./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-race.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 0e0057cc
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-race.i -s /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e73fa4cb5d730df9ff96f4b4e2c24e965bcd61c0183b81fcc825ea7b25063723
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-03-09 06:10:02,745 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-03-09 06:10:02,784 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-09 06:10:02,787 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-03-09 06:10:02,787 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-03-09 06:10:02,803 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-09 06:10:02,803 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-09 06:10:02,804 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-09 06:10:02,804 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-09 06:10:02,804 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-09 06:10:02,805 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-09 06:10:02,805 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-09 06:10:02,805 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-03-09 06:10:02,806 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-09 06:10:02,806 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-09 06:10:02,806 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-03-09 06:10:02,806 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-09 06:10:02,807 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-03-09 06:10:02,807 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-09 06:10:02,807 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-09 06:10:02,807 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-09 06:10:02,808 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-09 06:10:02,808 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-09 06:10:02,808 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-03-09 06:10:02,808 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-03-09 06:10:02,809 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-09 06:10:02,809 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-03-09 06:10:02,809 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-09 06:10:02,809 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-09 06:10:02,809 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-09 06:10:02,809 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-09 06:10:02,810 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-09 06:10:02,810 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-09 06:10:02,810 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-03-09 06:10:02,810 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-09 06:10:02,810 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-09 06:10:02,810 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-03-09 06:10:02,811 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-09 06:10:02,811 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-09 06:10:02,811 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-09 06:10:02,811 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-09 06:10:02,811 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e73fa4cb5d730df9ff96f4b4e2c24e965bcd61c0183b81fcc825ea7b25063723
[2024-03-09 06:10:02,977 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-09 06:10:03,000 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-09 06:10:03,003 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-09 06:10:03,004 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-03-09 06:10:03,008 INFO  L274        PluginConnector]: CDTParser initialized
[2024-03-09 06:10:03,009 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-race.i
[2024-03-09 06:10:03,986 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-03-09 06:10:04,167 INFO  L384              CDTParser]: Found 1 translation units.
[2024-03-09 06:10:04,168 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-race.i
[2024-03-09 06:10:04,180 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/6c7caf317/4ed6eedbf8ca4fb99053aaa12d4757a2/FLAG55a5314aa
[2024-03-09 06:10:04,535 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/6c7caf317/4ed6eedbf8ca4fb99053aaa12d4757a2
[2024-03-09 06:10:04,537 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-09 06:10:04,538 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-09 06:10:04,539 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-09 06:10:04,539 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-09 06:10:04,544 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-09 06:10:04,544 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:10:04" (1/1) ...
[2024-03-09 06:10:04,545 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63ac9a8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:10:04, skipping insertion in model container
[2024-03-09 06:10:04,545 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:10:04" (1/1) ...
[2024-03-09 06:10:04,583 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-03-09 06:10:04,860 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-09 06:10:04,866 INFO  L202         MainTranslator]: Completed pre-run
[2024-03-09 06:10:04,894 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-09 06:10:04,929 INFO  L206         MainTranslator]: Completed translation
[2024-03-09 06:10:04,929 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:10:04 WrapperNode
[2024-03-09 06:10:04,929 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-09 06:10:04,930 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-09 06:10:04,930 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-09 06:10:04,931 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-09 06:10:04,936 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:10:04" (1/1) ...
[2024-03-09 06:10:04,950 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:10:04" (1/1) ...
[2024-03-09 06:10:04,968 INFO  L138                Inliner]: procedures = 265, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 80
[2024-03-09 06:10:04,969 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-09 06:10:04,969 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-09 06:10:04,969 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-09 06:10:04,969 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-03-09 06:10:04,977 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:10:04" (1/1) ...
[2024-03-09 06:10:04,977 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:10:04" (1/1) ...
[2024-03-09 06:10:04,981 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:10:04" (1/1) ...
[2024-03-09 06:10:04,981 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:10:04" (1/1) ...
[2024-03-09 06:10:04,988 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:10:04" (1/1) ...
[2024-03-09 06:10:04,991 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:10:04" (1/1) ...
[2024-03-09 06:10:04,992 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:10:04" (1/1) ...
[2024-03-09 06:10:04,993 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:10:04" (1/1) ...
[2024-03-09 06:10:04,996 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-09 06:10:04,996 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-09 06:10:04,997 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-03-09 06:10:04,997 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-03-09 06:10:04,997 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:10:04" (1/1) ...
[2024-03-09 06:10:05,002 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-09 06:10:05,010 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:10:05,028 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-03-09 06:10:05,031 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-03-09 06:10:05,066 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-09 06:10:05,067 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-09 06:10:05,067 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-09 06:10:05,067 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-09 06:10:05,067 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-09 06:10:05,067 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-09 06:10:05,067 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-09 06:10:05,068 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-09 06:10:05,068 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-09 06:10:05,068 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-09 06:10:05,068 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-09 06:10:05,069 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-03-09 06:10:05,188 INFO  L241             CfgBuilder]: Building ICFG
[2024-03-09 06:10:05,190 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-09 06:10:05,385 INFO  L282             CfgBuilder]: Performing block encoding
[2024-03-09 06:10:05,393 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-09 06:10:05,394 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-09 06:10:05,395 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 06:10:05 BoogieIcfgContainer
[2024-03-09 06:10:05,395 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-09 06:10:05,397 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-09 06:10:05,397 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-03-09 06:10:05,400 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-03-09 06:10:05,400 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:10:04" (1/3) ...
[2024-03-09 06:10:05,401 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ea088ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:10:05, skipping insertion in model container
[2024-03-09 06:10:05,401 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:10:04" (2/3) ...
[2024-03-09 06:10:05,401 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ea088ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:10:05, skipping insertion in model container
[2024-03-09 06:10:05,402 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 06:10:05" (3/3) ...
[2024-03-09 06:10:05,403 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct-race.i
[2024-03-09 06:10:05,409 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-09 06:10:05,417 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-09 06:10:05,418 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations.
[2024-03-09 06:10:05,418 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-09 06:10:05,496 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-09 06:10:05,526 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 102 places, 103 transitions, 213 flow
[2024-03-09 06:10:05,576 INFO  L124   PetriNetUnfolderBase]: 6/152 cut-off events.
[2024-03-09 06:10:05,576 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-03-09 06:10:05,580 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 157 conditions, 152 events. 6/152 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 308 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 73. Up to 4 conditions per place. 
[2024-03-09 06:10:05,580 INFO  L82        GeneralOperation]: Start removeDead. Operand has 102 places, 103 transitions, 213 flow
[2024-03-09 06:10:05,584 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 102 places, 103 transitions, 213 flow
[2024-03-09 06:10:05,592 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 06:10:05,597 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@633df12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 06:10:05,598 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-03-09 06:10:05,608 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 06:10:05,608 INFO  L124   PetriNetUnfolderBase]: 3/47 cut-off events.
[2024-03-09 06:10:05,608 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 06:10:05,609 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:10:05,609 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:10:05,610 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-09 06:10:05,614 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:10:05,614 INFO  L85        PathProgramCache]: Analyzing trace with hash -1691916919, now seen corresponding path program 1 times
[2024-03-09 06:10:05,621 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:10:05,622 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521590319]
[2024-03-09 06:10:05,622 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:10:05,623 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:10:05,722 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:10:06,147 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:10:06,148 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:10:06,148 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521590319]
[2024-03-09 06:10:06,149 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521590319] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:10:06,149 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:10:06,149 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:10:06,150 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294754043]
[2024-03-09 06:10:06,161 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:10:06,181 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:10:06,186 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:10:06,206 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:10:06,207 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:10:06,513 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 72 out of 103
[2024-03-09 06:10:06,517 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 103 transitions, 213 flow. Second operand  has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:06,517 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:10:06,517 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 103
[2024-03-09 06:10:06,518 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:10:06,689 INFO  L124   PetriNetUnfolderBase]: 117/574 cut-off events.
[2024-03-09 06:10:06,689 INFO  L125   PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES.
[2024-03-09 06:10:06,691 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 886 conditions, 574 events. 117/574 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3185 event pairs, 6 based on Foata normal form. 13/537 useless extension candidates. Maximal degree in co-relation 751. Up to 194 conditions per place. 
[2024-03-09 06:10:06,693 INFO  L140   encePairwiseOnDemand]: 77/103 looper letters, 38 selfloop transitions, 29 changer transitions 1/139 dead transitions.
[2024-03-09 06:10:06,694 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 139 transitions, 422 flow
[2024-03-09 06:10:06,695 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:10:06,697 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:10:06,704 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 507 transitions.
[2024-03-09 06:10:06,707 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8203883495145631
[2024-03-09 06:10:06,707 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 507 transitions.
[2024-03-09 06:10:06,708 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 507 transitions.
[2024-03-09 06:10:06,709 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:10:06,712 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 507 transitions.
[2024-03-09 06:10:06,716 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 84.5) internal successors, (507), 6 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:06,721 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:06,721 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:06,723 INFO  L175             Difference]: Start difference. First operand has 102 places, 103 transitions, 213 flow. Second operand 6 states and 507 transitions.
[2024-03-09 06:10:06,723 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 139 transitions, 422 flow
[2024-03-09 06:10:06,726 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 139 transitions, 422 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 06:10:06,729 INFO  L231             Difference]: Finished difference. Result has 112 places, 128 transitions, 425 flow
[2024-03-09 06:10:06,730 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=425, PETRI_PLACES=112, PETRI_TRANSITIONS=128}
[2024-03-09 06:10:06,733 INFO  L281   CegarLoopForPetriNet]: 102 programPoint places, 10 predicate places.
[2024-03-09 06:10:06,733 INFO  L495      AbstractCegarLoop]: Abstraction has has 112 places, 128 transitions, 425 flow
[2024-03-09 06:10:06,734 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:06,734 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:10:06,734 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:10:06,735 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-09 06:10:06,735 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-09 06:10:06,735 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:10:06,736 INFO  L85        PathProgramCache]: Analyzing trace with hash -1385440213, now seen corresponding path program 1 times
[2024-03-09 06:10:06,736 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:10:06,736 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885237141]
[2024-03-09 06:10:06,736 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:10:06,736 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:10:06,753 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:10:06,822 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:10:06,822 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:10:06,823 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885237141]
[2024-03-09 06:10:06,823 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885237141] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:10:06,823 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:10:06,823 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:10:06,824 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373218921]
[2024-03-09 06:10:06,824 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:10:06,825 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-09 06:10:06,825 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:10:06,825 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-09 06:10:06,826 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-09 06:10:06,887 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 103
[2024-03-09 06:10:06,888 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 128 transitions, 425 flow. Second operand  has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:06,888 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:10:06,888 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 103
[2024-03-09 06:10:06,889 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:10:06,956 INFO  L124   PetriNetUnfolderBase]: 82/524 cut-off events.
[2024-03-09 06:10:06,957 INFO  L125   PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES.
[2024-03-09 06:10:06,959 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 956 conditions, 524 events. 82/524 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2922 event pairs, 4 based on Foata normal form. 1/496 useless extension candidates. Maximal degree in co-relation 765. Up to 98 conditions per place. 
[2024-03-09 06:10:06,960 INFO  L140   encePairwiseOnDemand]: 95/103 looper letters, 11 selfloop transitions, 2 changer transitions 5/133 dead transitions.
[2024-03-09 06:10:06,961 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 133 transitions, 471 flow
[2024-03-09 06:10:06,961 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:10:06,962 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:10:06,963 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 541 transitions.
[2024-03-09 06:10:06,963 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8754045307443366
[2024-03-09 06:10:06,964 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 541 transitions.
[2024-03-09 06:10:06,964 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 541 transitions.
[2024-03-09 06:10:06,964 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:10:06,964 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 541 transitions.
[2024-03-09 06:10:06,966 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:06,968 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:06,969 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:06,969 INFO  L175             Difference]: Start difference. First operand has 112 places, 128 transitions, 425 flow. Second operand 6 states and 541 transitions.
[2024-03-09 06:10:06,969 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 133 transitions, 471 flow
[2024-03-09 06:10:06,974 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 133 transitions, 471 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 06:10:06,976 INFO  L231             Difference]: Finished difference. Result has 120 places, 128 transitions, 443 flow
[2024-03-09 06:10:06,976 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=443, PETRI_PLACES=120, PETRI_TRANSITIONS=128}
[2024-03-09 06:10:06,977 INFO  L281   CegarLoopForPetriNet]: 102 programPoint places, 18 predicate places.
[2024-03-09 06:10:06,977 INFO  L495      AbstractCegarLoop]: Abstraction has has 120 places, 128 transitions, 443 flow
[2024-03-09 06:10:06,978 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:06,978 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:10:06,978 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:10:06,978 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-09 06:10:06,978 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-09 06:10:06,979 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:10:06,979 INFO  L85        PathProgramCache]: Analyzing trace with hash 73880186, now seen corresponding path program 1 times
[2024-03-09 06:10:06,980 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:10:06,980 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264923385]
[2024-03-09 06:10:06,980 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:10:06,980 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:10:07,005 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:10:07,267 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:10:07,267 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:10:07,268 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264923385]
[2024-03-09 06:10:07,268 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264923385] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:10:07,268 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:10:07,269 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:10:07,269 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513046520]
[2024-03-09 06:10:07,269 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:10:07,270 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:10:07,270 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:10:07,271 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:10:07,271 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:10:07,380 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 73 out of 103
[2024-03-09 06:10:07,381 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 128 transitions, 443 flow. Second operand  has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:07,381 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:10:07,382 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 103
[2024-03-09 06:10:07,382 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:10:07,732 INFO  L124   PetriNetUnfolderBase]: 338/1193 cut-off events.
[2024-03-09 06:10:07,733 INFO  L125   PetriNetUnfolderBase]: For 436/520 co-relation queries the response was YES.
[2024-03-09 06:10:07,737 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2762 conditions, 1193 events. 338/1193 cut-off events. For 436/520 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 8265 event pairs, 67 based on Foata normal form. 14/1141 useless extension candidates. Maximal degree in co-relation 2692. Up to 597 conditions per place. 
[2024-03-09 06:10:07,741 INFO  L140   encePairwiseOnDemand]: 80/103 looper letters, 49 selfloop transitions, 82 changer transitions 2/209 dead transitions.
[2024-03-09 06:10:07,742 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 209 transitions, 1045 flow
[2024-03-09 06:10:07,742 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:10:07,742 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:10:07,743 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 535 transitions.
[2024-03-09 06:10:07,744 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8656957928802589
[2024-03-09 06:10:07,744 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 535 transitions.
[2024-03-09 06:10:07,744 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 535 transitions.
[2024-03-09 06:10:07,744 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:10:07,744 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 535 transitions.
[2024-03-09 06:10:07,746 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:07,747 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:07,747 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:07,747 INFO  L175             Difference]: Start difference. First operand has 120 places, 128 transitions, 443 flow. Second operand 6 states and 535 transitions.
[2024-03-09 06:10:07,748 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 209 transitions, 1045 flow
[2024-03-09 06:10:07,753 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 209 transitions, 1031 flow, removed 5 selfloop flow, removed 5 redundant places.
[2024-03-09 06:10:07,756 INFO  L231             Difference]: Finished difference. Result has 122 places, 207 transitions, 1149 flow
[2024-03-09 06:10:07,756 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1149, PETRI_PLACES=122, PETRI_TRANSITIONS=207}
[2024-03-09 06:10:07,757 INFO  L281   CegarLoopForPetriNet]: 102 programPoint places, 20 predicate places.
[2024-03-09 06:10:07,757 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 207 transitions, 1149 flow
[2024-03-09 06:10:07,758 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:07,758 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:10:07,758 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:10:07,758 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-09 06:10:07,758 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-09 06:10:07,759 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:10:07,759 INFO  L85        PathProgramCache]: Analyzing trace with hash -2142844699, now seen corresponding path program 1 times
[2024-03-09 06:10:07,759 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:10:07,760 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589763476]
[2024-03-09 06:10:07,760 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:10:07,760 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:10:07,785 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 06:10:07,785 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-09 06:10:07,797 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 06:10:07,815 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-09 06:10:07,815 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-09 06:10:07,816 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2024-03-09 06:10:07,817 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2024-03-09 06:10:07,818 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2024-03-09 06:10:07,818 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2024-03-09 06:10:07,818 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2024-03-09 06:10:07,818 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2024-03-09 06:10:07,818 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2024-03-09 06:10:07,819 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-09 06:10:07,819 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2024-03-09 06:10:07,821 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-09 06:10:07,821 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-09 06:10:07,840 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-09 06:10:07,842 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 121 transitions, 258 flow
[2024-03-09 06:10:07,860 INFO  L124   PetriNetUnfolderBase]: 11/271 cut-off events.
[2024-03-09 06:10:07,860 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2024-03-09 06:10:07,860 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 283 conditions, 271 events. 11/271 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 656 event pairs, 0 based on Foata normal form. 0/239 useless extension candidates. Maximal degree in co-relation 154. Up to 8 conditions per place. 
[2024-03-09 06:10:07,861 INFO  L82        GeneralOperation]: Start removeDead. Operand has 121 places, 121 transitions, 258 flow
[2024-03-09 06:10:07,862 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 121 places, 121 transitions, 258 flow
[2024-03-09 06:10:07,863 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 06:10:07,864 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@633df12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 06:10:07,864 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-03-09 06:10:07,867 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 06:10:07,867 INFO  L124   PetriNetUnfolderBase]: 3/47 cut-off events.
[2024-03-09 06:10:07,867 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 06:10:07,867 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:10:07,867 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:10:07,868 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:10:07,868 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:10:07,868 INFO  L85        PathProgramCache]: Analyzing trace with hash 508585762, now seen corresponding path program 1 times
[2024-03-09 06:10:07,868 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:10:07,869 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346724890]
[2024-03-09 06:10:07,869 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:10:07,869 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:10:07,882 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:10:08,043 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:10:08,043 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:10:08,044 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346724890]
[2024-03-09 06:10:08,044 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346724890] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:10:08,044 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:10:08,044 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:10:08,044 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700066490]
[2024-03-09 06:10:08,044 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:10:08,045 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:10:08,045 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:10:08,045 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:10:08,046 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:10:08,224 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 121
[2024-03-09 06:10:08,226 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 121 transitions, 258 flow. Second operand  has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:08,226 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:10:08,226 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 121
[2024-03-09 06:10:08,226 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:10:08,752 INFO  L124   PetriNetUnfolderBase]: 1710/4914 cut-off events.
[2024-03-09 06:10:08,752 INFO  L125   PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES.
[2024-03-09 06:10:08,758 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7978 conditions, 4914 events. 1710/4914 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 40601 event pairs, 258 based on Foata normal form. 85/4617 useless extension candidates. Maximal degree in co-relation 4669. Up to 2239 conditions per place. 
[2024-03-09 06:10:08,771 INFO  L140   encePairwiseOnDemand]: 91/121 looper letters, 46 selfloop transitions, 48 changer transitions 1/178 dead transitions.
[2024-03-09 06:10:08,771 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 178 transitions, 571 flow
[2024-03-09 06:10:08,772 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:10:08,772 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:10:08,773 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 606 transitions.
[2024-03-09 06:10:08,773 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8347107438016529
[2024-03-09 06:10:08,774 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 606 transitions.
[2024-03-09 06:10:08,774 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 606 transitions.
[2024-03-09 06:10:08,774 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:10:08,774 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 606 transitions.
[2024-03-09 06:10:08,776 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:08,777 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:08,777 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:08,777 INFO  L175             Difference]: Start difference. First operand has 121 places, 121 transitions, 258 flow. Second operand 6 states and 606 transitions.
[2024-03-09 06:10:08,777 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 178 transitions, 571 flow
[2024-03-09 06:10:08,779 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 178 transitions, 571 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 06:10:08,781 INFO  L231             Difference]: Finished difference. Result has 131 places, 165 transitions, 592 flow
[2024-03-09 06:10:08,781 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=592, PETRI_PLACES=131, PETRI_TRANSITIONS=165}
[2024-03-09 06:10:08,781 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 10 predicate places.
[2024-03-09 06:10:08,782 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 165 transitions, 592 flow
[2024-03-09 06:10:08,782 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:08,782 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:10:08,782 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:10:08,782 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-09 06:10:08,783 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:10:08,783 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:10:08,783 INFO  L85        PathProgramCache]: Analyzing trace with hash -955128949, now seen corresponding path program 1 times
[2024-03-09 06:10:08,783 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:10:08,783 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658573038]
[2024-03-09 06:10:08,784 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:10:08,784 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:10:08,795 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:10:08,844 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:10:08,844 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:10:08,844 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658573038]
[2024-03-09 06:10:08,844 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658573038] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:10:08,845 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:10:08,845 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:10:08,845 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248855125]
[2024-03-09 06:10:08,845 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:10:08,845 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-09 06:10:08,846 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:10:08,846 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-09 06:10:08,846 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-09 06:10:08,889 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 121
[2024-03-09 06:10:08,890 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 165 transitions, 592 flow. Second operand  has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:08,890 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:10:08,890 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 121
[2024-03-09 06:10:08,890 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:10:09,159 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([285] L1029-5-->L1029-6: Formula: (let ((.cse0 (select |v_#race_20| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0)))  InVars {#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][108], [136#true, 106#L1029-6true, Black: 124#true, Black: 128#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 20#L1017-6true, Black: 127#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 126#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 129#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 87#L1017-7true])
[2024-03-09 06:10:09,160 INFO  L294   olderBase$Statistics]: this new event has 83 ancestors and is not cut-off event
[2024-03-09 06:10:09,160 INFO  L297   olderBase$Statistics]:   existing Event has 83 ancestors and is not cut-off event
[2024-03-09 06:10:09,160 INFO  L297   olderBase$Statistics]:   existing Event has 83 ancestors and is not cut-off event
[2024-03-09 06:10:09,160 INFO  L297   olderBase$Statistics]:   existing Event has 83 ancestors and is not cut-off event
[2024-03-09 06:10:09,172 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([285] L1029-5-->L1029-6: Formula: (let ((.cse0 (select |v_#race_20| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0)))  InVars {#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][108], [136#true, 106#L1029-6true, Black: 124#true, 20#L1017-6true, Black: 128#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 32#L1017-8true, Black: 127#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 126#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 129#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-03-09 06:10:09,173 INFO  L294   olderBase$Statistics]: this new event has 84 ancestors and is not cut-off event
[2024-03-09 06:10:09,173 INFO  L297   olderBase$Statistics]:   existing Event has 84 ancestors and is not cut-off event
[2024-03-09 06:10:09,173 INFO  L297   olderBase$Statistics]:   existing Event has 84 ancestors and is not cut-off event
[2024-03-09 06:10:09,173 INFO  L297   olderBase$Statistics]:   existing Event has 84 ancestors and is not cut-off event
[2024-03-09 06:10:09,251 INFO  L124   PetriNetUnfolderBase]: 1272/4234 cut-off events.
[2024-03-09 06:10:09,251 INFO  L125   PetriNetUnfolderBase]: For 859/866 co-relation queries the response was YES.
[2024-03-09 06:10:09,258 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8176 conditions, 4234 events. 1272/4234 cut-off events. For 859/866 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 36690 event pairs, 190 based on Foata normal form. 1/4001 useless extension candidates. Maximal degree in co-relation 4667. Up to 1362 conditions per place. 
[2024-03-09 06:10:09,312 INFO  L140   encePairwiseOnDemand]: 113/121 looper letters, 14 selfloop transitions, 2 changer transitions 5/171 dead transitions.
[2024-03-09 06:10:09,312 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 171 transitions, 646 flow
[2024-03-09 06:10:09,312 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:10:09,313 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:10:09,314 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 640 transitions.
[2024-03-09 06:10:09,314 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8815426997245179
[2024-03-09 06:10:09,314 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 640 transitions.
[2024-03-09 06:10:09,314 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 640 transitions.
[2024-03-09 06:10:09,315 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:10:09,315 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 640 transitions.
[2024-03-09 06:10:09,316 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 106.66666666666667) internal successors, (640), 6 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:09,317 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:09,317 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:09,317 INFO  L175             Difference]: Start difference. First operand has 131 places, 165 transitions, 592 flow. Second operand 6 states and 640 transitions.
[2024-03-09 06:10:09,318 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 171 transitions, 646 flow
[2024-03-09 06:10:09,323 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 171 transitions, 646 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 06:10:09,325 INFO  L231             Difference]: Finished difference. Result has 139 places, 166 transitions, 614 flow
[2024-03-09 06:10:09,325 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=614, PETRI_PLACES=139, PETRI_TRANSITIONS=166}
[2024-03-09 06:10:09,326 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 18 predicate places.
[2024-03-09 06:10:09,326 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 166 transitions, 614 flow
[2024-03-09 06:10:09,326 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:09,326 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:10:09,326 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:10:09,326 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-09 06:10:09,326 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:10:09,327 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:10:09,327 INFO  L85        PathProgramCache]: Analyzing trace with hash 1006173482, now seen corresponding path program 1 times
[2024-03-09 06:10:09,327 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:10:09,327 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101420699]
[2024-03-09 06:10:09,327 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:10:09,327 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:10:09,342 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:10:09,560 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:10:09,561 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:10:09,561 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101420699]
[2024-03-09 06:10:09,561 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101420699] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:10:09,561 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:10:09,561 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:10:09,561 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092092549]
[2024-03-09 06:10:09,561 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:10:09,562 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:10:09,562 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:10:09,562 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:10:09,562 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:10:09,692 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 121
[2024-03-09 06:10:09,693 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 166 transitions, 614 flow. Second operand  has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:09,693 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:10:09,693 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 121
[2024-03-09 06:10:09,693 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:10:10,993 INFO  L124   PetriNetUnfolderBase]: 4894/11716 cut-off events.
[2024-03-09 06:10:10,993 INFO  L125   PetriNetUnfolderBase]: For 5280/6910 co-relation queries the response was YES.
[2024-03-09 06:10:11,012 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28887 conditions, 11716 events. 4894/11716 cut-off events. For 5280/6910 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 105320 event pairs, 1127 based on Foata normal form. 45/11069 useless extension candidates. Maximal degree in co-relation 28816. Up to 6768 conditions per place. 
[2024-03-09 06:10:11,052 INFO  L140   encePairwiseOnDemand]: 94/121 looper letters, 80 selfloop transitions, 142 changer transitions 0/311 dead transitions.
[2024-03-09 06:10:11,052 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 311 transitions, 1722 flow
[2024-03-09 06:10:11,052 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:10:11,052 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:10:11,054 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 637 transitions.
[2024-03-09 06:10:11,054 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8774104683195593
[2024-03-09 06:10:11,054 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 637 transitions.
[2024-03-09 06:10:11,054 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 637 transitions.
[2024-03-09 06:10:11,055 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:10:11,055 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 637 transitions.
[2024-03-09 06:10:11,056 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:11,057 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:11,057 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:11,057 INFO  L175             Difference]: Start difference. First operand has 139 places, 166 transitions, 614 flow. Second operand 6 states and 637 transitions.
[2024-03-09 06:10:11,058 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 311 transitions, 1722 flow
[2024-03-09 06:10:11,070 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 311 transitions, 1710 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-09 06:10:11,073 INFO  L231             Difference]: Finished difference. Result has 142 places, 303 transitions, 1900 flow
[2024-03-09 06:10:11,073 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1900, PETRI_PLACES=142, PETRI_TRANSITIONS=303}
[2024-03-09 06:10:11,074 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 21 predicate places.
[2024-03-09 06:10:11,074 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 303 transitions, 1900 flow
[2024-03-09 06:10:11,074 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:11,074 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:10:11,074 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:10:11,074 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-09 06:10:11,075 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:10:11,075 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:10:11,075 INFO  L85        PathProgramCache]: Analyzing trace with hash 1649160194, now seen corresponding path program 1 times
[2024-03-09 06:10:11,075 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:10:11,075 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523186331]
[2024-03-09 06:10:11,075 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:10:11,075 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:10:11,092 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:10:11,457 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:10:11,457 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:10:11,457 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523186331]
[2024-03-09 06:10:11,457 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523186331] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:10:11,457 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263851273]
[2024-03-09 06:10:11,457 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:10:11,458 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:10:11,458 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:10:11,460 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 06:10:11,463 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-03-09 06:10:11,574 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:10:11,592 INFO  L262         TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 24 conjunts are in the unsatisfiable core
[2024-03-09 06:10:11,600 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:10:11,788 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 06:10:11,822 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-09 06:10:11,881 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:10:11,882 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-03-09 06:10:11,947 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:10:11,948 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-03-09 06:10:12,015 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 06:10:12,016 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32
[2024-03-09 06:10:12,025 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:10:12,026 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:10:12,059 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2024-03-09 06:10:12,085 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2024-03-09 06:10:12,108 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2024-03-09 06:10:12,294 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-09 06:10:12,295 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263851273] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:10:12,295 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:10:12,295 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 29
[2024-03-09 06:10:12,295 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850630226]
[2024-03-09 06:10:12,295 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:10:12,296 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2024-03-09 06:10:12,296 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:10:12,297 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2024-03-09 06:10:12,297 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=604, Unknown=3, NotChecked=156, Total=870
[2024-03-09 06:10:12,298 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 58 out of 121
[2024-03-09 06:10:12,300 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 303 transitions, 1900 flow. Second operand  has 30 states, 30 states have (on average 60.2) internal successors, (1806), 30 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:12,300 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:10:12,300 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 121
[2024-03-09 06:10:12,300 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:10:16,414 INFO  L124   PetriNetUnfolderBase]: 13429/26305 cut-off events.
[2024-03-09 06:10:16,414 INFO  L125   PetriNetUnfolderBase]: For 27116/27150 co-relation queries the response was YES.
[2024-03-09 06:10:16,464 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 84177 conditions, 26305 events. 13429/26305 cut-off events. For 27116/27150 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 234245 event pairs, 1506 based on Foata normal form. 356/25178 useless extension candidates. Maximal degree in co-relation 71500. Up to 12677 conditions per place. 
[2024-03-09 06:10:16,598 INFO  L140   encePairwiseOnDemand]: 98/121 looper letters, 510 selfloop transitions, 206 changer transitions 1/775 dead transitions.
[2024-03-09 06:10:16,599 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 775 transitions, 6168 flow
[2024-03-09 06:10:16,599 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2024-03-09 06:10:16,599 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2024-03-09 06:10:16,602 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1139 transitions.
[2024-03-09 06:10:16,602 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6723730814639906
[2024-03-09 06:10:16,603 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1139 transitions.
[2024-03-09 06:10:16,603 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1139 transitions.
[2024-03-09 06:10:16,603 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:10:16,604 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1139 transitions.
[2024-03-09 06:10:16,606 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 81.35714285714286) internal successors, (1139), 14 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:16,609 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 121.0) internal successors, (1815), 15 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:16,610 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 121.0) internal successors, (1815), 15 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:16,610 INFO  L175             Difference]: Start difference. First operand has 142 places, 303 transitions, 1900 flow. Second operand 14 states and 1139 transitions.
[2024-03-09 06:10:16,610 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 775 transitions, 6168 flow
[2024-03-09 06:10:16,965 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 775 transitions, 6114 flow, removed 27 selfloop flow, removed 0 redundant places.
[2024-03-09 06:10:16,972 INFO  L231             Difference]: Finished difference. Result has 164 places, 488 transitions, 4174 flow
[2024-03-09 06:10:16,973 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=1846, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4174, PETRI_PLACES=164, PETRI_TRANSITIONS=488}
[2024-03-09 06:10:16,973 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 43 predicate places.
[2024-03-09 06:10:16,973 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 488 transitions, 4174 flow
[2024-03-09 06:10:16,974 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 30 states, 30 states have (on average 60.2) internal successors, (1806), 30 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:16,974 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:10:16,974 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:10:16,982 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-03-09 06:10:17,178 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:10:17,178 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:10:17,179 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:10:17,180 INFO  L85        PathProgramCache]: Analyzing trace with hash 439180956, now seen corresponding path program 1 times
[2024-03-09 06:10:17,180 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:10:17,180 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564568411]
[2024-03-09 06:10:17,180 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:10:17,181 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:10:17,204 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:10:17,589 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:10:17,590 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:10:17,590 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564568411]
[2024-03-09 06:10:17,590 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564568411] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:10:17,590 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646919544]
[2024-03-09 06:10:17,590 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:10:17,590 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:10:17,591 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:10:17,591 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 06:10:17,595 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-03-09 06:10:17,676 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:10:17,677 INFO  L262         TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 20 conjunts are in the unsatisfiable core
[2024-03-09 06:10:17,680 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:10:17,897 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 06:10:17,940 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-09 06:10:17,979 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-09 06:10:18,029 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-09 06:10:18,184 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 06:10:18,185 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 06:10:18,227 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:10:18,227 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:10:18,249 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_333 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0))) is different from false
[2024-03-09 06:10:18,347 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))))) is different from false
[2024-03-09 06:10:18,401 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21)))))) is different from false
[2024-03-09 06:10:18,453 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1))))))))) is different from false
[2024-03-09 06:10:18,496 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) (.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0) .cse3 0)))) (and (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse3) 0))))))) is different from false
[2024-03-09 06:10:18,524 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:10:18,525 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49
[2024-03-09 06:10:18,532 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:10:18,532 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34
[2024-03-09 06:10:18,535 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3
[2024-03-09 06:10:18,544 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 06:10:18,544 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-09 06:10:18,549 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 06:10:18,550 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-09 06:10:18,556 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 06:10:18,556 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-09 06:10:18,667 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked.
[2024-03-09 06:10:18,667 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646919544] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:10:18,668 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:10:18,668 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33
[2024-03-09 06:10:18,668 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581557452]
[2024-03-09 06:10:18,668 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:10:18,669 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 34 states
[2024-03-09 06:10:18,669 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:10:18,670 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants.
[2024-03-09 06:10:18,670 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=701, Unknown=5, NotChecked=290, Total=1122
[2024-03-09 06:10:18,730 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 60 out of 121
[2024-03-09 06:10:18,732 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 488 transitions, 4174 flow. Second operand  has 34 states, 34 states have (on average 62.05882352941177) internal successors, (2110), 34 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:18,732 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:10:18,732 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 121
[2024-03-09 06:10:18,733 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:10:24,920 INFO  L124   PetriNetUnfolderBase]: 15344/30434 cut-off events.
[2024-03-09 06:10:24,921 INFO  L125   PetriNetUnfolderBase]: For 76190/76418 co-relation queries the response was YES.
[2024-03-09 06:10:25,013 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 121317 conditions, 30434 events. 15344/30434 cut-off events. For 76190/76418 co-relation queries the response was YES. Maximal size of possible extension queue 955. Compared 272369 event pairs, 1348 based on Foata normal form. 210/28774 useless extension candidates. Maximal degree in co-relation 113712. Up to 13023 conditions per place. 
[2024-03-09 06:10:25,140 INFO  L140   encePairwiseOnDemand]: 87/121 looper letters, 554 selfloop transitions, 282 changer transitions 4/904 dead transitions.
[2024-03-09 06:10:25,140 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 904 transitions, 8990 flow
[2024-03-09 06:10:25,141 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2024-03-09 06:10:25,141 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2024-03-09 06:10:25,143 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1187 transitions.
[2024-03-09 06:10:25,144 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6539944903581267
[2024-03-09 06:10:25,144 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1187 transitions.
[2024-03-09 06:10:25,144 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1187 transitions.
[2024-03-09 06:10:25,145 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:10:25,145 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1187 transitions.
[2024-03-09 06:10:25,147 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 79.13333333333334) internal successors, (1187), 15 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:25,150 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 121.0) internal successors, (1936), 16 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:25,150 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 121.0) internal successors, (1936), 16 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:25,150 INFO  L175             Difference]: Start difference. First operand has 164 places, 488 transitions, 4174 flow. Second operand 15 states and 1187 transitions.
[2024-03-09 06:10:25,151 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 904 transitions, 8990 flow
[2024-03-09 06:10:26,607 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 904 transitions, 8964 flow, removed 8 selfloop flow, removed 4 redundant places.
[2024-03-09 06:10:26,616 INFO  L231             Difference]: Finished difference. Result has 183 places, 643 transitions, 7009 flow
[2024-03-09 06:10:26,617 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=4150, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=7009, PETRI_PLACES=183, PETRI_TRANSITIONS=643}
[2024-03-09 06:10:26,617 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 62 predicate places.
[2024-03-09 06:10:26,618 INFO  L495      AbstractCegarLoop]: Abstraction has has 183 places, 643 transitions, 7009 flow
[2024-03-09 06:10:26,618 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 34 states, 34 states have (on average 62.05882352941177) internal successors, (2110), 34 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:26,619 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:10:26,619 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:10:26,625 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-03-09 06:10:26,819 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8
[2024-03-09 06:10:26,820 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:10:26,821 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:10:26,821 INFO  L85        PathProgramCache]: Analyzing trace with hash 485479165, now seen corresponding path program 1 times
[2024-03-09 06:10:26,822 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:10:26,822 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666326383]
[2024-03-09 06:10:26,822 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:10:26,823 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:10:26,841 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:10:27,076 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-09 06:10:27,077 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:10:27,077 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666326383]
[2024-03-09 06:10:27,077 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666326383] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:10:27,077 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:10:27,077 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:10:27,078 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654780245]
[2024-03-09 06:10:27,078 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:10:27,078 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:10:27,078 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:10:27,079 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:10:27,079 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:10:27,309 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 121
[2024-03-09 06:10:27,310 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 643 transitions, 7009 flow. Second operand  has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:27,310 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:10:27,310 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 121
[2024-03-09 06:10:27,310 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:10:30,202 INFO  L124   PetriNetUnfolderBase]: 8449/19290 cut-off events.
[2024-03-09 06:10:30,203 INFO  L125   PetriNetUnfolderBase]: For 90805/92367 co-relation queries the response was YES.
[2024-03-09 06:10:30,257 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 88676 conditions, 19290 events. 8449/19290 cut-off events. For 90805/92367 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 178455 event pairs, 714 based on Foata normal form. 220/18908 useless extension candidates. Maximal degree in co-relation 85078. Up to 8359 conditions per place. 
[2024-03-09 06:10:30,323 INFO  L140   encePairwiseOnDemand]: 106/121 looper letters, 376 selfloop transitions, 259 changer transitions 0/893 dead transitions.
[2024-03-09 06:10:30,324 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 893 transitions, 11552 flow
[2024-03-09 06:10:30,324 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:10:30,325 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:10:30,326 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 623 transitions.
[2024-03-09 06:10:30,326 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8581267217630854
[2024-03-09 06:10:30,326 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 623 transitions.
[2024-03-09 06:10:30,326 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 623 transitions.
[2024-03-09 06:10:30,326 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:10:30,327 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 623 transitions.
[2024-03-09 06:10:30,328 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:30,329 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:30,329 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:30,329 INFO  L175             Difference]: Start difference. First operand has 183 places, 643 transitions, 7009 flow. Second operand 6 states and 623 transitions.
[2024-03-09 06:10:30,329 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 893 transitions, 11552 flow
[2024-03-09 06:10:30,915 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 893 transitions, 11519 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-09 06:10:30,926 INFO  L231             Difference]: Finished difference. Result has 188 places, 891 transitions, 11450 flow
[2024-03-09 06:10:30,926 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=6976, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=643, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=11450, PETRI_PLACES=188, PETRI_TRANSITIONS=891}
[2024-03-09 06:10:30,927 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 67 predicate places.
[2024-03-09 06:10:30,927 INFO  L495      AbstractCegarLoop]: Abstraction has has 188 places, 891 transitions, 11450 flow
[2024-03-09 06:10:30,928 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:30,928 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:10:30,928 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:10:30,928 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-09 06:10:30,928 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:10:30,929 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:10:30,929 INFO  L85        PathProgramCache]: Analyzing trace with hash 1064692363, now seen corresponding path program 1 times
[2024-03-09 06:10:30,929 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:10:30,929 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718405309]
[2024-03-09 06:10:30,929 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:10:30,929 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:10:30,944 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:10:31,117 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2024-03-09 06:10:31,117 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:10:31,117 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718405309]
[2024-03-09 06:10:31,118 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718405309] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:10:31,118 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:10:31,118 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:10:31,118 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490417626]
[2024-03-09 06:10:31,118 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:10:31,119 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:10:31,119 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:10:31,120 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:10:31,120 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:10:31,271 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 121
[2024-03-09 06:10:31,272 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 891 transitions, 11450 flow. Second operand  has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:31,272 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:10:31,272 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 121
[2024-03-09 06:10:31,272 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:10:37,963 INFO  L124   PetriNetUnfolderBase]: 15893/34835 cut-off events.
[2024-03-09 06:10:37,963 INFO  L125   PetriNetUnfolderBase]: For 182336/194206 co-relation queries the response was YES.
[2024-03-09 06:10:38,116 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 164201 conditions, 34835 events. 15893/34835 cut-off events. For 182336/194206 co-relation queries the response was YES. Maximal size of possible extension queue 1317. Compared 354859 event pairs, 1992 based on Foata normal form. 661/34012 useless extension candidates. Maximal degree in co-relation 158902. Up to 19960 conditions per place. 
[2024-03-09 06:10:38,324 INFO  L140   encePairwiseOnDemand]: 94/121 looper letters, 685 selfloop transitions, 495 changer transitions 4/1322 dead transitions.
[2024-03-09 06:10:38,324 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 1322 transitions, 18790 flow
[2024-03-09 06:10:38,325 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:10:38,325 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:10:38,326 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 633 transitions.
[2024-03-09 06:10:38,326 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.871900826446281
[2024-03-09 06:10:38,326 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 633 transitions.
[2024-03-09 06:10:38,327 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 633 transitions.
[2024-03-09 06:10:38,327 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:10:38,327 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 633 transitions.
[2024-03-09 06:10:38,328 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:38,329 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:38,329 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:38,329 INFO  L175             Difference]: Start difference. First operand has 188 places, 891 transitions, 11450 flow. Second operand 6 states and 633 transitions.
[2024-03-09 06:10:38,330 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 1322 transitions, 18790 flow
[2024-03-09 06:10:40,089 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 1322 transitions, 18574 flow, removed 108 selfloop flow, removed 0 redundant places.
[2024-03-09 06:10:40,105 INFO  L231             Difference]: Finished difference. Result has 198 places, 1314 transitions, 18684 flow
[2024-03-09 06:10:40,106 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=11342, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=891, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=18684, PETRI_PLACES=198, PETRI_TRANSITIONS=1314}
[2024-03-09 06:10:40,106 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 77 predicate places.
[2024-03-09 06:10:40,107 INFO  L495      AbstractCegarLoop]: Abstraction has has 198 places, 1314 transitions, 18684 flow
[2024-03-09 06:10:40,107 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:40,107 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:10:40,107 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:10:40,107 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-09 06:10:40,107 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:10:40,108 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:10:40,108 INFO  L85        PathProgramCache]: Analyzing trace with hash -2136617976, now seen corresponding path program 1 times
[2024-03-09 06:10:40,108 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:10:40,108 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245322119]
[2024-03-09 06:10:40,108 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:10:40,108 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:10:40,124 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:10:40,774 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:10:40,774 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:10:40,775 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245322119]
[2024-03-09 06:10:40,775 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245322119] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:10:40,775 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252917984]
[2024-03-09 06:10:40,775 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:10:40,776 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:10:40,776 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:10:40,777 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 06:10:40,779 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-03-09 06:10:40,869 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:10:40,870 INFO  L262         TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 48 conjunts are in the unsatisfiable core
[2024-03-09 06:10:40,877 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:10:40,887 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 06:10:40,896 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 06:10:40,897 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14
[2024-03-09 06:10:40,967 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 06:10:40,979 INFO  L349             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2024-03-09 06:10:40,979 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2024-03-09 06:10:41,196 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-09 06:10:41,197 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33
[2024-03-09 06:10:41,320 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-03-09 06:10:41,335 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 06:10:41,376 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-09 06:10:41,477 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:10:41,478 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-03-09 06:10:41,550 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:10:41,550 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-03-09 06:10:41,841 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-09 06:10:41,908 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32
[2024-03-09 06:10:41,931 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32
[2024-03-09 06:10:41,951 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32
[2024-03-09 06:10:41,974 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32
[2024-03-09 06:10:42,005 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32
[2024-03-09 06:10:42,014 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:10:42,014 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:10:42,038 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_522 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_522 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_522 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_522 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2024-03-09 06:10:42,072 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2024-03-09 06:10:42,137 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse0 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse0 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse0 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse0 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))))) is different from false
[2024-03-09 06:10:42,291 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse1 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse1 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse1 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse1 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2024-03-09 06:10:42,309 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse1 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse1 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse1 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse1 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) .cse3)))))) is different from false
[2024-03-09 06:10:42,654 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29
[2024-03-09 06:10:42,793 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-09 06:10:42,793 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [252917984] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:10:42,793 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:10:42,793 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 41
[2024-03-09 06:10:42,793 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20065335]
[2024-03-09 06:10:42,793 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:10:42,794 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 42 states
[2024-03-09 06:10:42,794 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:10:42,794 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2024-03-09 06:10:42,795 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1200, Unknown=8, NotChecked=370, Total=1722
[2024-03-09 06:10:42,832 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 121
[2024-03-09 06:10:42,833 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 1314 transitions, 18684 flow. Second operand  has 42 states, 42 states have (on average 52.166666666666664) internal successors, (2191), 42 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:10:42,834 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:10:42,834 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 121
[2024-03-09 06:10:42,834 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:11:02,331 INFO  L124   PetriNetUnfolderBase]: 31367/58935 cut-off events.
[2024-03-09 06:11:02,331 INFO  L125   PetriNetUnfolderBase]: For 386424/386560 co-relation queries the response was YES.
[2024-03-09 06:11:02,646 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 310769 conditions, 58935 events. 31367/58935 cut-off events. For 386424/386560 co-relation queries the response was YES. Maximal size of possible extension queue 1839. Compared 555886 event pairs, 3397 based on Foata normal form. 52/58752 useless extension candidates. Maximal degree in co-relation 291464. Up to 36625 conditions per place. 
[2024-03-09 06:11:02,877 INFO  L140   encePairwiseOnDemand]: 78/121 looper letters, 1775 selfloop transitions, 460 changer transitions 22/2308 dead transitions.
[2024-03-09 06:11:02,878 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 2308 transitions, 34801 flow
[2024-03-09 06:11:02,878 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. 
[2024-03-09 06:11:02,879 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 35 states.
[2024-03-09 06:11:02,882 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 2206 transitions.
[2024-03-09 06:11:02,882 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5208972845336481
[2024-03-09 06:11:02,882 INFO  L72            ComplementDD]: Start complementDD. Operand 35 states and 2206 transitions.
[2024-03-09 06:11:02,882 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 35 states and 2206 transitions.
[2024-03-09 06:11:02,883 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:11:02,883 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 2206 transitions.
[2024-03-09 06:11:02,887 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 36 states, 35 states have (on average 63.02857142857143) internal successors, (2206), 35 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:11:02,891 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 36 states, 36 states have (on average 121.0) internal successors, (4356), 36 states have internal predecessors, (4356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:11:02,891 INFO  L81            ComplementDD]: Finished complementDD. Result  has 36 states, 36 states have (on average 121.0) internal successors, (4356), 36 states have internal predecessors, (4356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:11:02,891 INFO  L175             Difference]: Start difference. First operand has 198 places, 1314 transitions, 18684 flow. Second operand 35 states and 2206 transitions.
[2024-03-09 06:11:02,891 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 2308 transitions, 34801 flow
[2024-03-09 06:11:10,098 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 2308 transitions, 34477 flow, removed 162 selfloop flow, removed 0 redundant places.
[2024-03-09 06:11:10,125 INFO  L231             Difference]: Finished difference. Result has 250 places, 1645 transitions, 24839 flow
[2024-03-09 06:11:10,126 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=18432, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=986, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=24839, PETRI_PLACES=250, PETRI_TRANSITIONS=1645}
[2024-03-09 06:11:10,126 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 129 predicate places.
[2024-03-09 06:11:10,126 INFO  L495      AbstractCegarLoop]: Abstraction has has 250 places, 1645 transitions, 24839 flow
[2024-03-09 06:11:10,127 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 42 states, 42 states have (on average 52.166666666666664) internal successors, (2191), 42 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:11:10,127 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:11:10,127 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:11:10,134 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-03-09 06:11:10,328 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:11:10,329 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:11:10,329 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:11:10,330 INFO  L85        PathProgramCache]: Analyzing trace with hash 316709008, now seen corresponding path program 2 times
[2024-03-09 06:11:10,330 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:11:10,330 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601532841]
[2024-03-09 06:11:10,330 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:11:10,330 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:11:10,351 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:11:10,792 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:11:10,793 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:11:10,793 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601532841]
[2024-03-09 06:11:10,793 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601532841] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:11:10,793 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177319124]
[2024-03-09 06:11:10,793 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-09 06:11:10,793 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:11:10,793 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:11:10,794 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 06:11:10,800 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-03-09 06:11:10,953 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-09 06:11:10,953 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 06:11:10,955 INFO  L262         TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 52 conjunts are in the unsatisfiable core
[2024-03-09 06:11:10,960 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:11:10,995 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 06:11:11,053 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 06:11:11,053 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-03-09 06:11:11,242 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-09 06:11:11,242 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33
[2024-03-09 06:11:11,419 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-09 06:11:11,477 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 06:11:11,506 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-09 06:11:11,547 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-09 06:11:11,597 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-09 06:11:11,650 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 06:11:11,707 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:11:11,707 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:11:11,726 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_621 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_621) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_621 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_621) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_621 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_621) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_621 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_621) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2024-03-09 06:11:11,742 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_621 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_621) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_621 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_621) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_621 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_621) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_621 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_621) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2024-03-09 06:11:11,762 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_621 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_621) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_621 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_621) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_621 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_621) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_621 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_621) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2024-03-09 06:11:11,867 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_612) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~t~1#1.base|))) is different from false
[2024-03-09 06:11:11,940 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_612) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~malloc7#1.base|))) is different from false
[2024-03-09 06:11:11,984 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29
[2024-03-09 06:11:11,987 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6
[2024-03-09 06:11:12,033 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8
[2024-03-09 06:11:12,063 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:11:12,064 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [177319124] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:11:12,064 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:11:12,064 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 41
[2024-03-09 06:11:12,064 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228974075]
[2024-03-09 06:11:12,064 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:11:12,064 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 42 states
[2024-03-09 06:11:12,065 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:11:12,065 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2024-03-09 06:11:12,066 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1197, Unknown=12, NotChecked=370, Total=1722
[2024-03-09 06:11:12,146 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 121
[2024-03-09 06:11:12,149 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 1645 transitions, 24839 flow. Second operand  has 42 states, 42 states have (on average 52.07142857142857) internal successors, (2187), 42 states have internal predecessors, (2187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:11:12,149 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:11:12,149 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 121
[2024-03-09 06:11:12,149 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:11:41,043 INFO  L124   PetriNetUnfolderBase]: 45025/83206 cut-off events.
[2024-03-09 06:11:41,043 INFO  L125   PetriNetUnfolderBase]: For 678998/679851 co-relation queries the response was YES.
[2024-03-09 06:11:41,811 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 482259 conditions, 83206 events. 45025/83206 cut-off events. For 678998/679851 co-relation queries the response was YES. Maximal size of possible extension queue 2748. Compared 816820 event pairs, 6894 based on Foata normal form. 427/83369 useless extension candidates. Maximal degree in co-relation 481431. Up to 39258 conditions per place. 
[2024-03-09 06:11:42,233 INFO  L140   encePairwiseOnDemand]: 76/121 looper letters, 2389 selfloop transitions, 1017 changer transitions 13/3470 dead transitions.
[2024-03-09 06:11:42,233 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 3470 transitions, 58945 flow
[2024-03-09 06:11:42,234 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2024-03-09 06:11:42,234 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2024-03-09 06:11:42,236 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1942 transitions.
[2024-03-09 06:11:42,237 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5349862258953169
[2024-03-09 06:11:42,237 INFO  L72            ComplementDD]: Start complementDD. Operand 30 states and 1942 transitions.
[2024-03-09 06:11:42,237 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 30 states and 1942 transitions.
[2024-03-09 06:11:42,238 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:11:42,238 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 1942 transitions.
[2024-03-09 06:11:42,241 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 31 states, 30 states have (on average 64.73333333333333) internal successors, (1942), 30 states have internal predecessors, (1942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:11:42,245 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 31 states, 31 states have (on average 121.0) internal successors, (3751), 31 states have internal predecessors, (3751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:11:42,245 INFO  L81            ComplementDD]: Finished complementDD. Result  has 31 states, 31 states have (on average 121.0) internal successors, (3751), 31 states have internal predecessors, (3751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:11:42,245 INFO  L175             Difference]: Start difference. First operand has 250 places, 1645 transitions, 24839 flow. Second operand 30 states and 1942 transitions.
[2024-03-09 06:11:42,245 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 3470 transitions, 58945 flow
[2024-03-09 06:12:01,349 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 3470 transitions, 58781 flow, removed 76 selfloop flow, removed 6 redundant places.
[2024-03-09 06:12:01,390 INFO  L231             Difference]: Finished difference. Result has 287 places, 2437 transitions, 43178 flow
[2024-03-09 06:12:01,391 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=24717, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1645, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=351, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=951, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=43178, PETRI_PLACES=287, PETRI_TRANSITIONS=2437}
[2024-03-09 06:12:01,392 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 166 predicate places.
[2024-03-09 06:12:01,392 INFO  L495      AbstractCegarLoop]: Abstraction has has 287 places, 2437 transitions, 43178 flow
[2024-03-09 06:12:01,393 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 42 states, 42 states have (on average 52.07142857142857) internal successors, (2187), 42 states have internal predecessors, (2187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:12:01,393 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:12:01,393 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:12:01,400 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-03-09 06:12:01,593 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2024-03-09 06:12:01,594 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:12:01,594 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:12:01,594 INFO  L85        PathProgramCache]: Analyzing trace with hash -1279057368, now seen corresponding path program 3 times
[2024-03-09 06:12:01,594 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:12:01,595 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759911130]
[2024-03-09 06:12:01,595 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:12:01,595 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:12:01,616 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:12:02,081 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:12:02,081 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:12:02,081 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759911130]
[2024-03-09 06:12:02,081 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759911130] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:12:02,081 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966689766]
[2024-03-09 06:12:02,081 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-09 06:12:02,082 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:12:02,082 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:12:02,083 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 06:12:02,086 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-03-09 06:12:02,256 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-09 06:12:02,257 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 06:12:02,258 INFO  L262         TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 63 conjunts are in the unsatisfiable core
[2024-03-09 06:12:02,275 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:12:02,361 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 06:12:02,409 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 06:12:02,410 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14
[2024-03-09 06:12:02,495 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 06:12:02,510 INFO  L349             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2024-03-09 06:12:02,510 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2024-03-09 06:12:02,826 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-09 06:12:02,826 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33
[2024-03-09 06:12:03,212 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-03-09 06:12:03,235 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-09 06:12:03,291 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 06:12:03,335 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-09 06:12:03,397 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-09 06:12:03,455 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-09 06:12:03,553 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 06:12:03,599 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:12:03,599 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:12:03,616 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_722 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false
[2024-03-09 06:12:03,638 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_722 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2024-03-09 06:12:03,652 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_722 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false
[2024-03-09 06:12:03,760 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_713 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_713) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) c_threadThread1of2ForFork0_~t~0.base))) is different from false
[2024-03-09 06:12:04,301 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 57
[2024-03-09 06:12:04,305 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48
[2024-03-09 06:12:04,311 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46
[2024-03-09 06:12:04,490 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:12:04,490 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966689766] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:12:04,490 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:12:04,490 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 20] total 54
[2024-03-09 06:12:04,490 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403412232]
[2024-03-09 06:12:04,490 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:12:04,491 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 55 states
[2024-03-09 06:12:04,491 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:12:04,492 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants.
[2024-03-09 06:12:04,492 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2352, Unknown=7, NotChecked=404, Total=2970
[2024-03-09 06:12:04,662 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 34 out of 121
[2024-03-09 06:12:04,664 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 2437 transitions, 43178 flow. Second operand  has 55 states, 55 states have (on average 36.27272727272727) internal successors, (1995), 55 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:12:04,664 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:12:04,664 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 121
[2024-03-09 06:12:04,664 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:13:03,439 INFO  L124   PetriNetUnfolderBase]: 60546/110415 cut-off events.
[2024-03-09 06:13:03,439 INFO  L125   PetriNetUnfolderBase]: For 1309467/1310359 co-relation queries the response was YES.
[2024-03-09 06:13:04,657 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 720375 conditions, 110415 events. 60546/110415 cut-off events. For 1309467/1310359 co-relation queries the response was YES. Maximal size of possible extension queue 3402. Compared 1095512 event pairs, 5504 based on Foata normal form. 1257/111178 useless extension candidates. Maximal degree in co-relation 719501. Up to 40472 conditions per place. 
[2024-03-09 06:13:05,194 INFO  L140   encePairwiseOnDemand]: 66/121 looper letters, 3247 selfloop transitions, 2160 changer transitions 65/5508 dead transitions.
[2024-03-09 06:13:05,194 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 5508 transitions, 102948 flow
[2024-03-09 06:13:05,195 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. 
[2024-03-09 06:13:05,195 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 55 states.
[2024-03-09 06:13:05,197 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 2647 transitions.
[2024-03-09 06:13:05,198 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39774605559729526
[2024-03-09 06:13:05,198 INFO  L72            ComplementDD]: Start complementDD. Operand 55 states and 2647 transitions.
[2024-03-09 06:13:05,198 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 55 states and 2647 transitions.
[2024-03-09 06:13:05,199 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:13:05,199 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 2647 transitions.
[2024-03-09 06:13:05,202 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 56 states, 55 states have (on average 48.127272727272725) internal successors, (2647), 55 states have internal predecessors, (2647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:13:05,207 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 56 states, 56 states have (on average 121.0) internal successors, (6776), 56 states have internal predecessors, (6776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:13:05,208 INFO  L81            ComplementDD]: Finished complementDD. Result  has 56 states, 56 states have (on average 121.0) internal successors, (6776), 56 states have internal predecessors, (6776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:13:05,208 INFO  L175             Difference]: Start difference. First operand has 287 places, 2437 transitions, 43178 flow. Second operand 55 states and 2647 transitions.
[2024-03-09 06:13:05,208 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 5508 transitions, 102948 flow
[2024-03-09 06:13:50,926 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 5508 transitions, 102418 flow, removed 236 selfloop flow, removed 15 redundant places.
[2024-03-09 06:13:50,999 INFO  L231             Difference]: Finished difference. Result has 350 places, 3788 transitions, 77865 flow
[2024-03-09 06:13:51,001 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=42941, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=954, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1064, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=77865, PETRI_PLACES=350, PETRI_TRANSITIONS=3788}
[2024-03-09 06:13:51,001 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 229 predicate places.
[2024-03-09 06:13:51,001 INFO  L495      AbstractCegarLoop]: Abstraction has has 350 places, 3788 transitions, 77865 flow
[2024-03-09 06:13:51,002 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 55 states, 55 states have (on average 36.27272727272727) internal successors, (1995), 55 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:13:51,002 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:13:51,003 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:13:51,008 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-03-09 06:13:51,203 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,6 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:13:51,204 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:13:51,204 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:13:51,205 INFO  L85        PathProgramCache]: Analyzing trace with hash 148687240, now seen corresponding path program 4 times
[2024-03-09 06:13:51,205 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:13:51,206 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69922940]
[2024-03-09 06:13:51,206 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:13:51,206 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:13:51,225 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:13:51,852 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:13:51,852 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:13:51,852 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69922940]
[2024-03-09 06:13:51,852 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69922940] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:13:51,852 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759852243]
[2024-03-09 06:13:51,852 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-03-09 06:13:51,853 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:13:51,853 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:13:51,854 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 06:13:51,855 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-03-09 06:13:52,026 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-03-09 06:13:52,027 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 06:13:52,028 INFO  L262         TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 58 conjunts are in the unsatisfiable core
[2024-03-09 06:13:52,035 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:13:52,067 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 06:13:52,151 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 06:13:52,151 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-03-09 06:13:52,409 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-09 06:13:52,410 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33
[2024-03-09 06:13:52,643 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 06:13:52,644 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-03-09 06:13:52,665 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 06:13:52,726 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-09 06:13:52,790 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-09 06:13:52,948 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-09 06:13:53,018 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 06:13:53,019 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21
[2024-03-09 06:13:53,045 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-09 06:13:53,134 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 06:13:53,135 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 06:13:53,158 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 06:13:53,159 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 06:13:53,187 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 06:13:53,188 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 06:13:53,282 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 06:13:53,324 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:13:53,324 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:13:53,341 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_826 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_826) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_826 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_826) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_826 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_826) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_826 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_826) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2024-03-09 06:14:05,900 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_825 (Array Int Int)) (v_ArrVal_826 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_825) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_826) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_825 (Array Int Int)) (v_ArrVal_826 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_825) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_826) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_825 (Array Int Int)) (v_ArrVal_826 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_825) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_826) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_825 (Array Int Int)) (v_ArrVal_826 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_825) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_826) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false
[2024-03-09 06:14:05,937 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_ArrVal_826 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_820) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_825) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_826) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_ArrVal_826 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_820) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_825) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_826) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_ArrVal_826 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_820) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_825) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_826) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_ArrVal_826 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_820) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_825) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_826) c_threadThread1of2ForFork0_~t~0.base) .cse0) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false
[2024-03-09 06:14:05,961 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_ArrVal_826 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_820) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_825) .cse1 v_ArrVal_826) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_ArrVal_826 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_820) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_825) .cse1 v_ArrVal_826) c_threadThread1of2ForFork0_~t~0.base) .cse0))) (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_ArrVal_826 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_820) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_825) .cse1 v_ArrVal_826) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_ArrVal_826 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_820) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_825) .cse1 v_ArrVal_826) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false
[2024-03-09 06:14:06,836 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46
[2024-03-09 06:14:06,946 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:14:06,946 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 40
[2024-03-09 06:14:07,029 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:14:07,029 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759852243] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:14:07,030 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:14:07,030 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 19] total 45
[2024-03-09 06:14:07,030 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879180954]
[2024-03-09 06:14:07,030 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:14:07,031 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 46 states
[2024-03-09 06:14:07,031 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:14:07,032 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants.
[2024-03-09 06:14:07,033 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1532, Unknown=40, NotChecked=332, Total=2070
[2024-03-09 06:14:07,564 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 121
[2024-03-09 06:14:07,566 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 3788 transitions, 77865 flow. Second operand  has 46 states, 46 states have (on average 52.04347826086956) internal successors, (2394), 46 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:14:07,566 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:14:07,566 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 121
[2024-03-09 06:14:07,566 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:15:27,741 INFO  L124   PetriNetUnfolderBase]: 59157/108431 cut-off events.
[2024-03-09 06:15:27,741 INFO  L125   PetriNetUnfolderBase]: For 1830269/1845415 co-relation queries the response was YES.
[2024-03-09 06:15:29,300 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 788952 conditions, 108431 events. 59157/108431 cut-off events. For 1830269/1845415 co-relation queries the response was YES. Maximal size of possible extension queue 3443. Compared 1084170 event pairs, 6169 based on Foata normal form. 732/108737 useless extension candidates. Maximal degree in co-relation 788832. Up to 69200 conditions per place. 
[2024-03-09 06:15:29,883 INFO  L140   encePairwiseOnDemand]: 78/121 looper letters, 3385 selfloop transitions, 1293 changer transitions 19/4770 dead transitions.
[2024-03-09 06:15:29,883 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 4770 transitions, 102862 flow
[2024-03-09 06:15:29,885 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. 
[2024-03-09 06:15:29,885 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 42 states.
[2024-03-09 06:15:29,889 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 2642 transitions.
[2024-03-09 06:15:29,890 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5198740653286108
[2024-03-09 06:15:29,890 INFO  L72            ComplementDD]: Start complementDD. Operand 42 states and 2642 transitions.
[2024-03-09 06:15:29,890 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 42 states and 2642 transitions.
[2024-03-09 06:15:29,892 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:15:29,892 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 2642 transitions.
[2024-03-09 06:15:29,896 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 43 states, 42 states have (on average 62.904761904761905) internal successors, (2642), 42 states have internal predecessors, (2642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:15:29,902 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 43 states, 43 states have (on average 121.0) internal successors, (5203), 43 states have internal predecessors, (5203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:15:29,903 INFO  L81            ComplementDD]: Finished complementDD. Result  has 43 states, 43 states have (on average 121.0) internal successors, (5203), 43 states have internal predecessors, (5203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:15:29,903 INFO  L175             Difference]: Start difference. First operand has 350 places, 3788 transitions, 77865 flow. Second operand 42 states and 2642 transitions.
[2024-03-09 06:15:29,903 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 4770 transitions, 102862 flow
[2024-03-09 06:16:36,370 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 4770 transitions, 102140 flow, removed 291 selfloop flow, removed 21 redundant places.
[2024-03-09 06:16:36,448 INFO  L231             Difference]: Finished difference. Result has 376 places, 4024 transitions, 87434 flow
[2024-03-09 06:16:36,451 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=77190, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3788, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1072, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2644, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=87434, PETRI_PLACES=376, PETRI_TRANSITIONS=4024}
[2024-03-09 06:16:36,451 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 255 predicate places.
[2024-03-09 06:16:36,451 INFO  L495      AbstractCegarLoop]: Abstraction has has 376 places, 4024 transitions, 87434 flow
[2024-03-09 06:16:36,452 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 46 states, 46 states have (on average 52.04347826086956) internal successors, (2394), 46 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:36,452 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:16:36,452 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:16:36,465 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-03-09 06:16:36,653 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2024-03-09 06:16:36,653 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:16:36,654 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:16:36,654 INFO  L85        PathProgramCache]: Analyzing trace with hash -2021296298, now seen corresponding path program 5 times
[2024-03-09 06:16:36,654 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:16:36,654 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68280991]
[2024-03-09 06:16:36,655 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:16:36,655 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:16:36,674 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:16:37,371 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:16:37,372 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:16:37,372 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68280991]
[2024-03-09 06:16:37,372 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68280991] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:16:37,372 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017861082]
[2024-03-09 06:16:37,372 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-03-09 06:16:37,372 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:16:37,372 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:16:37,373 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 06:16:37,385 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-03-09 06:16:37,534 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-09 06:16:37,534 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 06:16:37,535 INFO  L262         TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 48 conjunts are in the unsatisfiable core
[2024-03-09 06:16:37,540 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:16:37,547 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 06:16:37,582 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 06:16:37,582 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14
[2024-03-09 06:16:37,677 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 06:16:37,695 INFO  L349             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2024-03-09 06:16:37,695 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2024-03-09 06:16:37,920 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-09 06:16:37,920 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33
[2024-03-09 06:16:38,076 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-03-09 06:16:38,120 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 06:16:38,262 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-09 06:16:38,342 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-09 06:16:38,409 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:16:38,409 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-03-09 06:16:38,480 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:16:38,480 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-03-09 06:16:38,570 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32
[2024-03-09 06:16:38,596 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32
[2024-03-09 06:16:38,623 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32
[2024-03-09 06:16:38,650 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32
[2024-03-09 06:16:38,704 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32
[2024-03-09 06:16:38,720 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:16:38,720 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:16:43,177 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_931) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_931) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_931) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_931) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))))) is different from false
[2024-03-09 06:16:43,200 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_931) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_931) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_931) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_931) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false
[2024-03-09 06:16:43,223 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) .cse1 v_ArrVal_931) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) .cse1 v_ArrVal_931) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) .cse1 v_ArrVal_931) c_threadThread1of2ForFork0_~t~0.base) .cse3))) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) .cse1 v_ArrVal_931) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2024-03-09 06:16:43,712 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35
[2024-03-09 06:16:43,721 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6
[2024-03-09 06:16:43,881 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:16:43,881 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017861082] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:16:43,881 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:16:43,881 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 43
[2024-03-09 06:16:43,881 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137038178]
[2024-03-09 06:16:43,882 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:16:43,882 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 44 states
[2024-03-09 06:16:43,882 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:16:43,882 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants.
[2024-03-09 06:16:43,883 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1468, Unknown=37, NotChecked=240, Total=1892
[2024-03-09 06:16:44,266 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 121
[2024-03-09 06:16:44,268 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 4024 transitions, 87434 flow. Second operand  has 44 states, 44 states have (on average 52.06818181818182) internal successors, (2291), 44 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:16:44,268 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:16:44,268 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 121
[2024-03-09 06:16:44,268 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:18:15,997 INFO  L124   PetriNetUnfolderBase]: 60269/111086 cut-off events.
[2024-03-09 06:18:15,997 INFO  L125   PetriNetUnfolderBase]: For 2095682/2096917 co-relation queries the response was YES.
[2024-03-09 06:18:17,831 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 838103 conditions, 111086 events. 60269/111086 cut-off events. For 2095682/2096917 co-relation queries the response was YES. Maximal size of possible extension queue 3545. Compared 1116847 event pairs, 5643 based on Foata normal form. 522/111452 useless extension candidates. Maximal degree in co-relation 836450. Up to 69939 conditions per place. 
[2024-03-09 06:18:18,425 INFO  L140   encePairwiseOnDemand]: 78/121 looper letters, 3598 selfloop transitions, 1353 changer transitions 11/5035 dead transitions.
[2024-03-09 06:18:18,426 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 5035 transitions, 114185 flow
[2024-03-09 06:18:18,426 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. 
[2024-03-09 06:18:18,426 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 37 states.
[2024-03-09 06:18:18,428 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 2346 transitions.
[2024-03-09 06:18:18,428 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5240116149207058
[2024-03-09 06:18:18,429 INFO  L72            ComplementDD]: Start complementDD. Operand 37 states and 2346 transitions.
[2024-03-09 06:18:18,429 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 37 states and 2346 transitions.
[2024-03-09 06:18:18,429 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:18:18,429 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 2346 transitions.
[2024-03-09 06:18:18,432 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 38 states, 37 states have (on average 63.4054054054054) internal successors, (2346), 37 states have internal predecessors, (2346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:18:18,435 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 38 states, 38 states have (on average 121.0) internal successors, (4598), 38 states have internal predecessors, (4598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:18:18,435 INFO  L81            ComplementDD]: Finished complementDD. Result  has 38 states, 38 states have (on average 121.0) internal successors, (4598), 38 states have internal predecessors, (4598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:18:18,435 INFO  L175             Difference]: Start difference. First operand has 376 places, 4024 transitions, 87434 flow. Second operand 37 states and 2346 transitions.
[2024-03-09 06:18:18,435 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 5035 transitions, 114185 flow
[2024-03-09 06:19:30,792 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 5035 transitions, 113261 flow, removed 261 selfloop flow, removed 33 redundant places.
[2024-03-09 06:19:30,880 INFO  L231             Difference]: Finished difference. Result has 390 places, 4294 transitions, 98968 flow
[2024-03-09 06:19:30,883 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=86590, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4024, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2770, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=98968, PETRI_PLACES=390, PETRI_TRANSITIONS=4294}
[2024-03-09 06:19:30,883 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 269 predicate places.
[2024-03-09 06:19:30,883 INFO  L495      AbstractCegarLoop]: Abstraction has has 390 places, 4294 transitions, 98968 flow
[2024-03-09 06:19:30,884 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 44 states, 44 states have (on average 52.06818181818182) internal successors, (2291), 44 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:19:30,884 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:19:30,884 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:19:30,892 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-03-09 06:19:31,085 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2024-03-09 06:19:31,086 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:19:31,086 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:19:31,087 INFO  L85        PathProgramCache]: Analyzing trace with hash 899850442, now seen corresponding path program 6 times
[2024-03-09 06:19:31,087 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:19:31,087 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320137499]
[2024-03-09 06:19:31,088 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:19:31,088 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:19:31,108 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:19:31,615 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:19:31,616 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:19:31,616 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320137499]
[2024-03-09 06:19:31,616 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320137499] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:19:31,616 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131791698]
[2024-03-09 06:19:31,616 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-03-09 06:19:31,617 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:19:31,617 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:19:31,618 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 06:19:31,620 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-03-09 06:19:31,782 INFO  L228   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s)
[2024-03-09 06:19:31,782 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 06:19:31,784 INFO  L262         TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 52 conjunts are in the unsatisfiable core
[2024-03-09 06:19:31,788 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:19:31,822 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-09 06:19:31,929 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 06:19:31,929 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-03-09 06:19:32,226 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-09 06:19:32,227 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33
[2024-03-09 06:19:32,450 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-09 06:19:32,615 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 06:19:32,671 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-09 06:19:32,734 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-09 06:19:32,802 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-09 06:19:32,878 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 06:19:32,936 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:19:32,936 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:19:32,962 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1030 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1030) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1030 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1030) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1030 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1030) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1030 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1030) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2024-03-09 06:19:32,981 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1030 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1030) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1030 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1030) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1030 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1030) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1030 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1030) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2024-03-09 06:19:33,000 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1030 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1030) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1030 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1030) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1030 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1030) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1030 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1030) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2024-03-09 06:19:33,130 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1021 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1021) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~t~1#1.base|))) is different from false
[2024-03-09 06:19:33,350 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29
[2024-03-09 06:19:33,362 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6
[2024-03-09 06:19:33,418 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8
[2024-03-09 06:19:33,459 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:19:33,459 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [131791698] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:19:33,459 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:19:33,460 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 41
[2024-03-09 06:19:33,460 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006278451]
[2024-03-09 06:19:33,460 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:19:33,461 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 42 states
[2024-03-09 06:19:33,461 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:19:33,462 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2024-03-09 06:19:33,463 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1258, Unknown=19, NotChecked=300, Total=1722
[2024-03-09 06:19:33,620 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 121
[2024-03-09 06:19:33,622 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 4294 transitions, 98968 flow. Second operand  has 42 states, 42 states have (on average 52.07142857142857) internal successors, (2187), 42 states have internal predecessors, (2187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:19:33,622 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:19:33,623 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 121
[2024-03-09 06:19:33,623 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:21:34,053 INFO  L124   PetriNetUnfolderBase]: 77292/141718 cut-off events.
[2024-03-09 06:21:34,053 INFO  L125   PetriNetUnfolderBase]: For 3196879/3213068 co-relation queries the response was YES.
[2024-03-09 06:21:36,368 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1121589 conditions, 141718 events. 77292/141718 cut-off events. For 3196879/3213068 co-relation queries the response was YES. Maximal size of possible extension queue 4577. Compared 1475929 event pairs, 10715 based on Foata normal form. 820/142131 useless extension candidates. Maximal degree in co-relation 1109380. Up to 59433 conditions per place. 
[2024-03-09 06:21:37,215 INFO  L140   encePairwiseOnDemand]: 76/121 looper letters, 5009 selfloop transitions, 1905 changer transitions 24/7011 dead transitions.
[2024-03-09 06:21:37,216 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 7011 transitions, 166509 flow
[2024-03-09 06:21:37,216 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2024-03-09 06:21:37,216 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2024-03-09 06:21:37,217 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1974 transitions.
[2024-03-09 06:21:37,218 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.543801652892562
[2024-03-09 06:21:37,218 INFO  L72            ComplementDD]: Start complementDD. Operand 30 states and 1974 transitions.
[2024-03-09 06:21:37,218 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 30 states and 1974 transitions.
[2024-03-09 06:21:37,219 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:21:37,219 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 1974 transitions.
[2024-03-09 06:21:37,221 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 31 states, 30 states have (on average 65.8) internal successors, (1974), 30 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:21:37,223 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 31 states, 31 states have (on average 121.0) internal successors, (3751), 31 states have internal predecessors, (3751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:21:37,224 INFO  L81            ComplementDD]: Finished complementDD. Result  has 31 states, 31 states have (on average 121.0) internal successors, (3751), 31 states have internal predecessors, (3751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:21:37,224 INFO  L175             Difference]: Start difference. First operand has 390 places, 4294 transitions, 98968 flow. Second operand 30 states and 1974 transitions.
[2024-03-09 06:21:37,224 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 7011 transitions, 166509 flow
Killed by 15
