./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/value-barrier-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49dcb57-9d2b-4b05-9f82-206e0c7948be/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49dcb57-9d2b-4b05-9f82-206e0c7948be/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49dcb57-9d2b-4b05-9f82-206e0c7948be/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49dcb57-9d2b-4b05-9f82-206e0c7948be/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/value-barrier-race.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49dcb57-9d2b-4b05-9f82-206e0c7948be/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49dcb57-9d2b-4b05-9f82-206e0c7948be/bin/uautomizer-verify-VRDe98Ueme --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 4e3d22e98e469d91cee59ee59a7893605d6313bab33afdf939e81a0c217e3b1b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:43:10,325 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:43:10,420 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49dcb57-9d2b-4b05-9f82-206e0c7948be/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-26 10:43:10,426 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:43:10,427 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:43:10,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:43:10,462 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:43:10,463 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:43:10,464 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:43:10,469 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:43:10,470 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:43:10,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:43:10,471 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:43:10,473 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:43:10,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 10:43:10,474 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:43:10,475 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:43:10,475 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:43:10,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:43:10,476 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 10:43:10,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:43:10,477 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 10:43:10,477 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-26 10:43:10,478 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 10:43:10,478 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:43:10,479 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 10:43:10,479 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:43:10,480 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:43:10,480 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:43:10,480 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:43:10,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:43:10,481 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:43:10,481 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:43:10,482 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 10:43:10,482 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 10:43:10,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 10:43:10,483 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:43:10,483 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:43:10,483 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 10:43:10,483 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:43:10,484 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:43:10,484 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49dcb57-9d2b-4b05-9f82-206e0c7948be/bin/uautomizer-verify-VRDe98Ueme/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49dcb57-9d2b-4b05-9f82-206e0c7948be/bin/uautomizer-verify-VRDe98Ueme 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 -> 4e3d22e98e469d91cee59ee59a7893605d6313bab33afdf939e81a0c217e3b1b [2023-11-26 10:43:10,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:43:10,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:43:10,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:43:10,847 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:43:10,848 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:43:10,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49dcb57-9d2b-4b05-9f82-206e0c7948be/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-race-challenges/value-barrier-race.i [2023-11-26 10:43:14,316 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:43:14,625 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:43:14,626 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49dcb57-9d2b-4b05-9f82-206e0c7948be/sv-benchmarks/c/pthread-race-challenges/value-barrier-race.i [2023-11-26 10:43:14,667 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49dcb57-9d2b-4b05-9f82-206e0c7948be/bin/uautomizer-verify-VRDe98Ueme/data/d7b8ea474/3bfef08b87ca4beda3a0609554d1a6fc/FLAG6a39a2dd0 [2023-11-26 10:43:14,686 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49dcb57-9d2b-4b05-9f82-206e0c7948be/bin/uautomizer-verify-VRDe98Ueme/data/d7b8ea474/3bfef08b87ca4beda3a0609554d1a6fc [2023-11-26 10:43:14,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:43:14,691 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:43:14,693 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:43:14,693 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:43:14,699 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:43:14,700 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:43:14" (1/1) ... [2023-11-26 10:43:14,701 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b96f0e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:14, skipping insertion in model container [2023-11-26 10:43:14,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:43:14" (1/1) ... [2023-11-26 10:43:14,759 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:43:15,346 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:43:15,358 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:43:15,426 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:43:15,497 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:43:15,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:15 WrapperNode [2023-11-26 10:43:15,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:43:15,499 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:43:15,499 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:43:15,499 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:43:15,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:15" (1/1) ... [2023-11-26 10:43:15,535 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:15" (1/1) ... [2023-11-26 10:43:15,590 INFO L138 Inliner]: procedures = 265, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 91 [2023-11-26 10:43:15,590 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:43:15,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:43:15,591 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:43:15,591 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:43:15,602 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:15" (1/1) ... [2023-11-26 10:43:15,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:15" (1/1) ... [2023-11-26 10:43:15,625 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:15" (1/1) ... [2023-11-26 10:43:15,625 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:15" (1/1) ... [2023-11-26 10:43:15,634 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:15" (1/1) ... [2023-11-26 10:43:15,649 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:15" (1/1) ... [2023-11-26 10:43:15,651 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:15" (1/1) ... [2023-11-26 10:43:15,653 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:15" (1/1) ... [2023-11-26 10:43:15,656 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:43:15,657 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:43:15,657 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:43:15,658 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:43:15,658 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:15" (1/1) ... [2023-11-26 10:43:15,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:43:15,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49dcb57-9d2b-4b05-9f82-206e0c7948be/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:43:15,708 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49dcb57-9d2b-4b05-9f82-206e0c7948be/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:43:15,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49dcb57-9d2b-4b05-9f82-206e0c7948be/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:43:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 10:43:15,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-26 10:43:15,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 10:43:15,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-26 10:43:15,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-26 10:43:15,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-26 10:43:15,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-26 10:43:15,760 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-26 10:43:15,761 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-26 10:43:15,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:43:15,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:43:15,764 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 10:43:15,988 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:43:15,995 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:43:16,274 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:43:16,286 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:43:16,286 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-26 10:43:16,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:43:16 BoogieIcfgContainer [2023-11-26 10:43:16,288 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:43:16,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:43:16,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:43:16,294 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:43:16,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:43:14" (1/3) ... [2023-11-26 10:43:16,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b7ac227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:43:16, skipping insertion in model container [2023-11-26 10:43:16,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:15" (2/3) ... [2023-11-26 10:43:16,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b7ac227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:43:16, skipping insertion in model container [2023-11-26 10:43:16,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:43:16" (3/3) ... [2023-11-26 10:43:16,297 INFO L112 eAbstractionObserver]: Analyzing ICFG value-barrier-race.i [2023-11-26 10:43:16,306 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 10:43:16,318 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:43:16,318 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-26 10:43:16,318 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 10:43:16,377 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-26 10:43:16,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 113 transitions, 233 flow [2023-11-26 10:43:16,493 INFO L124 PetriNetUnfolderBase]: 8/176 cut-off events. [2023-11-26 10:43:16,493 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-26 10:43:16,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 176 events. 8/176 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 334 event pairs, 0 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 86. Up to 4 conditions per place. [2023-11-26 10:43:16,500 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 113 transitions, 233 flow [2023-11-26 10:43:16,506 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 113 transitions, 233 flow [2023-11-26 10:43:16,516 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:43:16,524 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;@51bdb3bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:43:16,524 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-11-26 10:43:16,536 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:43:16,536 INFO L124 PetriNetUnfolderBase]: 2/39 cut-off events. [2023-11-26 10:43:16,537 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:43:16,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:43:16,538 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] [2023-11-26 10:43:16,538 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-26 10:43:16,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:16,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1153270634, now seen corresponding path program 1 times [2023-11-26 10:43:16,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:16,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023977121] [2023-11-26 10:43:16,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:16,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:16,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:43:16,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:16,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023977121] [2023-11-26 10:43:16,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023977121] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:16,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:16,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:43:16,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228818128] [2023-11-26 10:43:16,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:16,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:43:16,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:17,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:43:17,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:43:17,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 113 [2023-11-26 10:43:17,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 113 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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) [2023-11-26 10:43:17,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:43:17,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 113 [2023-11-26 10:43:17,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:43:17,157 INFO L124 PetriNetUnfolderBase]: 7/207 cut-off events. [2023-11-26 10:43:17,158 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2023-11-26 10:43:17,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 207 events. 7/207 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 558 event pairs, 3 based on Foata normal form. 11/192 useless extension candidates. Maximal degree in co-relation 136. Up to 21 conditions per place. [2023-11-26 10:43:17,162 INFO L140 encePairwiseOnDemand]: 104/113 looper letters, 9 selfloop transitions, 4 changer transitions 1/112 dead transitions. [2023-11-26 10:43:17,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 112 transitions, 257 flow [2023-11-26 10:43:17,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:43:17,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:43:17,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 316 transitions. [2023-11-26 10:43:17,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9321533923303835 [2023-11-26 10:43:17,195 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 316 transitions. [2023-11-26 10:43:17,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 316 transitions. [2023-11-26 10:43:17,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:43:17,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 316 transitions. [2023-11-26 10:43:17,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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) [2023-11-26 10:43:17,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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) [2023-11-26 10:43:17,218 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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) [2023-11-26 10:43:17,220 INFO L175 Difference]: Start difference. First operand has 110 places, 113 transitions, 233 flow. Second operand 3 states and 316 transitions. [2023-11-26 10:43:17,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 112 transitions, 257 flow [2023-11-26 10:43:17,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 112 transitions, 257 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:43:17,236 INFO L231 Difference]: Finished difference. Result has 114 places, 111 transitions, 253 flow [2023-11-26 10:43:17,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=253, PETRI_PLACES=114, PETRI_TRANSITIONS=111} [2023-11-26 10:43:17,245 INFO L281 CegarLoopForPetriNet]: 110 programPoint places, 4 predicate places. [2023-11-26 10:43:17,255 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 111 transitions, 253 flow [2023-11-26 10:43:17,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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) [2023-11-26 10:43:17,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:43:17,256 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] [2023-11-26 10:43:17,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 10:43:17,257 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-26 10:43:17,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:17,258 INFO L85 PathProgramCache]: Analyzing trace with hash -696390061, now seen corresponding path program 1 times [2023-11-26 10:43:17,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:17,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695450768] [2023-11-26 10:43:17,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:17,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:18,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:43:18,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:18,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695450768] [2023-11-26 10:43:18,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695450768] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:18,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:18,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:43:18,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673515192] [2023-11-26 10:43:18,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:18,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:43:18,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:18,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:43:18,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:43:18,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 113 [2023-11-26 10:43:18,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 111 transitions, 253 flow. Second operand has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 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) [2023-11-26 10:43:18,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:43:18,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 113 [2023-11-26 10:43:18,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:43:18,455 INFO L124 PetriNetUnfolderBase]: 6/199 cut-off events. [2023-11-26 10:43:18,456 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-26 10:43:18,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 199 events. 6/199 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 471 event pairs, 1 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 137. Up to 31 conditions per place. [2023-11-26 10:43:18,463 INFO L140 encePairwiseOnDemand]: 97/113 looper letters, 20 selfloop transitions, 9 changer transitions 4/120 dead transitions. [2023-11-26 10:43:18,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 120 transitions, 337 flow [2023-11-26 10:43:18,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:43:18,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 10:43:18,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 546 transitions. [2023-11-26 10:43:18,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8053097345132744 [2023-11-26 10:43:18,468 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 546 transitions. [2023-11-26 10:43:18,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 546 transitions. [2023-11-26 10:43:18,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:43:18,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 546 transitions. [2023-11-26 10:43:18,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 91.0) internal successors, (546), 6 states have internal predecessors, (546), 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) [2023-11-26 10:43:18,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 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) [2023-11-26 10:43:18,477 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 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) [2023-11-26 10:43:18,477 INFO L175 Difference]: Start difference. First operand has 114 places, 111 transitions, 253 flow. Second operand 6 states and 546 transitions. [2023-11-26 10:43:18,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 120 transitions, 337 flow [2023-11-26 10:43:18,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 120 transitions, 329 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:43:18,488 INFO L231 Difference]: Finished difference. Result has 117 places, 116 transitions, 312 flow [2023-11-26 10:43:18,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=117, PETRI_TRANSITIONS=116} [2023-11-26 10:43:18,489 INFO L281 CegarLoopForPetriNet]: 110 programPoint places, 7 predicate places. [2023-11-26 10:43:18,490 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 312 flow [2023-11-26 10:43:18,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 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) [2023-11-26 10:43:18,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:43:18,491 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] [2023-11-26 10:43:18,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 10:43:18,492 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-26 10:43:18,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:18,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1771011422, now seen corresponding path program 1 times [2023-11-26 10:43:18,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:18,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918462631] [2023-11-26 10:43:18,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:18,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:18,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:43:18,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:18,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918462631] [2023-11-26 10:43:18,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918462631] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:18,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:18,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:43:18,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830205393] [2023-11-26 10:43:18,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:18,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:43:18,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:18,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:43:18,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:43:18,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 113 [2023-11-26 10:43:18,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 116 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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) [2023-11-26 10:43:18,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:43:18,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 113 [2023-11-26 10:43:18,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:43:18,692 INFO L124 PetriNetUnfolderBase]: 8/315 cut-off events. [2023-11-26 10:43:18,692 INFO L125 PetriNetUnfolderBase]: For 16/18 co-relation queries the response was YES. [2023-11-26 10:43:18,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 315 events. 8/315 cut-off events. For 16/18 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1023 event pairs, 1 based on Foata normal form. 1/288 useless extension candidates. Maximal degree in co-relation 309. Up to 14 conditions per place. [2023-11-26 10:43:18,695 INFO L140 encePairwiseOnDemand]: 109/113 looper letters, 7 selfloop transitions, 3 changer transitions 0/120 dead transitions. [2023-11-26 10:43:18,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 120 transitions, 343 flow [2023-11-26 10:43:18,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:43:18,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:43:18,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2023-11-26 10:43:18,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.943952802359882 [2023-11-26 10:43:18,698 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions. [2023-11-26 10:43:18,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions. [2023-11-26 10:43:18,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:43:18,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions. [2023-11-26 10:43:18,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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) [2023-11-26 10:43:18,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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) [2023-11-26 10:43:18,702 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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) [2023-11-26 10:43:18,702 INFO L175 Difference]: Start difference. First operand has 117 places, 116 transitions, 312 flow. Second operand 3 states and 320 transitions. [2023-11-26 10:43:18,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 120 transitions, 343 flow [2023-11-26 10:43:18,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 120 transitions, 334 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-26 10:43:18,716 INFO L231 Difference]: Finished difference. Result has 120 places, 119 transitions, 329 flow [2023-11-26 10:43:18,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=329, PETRI_PLACES=120, PETRI_TRANSITIONS=119} [2023-11-26 10:43:18,718 INFO L281 CegarLoopForPetriNet]: 110 programPoint places, 10 predicate places. [2023-11-26 10:43:18,719 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 119 transitions, 329 flow [2023-11-26 10:43:18,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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) [2023-11-26 10:43:18,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:43:18,720 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] [2023-11-26 10:43:18,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 10:43:18,720 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-26 10:43:18,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:18,722 INFO L85 PathProgramCache]: Analyzing trace with hash -903876076, now seen corresponding path program 1 times [2023-11-26 10:43:18,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:18,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891604792] [2023-11-26 10:43:18,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:18,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:18,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:43:18,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:18,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891604792] [2023-11-26 10:43:18,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891604792] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:18,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:18,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:43:18,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887997419] [2023-11-26 10:43:18,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:18,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:43:18,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:18,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:43:18,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:43:18,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 113 [2023-11-26 10:43:18,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 119 transitions, 329 flow. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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) [2023-11-26 10:43:18,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:43:18,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 113 [2023-11-26 10:43:18,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:43:18,907 INFO L124 PetriNetUnfolderBase]: 25/379 cut-off events. [2023-11-26 10:43:18,907 INFO L125 PetriNetUnfolderBase]: For 53/56 co-relation queries the response was YES. [2023-11-26 10:43:18,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 563 conditions, 379 events. 25/379 cut-off events. For 53/56 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1403 event pairs, 3 based on Foata normal form. 1/343 useless extension candidates. Maximal degree in co-relation 376. Up to 44 conditions per place. [2023-11-26 10:43:18,911 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 10 selfloop transitions, 6 changer transitions 0/123 dead transitions. [2023-11-26 10:43:18,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 123 transitions, 375 flow [2023-11-26 10:43:18,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:43:18,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:43:18,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2023-11-26 10:43:18,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9174041297935103 [2023-11-26 10:43:18,914 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2023-11-26 10:43:18,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2023-11-26 10:43:18,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:43:18,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2023-11-26 10:43:18,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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) [2023-11-26 10:43:18,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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) [2023-11-26 10:43:18,917 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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) [2023-11-26 10:43:18,917 INFO L175 Difference]: Start difference. First operand has 120 places, 119 transitions, 329 flow. Second operand 3 states and 311 transitions. [2023-11-26 10:43:18,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 123 transitions, 375 flow [2023-11-26 10:43:18,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 123 transitions, 367 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:43:18,926 INFO L231 Difference]: Finished difference. Result has 122 places, 123 transitions, 369 flow [2023-11-26 10:43:18,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=369, PETRI_PLACES=122, PETRI_TRANSITIONS=123} [2023-11-26 10:43:18,927 INFO L281 CegarLoopForPetriNet]: 110 programPoint places, 12 predicate places. [2023-11-26 10:43:18,928 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 123 transitions, 369 flow [2023-11-26 10:43:18,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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) [2023-11-26 10:43:18,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:43:18,929 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] [2023-11-26 10:43:18,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 10:43:18,929 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-26 10:43:18,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:18,930 INFO L85 PathProgramCache]: Analyzing trace with hash 823299659, now seen corresponding path program 1 times [2023-11-26 10:43:18,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:18,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955667589] [2023-11-26 10:43:18,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:18,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:19,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:43:19,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:19,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955667589] [2023-11-26 10:43:19,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955667589] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:19,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:19,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:43:19,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74466986] [2023-11-26 10:43:19,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:19,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:43:19,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:19,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:43:19,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:43:19,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 113 [2023-11-26 10:43:19,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 123 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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) [2023-11-26 10:43:19,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:43:19,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 113 [2023-11-26 10:43:19,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:43:19,135 INFO L124 PetriNetUnfolderBase]: 19/465 cut-off events. [2023-11-26 10:43:19,135 INFO L125 PetriNetUnfolderBase]: For 79/93 co-relation queries the response was YES. [2023-11-26 10:43:19,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 688 conditions, 465 events. 19/465 cut-off events. For 79/93 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2078 event pairs, 0 based on Foata normal form. 4/438 useless extension candidates. Maximal degree in co-relation 454. Up to 26 conditions per place. [2023-11-26 10:43:19,138 INFO L140 encePairwiseOnDemand]: 109/113 looper letters, 6 selfloop transitions, 4 changer transitions 0/126 dead transitions. [2023-11-26 10:43:19,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 126 transitions, 400 flow [2023-11-26 10:43:19,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:43:19,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:43:19,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2023-11-26 10:43:19,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9410029498525073 [2023-11-26 10:43:19,141 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 319 transitions. [2023-11-26 10:43:19,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 319 transitions. [2023-11-26 10:43:19,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:43:19,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 319 transitions. [2023-11-26 10:43:19,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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) [2023-11-26 10:43:19,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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) [2023-11-26 10:43:19,147 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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) [2023-11-26 10:43:19,148 INFO L175 Difference]: Start difference. First operand has 122 places, 123 transitions, 369 flow. Second operand 3 states and 319 transitions. [2023-11-26 10:43:19,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 126 transitions, 400 flow [2023-11-26 10:43:19,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 126 transitions, 388 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:43:19,154 INFO L231 Difference]: Finished difference. Result has 124 places, 125 transitions, 385 flow [2023-11-26 10:43:19,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=385, PETRI_PLACES=124, PETRI_TRANSITIONS=125} [2023-11-26 10:43:19,156 INFO L281 CegarLoopForPetriNet]: 110 programPoint places, 14 predicate places. [2023-11-26 10:43:19,156 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 125 transitions, 385 flow [2023-11-26 10:43:19,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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) [2023-11-26 10:43:19,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:43:19,157 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] [2023-11-26 10:43:19,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 10:43:19,158 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-26 10:43:19,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:19,159 INFO L85 PathProgramCache]: Analyzing trace with hash -2136876547, now seen corresponding path program 1 times [2023-11-26 10:43:19,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:19,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534467940] [2023-11-26 10:43:19,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:19,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:43:19,226 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:43:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:43:19,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:43:19,278 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 10:43:19,280 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2023-11-26 10:43:19,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2023-11-26 10:43:19,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2023-11-26 10:43:19,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2023-11-26 10:43:19,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2023-11-26 10:43:19,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2023-11-26 10:43:19,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2023-11-26 10:43:19,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2023-11-26 10:43:19,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2023-11-26 10:43:19,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2023-11-26 10:43:19,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2023-11-26 10:43:19,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 10:43:19,285 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-26 10:43:19,288 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-26 10:43:19,288 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-26 10:43:19,317 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-26 10:43:19,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 128 transitions, 272 flow [2023-11-26 10:43:19,378 INFO L124 PetriNetUnfolderBase]: 15/305 cut-off events. [2023-11-26 10:43:19,378 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-26 10:43:19,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 305 events. 15/305 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 690 event pairs, 0 based on Foata normal form. 0/261 useless extension candidates. Maximal degree in co-relation 178. Up to 8 conditions per place. [2023-11-26 10:43:19,380 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 128 transitions, 272 flow [2023-11-26 10:43:19,383 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 128 transitions, 272 flow [2023-11-26 10:43:19,384 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:43:19,392 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;@51bdb3bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:43:19,392 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-26 10:43:19,397 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:43:19,397 INFO L124 PetriNetUnfolderBase]: 2/39 cut-off events. [2023-11-26 10:43:19,397 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:43:19,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:43:19,397 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] [2023-11-26 10:43:19,399 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-26 10:43:19,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:19,399 INFO L85 PathProgramCache]: Analyzing trace with hash 612998422, now seen corresponding path program 1 times [2023-11-26 10:43:19,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:19,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797311462] [2023-11-26 10:43:19,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:19,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:19,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:43:19,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:19,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797311462] [2023-11-26 10:43:19,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797311462] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:19,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:19,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:43:19,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416431989] [2023-11-26 10:43:19,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:19,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:43:19,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:19,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:43:19,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:43:19,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 128 [2023-11-26 10:43:19,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 128 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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) [2023-11-26 10:43:19,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:43:19,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 128 [2023-11-26 10:43:19,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:43:19,587 INFO L124 PetriNetUnfolderBase]: 43/526 cut-off events. [2023-11-26 10:43:19,587 INFO L125 PetriNetUnfolderBase]: For 35/45 co-relation queries the response was YES. [2023-11-26 10:43:19,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 526 events. 43/526 cut-off events. For 35/45 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2259 event pairs, 23 based on Foata normal form. 50/500 useless extension candidates. Maximal degree in co-relation 344. Up to 83 conditions per place. [2023-11-26 10:43:19,592 INFO L140 encePairwiseOnDemand]: 117/128 looper letters, 12 selfloop transitions, 5 changer transitions 1/127 dead transitions. [2023-11-26 10:43:19,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 127 transitions, 304 flow [2023-11-26 10:43:19,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:43:19,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:43:19,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2023-11-26 10:43:19,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9244791666666666 [2023-11-26 10:43:19,595 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2023-11-26 10:43:19,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2023-11-26 10:43:19,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:43:19,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2023-11-26 10:43:19,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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) [2023-11-26 10:43:19,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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) [2023-11-26 10:43:19,600 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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) [2023-11-26 10:43:19,600 INFO L175 Difference]: Start difference. First operand has 124 places, 128 transitions, 272 flow. Second operand 3 states and 355 transitions. [2023-11-26 10:43:19,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 127 transitions, 304 flow [2023-11-26 10:43:19,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 127 transitions, 304 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:43:19,604 INFO L231 Difference]: Finished difference. Result has 128 places, 126 transitions, 298 flow [2023-11-26 10:43:19,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=128, PETRI_TRANSITIONS=126} [2023-11-26 10:43:19,606 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, 4 predicate places. [2023-11-26 10:43:19,607 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 126 transitions, 298 flow [2023-11-26 10:43:19,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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) [2023-11-26 10:43:19,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:43:19,607 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] [2023-11-26 10:43:19,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 10:43:19,608 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-26 10:43:19,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:19,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1776624045, now seen corresponding path program 1 times [2023-11-26 10:43:19,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:19,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722216487] [2023-11-26 10:43:19,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:19,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:20,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:43:20,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:20,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722216487] [2023-11-26 10:43:20,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722216487] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:20,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:20,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:43:20,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014948256] [2023-11-26 10:43:20,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:20,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:43:20,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:20,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:43:20,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:43:20,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 128 [2023-11-26 10:43:20,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 126 transitions, 298 flow. Second operand has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 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) [2023-11-26 10:43:20,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:43:20,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 128 [2023-11-26 10:43:20,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:43:20,367 INFO L124 PetriNetUnfolderBase]: 29/446 cut-off events. [2023-11-26 10:43:20,367 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-11-26 10:43:20,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 446 events. 29/446 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1703 event pairs, 9 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 315. Up to 72 conditions per place. [2023-11-26 10:43:20,372 INFO L140 encePairwiseOnDemand]: 112/128 looper letters, 22 selfloop transitions, 9 changer transitions 4/135 dead transitions. [2023-11-26 10:43:20,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 135 transitions, 386 flow [2023-11-26 10:43:20,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:43:20,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 10:43:20,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 620 transitions. [2023-11-26 10:43:20,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8072916666666666 [2023-11-26 10:43:20,376 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 620 transitions. [2023-11-26 10:43:20,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 620 transitions. [2023-11-26 10:43:20,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:43:20,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 620 transitions. [2023-11-26 10:43:20,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.33333333333333) internal successors, (620), 6 states have internal predecessors, (620), 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) [2023-11-26 10:43:20,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 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) [2023-11-26 10:43:20,382 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 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) [2023-11-26 10:43:20,382 INFO L175 Difference]: Start difference. First operand has 128 places, 126 transitions, 298 flow. Second operand 6 states and 620 transitions. [2023-11-26 10:43:20,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 135 transitions, 386 flow [2023-11-26 10:43:20,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 135 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:43:20,388 INFO L231 Difference]: Finished difference. Result has 131 places, 131 transitions, 355 flow [2023-11-26 10:43:20,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=355, PETRI_PLACES=131, PETRI_TRANSITIONS=131} [2023-11-26 10:43:20,389 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, 7 predicate places. [2023-11-26 10:43:20,389 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 131 transitions, 355 flow [2023-11-26 10:43:20,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 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) [2023-11-26 10:43:20,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:43:20,390 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] [2023-11-26 10:43:20,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 10:43:20,391 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-26 10:43:20,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:20,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1646897487, now seen corresponding path program 1 times [2023-11-26 10:43:20,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:20,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555279600] [2023-11-26 10:43:20,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:20,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:20,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:43:20,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:20,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555279600] [2023-11-26 10:43:20,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555279600] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:20,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:20,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:43:20,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382812922] [2023-11-26 10:43:20,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:20,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:43:20,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:20,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:43:20,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:43:20,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 128 [2023-11-26 10:43:20,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 131 transitions, 355 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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) [2023-11-26 10:43:20,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:43:20,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 128 [2023-11-26 10:43:20,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:43:20,711 INFO L124 PetriNetUnfolderBase]: 102/1429 cut-off events. [2023-11-26 10:43:20,712 INFO L125 PetriNetUnfolderBase]: For 130/178 co-relation queries the response was YES. [2023-11-26 10:43:20,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1950 conditions, 1429 events. 102/1429 cut-off events. For 130/178 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 10368 event pairs, 25 based on Foata normal form. 5/1267 useless extension candidates. Maximal degree in co-relation 1738. Up to 93 conditions per place. [2023-11-26 10:43:20,727 INFO L140 encePairwiseOnDemand]: 121/128 looper letters, 14 selfloop transitions, 5 changer transitions 0/139 dead transitions. [2023-11-26 10:43:20,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 139 transitions, 420 flow [2023-11-26 10:43:20,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:43:20,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:43:20,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-11-26 10:43:20,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9296875 [2023-11-26 10:43:20,730 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-11-26 10:43:20,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-11-26 10:43:20,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:43:20,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-11-26 10:43:20,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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) [2023-11-26 10:43:20,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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) [2023-11-26 10:43:20,733 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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) [2023-11-26 10:43:20,734 INFO L175 Difference]: Start difference. First operand has 131 places, 131 transitions, 355 flow. Second operand 3 states and 357 transitions. [2023-11-26 10:43:20,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 139 transitions, 420 flow [2023-11-26 10:43:20,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 139 transitions, 411 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-26 10:43:20,741 INFO L231 Difference]: Finished difference. Result has 134 places, 136 transitions, 390 flow [2023-11-26 10:43:20,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=390, PETRI_PLACES=134, PETRI_TRANSITIONS=136} [2023-11-26 10:43:20,743 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, 10 predicate places. [2023-11-26 10:43:20,743 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 136 transitions, 390 flow [2023-11-26 10:43:20,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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) [2023-11-26 10:43:20,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:43:20,744 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] [2023-11-26 10:43:20,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 10:43:20,744 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-26 10:43:20,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:20,745 INFO L85 PathProgramCache]: Analyzing trace with hash -27204972, now seen corresponding path program 1 times [2023-11-26 10:43:20,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:20,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258063313] [2023-11-26 10:43:20,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:20,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:20,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:43:20,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:20,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258063313] [2023-11-26 10:43:20,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258063313] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:20,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:20,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:43:20,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304189106] [2023-11-26 10:43:20,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:20,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:43:20,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:20,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:43:20,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:43:20,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 128 [2023-11-26 10:43:20,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 136 transitions, 390 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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) [2023-11-26 10:43:20,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:43:20,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 128 [2023-11-26 10:43:20,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:43:20,917 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][109], [30#L1022-1true, Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 83#L1034-4true, Black: 136#(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: 137#(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)), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 150#true, Black: 133#true, 146#(= |#race~ready~0| 0), Black: 144#true, 85#L1022-2true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-26 10:43:20,918 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-11-26 10:43:20,918 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-26 10:43:20,918 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-26 10:43:20,918 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-26 10:43:20,934 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][135], [Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 83#L1034-4true, Black: 136#(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: 137#(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)), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 150#true, Black: 133#true, 146#(= |#race~ready~0| 0), Black: 144#true, 39#L1022-1true, 96#L1022-2true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-26 10:43:20,934 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-11-26 10:43:20,934 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-26 10:43:20,934 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-26 10:43:20,935 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-26 10:43:20,945 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][58], [30#L1022-1true, Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 136#(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: 137#(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)), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 150#true, Black: 133#true, 146#(= |#race~ready~0| 0), 38#L1035true, Black: 144#true, 85#L1022-2true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-26 10:43:20,945 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-11-26 10:43:20,946 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-26 10:43:20,946 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-26 10:43:20,946 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-11-26 10:43:20,958 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][93], [Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 136#(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: 137#(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)), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 150#true, Black: 133#true, 146#(= |#race~ready~0| 0), 38#L1035true, Black: 144#true, 39#L1022-1true, 96#L1022-2true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-26 10:43:20,958 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-11-26 10:43:20,958 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-26 10:43:20,958 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-26 10:43:20,958 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-11-26 10:43:21,083 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][58], [30#L1022-1true, Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 133#true, 71#ULTIMATE.startFINALtrue, Black: 136#(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: 137#(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)), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 150#true, 146#(= |#race~ready~0| 0), Black: 144#true, 85#L1022-2true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-26 10:43:21,083 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2023-11-26 10:43:21,083 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2023-11-26 10:43:21,084 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2023-11-26 10:43:21,084 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2023-11-26 10:43:21,087 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][93], [Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 133#true, 71#ULTIMATE.startFINALtrue, Black: 136#(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: 137#(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)), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 150#true, 146#(= |#race~ready~0| 0), Black: 144#true, 39#L1022-1true, 96#L1022-2true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-26 10:43:21,087 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2023-11-26 10:43:21,087 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2023-11-26 10:43:21,087 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2023-11-26 10:43:21,088 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2023-11-26 10:43:21,161 INFO L124 PetriNetUnfolderBase]: 298/1949 cut-off events. [2023-11-26 10:43:21,162 INFO L125 PetriNetUnfolderBase]: For 476/531 co-relation queries the response was YES. [2023-11-26 10:43:21,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3109 conditions, 1949 events. 298/1949 cut-off events. For 476/531 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 14651 event pairs, 48 based on Foata normal form. 8/1688 useless extension candidates. Maximal degree in co-relation 2296. Up to 348 conditions per place. [2023-11-26 10:43:21,182 INFO L140 encePairwiseOnDemand]: 122/128 looper letters, 14 selfloop transitions, 8 changer transitions 0/142 dead transitions. [2023-11-26 10:43:21,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 142 transitions, 458 flow [2023-11-26 10:43:21,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:43:21,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:43:21,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-11-26 10:43:21,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.90625 [2023-11-26 10:43:21,185 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-11-26 10:43:21,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-11-26 10:43:21,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:43:21,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-11-26 10:43:21,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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) [2023-11-26 10:43:21,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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) [2023-11-26 10:43:21,188 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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) [2023-11-26 10:43:21,189 INFO L175 Difference]: Start difference. First operand has 134 places, 136 transitions, 390 flow. Second operand 3 states and 348 transitions. [2023-11-26 10:43:21,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 142 transitions, 458 flow [2023-11-26 10:43:21,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 142 transitions, 444 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:43:21,196 INFO L231 Difference]: Finished difference. Result has 136 places, 142 transitions, 446 flow [2023-11-26 10:43:21,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=446, PETRI_PLACES=136, PETRI_TRANSITIONS=142} [2023-11-26 10:43:21,197 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, 12 predicate places. [2023-11-26 10:43:21,198 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 142 transitions, 446 flow [2023-11-26 10:43:21,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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) [2023-11-26 10:43:21,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:43:21,198 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] [2023-11-26 10:43:21,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 10:43:21,199 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-26 10:43:21,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:21,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1311194984, now seen corresponding path program 1 times [2023-11-26 10:43:21,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:21,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046464794] [2023-11-26 10:43:21,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:21,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:21,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:43:21,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:21,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046464794] [2023-11-26 10:43:21,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046464794] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:21,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:21,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:43:21,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841844502] [2023-11-26 10:43:21,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:21,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:43:21,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:21,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:43:21,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:43:21,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 128 [2023-11-26 10:43:21,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 142 transitions, 446 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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) [2023-11-26 10:43:21,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:43:21,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 128 [2023-11-26 10:43:21,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:43:21,418 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][111], [30#L1022-1true, Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 83#L1034-4true, Black: 136#(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: 137#(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)), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, 150#true, 156#true, Black: 144#true, 85#L1022-2true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-26 10:43:21,418 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-11-26 10:43:21,419 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-26 10:43:21,419 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-26 10:43:21,419 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-26 10:43:21,420 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][142], [Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 83#L1034-4true, Black: 136#(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: 137#(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)), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, 150#true, 156#true, Black: 144#true, 39#L1022-1true, 96#L1022-2true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-26 10:43:21,420 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-11-26 10:43:21,420 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-26 10:43:21,421 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-26 10:43:21,421 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-26 10:43:21,437 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][58], [30#L1022-1true, Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 136#(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: 137#(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)), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, 150#true, 38#L1035true, 156#true, Black: 144#true, 85#L1022-2true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-26 10:43:21,437 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-11-26 10:43:21,437 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-11-26 10:43:21,438 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-26 10:43:21,438 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-26 10:43:21,457 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][92], [Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 136#(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: 137#(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)), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, 150#true, 38#L1035true, 156#true, Black: 144#true, 39#L1022-1true, 96#L1022-2true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-26 10:43:21,458 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-11-26 10:43:21,458 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-26 10:43:21,458 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-11-26 10:43:21,458 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-26 10:43:21,937 INFO L124 PetriNetUnfolderBase]: 386/3533 cut-off events. [2023-11-26 10:43:21,937 INFO L125 PetriNetUnfolderBase]: For 995/1451 co-relation queries the response was YES. [2023-11-26 10:43:21,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5551 conditions, 3533 events. 386/3533 cut-off events. For 995/1451 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 33901 event pairs, 41 based on Foata normal form. 33/3235 useless extension candidates. Maximal degree in co-relation 4169. Up to 355 conditions per place. [2023-11-26 10:43:21,978 INFO L140 encePairwiseOnDemand]: 121/128 looper letters, 16 selfloop transitions, 7 changer transitions 0/152 dead transitions. [2023-11-26 10:43:21,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 152 transitions, 533 flow [2023-11-26 10:43:21,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:43:21,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:43:21,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-11-26 10:43:21,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9296875 [2023-11-26 10:43:21,981 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-11-26 10:43:21,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-11-26 10:43:21,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:43:21,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-11-26 10:43:21,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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) [2023-11-26 10:43:21,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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) [2023-11-26 10:43:21,985 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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) [2023-11-26 10:43:21,985 INFO L175 Difference]: Start difference. First operand has 136 places, 142 transitions, 446 flow. Second operand 3 states and 357 transitions. [2023-11-26 10:43:21,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 152 transitions, 533 flow [2023-11-26 10:43:21,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 152 transitions, 517 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:43:22,000 INFO L231 Difference]: Finished difference. Result has 138 places, 149 transitions, 500 flow [2023-11-26 10:43:22,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=138, PETRI_TRANSITIONS=149} [2023-11-26 10:43:22,002 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, 14 predicate places. [2023-11-26 10:43:22,002 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 149 transitions, 500 flow [2023-11-26 10:43:22,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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) [2023-11-26 10:43:22,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:43:22,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] [2023-11-26 10:43:22,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 10:43:22,003 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-26 10:43:22,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:22,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1669507446, now seen corresponding path program 1 times [2023-11-26 10:43:22,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:22,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809876133] [2023-11-26 10:43:22,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:22,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:22,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:43:22,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:22,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809876133] [2023-11-26 10:43:22,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809876133] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:22,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:22,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:43:22,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510958557] [2023-11-26 10:43:22,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:22,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:43:22,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:22,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:43:22,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:43:22,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 128 [2023-11-26 10:43:22,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 149 transitions, 500 flow. Second operand has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 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) [2023-11-26 10:43:22,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:43:22,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 128 [2023-11-26 10:43:22,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:43:22,393 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][101], [Black: 158#(= |#race~data~0| 0), 30#L1022-1true, Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 83#L1034-4true, 162#true, Black: 136#(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: 137#(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)), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, 156#true, Black: 144#true, 85#L1022-2true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-26 10:43:22,393 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-11-26 10:43:22,394 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-26 10:43:22,394 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-26 10:43:22,394 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-26 10:43:22,395 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][142], [Black: 158#(= |#race~data~0| 0), Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 83#L1034-4true, 162#true, Black: 136#(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: 137#(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)), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, 156#true, Black: 144#true, 39#L1022-1true, 96#L1022-2true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-26 10:43:22,395 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-11-26 10:43:22,395 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-26 10:43:22,395 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-26 10:43:22,396 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-26 10:43:22,409 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][58], [Black: 158#(= |#race~data~0| 0), 30#L1022-1true, Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 162#true, Black: 136#(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: 137#(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)), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, 38#L1035true, 156#true, Black: 144#true, 85#L1022-2true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-26 10:43:22,410 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-11-26 10:43:22,410 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-26 10:43:22,410 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-26 10:43:22,410 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-11-26 10:43:22,428 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][79], [Black: 158#(= |#race~data~0| 0), Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 162#true, Black: 136#(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: 137#(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)), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, 38#L1035true, 156#true, Black: 144#true, 39#L1022-1true, 96#L1022-2true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-26 10:43:22,429 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-11-26 10:43:22,429 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-11-26 10:43:22,429 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-26 10:43:22,429 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-26 10:43:22,851 INFO L124 PetriNetUnfolderBase]: 362/3524 cut-off events. [2023-11-26 10:43:22,851 INFO L125 PetriNetUnfolderBase]: For 772/940 co-relation queries the response was YES. [2023-11-26 10:43:22,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5699 conditions, 3524 events. 362/3524 cut-off events. For 772/940 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 34046 event pairs, 33 based on Foata normal form. 1/3270 useless extension candidates. Maximal degree in co-relation 4279. Up to 328 conditions per place. [2023-11-26 10:43:22,890 INFO L140 encePairwiseOnDemand]: 121/128 looper letters, 14 selfloop transitions, 2 changer transitions 4/150 dead transitions. [2023-11-26 10:43:22,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 150 transitions, 528 flow [2023-11-26 10:43:22,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:43:22,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 10:43:22,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 669 transitions. [2023-11-26 10:43:22,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.87109375 [2023-11-26 10:43:22,893 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 669 transitions. [2023-11-26 10:43:22,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 669 transitions. [2023-11-26 10:43:22,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:43:22,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 669 transitions. [2023-11-26 10:43:22,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 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) [2023-11-26 10:43:22,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 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) [2023-11-26 10:43:22,899 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 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) [2023-11-26 10:43:22,900 INFO L175 Difference]: Start difference. First operand has 138 places, 149 transitions, 500 flow. Second operand 6 states and 669 transitions. [2023-11-26 10:43:22,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 150 transitions, 528 flow [2023-11-26 10:43:22,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 150 transitions, 506 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-26 10:43:22,911 INFO L231 Difference]: Finished difference. Result has 145 places, 146 transitions, 476 flow [2023-11-26 10:43:22,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=476, PETRI_PLACES=145, PETRI_TRANSITIONS=146} [2023-11-26 10:43:22,912 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, 21 predicate places. [2023-11-26 10:43:22,913 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 146 transitions, 476 flow [2023-11-26 10:43:22,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 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) [2023-11-26 10:43:22,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:43:22,913 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] [2023-11-26 10:43:22,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 10:43:22,914 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-26 10:43:22,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:22,915 INFO L85 PathProgramCache]: Analyzing trace with hash -139954277, now seen corresponding path program 1 times [2023-11-26 10:43:22,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:22,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380355524] [2023-11-26 10:43:22,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:22,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:23,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 10:43:23,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:23,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380355524] [2023-11-26 10:43:23,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380355524] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:23,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:23,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:43:23,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583652739] [2023-11-26 10:43:23,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:23,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:43:23,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:23,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:43:23,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:43:23,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 128 [2023-11-26 10:43:23,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 146 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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) [2023-11-26 10:43:23,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:43:23,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 128 [2023-11-26 10:43:23,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:43:23,119 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][83], [30#L1022-1true, Black: 158#(= |#race~data~0| 0), Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 83#L1034-4true, 162#true, Black: 164#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 165#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 168#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 136#(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: 166#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 174#true, Black: 137#(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)), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, Black: 144#true, 85#L1022-2true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-26 10:43:23,119 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-11-26 10:43:23,120 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-26 10:43:23,120 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-26 10:43:23,120 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-26 10:43:23,123 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][121], [Black: 158#(= |#race~data~0| 0), Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 83#L1034-4true, 162#true, Black: 164#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 165#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 168#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 136#(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: 166#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 174#true, Black: 137#(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)), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, Black: 144#true, 39#L1022-1true, 96#L1022-2true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-26 10:43:23,123 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-11-26 10:43:23,123 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-26 10:43:23,123 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-26 10:43:23,124 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-26 10:43:23,135 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][41], [Black: 158#(= |#race~data~0| 0), 30#L1022-1true, Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 162#true, Black: 164#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 165#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 168#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 136#(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: 137#(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)), Black: 166#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 174#true, Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, 38#L1035true, Black: 144#true, 85#L1022-2true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-26 10:43:23,135 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-11-26 10:43:23,135 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-26 10:43:23,135 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-26 10:43:23,135 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-11-26 10:43:23,146 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][63], [Black: 158#(= |#race~data~0| 0), Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 162#true, Black: 164#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 165#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 168#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 136#(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: 137#(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)), Black: 166#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 174#true, Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, 38#L1035true, Black: 144#true, 39#L1022-1true, 96#L1022-2true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-26 10:43:23,147 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-11-26 10:43:23,147 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-26 10:43:23,147 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-26 10:43:23,147 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-11-26 10:43:23,355 INFO L124 PetriNetUnfolderBase]: 217/1965 cut-off events. [2023-11-26 10:43:23,355 INFO L125 PetriNetUnfolderBase]: For 373/545 co-relation queries the response was YES. [2023-11-26 10:43:23,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2980 conditions, 1965 events. 217/1965 cut-off events. For 373/545 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 15916 event pairs, 34 based on Foata normal form. 9/1857 useless extension candidates. Maximal degree in co-relation 2912. Up to 214 conditions per place. [2023-11-26 10:43:23,382 INFO L140 encePairwiseOnDemand]: 124/128 looper letters, 6 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2023-11-26 10:43:23,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 134 transitions, 434 flow [2023-11-26 10:43:23,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:43:23,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:43:23,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2023-11-26 10:43:23,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9244791666666666 [2023-11-26 10:43:23,385 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2023-11-26 10:43:23,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2023-11-26 10:43:23,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:43:23,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2023-11-26 10:43:23,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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) [2023-11-26 10:43:23,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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) [2023-11-26 10:43:23,391 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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) [2023-11-26 10:43:23,391 INFO L175 Difference]: Start difference. First operand has 145 places, 146 transitions, 476 flow. Second operand 3 states and 355 transitions. [2023-11-26 10:43:23,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 134 transitions, 434 flow [2023-11-26 10:43:23,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 134 transitions, 412 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-26 10:43:23,400 INFO L231 Difference]: Finished difference. Result has 137 places, 134 transitions, 406 flow [2023-11-26 10:43:23,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=406, PETRI_PLACES=137, PETRI_TRANSITIONS=134} [2023-11-26 10:43:23,401 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, 13 predicate places. [2023-11-26 10:43:23,401 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 134 transitions, 406 flow [2023-11-26 10:43:23,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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) [2023-11-26 10:43:23,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:43:23,402 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] [2023-11-26 10:43:23,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 10:43:23,403 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-26 10:43:23,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:23,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1678731226, now seen corresponding path program 1 times [2023-11-26 10:43:23,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:23,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258178427] [2023-11-26 10:43:23,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:23,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:43:23,433 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:43:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:43:23,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:43:23,466 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 10:43:23,466 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (12 of 13 remaining) [2023-11-26 10:43:23,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2023-11-26 10:43:23,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2023-11-26 10:43:23,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2023-11-26 10:43:23,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2023-11-26 10:43:23,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2023-11-26 10:43:23,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2023-11-26 10:43:23,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 13 remaining) [2023-11-26 10:43:23,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2023-11-26 10:43:23,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2023-11-26 10:43:23,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2023-11-26 10:43:23,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2023-11-26 10:43:23,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2023-11-26 10:43:23,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 10:43:23,469 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:23,474 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-11-26 10:43:23,475 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 10:43:23,531 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated [2023-11-26 10:43:23,533 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc4 [2023-11-26 10:43:23,534 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem7 [2023-11-26 10:43:23,535 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated [2023-11-26 10:43:23,535 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated [2023-11-26 10:43:23,535 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem7 [2023-11-26 10:43:23,536 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem7 [2023-11-26 10:43:23,536 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated [2023-11-26 10:43:23,538 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-26 10:43:23,538 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated [2023-11-26 10:43:23,538 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated [2023-11-26 10:43:23,539 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated [2023-11-26 10:43:23,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 10:43:23 BasicIcfg [2023-11-26 10:43:23,553 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 10:43:23,553 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 10:43:23,554 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 10:43:23,554 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 10:43:23,554 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:43:16" (3/4) ... [2023-11-26 10:43:23,556 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 10:43:23,558 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 10:43:23,559 INFO L158 Benchmark]: Toolchain (without parser) took 8867.98ms. Allocated memory was 142.6MB in the beginning and 274.7MB in the end (delta: 132.1MB). Free memory was 93.7MB in the beginning and 115.1MB in the end (delta: -21.4MB). Peak memory consumption was 112.8MB. Max. memory is 16.1GB. [2023-11-26 10:43:23,559 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 142.6MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:43:23,559 INFO L158 Benchmark]: CACSL2BoogieTranslator took 805.29ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 65.4MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-26 10:43:23,560 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.48ms. Allocated memory is still 142.6MB. Free memory was 65.4MB in the beginning and 63.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 10:43:23,560 INFO L158 Benchmark]: Boogie Preprocessor took 65.64ms. Allocated memory is still 142.6MB. Free memory was 63.0MB in the beginning and 60.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 10:43:23,561 INFO L158 Benchmark]: RCFGBuilder took 630.70ms. Allocated memory was 142.6MB in the beginning and 228.6MB in the end (delta: 86.0MB). Free memory was 60.9MB in the beginning and 189.7MB in the end (delta: -128.8MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2023-11-26 10:43:23,561 INFO L158 Benchmark]: TraceAbstraction took 7262.78ms. Allocated memory was 228.6MB in the beginning and 274.7MB in the end (delta: 46.1MB). Free memory was 188.7MB in the beginning and 115.1MB in the end (delta: 73.6MB). Peak memory consumption was 118.7MB. Max. memory is 16.1GB. [2023-11-26 10:43:23,562 INFO L158 Benchmark]: Witness Printer took 4.56ms. Allocated memory is still 274.7MB. Free memory is still 115.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:43:23,565 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 142.6MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 805.29ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 65.4MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.48ms. Allocated memory is still 142.6MB. Free memory was 65.4MB in the beginning and 63.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.64ms. Allocated memory is still 142.6MB. Free memory was 63.0MB in the beginning and 60.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 630.70ms. Allocated memory was 142.6MB in the beginning and 228.6MB in the end (delta: 86.0MB). Free memory was 60.9MB in the beginning and 189.7MB in the end (delta: -128.8MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7262.78ms. Allocated memory was 228.6MB in the beginning and 274.7MB in the end (delta: 46.1MB). Free memory was 188.7MB in the beginning and 115.1MB in the end (delta: 73.6MB). Peak memory consumption was 118.7MB. Max. memory is 16.1GB. * Witness Printer took 4.56ms. Allocated memory is still 274.7MB. Free memory is still 115.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1022]: Data race detected [2023-11-26 10:43:23,584 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated [2023-11-26 10:43:23,585 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc4 [2023-11-26 10:43:23,585 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem7 [2023-11-26 10:43:23,586 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated [2023-11-26 10:43:23,586 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated [2023-11-26 10:43:23,586 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem7 [2023-11-26 10:43:23,586 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated [2023-11-26 10:43:23,587 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem7 [2023-11-26 10:43:23,587 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-26 10:43:23,588 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated [2023-11-26 10:43:23,588 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated [2023-11-26 10:43:23,588 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated [2023-11-26 10:43:23,600 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated [2023-11-26 10:43:23,600 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc4 [2023-11-26 10:43:23,601 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem7 [2023-11-26 10:43:23,601 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated [2023-11-26 10:43:23,601 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem7 [2023-11-26 10:43:23,601 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated [2023-11-26 10:43:23,602 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated [2023-11-26 10:43:23,602 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem7 [2023-11-26 10:43:23,603 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-26 10:43:23,603 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated [2023-11-26 10:43:23,603 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated [2023-11-26 10:43:23,604 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated Data race detected The following path leads to a data race: [L1019] 0 _Bool ready = 0; VAL [ready=0] [L1020] 0 int data = 0; VAL [data=0, ready=0] [L1027] 0 int threads_total = __VERIFIER_nondet_int(); VAL [data=0, ready=0, threads_total=1] [L1028] CALL 0 assume_abort_if_not(threads_total >= 0) [L1016] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, data=0, ready=0] [L1028] RET 0 assume_abort_if_not(threads_total >= 0) [L1029] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [data=0, ready=0, threads_total=1, tids={5:0}] [L1029] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [data=0, ready=0, threads_total=1, tids={5:0}] [L1030] 0 int i = 0; VAL [data=0, i=0, ready=0, threads_total=1, tids={5:0}] [L1030] COND TRUE 0 i < threads_total VAL [data=0, i=0, ready=0, threads_total=1, tids={5:0}] [L1031] EXPR 0 \read(*tids) VAL [data=0, i=0, ready=0, threads_total=1, tids={5:0}] [L1031] EXPR 0 tids[i] VAL [data=0, i=0, ready=0, threads_total=1, tids={5:0}] [L1031] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [arg={0:0}, data=0, i=0, ready=0, threads_total=1, tids={5:0}] [L1022] 1 !ready VAL [arg={0:0}, arg={0:0}, data=0, ready=0] [L1030] 0 i++ VAL [arg={0:0}, arg={0:0}, data=0, i=1, ready=0, threads_total=1, tids={5:0}] [L1030] COND FALSE 0 !(i < threads_total) VAL [arg={0:0}, arg={0:0}, data=0, i=1, ready=0, threads_total=1, tids={5:0}] [L1033] 0 data = __VERIFIER_nondet_int() VAL [arg={0:0}, arg={0:0}, data=0, ready=0, threads_total=1, tids={5:0}] [L1034] 0 ready = 1 VAL [arg={0:0}, arg={0:0}, data=0, ready=1, threads_total=1, tids={5:0}] [L1022] 1 !ready VAL [arg={0:0}, arg={0:0}, data=0, ready=1] Now there is a data race on ~ready~0 between C: ready = 1 [1034] and C: !ready [1022] - UnprovableResult [Line: 1033]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 120 locations, 11 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.9s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 125 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 188 IncrementalHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 6 mSDtfsCounter, 188 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=385occurred in iteration=5, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 251 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 132 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.2s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 248 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 134 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 297 IncrementalHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 23 mSDtfsCounter, 297 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=500occurred in iteration=5, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 322 NumberOfCodeBlocks, 322 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 261 ConstructedInterpolants, 0 QuantifiedInterpolants, 480 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-26 10:43:23,626 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49dcb57-9d2b-4b05-9f82-206e0c7948be/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE