./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_561a171a-90bf-4742-a5e4-06d846f751dd/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_561a171a-90bf-4742-a5e4-06d846f751dd/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_561a171a-90bf-4742-a5e4-06d846f751dd/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_561a171a-90bf-4742-a5e4-06d846f751dd/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_561a171a-90bf-4742-a5e4-06d846f751dd/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_561a171a-90bf-4742-a5e4-06d846f751dd/bin/uautomizer-verify-BQ2R08f2Ya --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 dc1a8bd7c922f93873ec39bdce92396c491017d4a5984ae9a59a0e03f4bb08ec --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:07:11,079 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:07:11,149 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_561a171a-90bf-4742-a5e4-06d846f751dd/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-29 00:07:11,154 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:07:11,155 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:07:11,181 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:07:11,182 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:07:11,182 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:07:11,183 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:07:11,183 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:07:11,184 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:07:11,185 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:07:11,186 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:07:11,186 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:07:11,187 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:07:11,187 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:07:11,188 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:07:11,189 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:07:11,189 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:07:11,190 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:07:11,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:07:11,191 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:07:11,192 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-29 00:07:11,192 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:07:11,193 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:07:11,193 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:07:11,194 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:07:11,194 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:07:11,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:07:11,195 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:07:11,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:07:11,196 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:07:11,196 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:07:11,197 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:07:11,197 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:07:11,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:07:11,197 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:07:11,197 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:07:11,198 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:07:11,198 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:07:11,198 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:07:11,198 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_561a171a-90bf-4742-a5e4-06d846f751dd/bin/uautomizer-verify-BQ2R08f2Ya/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_561a171a-90bf-4742-a5e4-06d846f751dd/bin/uautomizer-verify-BQ2R08f2Ya 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 -> dc1a8bd7c922f93873ec39bdce92396c491017d4a5984ae9a59a0e03f4bb08ec [2023-11-29 00:07:11,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:07:11,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:07:11,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:07:11,458 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:07:11,458 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:07:11,459 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_561a171a-90bf-4742-a5e4-06d846f751dd/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-2.i [2023-11-29 00:07:14,378 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:07:14,626 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:07:14,627 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_561a171a-90bf-4742-a5e4-06d846f751dd/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-2.i [2023-11-29 00:07:14,641 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_561a171a-90bf-4742-a5e4-06d846f751dd/bin/uautomizer-verify-BQ2R08f2Ya/data/ec1ad071f/0a5d6aa37b11404d90248f7102a9e9de/FLAG0a80cf992 [2023-11-29 00:07:14,653 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_561a171a-90bf-4742-a5e4-06d846f751dd/bin/uautomizer-verify-BQ2R08f2Ya/data/ec1ad071f/0a5d6aa37b11404d90248f7102a9e9de [2023-11-29 00:07:14,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:07:14,656 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:07:14,658 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:07:14,658 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:07:14,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:07:14,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:07:14" (1/1) ... [2023-11-29 00:07:14,666 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17fc8f7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:07:14, skipping insertion in model container [2023-11-29 00:07:14,666 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:07:14" (1/1) ... [2023-11-29 00:07:14,721 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:07:15,076 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:07:15,092 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:07:15,143 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:07:15,191 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:07:15,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:07:15 WrapperNode [2023-11-29 00:07:15,192 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:07:15,193 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:07:15,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:07:15,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:07:15,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:07:15" (1/1) ... [2023-11-29 00:07:15,220 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:07:15" (1/1) ... [2023-11-29 00:07:15,249 INFO L138 Inliner]: procedures = 172, calls = 28, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 117 [2023-11-29 00:07:15,250 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:07:15,251 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:07:15,251 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:07:15,251 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:07:15,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:07:15" (1/1) ... [2023-11-29 00:07:15,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:07:15" (1/1) ... [2023-11-29 00:07:15,266 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:07:15" (1/1) ... [2023-11-29 00:07:15,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:07:15" (1/1) ... [2023-11-29 00:07:15,273 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:07:15" (1/1) ... [2023-11-29 00:07:15,277 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:07:15" (1/1) ... [2023-11-29 00:07:15,279 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:07:15" (1/1) ... [2023-11-29 00:07:15,281 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:07:15" (1/1) ... [2023-11-29 00:07:15,285 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:07:15,286 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:07:15,287 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:07:15,287 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:07:15,288 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:07:15" (1/1) ... [2023-11-29 00:07:15,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:07:15,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_561a171a-90bf-4742-a5e4-06d846f751dd/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:07:15,324 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_561a171a-90bf-4742-a5e4-06d846f751dd/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:07:15,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_561a171a-90bf-4742-a5e4-06d846f751dd/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:07:15,372 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2023-11-29 00:07:15,372 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2023-11-29 00:07:15,373 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-29 00:07:15,373 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-29 00:07:15,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 00:07:15,374 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-29 00:07:15,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:07:15,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:07:15,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:07:15,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 00:07:15,375 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-29 00:07:15,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:07:15,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:07:15,377 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 00:07:15,516 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:07:15,519 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:07:15,749 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:07:15,773 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:07:15,773 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 00:07:15,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:07:15 BoogieIcfgContainer [2023-11-29 00:07:15,775 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:07:15,779 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:07:15,779 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:07:15,783 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:07:15,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:07:14" (1/3) ... [2023-11-29 00:07:15,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59fc96bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:07:15, skipping insertion in model container [2023-11-29 00:07:15,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:07:15" (2/3) ... [2023-11-29 00:07:15,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59fc96bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:07:15, skipping insertion in model container [2023-11-29 00:07:15,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:07:15" (3/3) ... [2023-11-29 00:07:15,787 INFO L112 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-variant-2.i [2023-11-29 00:07:15,798 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 00:07:15,811 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:07:15,811 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-11-29 00:07:15,811 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 00:07:15,888 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 00:07:15,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 143 transitions, 294 flow [2023-11-29 00:07:16,018 INFO L124 PetriNetUnfolderBase]: 8/161 cut-off events. [2023-11-29 00:07:16,018 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:07:16,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 161 events. 8/161 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 232 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 105. Up to 4 conditions per place. [2023-11-29 00:07:16,026 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 143 transitions, 294 flow [2023-11-29 00:07:16,034 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 142 transitions, 291 flow [2023-11-29 00:07:16,047 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:07:16,055 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;@70411744, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:07:16,055 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2023-11-29 00:07:16,082 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:07:16,082 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2023-11-29 00:07:16,082 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:07:16,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:07:16,083 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] [2023-11-29 00:07:16,084 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2023-11-29 00:07:16,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:07:16,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1743213872, now seen corresponding path program 1 times [2023-11-29 00:07:16,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:07:16,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625700017] [2023-11-29 00:07:16,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:07:16,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:07:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:07:16,380 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-29 00:07:16,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:07:16,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625700017] [2023-11-29 00:07:16,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625700017] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:07:16,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:07:16,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:07:16,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731666390] [2023-11-29 00:07:16,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:07:16,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:07:16,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:07:16,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:07:16,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:07:16,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 143 [2023-11-29 00:07:16,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 142 transitions, 291 flow. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 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-29 00:07:16,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:07:16,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 143 [2023-11-29 00:07:16,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:07:16,597 INFO L124 PetriNetUnfolderBase]: 23/322 cut-off events. [2023-11-29 00:07:16,597 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 00:07:16,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 322 events. 23/322 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1244 event pairs, 19 based on Foata normal form. 38/305 useless extension candidates. Maximal degree in co-relation 312. Up to 47 conditions per place. [2023-11-29 00:07:16,604 INFO L140 encePairwiseOnDemand]: 135/143 looper letters, 11 selfloop transitions, 2 changer transitions 1/133 dead transitions. [2023-11-29 00:07:16,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 133 transitions, 299 flow [2023-11-29 00:07:16,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:07:16,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:07:16,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-11-29 00:07:16,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9044289044289044 [2023-11-29 00:07:16,623 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-11-29 00:07:16,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-11-29 00:07:16,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:07:16,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-11-29 00:07:16,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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-29 00:07:16,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 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-29 00:07:16,641 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 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-29 00:07:16,643 INFO L175 Difference]: Start difference. First operand has 141 places, 142 transitions, 291 flow. Second operand 3 states and 388 transitions. [2023-11-29 00:07:16,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 133 transitions, 299 flow [2023-11-29 00:07:16,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 133 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:07:16,655 INFO L231 Difference]: Finished difference. Result has 138 places, 132 transitions, 274 flow [2023-11-29 00:07:16,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=138, PETRI_TRANSITIONS=132} [2023-11-29 00:07:16,662 INFO L281 CegarLoopForPetriNet]: 141 programPoint places, -3 predicate places. [2023-11-29 00:07:16,662 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 132 transitions, 274 flow [2023-11-29 00:07:16,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 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-29 00:07:16,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:07:16,663 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] [2023-11-29 00:07:16,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:07:16,664 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2023-11-29 00:07:16,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:07:16,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1180355068, now seen corresponding path program 1 times [2023-11-29 00:07:16,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:07:16,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764872773] [2023-11-29 00:07:16,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:07:16,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:07:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:07:16,761 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-29 00:07:16,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:07:16,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764872773] [2023-11-29 00:07:16,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764872773] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:07:16,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:07:16,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:07:16,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797558733] [2023-11-29 00:07:16,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:07:16,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:07:16,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:07:16,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:07:16,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:07:16,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 143 [2023-11-29 00:07:16,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 132 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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-29 00:07:16,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:07:16,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 143 [2023-11-29 00:07:16,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:07:16,888 INFO L124 PetriNetUnfolderBase]: 29/364 cut-off events. [2023-11-29 00:07:16,888 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 00:07:16,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 364 events. 29/364 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1472 event pairs, 26 based on Foata normal form. 0/326 useless extension candidates. Maximal degree in co-relation 406. Up to 62 conditions per place. [2023-11-29 00:07:16,892 INFO L140 encePairwiseOnDemand]: 140/143 looper letters, 13 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2023-11-29 00:07:16,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 131 transitions, 302 flow [2023-11-29 00:07:16,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:07:16,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:07:16,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2023-11-29 00:07:16,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8834498834498834 [2023-11-29 00:07:16,896 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2023-11-29 00:07:16,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2023-11-29 00:07:16,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:07:16,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2023-11-29 00:07:16,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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-29 00:07:16,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 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-29 00:07:16,901 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 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-29 00:07:16,902 INFO L175 Difference]: Start difference. First operand has 138 places, 132 transitions, 274 flow. Second operand 3 states and 379 transitions. [2023-11-29 00:07:16,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 131 transitions, 302 flow [2023-11-29 00:07:16,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 131 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:07:16,907 INFO L231 Difference]: Finished difference. Result has 136 places, 131 transitions, 272 flow [2023-11-29 00:07:16,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=136, PETRI_TRANSITIONS=131} [2023-11-29 00:07:16,908 INFO L281 CegarLoopForPetriNet]: 141 programPoint places, -5 predicate places. [2023-11-29 00:07:16,909 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 131 transitions, 272 flow [2023-11-29 00:07:16,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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-29 00:07:16,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:07:16,910 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-29 00:07:16,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:07:16,910 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2023-11-29 00:07:16,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:07:16,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1474546595, now seen corresponding path program 1 times [2023-11-29 00:07:16,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:07:16,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109073091] [2023-11-29 00:07:16,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:07:16,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:07:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:07:16,981 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-29 00:07:16,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:07:16,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109073091] [2023-11-29 00:07:16,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109073091] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:07:16,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:07:16,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:07:16,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181790840] [2023-11-29 00:07:16,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:07:16,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:07:16,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:07:16,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:07:16,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:07:17,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 143 [2023-11-29 00:07:17,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 131 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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-29 00:07:17,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:07:17,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 143 [2023-11-29 00:07:17,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:07:17,125 INFO L124 PetriNetUnfolderBase]: 68/535 cut-off events. [2023-11-29 00:07:17,125 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 00:07:17,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 666 conditions, 535 events. 68/535 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2793 event pairs, 58 based on Foata normal form. 0/489 useless extension candidates. Maximal degree in co-relation 626. Up to 116 conditions per place. [2023-11-29 00:07:17,130 INFO L140 encePairwiseOnDemand]: 137/143 looper letters, 14 selfloop transitions, 1 changer transitions 0/126 dead transitions. [2023-11-29 00:07:17,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 126 transitions, 292 flow [2023-11-29 00:07:17,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:07:17,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:07:17,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2023-11-29 00:07:17,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8648018648018648 [2023-11-29 00:07:17,133 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 371 transitions. [2023-11-29 00:07:17,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 371 transitions. [2023-11-29 00:07:17,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:07:17,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 371 transitions. [2023-11-29 00:07:17,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 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-29 00:07:17,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 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-29 00:07:17,137 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 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-29 00:07:17,138 INFO L175 Difference]: Start difference. First operand has 136 places, 131 transitions, 272 flow. Second operand 3 states and 371 transitions. [2023-11-29 00:07:17,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 126 transitions, 292 flow [2023-11-29 00:07:17,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 126 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:07:17,142 INFO L231 Difference]: Finished difference. Result has 131 places, 126 transitions, 260 flow [2023-11-29 00:07:17,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=131, PETRI_TRANSITIONS=126} [2023-11-29 00:07:17,143 INFO L281 CegarLoopForPetriNet]: 141 programPoint places, -10 predicate places. [2023-11-29 00:07:17,144 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 126 transitions, 260 flow [2023-11-29 00:07:17,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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-29 00:07:17,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:07:17,145 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-29 00:07:17,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:07:17,145 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2023-11-29 00:07:17,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:07:17,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1398581886, now seen corresponding path program 1 times [2023-11-29 00:07:17,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:07:17,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487895613] [2023-11-29 00:07:17,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:07:17,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:07:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:07:17,223 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-29 00:07:17,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:07:17,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487895613] [2023-11-29 00:07:17,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487895613] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:07:17,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:07:17,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:07:17,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236291833] [2023-11-29 00:07:17,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:07:17,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:07:17,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:07:17,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:07:17,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:07:17,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 143 [2023-11-29 00:07:17,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 126 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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-29 00:07:17,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:07:17,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 143 [2023-11-29 00:07:17,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:07:17,303 INFO L124 PetriNetUnfolderBase]: 17/242 cut-off events. [2023-11-29 00:07:17,304 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 00:07:17,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 242 events. 17/242 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 627 event pairs, 4 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 260. Up to 32 conditions per place. [2023-11-29 00:07:17,306 INFO L140 encePairwiseOnDemand]: 137/143 looper letters, 13 selfloop transitions, 4 changer transitions 0/131 dead transitions. [2023-11-29 00:07:17,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 131 transitions, 307 flow [2023-11-29 00:07:17,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:07:17,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:07:17,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-11-29 00:07:17,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9184149184149184 [2023-11-29 00:07:17,309 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-11-29 00:07:17,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-11-29 00:07:17,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:07:17,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-11-29 00:07:17,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 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-29 00:07:17,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 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-29 00:07:17,314 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 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-29 00:07:17,314 INFO L175 Difference]: Start difference. First operand has 131 places, 126 transitions, 260 flow. Second operand 3 states and 394 transitions. [2023-11-29 00:07:17,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 131 transitions, 307 flow [2023-11-29 00:07:17,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 131 transitions, 306 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:07:17,318 INFO L231 Difference]: Finished difference. Result has 133 places, 128 transitions, 287 flow [2023-11-29 00:07:17,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=287, PETRI_PLACES=133, PETRI_TRANSITIONS=128} [2023-11-29 00:07:17,320 INFO L281 CegarLoopForPetriNet]: 141 programPoint places, -8 predicate places. [2023-11-29 00:07:17,320 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 128 transitions, 287 flow [2023-11-29 00:07:17,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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-29 00:07:17,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:07:17,321 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:07:17,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:07:17,322 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2023-11-29 00:07:17,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:07:17,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1186562035, now seen corresponding path program 1 times [2023-11-29 00:07:17,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:07:17,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333970011] [2023-11-29 00:07:17,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:07:17,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:07:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:07:17,486 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 00:07:17,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:07:17,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333970011] [2023-11-29 00:07:17,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333970011] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:07:17,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:07:17,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:07:17,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696762307] [2023-11-29 00:07:17,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:07:17,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:07:17,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:07:17,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:07:17,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:07:17,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 143 [2023-11-29 00:07:17,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 128 transitions, 287 flow. Second operand has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 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-29 00:07:17,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:07:17,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 143 [2023-11-29 00:07:17,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:07:17,623 INFO L124 PetriNetUnfolderBase]: 12/288 cut-off events. [2023-11-29 00:07:17,624 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-11-29 00:07:17,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 288 events. 12/288 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 921 event pairs, 8 based on Foata normal form. 1/265 useless extension candidates. Maximal degree in co-relation 333. Up to 34 conditions per place. [2023-11-29 00:07:17,626 INFO L140 encePairwiseOnDemand]: 139/143 looper letters, 16 selfloop transitions, 0 changer transitions 4/131 dead transitions. [2023-11-29 00:07:17,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 131 transitions, 333 flow [2023-11-29 00:07:17,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:07:17,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:07:17,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 616 transitions. [2023-11-29 00:07:17,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8615384615384616 [2023-11-29 00:07:17,631 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 616 transitions. [2023-11-29 00:07:17,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 616 transitions. [2023-11-29 00:07:17,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:07:17,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 616 transitions. [2023-11-29 00:07:17,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 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-29 00:07:17,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 143.0) internal successors, (858), 6 states have internal predecessors, (858), 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-29 00:07:17,639 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 143.0) internal successors, (858), 6 states have internal predecessors, (858), 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-29 00:07:17,639 INFO L175 Difference]: Start difference. First operand has 133 places, 128 transitions, 287 flow. Second operand 5 states and 616 transitions. [2023-11-29 00:07:17,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 131 transitions, 333 flow [2023-11-29 00:07:17,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 131 transitions, 325 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:07:17,644 INFO L231 Difference]: Finished difference. Result has 138 places, 127 transitions, 283 flow [2023-11-29 00:07:17,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=283, PETRI_PLACES=138, PETRI_TRANSITIONS=127} [2023-11-29 00:07:17,646 INFO L281 CegarLoopForPetriNet]: 141 programPoint places, -3 predicate places. [2023-11-29 00:07:17,646 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 127 transitions, 283 flow [2023-11-29 00:07:17,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 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-29 00:07:17,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:07:17,647 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:07:17,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:07:17,648 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2023-11-29 00:07:17,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:07:17,648 INFO L85 PathProgramCache]: Analyzing trace with hash -736873221, now seen corresponding path program 1 times [2023-11-29 00:07:17,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:07:17,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869403619] [2023-11-29 00:07:17,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:07:17,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:07:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:07:17,686 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:07:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:07:17,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:07:17,746 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:07:17,747 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2023-11-29 00:07:17,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2023-11-29 00:07:17,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2023-11-29 00:07:17,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2023-11-29 00:07:17,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 17 remaining) [2023-11-29 00:07:17,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2023-11-29 00:07:17,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 17 remaining) [2023-11-29 00:07:17,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2023-11-29 00:07:17,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2023-11-29 00:07:17,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2023-11-29 00:07:17,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2023-11-29 00:07:17,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 17 remaining) [2023-11-29 00:07:17,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2023-11-29 00:07:17,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2023-11-29 00:07:17,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2023-11-29 00:07:17,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 17 remaining) [2023-11-29 00:07:17,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 17 remaining) [2023-11-29 00:07:17,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:07:17,753 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-29 00:07:17,756 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 00:07:17,756 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-29 00:07:17,802 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 00:07:17,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 200 transitions, 420 flow [2023-11-29 00:07:17,844 INFO L124 PetriNetUnfolderBase]: 11/219 cut-off events. [2023-11-29 00:07:17,845 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 00:07:17,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 219 events. 11/219 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 425 event pairs, 0 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 226. Up to 6 conditions per place. [2023-11-29 00:07:17,847 INFO L82 GeneralOperation]: Start removeDead. Operand has 199 places, 200 transitions, 420 flow [2023-11-29 00:07:17,850 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 176 transitions, 365 flow [2023-11-29 00:07:17,852 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:07:17,853 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;@70411744, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:07:17,853 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-11-29 00:07:17,857 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:07:17,858 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2023-11-29 00:07:17,858 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:07:17,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:07:17,858 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] [2023-11-29 00:07:17,858 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-29 00:07:17,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:07:17,859 INFO L85 PathProgramCache]: Analyzing trace with hash -104759400, now seen corresponding path program 1 times [2023-11-29 00:07:17,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:07:17,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739109258] [2023-11-29 00:07:17,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:07:17,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:07:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:07:17,893 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-29 00:07:17,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:07:17,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739109258] [2023-11-29 00:07:17,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739109258] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:07:17,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:07:17,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:07:17,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226658563] [2023-11-29 00:07:17,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:07:17,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:07:17,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:07:17,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:07:17,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:07:17,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 200 [2023-11-29 00:07:17,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 176 transitions, 365 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:07:17,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:07:17,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 200 [2023-11-29 00:07:17,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:07:18,208 INFO L124 PetriNetUnfolderBase]: 216/1084 cut-off events. [2023-11-29 00:07:18,209 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-11-29 00:07:18,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1443 conditions, 1084 events. 216/1084 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 7428 event pairs, 189 based on Foata normal form. 226/1131 useless extension candidates. Maximal degree in co-relation 1374. Up to 317 conditions per place. [2023-11-29 00:07:18,225 INFO L140 encePairwiseOnDemand]: 191/200 looper letters, 16 selfloop transitions, 2 changer transitions 1/166 dead transitions. [2023-11-29 00:07:18,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 166 transitions, 381 flow [2023-11-29 00:07:18,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:07:18,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:07:18,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 532 transitions. [2023-11-29 00:07:18,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8866666666666667 [2023-11-29 00:07:18,229 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 532 transitions. [2023-11-29 00:07:18,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 532 transitions. [2023-11-29 00:07:18,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:07:18,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 532 transitions. [2023-11-29 00:07:18,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 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-29 00:07:18,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-29 00:07:18,236 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-29 00:07:18,236 INFO L175 Difference]: Start difference. First operand has 175 places, 176 transitions, 365 flow. Second operand 3 states and 532 transitions. [2023-11-29 00:07:18,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 166 transitions, 381 flow [2023-11-29 00:07:18,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 166 transitions, 380 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:07:18,241 INFO L231 Difference]: Finished difference. Result has 172 places, 165 transitions, 346 flow [2023-11-29 00:07:18,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=172, PETRI_TRANSITIONS=165} [2023-11-29 00:07:18,243 INFO L281 CegarLoopForPetriNet]: 175 programPoint places, -3 predicate places. [2023-11-29 00:07:18,243 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 165 transitions, 346 flow [2023-11-29 00:07:18,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:07:18,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:07:18,244 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] [2023-11-29 00:07:18,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:07:18,244 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-29 00:07:18,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:07:18,245 INFO L85 PathProgramCache]: Analyzing trace with hash 664564676, now seen corresponding path program 1 times [2023-11-29 00:07:18,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:07:18,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989628160] [2023-11-29 00:07:18,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:07:18,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:07:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:07:18,287 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-29 00:07:18,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:07:18,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989628160] [2023-11-29 00:07:18,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989628160] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:07:18,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:07:18,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:07:18,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350169590] [2023-11-29 00:07:18,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:07:18,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:07:18,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:07:18,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:07:18,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:07:18,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 200 [2023-11-29 00:07:18,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 165 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 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-29 00:07:18,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:07:18,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 200 [2023-11-29 00:07:18,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:07:18,661 INFO L124 PetriNetUnfolderBase]: 200/1658 cut-off events. [2023-11-29 00:07:18,662 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-11-29 00:07:18,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2022 conditions, 1658 events. 200/1658 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 12906 event pairs, 194 based on Foata normal form. 0/1410 useless extension candidates. Maximal degree in co-relation 1988. Up to 326 conditions per place. [2023-11-29 00:07:18,684 INFO L140 encePairwiseOnDemand]: 197/200 looper letters, 17 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2023-11-29 00:07:18,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 164 transitions, 382 flow [2023-11-29 00:07:18,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:07:18,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:07:18,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2023-11-29 00:07:18,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8733333333333333 [2023-11-29 00:07:18,687 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2023-11-29 00:07:18,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2023-11-29 00:07:18,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:07:18,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2023-11-29 00:07:18,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 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-29 00:07:18,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-29 00:07:18,693 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-29 00:07:18,693 INFO L175 Difference]: Start difference. First operand has 172 places, 165 transitions, 346 flow. Second operand 3 states and 524 transitions. [2023-11-29 00:07:18,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 164 transitions, 382 flow [2023-11-29 00:07:18,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 164 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:07:18,715 INFO L231 Difference]: Finished difference. Result has 170 places, 164 transitions, 344 flow [2023-11-29 00:07:18,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=170, PETRI_TRANSITIONS=164} [2023-11-29 00:07:18,717 INFO L281 CegarLoopForPetriNet]: 175 programPoint places, -5 predicate places. [2023-11-29 00:07:18,717 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 164 transitions, 344 flow [2023-11-29 00:07:18,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 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-29 00:07:18,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:07:18,718 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-29 00:07:18,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:07:18,718 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-29 00:07:18,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:07:18,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1505864741, now seen corresponding path program 1 times [2023-11-29 00:07:18,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:07:18,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32370206] [2023-11-29 00:07:18,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:07:18,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:07:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:07:18,751 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-29 00:07:18,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:07:18,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32370206] [2023-11-29 00:07:18,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32370206] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:07:18,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:07:18,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:07:18,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842750009] [2023-11-29 00:07:18,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:07:18,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:07:18,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:07:18,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:07:18,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:07:18,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 200 [2023-11-29 00:07:18,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 164 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 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-29 00:07:18,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:07:18,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 200 [2023-11-29 00:07:18,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:07:19,154 INFO L124 PetriNetUnfolderBase]: 590/2629 cut-off events. [2023-11-29 00:07:19,154 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2023-11-29 00:07:19,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3481 conditions, 2629 events. 590/2629 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 22634 event pairs, 508 based on Foata normal form. 0/2308 useless extension candidates. Maximal degree in co-relation 3440. Up to 791 conditions per place. [2023-11-29 00:07:19,173 INFO L140 encePairwiseOnDemand]: 193/200 looper letters, 19 selfloop transitions, 1 changer transitions 0/158 dead transitions. [2023-11-29 00:07:19,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 158 transitions, 372 flow [2023-11-29 00:07:19,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:07:19,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:07:19,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2023-11-29 00:07:19,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8433333333333334 [2023-11-29 00:07:19,176 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 506 transitions. [2023-11-29 00:07:19,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 506 transitions. [2023-11-29 00:07:19,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:07:19,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 506 transitions. [2023-11-29 00:07:19,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 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-29 00:07:19,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-29 00:07:19,180 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-29 00:07:19,180 INFO L175 Difference]: Start difference. First operand has 170 places, 164 transitions, 344 flow. Second operand 3 states and 506 transitions. [2023-11-29 00:07:19,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 158 transitions, 372 flow [2023-11-29 00:07:19,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 158 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:07:19,183 INFO L231 Difference]: Finished difference. Result has 164 places, 158 transitions, 330 flow [2023-11-29 00:07:19,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=164, PETRI_TRANSITIONS=158} [2023-11-29 00:07:19,184 INFO L281 CegarLoopForPetriNet]: 175 programPoint places, -11 predicate places. [2023-11-29 00:07:19,184 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 158 transitions, 330 flow [2023-11-29 00:07:19,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 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-29 00:07:19,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:07:19,185 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-29 00:07:19,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 00:07:19,185 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-29 00:07:19,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:07:19,186 INFO L85 PathProgramCache]: Analyzing trace with hash 801459983, now seen corresponding path program 1 times [2023-11-29 00:07:19,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:07:19,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361851118] [2023-11-29 00:07:19,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:07:19,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:07:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:07:19,229 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-29 00:07:19,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:07:19,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361851118] [2023-11-29 00:07:19,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361851118] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:07:19,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:07:19,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:07:19,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971582479] [2023-11-29 00:07:19,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:07:19,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:07:19,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:07:19,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:07:19,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:07:19,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 200 [2023-11-29 00:07:19,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 158 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 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-29 00:07:19,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:07:19,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 200 [2023-11-29 00:07:19,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:07:19,486 INFO L124 PetriNetUnfolderBase]: 347/1387 cut-off events. [2023-11-29 00:07:19,486 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2023-11-29 00:07:19,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2069 conditions, 1387 events. 347/1387 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9781 event pairs, 117 based on Foata normal form. 0/1222 useless extension candidates. Maximal degree in co-relation 2028. Up to 382 conditions per place. [2023-11-29 00:07:19,503 INFO L140 encePairwiseOnDemand]: 189/200 looper letters, 25 selfloop transitions, 8 changer transitions 0/172 dead transitions. [2023-11-29 00:07:19,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 172 transitions, 432 flow [2023-11-29 00:07:19,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:07:19,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:07:19,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 537 transitions. [2023-11-29 00:07:19,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.895 [2023-11-29 00:07:19,506 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 537 transitions. [2023-11-29 00:07:19,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 537 transitions. [2023-11-29 00:07:19,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:07:19,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 537 transitions. [2023-11-29 00:07:19,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 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-29 00:07:19,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-29 00:07:19,559 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-29 00:07:19,560 INFO L175 Difference]: Start difference. First operand has 164 places, 158 transitions, 330 flow. Second operand 3 states and 537 transitions. [2023-11-29 00:07:19,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 172 transitions, 432 flow [2023-11-29 00:07:19,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 172 transitions, 431 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:07:19,564 INFO L231 Difference]: Finished difference. Result has 167 places, 166 transitions, 399 flow [2023-11-29 00:07:19,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=399, PETRI_PLACES=167, PETRI_TRANSITIONS=166} [2023-11-29 00:07:19,565 INFO L281 CegarLoopForPetriNet]: 175 programPoint places, -8 predicate places. [2023-11-29 00:07:19,566 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 166 transitions, 399 flow [2023-11-29 00:07:19,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 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-29 00:07:19,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:07:19,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:07:19,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 00:07:19,567 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-29 00:07:19,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:07:19,567 INFO L85 PathProgramCache]: Analyzing trace with hash 244468357, now seen corresponding path program 1 times [2023-11-29 00:07:19,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:07:19,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418898190] [2023-11-29 00:07:19,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:07:19,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:07:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:07:19,644 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-29 00:07:19,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:07:19,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418898190] [2023-11-29 00:07:19,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418898190] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:07:19,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:07:19,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:07:19,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76208589] [2023-11-29 00:07:19,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:07:19,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:07:19,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:07:19,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:07:19,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:07:19,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 200 [2023-11-29 00:07:19,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 166 transitions, 399 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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-29 00:07:19,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:07:19,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 200 [2023-11-29 00:07:19,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:07:20,010 INFO L124 PetriNetUnfolderBase]: 447/1937 cut-off events. [2023-11-29 00:07:20,010 INFO L125 PetriNetUnfolderBase]: For 623/643 co-relation queries the response was YES. [2023-11-29 00:07:20,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3375 conditions, 1937 events. 447/1937 cut-off events. For 623/643 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 15564 event pairs, 158 based on Foata normal form. 2/1727 useless extension candidates. Maximal degree in co-relation 3333. Up to 585 conditions per place. [2023-11-29 00:07:20,064 INFO L140 encePairwiseOnDemand]: 193/200 looper letters, 23 selfloop transitions, 10 changer transitions 0/177 dead transitions. [2023-11-29 00:07:20,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 177 transitions, 510 flow [2023-11-29 00:07:20,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:07:20,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:07:20,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 539 transitions. [2023-11-29 00:07:20,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8983333333333333 [2023-11-29 00:07:20,067 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 539 transitions. [2023-11-29 00:07:20,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 539 transitions. [2023-11-29 00:07:20,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:07:20,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 539 transitions. [2023-11-29 00:07:20,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 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-29 00:07:20,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-29 00:07:20,071 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-29 00:07:20,071 INFO L175 Difference]: Start difference. First operand has 167 places, 166 transitions, 399 flow. Second operand 3 states and 539 transitions. [2023-11-29 00:07:20,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 177 transitions, 510 flow [2023-11-29 00:07:20,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 177 transitions, 488 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:07:20,078 INFO L231 Difference]: Finished difference. Result has 169 places, 174 transitions, 469 flow [2023-11-29 00:07:20,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=469, PETRI_PLACES=169, PETRI_TRANSITIONS=174} [2023-11-29 00:07:20,080 INFO L281 CegarLoopForPetriNet]: 175 programPoint places, -6 predicate places. [2023-11-29 00:07:20,080 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 174 transitions, 469 flow [2023-11-29 00:07:20,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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-29 00:07:20,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:07:20,081 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:07:20,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 00:07:20,081 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-29 00:07:20,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:07:20,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1876653039, now seen corresponding path program 1 times [2023-11-29 00:07:20,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:07:20,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164170610] [2023-11-29 00:07:20,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:07:20,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:07:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:07:20,174 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-29 00:07:20,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:07:20,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164170610] [2023-11-29 00:07:20,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164170610] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:07:20,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:07:20,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:07:20,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642673630] [2023-11-29 00:07:20,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:07:20,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:07:20,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:07:20,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:07:20,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:07:20,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 200 [2023-11-29 00:07:20,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 174 transitions, 469 flow. Second operand has 5 states, 5 states have (on average 170.6) internal successors, (853), 5 states have internal predecessors, (853), 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-29 00:07:20,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:07:20,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 200 [2023-11-29 00:07:20,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:07:20,431 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([551] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread2of2ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of2ForFork0_#t~nondet6#1=|v_thr2Thread2of2ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of2ForFork0_#t~nondet6#1][158], [Black: 222#(= |#race~x~0| |thr2Thread1of2ForFork0_#t~nondet5#1|), 220#true, thr2Thread1of2ForFork0InUse, 99#L705-2true, thr2Thread2of2ForFork0InUse, thr1Thread1of2ForFork1InUse, 12#$Ultimate##0true, 131#L705-2true, 47#L714-4true, Black: 214#true, 226#true, 212#(= |#race~n~0| 0)]) [2023-11-29 00:07:20,431 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2023-11-29 00:07:20,431 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-29 00:07:20,431 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-29 00:07:20,431 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-29 00:07:20,585 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L702-4-->L705-2: Formula: (and (= |v_thr2Thread1of2ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of2ForFork0_#t~nondet6#1=|v_thr2Thread1of2ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of2ForFork0_#t~nondet6#1][128], [Black: 222#(= |#race~x~0| |thr2Thread1of2ForFork0_#t~nondet5#1|), 220#true, thr2Thread1of2ForFork0InUse, 99#L705-2true, thr2Thread2of2ForFork0InUse, thr1Thread1of2ForFork1InUse, 67#L-1-4true, 12#$Ultimate##0true, 131#L705-2true, Black: 214#true, 226#true, 212#(= |#race~n~0| 0)]) [2023-11-29 00:07:20,585 INFO L294 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2023-11-29 00:07:20,585 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-29 00:07:20,585 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-29 00:07:20,585 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-29 00:07:20,624 INFO L124 PetriNetUnfolderBase]: 540/2968 cut-off events. [2023-11-29 00:07:20,624 INFO L125 PetriNetUnfolderBase]: For 529/737 co-relation queries the response was YES. [2023-11-29 00:07:20,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4755 conditions, 2968 events. 540/2968 cut-off events. For 529/737 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 27794 event pairs, 215 based on Foata normal form. 1/2606 useless extension candidates. Maximal degree in co-relation 4712. Up to 443 conditions per place. [2023-11-29 00:07:20,651 INFO L140 encePairwiseOnDemand]: 196/200 looper letters, 19 selfloop transitions, 0 changer transitions 4/177 dead transitions. [2023-11-29 00:07:20,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 177 transitions, 521 flow [2023-11-29 00:07:20,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:07:20,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:07:20,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 864 transitions. [2023-11-29 00:07:20,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.864 [2023-11-29 00:07:20,654 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 864 transitions. [2023-11-29 00:07:20,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 864 transitions. [2023-11-29 00:07:20,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:07:20,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 864 transitions. [2023-11-29 00:07:20,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 172.8) internal successors, (864), 5 states have internal predecessors, (864), 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-29 00:07:20,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 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-29 00:07:20,660 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 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-29 00:07:20,660 INFO L175 Difference]: Start difference. First operand has 169 places, 174 transitions, 469 flow. Second operand 5 states and 864 transitions. [2023-11-29 00:07:20,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 177 transitions, 521 flow [2023-11-29 00:07:20,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 177 transitions, 501 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:07:20,667 INFO L231 Difference]: Finished difference. Result has 174 places, 173 transitions, 453 flow [2023-11-29 00:07:20,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=453, PETRI_PLACES=174, PETRI_TRANSITIONS=173} [2023-11-29 00:07:20,668 INFO L281 CegarLoopForPetriNet]: 175 programPoint places, -1 predicate places. [2023-11-29 00:07:20,668 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 173 transitions, 453 flow [2023-11-29 00:07:20,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 170.6) internal successors, (853), 5 states have internal predecessors, (853), 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-29 00:07:20,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:07:20,669 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:07:20,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 00:07:20,669 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-29 00:07:20,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:07:20,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1719966117, now seen corresponding path program 1 times [2023-11-29 00:07:20,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:07:20,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816626011] [2023-11-29 00:07:20,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:07:20,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:07:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:07:20,695 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:07:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:07:20,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:07:20,725 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:07:20,725 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2023-11-29 00:07:20,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2023-11-29 00:07:20,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2023-11-29 00:07:20,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2023-11-29 00:07:20,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2023-11-29 00:07:20,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2023-11-29 00:07:20,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2023-11-29 00:07:20,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2023-11-29 00:07:20,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2023-11-29 00:07:20,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2023-11-29 00:07:20,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2023-11-29 00:07:20,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 22 remaining) [2023-11-29 00:07:20,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2023-11-29 00:07:20,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2023-11-29 00:07:20,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2023-11-29 00:07:20,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2023-11-29 00:07:20,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2023-11-29 00:07:20,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2023-11-29 00:07:20,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2023-11-29 00:07:20,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2023-11-29 00:07:20,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2023-11-29 00:07:20,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2023-11-29 00:07:20,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 00:07:20,729 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:07:20,730 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 00:07:20,730 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-29 00:07:20,776 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 00:07:20,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 256 places, 257 transitions, 550 flow [2023-11-29 00:07:20,815 INFO L124 PetriNetUnfolderBase]: 14/277 cut-off events. [2023-11-29 00:07:20,815 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-29 00:07:20,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 277 events. 14/277 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 629 event pairs, 0 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 288. Up to 8 conditions per place. [2023-11-29 00:07:20,817 INFO L82 GeneralOperation]: Start removeDead. Operand has 256 places, 257 transitions, 550 flow [2023-11-29 00:07:20,820 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 209 places, 210 transitions, 441 flow [2023-11-29 00:07:20,822 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:07:20,823 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;@70411744, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:07:20,823 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2023-11-29 00:07:20,826 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:07:20,826 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2023-11-29 00:07:20,826 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:07:20,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:07:20,826 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] [2023-11-29 00:07:20,826 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2023-11-29 00:07:20,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:07:20,827 INFO L85 PathProgramCache]: Analyzing trace with hash 2022129433, now seen corresponding path program 1 times [2023-11-29 00:07:20,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:07:20,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79651086] [2023-11-29 00:07:20,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:07:20,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:07:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:07:20,850 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-29 00:07:20,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:07:20,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79651086] [2023-11-29 00:07:20,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79651086] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:07:20,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:07:20,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:07:20,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471513851] [2023-11-29 00:07:20,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:07:20,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:07:20,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:07:20,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:07:20,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:07:20,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 257 [2023-11-29 00:07:20,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 210 transitions, 441 flow. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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-29 00:07:20,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:07:20,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 257 [2023-11-29 00:07:20,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:07:21,750 INFO L124 PetriNetUnfolderBase]: 1589/4926 cut-off events. [2023-11-29 00:07:21,750 INFO L125 PetriNetUnfolderBase]: For 336/336 co-relation queries the response was YES. [2023-11-29 00:07:21,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7236 conditions, 4926 events. 1589/4926 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 45466 event pairs, 1439 based on Foata normal form. 1274/5494 useless extension candidates. Maximal degree in co-relation 7166. Up to 2067 conditions per place. [2023-11-29 00:07:21,809 INFO L140 encePairwiseOnDemand]: 247/257 looper letters, 21 selfloop transitions, 2 changer transitions 1/199 dead transitions. [2023-11-29 00:07:21,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 199 transitions, 465 flow [2023-11-29 00:07:21,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:07:21,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:07:21,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 676 transitions. [2023-11-29 00:07:21,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8767833981841764 [2023-11-29 00:07:21,812 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 676 transitions. [2023-11-29 00:07:21,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 676 transitions. [2023-11-29 00:07:21,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:07:21,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 676 transitions. [2023-11-29 00:07:21,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 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-29 00:07:21,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 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-29 00:07:21,818 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 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-29 00:07:21,818 INFO L175 Difference]: Start difference. First operand has 209 places, 210 transitions, 441 flow. Second operand 3 states and 676 transitions. [2023-11-29 00:07:21,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 199 transitions, 465 flow [2023-11-29 00:07:21,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 199 transitions, 462 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-29 00:07:21,823 INFO L231 Difference]: Finished difference. Result has 206 places, 198 transitions, 418 flow [2023-11-29 00:07:21,824 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=206, PETRI_TRANSITIONS=198} [2023-11-29 00:07:21,825 INFO L281 CegarLoopForPetriNet]: 209 programPoint places, -3 predicate places. [2023-11-29 00:07:21,825 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 198 transitions, 418 flow [2023-11-29 00:07:21,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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-29 00:07:21,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:07:21,826 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] [2023-11-29 00:07:21,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 00:07:21,826 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2023-11-29 00:07:21,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:07:21,827 INFO L85 PathProgramCache]: Analyzing trace with hash -234449179, now seen corresponding path program 1 times [2023-11-29 00:07:21,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:07:21,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771549369] [2023-11-29 00:07:21,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:07:21,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:07:21,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:07:21,860 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-29 00:07:21,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:07:21,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771549369] [2023-11-29 00:07:21,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771549369] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:07:21,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:07:21,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:07:21,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348966637] [2023-11-29 00:07:21,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:07:21,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:07:21,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:07:21,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:07:21,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:07:21,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 257 [2023-11-29 00:07:21,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 198 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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-29 00:07:21,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:07:21,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 257 [2023-11-29 00:07:21,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:07:22,996 INFO L124 PetriNetUnfolderBase]: 1176/6922 cut-off events. [2023-11-29 00:07:22,996 INFO L125 PetriNetUnfolderBase]: For 314/314 co-relation queries the response was YES. [2023-11-29 00:07:23,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8727 conditions, 6922 events. 1176/6922 cut-off events. For 314/314 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 75088 event pairs, 1154 based on Foata normal form. 0/5922 useless extension candidates. Maximal degree in co-relation 8692. Up to 1670 conditions per place. [2023-11-29 00:07:23,056 INFO L140 encePairwiseOnDemand]: 254/257 looper letters, 21 selfloop transitions, 2 changer transitions 0/197 dead transitions. [2023-11-29 00:07:23,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 197 transitions, 462 flow [2023-11-29 00:07:23,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:07:23,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:07:23,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2023-11-29 00:07:23,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.867704280155642 [2023-11-29 00:07:23,060 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 669 transitions. [2023-11-29 00:07:23,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 669 transitions. [2023-11-29 00:07:23,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:07:23,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 669 transitions. [2023-11-29 00:07:23,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 223.0) internal successors, (669), 3 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-29 00:07:23,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 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-29 00:07:23,067 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 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-29 00:07:23,067 INFO L175 Difference]: Start difference. First operand has 206 places, 198 transitions, 418 flow. Second operand 3 states and 669 transitions. [2023-11-29 00:07:23,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 197 transitions, 462 flow [2023-11-29 00:07:23,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 197 transitions, 458 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:07:23,075 INFO L231 Difference]: Finished difference. Result has 204 places, 197 transitions, 416 flow [2023-11-29 00:07:23,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=416, PETRI_PLACES=204, PETRI_TRANSITIONS=197} [2023-11-29 00:07:23,077 INFO L281 CegarLoopForPetriNet]: 209 programPoint places, -5 predicate places. [2023-11-29 00:07:23,077 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 197 transitions, 416 flow [2023-11-29 00:07:23,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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-29 00:07:23,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:07:23,078 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-29 00:07:23,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 00:07:23,078 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2023-11-29 00:07:23,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:07:23,079 INFO L85 PathProgramCache]: Analyzing trace with hash -827584762, now seen corresponding path program 1 times [2023-11-29 00:07:23,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:07:23,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208376657] [2023-11-29 00:07:23,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:07:23,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:07:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:07:23,113 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-29 00:07:23,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:07:23,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208376657] [2023-11-29 00:07:23,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208376657] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:07:23,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:07:23,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:07:23,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699812008] [2023-11-29 00:07:23,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:07:23,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:07:23,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:07:23,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:07:23,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:07:23,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 257 [2023-11-29 00:07:23,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 197 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 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-29 00:07:23,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:07:23,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 257 [2023-11-29 00:07:23,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:07:25,188 INFO L124 PetriNetUnfolderBase]: 4181/13366 cut-off events. [2023-11-29 00:07:25,188 INFO L125 PetriNetUnfolderBase]: For 436/436 co-relation queries the response was YES. [2023-11-29 00:07:25,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18719 conditions, 13366 events. 4181/13366 cut-off events. For 436/436 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 146237 event pairs, 3658 based on Foata normal form. 0/11639 useless extension candidates. Maximal degree in co-relation 18677. Up to 5066 conditions per place. [2023-11-29 00:07:25,314 INFO L140 encePairwiseOnDemand]: 249/257 looper letters, 24 selfloop transitions, 1 changer transitions 0/190 dead transitions. [2023-11-29 00:07:25,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 190 transitions, 452 flow [2023-11-29 00:07:25,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:07:25,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:07:25,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 641 transitions. [2023-11-29 00:07:25,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8313878080415046 [2023-11-29 00:07:25,318 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 641 transitions. [2023-11-29 00:07:25,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 641 transitions. [2023-11-29 00:07:25,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:07:25,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 641 transitions. [2023-11-29 00:07:25,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 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-29 00:07:25,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 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-29 00:07:25,326 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 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-29 00:07:25,326 INFO L175 Difference]: Start difference. First operand has 204 places, 197 transitions, 416 flow. Second operand 3 states and 641 transitions. [2023-11-29 00:07:25,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 190 transitions, 452 flow [2023-11-29 00:07:25,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 190 transitions, 448 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:07:25,333 INFO L231 Difference]: Finished difference. Result has 197 places, 190 transitions, 400 flow [2023-11-29 00:07:25,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=197, PETRI_TRANSITIONS=190} [2023-11-29 00:07:25,335 INFO L281 CegarLoopForPetriNet]: 209 programPoint places, -12 predicate places. [2023-11-29 00:07:25,335 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 190 transitions, 400 flow [2023-11-29 00:07:25,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 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-29 00:07:25,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:07:25,336 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-29 00:07:25,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 00:07:25,337 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2023-11-29 00:07:25,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:07:25,337 INFO L85 PathProgramCache]: Analyzing trace with hash -911197425, now seen corresponding path program 1 times [2023-11-29 00:07:25,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:07:25,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911409906] [2023-11-29 00:07:25,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:07:25,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:07:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:07:25,383 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-29 00:07:25,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:07:25,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911409906] [2023-11-29 00:07:25,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911409906] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:07:25,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:07:25,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:07:25,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512994003] [2023-11-29 00:07:25,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:07:25,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:07:25,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:07:25,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:07:25,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:07:25,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 257 [2023-11-29 00:07:25,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 190 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 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-29 00:07:25,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:07:25,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 257 [2023-11-29 00:07:25,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:07:27,379 INFO L124 PetriNetUnfolderBase]: 4747/11775 cut-off events. [2023-11-29 00:07:27,379 INFO L125 PetriNetUnfolderBase]: For 735/735 co-relation queries the response was YES. [2023-11-29 00:07:27,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19332 conditions, 11775 events. 4747/11775 cut-off events. For 735/735 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 117339 event pairs, 1694 based on Foata normal form. 0/10133 useless extension candidates. Maximal degree in co-relation 19290. Up to 4100 conditions per place. [2023-11-29 00:07:27,527 INFO L140 encePairwiseOnDemand]: 242/257 looper letters, 35 selfloop transitions, 11 changer transitions 0/210 dead transitions. [2023-11-29 00:07:27,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 210 transitions, 545 flow [2023-11-29 00:07:27,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:07:27,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:07:27,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 677 transitions. [2023-11-29 00:07:27,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8780804150453956 [2023-11-29 00:07:27,530 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 677 transitions. [2023-11-29 00:07:27,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 677 transitions. [2023-11-29 00:07:27,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:07:27,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 677 transitions. [2023-11-29 00:07:27,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 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-29 00:07:27,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 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-29 00:07:27,536 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 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-29 00:07:27,536 INFO L175 Difference]: Start difference. First operand has 197 places, 190 transitions, 400 flow. Second operand 3 states and 677 transitions. [2023-11-29 00:07:27,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 210 transitions, 545 flow [2023-11-29 00:07:27,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 210 transitions, 544 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:07:27,544 INFO L231 Difference]: Finished difference. Result has 200 places, 201 transitions, 495 flow [2023-11-29 00:07:27,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=495, PETRI_PLACES=200, PETRI_TRANSITIONS=201} [2023-11-29 00:07:27,545 INFO L281 CegarLoopForPetriNet]: 209 programPoint places, -9 predicate places. [2023-11-29 00:07:27,546 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 201 transitions, 495 flow [2023-11-29 00:07:27,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 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-29 00:07:27,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:07:27,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:07:27,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 00:07:27,547 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2023-11-29 00:07:27,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:07:27,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1357588598, now seen corresponding path program 1 times [2023-11-29 00:07:27,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:07:27,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255696769] [2023-11-29 00:07:27,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:07:27,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:07:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:07:27,614 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-29 00:07:27,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:07:27,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255696769] [2023-11-29 00:07:27,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255696769] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:07:27,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:07:27,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:07:27,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552457249] [2023-11-29 00:07:27,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:07:27,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:07:27,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:07:27,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:07:27,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:07:27,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 257 [2023-11-29 00:07:27,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 201 transitions, 495 flow. Second operand has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 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-29 00:07:27,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:07:27,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 257 [2023-11-29 00:07:27,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:07:29,668 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([808] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~nondet6#1=|v_thr2Thread1of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~nondet6#1][125], [269#(= |#race~n~0| 0), 105#L700-3true, 273#(= |#race~x~0| 0), 203#$Ultimate##0true, 57#L705-2true, 277#true, Black: 271#true, 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse]) [2023-11-29 00:07:29,668 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2023-11-29 00:07:29,668 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-29 00:07:29,668 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 00:07:29,668 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-29 00:07:29,693 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread3of3ForFork0_#t~nondet6#1=|v_thr2Thread3of3ForFork0_#t~nondet6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~nondet6#1][190], [269#(= |#race~n~0| 0), 105#L700-3true, 273#(= |#race~x~0| 0), 119#L694-2true, 57#L705-2true, 277#true, Black: 271#true, 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse]) [2023-11-29 00:07:29,693 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2023-11-29 00:07:29,694 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-29 00:07:29,694 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 00:07:29,694 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-29 00:07:29,932 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread3of3ForFork0_#t~nondet6#1=|v_thr2Thread3of3ForFork0_#t~nondet6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~nondet6#1][216], [269#(= |#race~n~0| 0), 105#L700-3true, 273#(= |#race~x~0| 0), 57#L705-2true, 214#L694-1true, Black: 271#true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, thr2Thread3of3ForFork0InUse, 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr1Thread1of3ForFork1InUse, 204#L703-4true]) [2023-11-29 00:07:29,932 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2023-11-29 00:07:29,932 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 00:07:29,933 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 00:07:29,933 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 00:07:30,516 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][207], [269#(= |#race~n~0| 0), 273#(= |#race~x~0| 0), 119#L694-2true, 57#L705-2true, Black: 271#true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, thr2Thread3of3ForFork0InUse, 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr1Thread1of3ForFork1InUse, 204#L703-4true, 23#L705-2true]) [2023-11-29 00:07:30,516 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-29 00:07:30,516 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-29 00:07:30,516 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-29 00:07:30,516 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-29 00:07:30,729 INFO L124 PetriNetUnfolderBase]: 6562/18051 cut-off events. [2023-11-29 00:07:30,729 INFO L125 PetriNetUnfolderBase]: For 7614/8165 co-relation queries the response was YES. [2023-11-29 00:07:30,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35083 conditions, 18051 events. 6562/18051 cut-off events. For 7614/8165 co-relation queries the response was YES. Maximal size of possible extension queue 801. Compared 202687 event pairs, 2467 based on Foata normal form. 44/15761 useless extension candidates. Maximal degree in co-relation 35040. Up to 7179 conditions per place. [2023-11-29 00:07:30,944 INFO L140 encePairwiseOnDemand]: 248/257 looper letters, 33 selfloop transitions, 14 changer transitions 0/219 dead transitions. [2023-11-29 00:07:30,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 219 transitions, 665 flow [2023-11-29 00:07:30,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:07:30,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:07:30,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 687 transitions. [2023-11-29 00:07:30,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8910505836575876 [2023-11-29 00:07:30,948 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 687 transitions. [2023-11-29 00:07:30,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 687 transitions. [2023-11-29 00:07:30,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:07:30,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 687 transitions. [2023-11-29 00:07:30,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 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-29 00:07:30,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 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-29 00:07:30,955 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 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-29 00:07:30,955 INFO L175 Difference]: Start difference. First operand has 200 places, 201 transitions, 495 flow. Second operand 3 states and 687 transitions. [2023-11-29 00:07:30,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 219 transitions, 665 flow [2023-11-29 00:07:30,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 219 transitions, 633 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:07:30,986 INFO L231 Difference]: Finished difference. Result has 202 places, 213 transitions, 599 flow [2023-11-29 00:07:30,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=599, PETRI_PLACES=202, PETRI_TRANSITIONS=213} [2023-11-29 00:07:30,988 INFO L281 CegarLoopForPetriNet]: 209 programPoint places, -7 predicate places. [2023-11-29 00:07:30,988 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 213 transitions, 599 flow [2023-11-29 00:07:30,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 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-29 00:07:30,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:07:30,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:07:30,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 00:07:30,989 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2023-11-29 00:07:30,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:07:30,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1841739132, now seen corresponding path program 1 times [2023-11-29 00:07:30,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:07:30,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903824085] [2023-11-29 00:07:30,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:07:30,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:07:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:07:31,094 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-29 00:07:31,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:07:31,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903824085] [2023-11-29 00:07:31,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903824085] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:07:31,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:07:31,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:07:31,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582588895] [2023-11-29 00:07:31,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:07:31,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:07:31,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:07:31,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:07:31,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:07:31,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 257 [2023-11-29 00:07:31,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 213 transitions, 599 flow. Second operand has 5 states, 5 states have (on average 219.6) internal successors, (1098), 5 states have internal predecessors, (1098), 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-29 00:07:31,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:07:31,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 257 [2023-11-29 00:07:31,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:07:32,817 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([808] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~nondet6#1=|v_thr2Thread1of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~nondet6#1][128], [283#true, 269#(= |#race~n~0| 0), 105#L700-3true, 203#$Ultimate##0true, 57#L705-2true, 277#true, Black: 271#true, 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse]) [2023-11-29 00:07:32,817 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2023-11-29 00:07:32,817 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-29 00:07:32,817 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-29 00:07:32,818 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 00:07:33,155 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread3of3ForFork0_#t~nondet6#1=|v_thr2Thread3of3ForFork0_#t~nondet6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~nondet6#1][190], [283#true, 269#(= |#race~n~0| 0), 203#$Ultimate##0true, 57#L705-2true, 277#true, Black: 271#true, 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 55#L701-1true]) [2023-11-29 00:07:33,155 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2023-11-29 00:07:33,155 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-29 00:07:33,155 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 00:07:33,155 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 00:07:33,231 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([808] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~nondet6#1=|v_thr2Thread1of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~nondet6#1][128], [283#true, 269#(= |#race~n~0| 0), 105#L700-3true, 57#L705-2true, 214#L694-1true, 277#true, Black: 271#true, 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse]) [2023-11-29 00:07:33,232 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2023-11-29 00:07:33,232 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 00:07:33,232 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 00:07:33,232 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-29 00:07:33,276 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread3of3ForFork0_#t~nondet6#1=|v_thr2Thread3of3ForFork0_#t~nondet6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~nondet6#1][190], [283#true, 269#(= |#race~n~0| 0), 43#L701-2true, 203#$Ultimate##0true, 57#L705-2true, 277#true, Black: 271#true, 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse]) [2023-11-29 00:07:33,276 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2023-11-29 00:07:33,276 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-29 00:07:33,276 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-29 00:07:33,276 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 00:07:33,318 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([808] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~nondet6#1=|v_thr2Thread1of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~nondet6#1][128], [283#true, 269#(= |#race~n~0| 0), 105#L700-3true, 119#L694-2true, 57#L705-2true, 277#true, Black: 271#true, 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse]) [2023-11-29 00:07:33,318 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2023-11-29 00:07:33,318 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-29 00:07:33,318 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-29 00:07:33,318 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 00:07:33,552 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([831] L701-->L701-1: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][203], [283#true, 269#(= |#race~n~0| 0), 119#L694-2true, 57#L705-2true, 277#true, Black: 271#true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 204#L703-4true, 55#L701-1true]) [2023-11-29 00:07:33,552 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-29 00:07:33,552 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 00:07:33,552 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 00:07:33,552 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-29 00:07:33,680 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([808] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~nondet6#1=|v_thr2Thread1of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~nondet6#1][128], [283#true, 269#(= |#race~n~0| 0), 105#L700-3true, 203#$Ultimate##0true, 57#L705-2true, 277#true, Black: 273#(= |#race~x~0| 0), 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse]) [2023-11-29 00:07:33,680 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2023-11-29 00:07:33,680 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 00:07:33,681 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 00:07:33,681 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 00:07:33,818 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread3of3ForFork0_#t~nondet6#1=|v_thr2Thread3of3ForFork0_#t~nondet6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~nondet6#1][190], [283#true, 269#(= |#race~n~0| 0), 203#$Ultimate##0true, 57#L705-2true, 277#true, Black: 271#true, 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-29 00:07:33,818 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-29 00:07:33,818 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 00:07:33,818 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-29 00:07:33,818 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 00:07:33,820 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 104#L701-1true, 269#(= |#race~n~0| 0), 203#$Ultimate##0true, 277#true, Black: 273#(= |#race~x~0| 0), 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-29 00:07:33,820 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-29 00:07:33,820 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-29 00:07:33,820 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-29 00:07:33,820 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-29 00:07:33,822 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread3of3ForFork0_#t~nondet6#1=|v_thr2Thread3of3ForFork0_#t~nondet6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~nondet6#1][190], [283#true, 269#(= |#race~n~0| 0), 203#$Ultimate##0true, 57#L705-2true, 277#true, Black: 273#(= |#race~x~0| 0), 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 55#L701-1true]) [2023-11-29 00:07:33,822 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-29 00:07:33,822 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-29 00:07:33,822 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-29 00:07:33,822 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-29 00:07:34,046 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([808] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~nondet6#1=|v_thr2Thread1of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~nondet6#1][128], [283#true, 269#(= |#race~n~0| 0), 105#L700-3true, 57#L705-2true, 214#L694-1true, 277#true, Black: 273#(= |#race~x~0| 0), 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse]) [2023-11-29 00:07:34,047 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-29 00:07:34,047 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-29 00:07:34,047 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-29 00:07:34,047 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-29 00:07:34,066 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 269#(= |#race~n~0| 0), 203#$Ultimate##0true, 57#L705-2true, 40#L-1-4true, 277#true, Black: 273#(= |#race~x~0| 0), 49#$Ultimate##0true, thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-29 00:07:34,066 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2023-11-29 00:07:34,067 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-29 00:07:34,067 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-29 00:07:34,067 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-29 00:07:34,068 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 269#(= |#race~n~0| 0), 203#$Ultimate##0true, 277#true, Black: 273#(= |#race~x~0| 0), 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, 123#L701-2true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-29 00:07:34,068 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-29 00:07:34,068 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 00:07:34,068 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 00:07:34,068 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 00:07:34,069 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread3of3ForFork0_#t~nondet6#1=|v_thr2Thread3of3ForFork0_#t~nondet6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~nondet6#1][190], [283#true, 269#(= |#race~n~0| 0), 43#L701-2true, 203#$Ultimate##0true, 57#L705-2true, 277#true, Black: 273#(= |#race~x~0| 0), 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse]) [2023-11-29 00:07:34,070 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-29 00:07:34,070 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 00:07:34,070 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 00:07:34,070 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 00:07:34,096 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([808] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~nondet6#1=|v_thr2Thread1of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~nondet6#1][128], [283#true, 269#(= |#race~n~0| 0), 105#L700-3true, 119#L694-2true, 57#L705-2true, 277#true, Black: 273#(= |#race~x~0| 0), 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse]) [2023-11-29 00:07:34,096 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-29 00:07:34,096 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 00:07:34,096 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 00:07:34,096 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 00:07:34,204 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread3of3ForFork0_#t~nondet6#1=|v_thr2Thread3of3ForFork0_#t~nondet6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~nondet6#1][190], [283#true, 269#(= |#race~n~0| 0), 203#$Ultimate##0true, 57#L705-2true, 277#true, Black: 273#(= |#race~x~0| 0), 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-29 00:07:34,204 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is not cut-off event [2023-11-29 00:07:34,204 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is not cut-off event [2023-11-29 00:07:34,204 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is not cut-off event [2023-11-29 00:07:34,204 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is not cut-off event [2023-11-29 00:07:34,205 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread3of3ForFork0_#t~nondet6#1=|v_thr2Thread3of3ForFork0_#t~nondet6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~nondet6#1][190], [283#true, 269#(= |#race~n~0| 0), 203#$Ultimate##0true, 57#L705-2true, 277#true, Black: 271#true, 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, 165#L703-3true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse]) [2023-11-29 00:07:34,205 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2023-11-29 00:07:34,205 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-29 00:07:34,206 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2023-11-29 00:07:34,206 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-29 00:07:34,344 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([874] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread3of3ForFork0_#t~nondet6#1=|v_thr2Thread3of3ForFork0_#t~nondet6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~nondet6#1][190], [283#true, 269#(= |#race~n~0| 0), 203#$Ultimate##0true, 57#L705-2true, 277#true, Black: 273#(= |#race~x~0| 0), 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-29 00:07:34,344 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-29 00:07:34,344 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-29 00:07:34,344 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-29 00:07:34,344 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-29 00:07:34,344 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-29 00:07:34,466 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread3of3ForFork0_#t~nondet6#1=|v_thr2Thread3of3ForFork0_#t~nondet6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~nondet6#1][190], [283#true, 269#(= |#race~n~0| 0), 214#L694-1true, 57#L705-2true, 277#true, Black: 273#(= |#race~x~0| 0), 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-29 00:07:34,466 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2023-11-29 00:07:34,466 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-29 00:07:34,467 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2023-11-29 00:07:34,467 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2023-11-29 00:07:34,512 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread3of3ForFork0_#t~nondet6#1=|v_thr2Thread3of3ForFork0_#t~nondet6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~nondet6#1][190], [283#true, 269#(= |#race~n~0| 0), 119#L694-2true, 57#L705-2true, 277#true, Black: 273#(= |#race~x~0| 0), 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-29 00:07:34,512 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-29 00:07:34,513 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-29 00:07:34,513 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-29 00:07:34,513 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-29 00:07:34,876 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 269#(= |#race~n~0| 0), 203#$Ultimate##0true, 57#L705-2true, 40#L-1-4true, 277#true, Black: 273#(= |#race~x~0| 0), thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 223#L700-3true, 23#L705-2true]) [2023-11-29 00:07:34,876 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2023-11-29 00:07:34,876 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-29 00:07:34,876 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2023-11-29 00:07:34,877 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-29 00:07:35,067 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([864] L701-->L701-1: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][212], [283#true, 104#L701-1true, 269#(= |#race~n~0| 0), 119#L694-2true, 40#L-1-4true, 277#true, Black: 271#true, thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 204#L703-4true, 23#L705-2true]) [2023-11-29 00:07:35,067 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2023-11-29 00:07:35,067 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-29 00:07:35,067 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-29 00:07:35,067 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-29 00:07:35,096 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 269#(= |#race~n~0| 0), 215#L700-3true, 214#L694-1true, 40#L-1-4true, 277#true, Black: 273#(= |#race~x~0| 0), 195#L705-2true, thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-29 00:07:35,096 INFO L294 olderBase$Statistics]: this new event has 165 ancestors and is cut-off event [2023-11-29 00:07:35,096 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-29 00:07:35,096 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-29 00:07:35,096 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-29 00:07:35,137 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 269#(= |#race~n~0| 0), 117#L701-1true, 203#$Ultimate##0true, 57#L705-2true, 40#L-1-4true, 277#true, Black: 273#(= |#race~x~0| 0), thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-29 00:07:35,137 INFO L294 olderBase$Statistics]: this new event has 165 ancestors and is cut-off event [2023-11-29 00:07:35,137 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-29 00:07:35,137 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-29 00:07:35,137 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-29 00:07:35,145 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 269#(= |#race~n~0| 0), 215#L700-3true, 119#L694-2true, 40#L-1-4true, 277#true, Black: 273#(= |#race~x~0| 0), 195#L705-2true, thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-29 00:07:35,145 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2023-11-29 00:07:35,145 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-29 00:07:35,145 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-29 00:07:35,145 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-29 00:07:35,188 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 269#(= |#race~n~0| 0), 203#$Ultimate##0true, 57#L705-2true, 40#L-1-4true, 277#true, Black: 271#true, 195#L705-2true, thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-29 00:07:35,188 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2023-11-29 00:07:35,188 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-29 00:07:35,188 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-29 00:07:35,188 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-29 00:07:35,189 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([864] L701-->L701-1: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][182], [104#L701-1true, 283#true, 269#(= |#race~n~0| 0), 119#L694-2true, 40#L-1-4true, 277#true, Black: 271#true, thr2Thread1of3ForFork0InUse, 138#L702-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-29 00:07:35,189 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2023-11-29 00:07:35,190 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-29 00:07:35,190 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2023-11-29 00:07:35,190 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-29 00:07:35,197 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [201#L701-2true, 283#true, 269#(= |#race~n~0| 0), 203#$Ultimate##0true, 57#L705-2true, 40#L-1-4true, 277#true, Black: 273#(= |#race~x~0| 0), thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-29 00:07:35,198 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2023-11-29 00:07:35,198 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-29 00:07:35,198 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-29 00:07:35,198 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-29 00:07:35,225 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([808] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~nondet6#1=|v_thr2Thread1of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~nondet6#1][128], [283#true, 269#(= |#race~n~0| 0), 105#L700-3true, 57#L705-2true, 214#L694-1true, 40#L-1-4true, 277#true, Black: 273#(= |#race~x~0| 0), 195#L705-2true, thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse]) [2023-11-29 00:07:35,226 INFO L294 olderBase$Statistics]: this new event has 165 ancestors and is cut-off event [2023-11-29 00:07:35,226 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-29 00:07:35,226 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-29 00:07:35,226 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-29 00:07:35,255 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([808] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~nondet6#1=|v_thr2Thread1of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~nondet6#1][128], [283#true, 269#(= |#race~n~0| 0), 105#L700-3true, 119#L694-2true, 57#L705-2true, 40#L-1-4true, 277#true, Black: 273#(= |#race~x~0| 0), 195#L705-2true, thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse]) [2023-11-29 00:07:35,255 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2023-11-29 00:07:35,255 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-29 00:07:35,255 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-29 00:07:35,255 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-29 00:07:35,300 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 269#(= |#race~n~0| 0), 57#L705-2true, 40#L-1-4true, 277#true, Black: 271#true, 195#L705-2true, thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 19#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-29 00:07:35,300 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2023-11-29 00:07:35,301 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2023-11-29 00:07:35,301 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2023-11-29 00:07:35,301 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2023-11-29 00:07:35,314 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 269#(= |#race~n~0| 0), 239#L703-3true, 203#$Ultimate##0true, 40#L-1-4true, 277#true, Black: 271#true, 195#L705-2true, thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-29 00:07:35,314 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2023-11-29 00:07:35,314 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-29 00:07:35,314 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2023-11-29 00:07:35,314 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2023-11-29 00:07:35,345 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 269#(= |#race~n~0| 0), 214#L694-1true, 57#L705-2true, 40#L-1-4true, Black: 271#true, thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 277#true, thr2Thread3of3ForFork0InUse, 230#L703-3true, thr1Thread1of3ForFork1InUse, 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 23#L705-2true]) [2023-11-29 00:07:35,345 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2023-11-29 00:07:35,345 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-29 00:07:35,345 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-29 00:07:35,345 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2023-11-29 00:07:35,350 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([808] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~nondet6#1=|v_thr2Thread1of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~nondet6#1][128], [283#true, 269#(= |#race~n~0| 0), 203#$Ultimate##0true, 57#L705-2true, 40#L-1-4true, 277#true, Black: 271#true, 195#L705-2true, thr2Thread1of3ForFork0InUse, 165#L703-3true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse]) [2023-11-29 00:07:35,350 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2023-11-29 00:07:35,350 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-29 00:07:35,350 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2023-11-29 00:07:35,350 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-29 00:07:35,365 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 269#(= |#race~n~0| 0), 119#L694-2true, 57#L705-2true, 40#L-1-4true, Black: 271#true, thr2Thread1of3ForFork0InUse, Black: 277#true, thr2Thread2of3ForFork0InUse, thr2Thread3of3ForFork0InUse, 230#L703-3true, 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-29 00:07:35,365 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2023-11-29 00:07:35,365 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-29 00:07:35,365 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2023-11-29 00:07:35,365 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-29 00:07:35,377 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 269#(= |#race~n~0| 0), 57#L705-2true, 40#L-1-4true, Black: 271#true, thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 277#true, 19#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, thr2Thread3of3ForFork0InUse, 230#L703-3true, thr1Thread1of3ForFork1InUse, 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 23#L705-2true]) [2023-11-29 00:07:35,378 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2023-11-29 00:07:35,378 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-29 00:07:35,378 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-29 00:07:35,378 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2023-11-29 00:07:35,383 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 269#(= |#race~n~0| 0), 203#$Ultimate##0true, 57#L705-2true, 40#L-1-4true, 277#true, Black: 273#(= |#race~x~0| 0), 195#L705-2true, thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-29 00:07:35,383 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2023-11-29 00:07:35,383 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-29 00:07:35,383 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2023-11-29 00:07:35,383 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-29 00:07:35,401 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread3of3ForFork0_#t~nondet6#1=|v_thr2Thread3of3ForFork0_#t~nondet6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~nondet6#1][190], [283#true, 269#(= |#race~n~0| 0), 57#L705-2true, 40#L-1-4true, 277#true, Black: 271#true, 195#L705-2true, thr2Thread1of3ForFork0InUse, 165#L703-3true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 19#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse]) [2023-11-29 00:07:35,401 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2023-11-29 00:07:35,402 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-29 00:07:35,402 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2023-11-29 00:07:35,402 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-29 00:07:35,423 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([808] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~nondet6#1=|v_thr2Thread1of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~nondet6#1][128], [283#true, 269#(= |#race~n~0| 0), 57#L705-2true, 40#L-1-4true, 277#true, Black: 271#true, 195#L705-2true, thr2Thread1of3ForFork0InUse, 165#L703-3true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 19#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse]) [2023-11-29 00:07:35,423 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2023-11-29 00:07:35,423 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-29 00:07:35,424 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2023-11-29 00:07:35,424 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2023-11-29 00:07:35,424 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 269#(= |#race~n~0| 0), 57#L705-2true, 40#L-1-4true, 277#true, Black: 271#true, thr2Thread1of3ForFork0InUse, 138#L702-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 19#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-29 00:07:35,424 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is cut-off event [2023-11-29 00:07:35,424 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2023-11-29 00:07:35,424 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-29 00:07:35,424 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2023-11-29 00:07:35,432 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 269#(= |#race~n~0| 0), 203#$Ultimate##0true, 57#L705-2true, 40#L-1-4true, 277#true, Black: 273#(= |#race~x~0| 0), thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, 230#L703-3true, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-29 00:07:35,432 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is cut-off event [2023-11-29 00:07:35,432 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2023-11-29 00:07:35,432 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-29 00:07:35,432 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-29 00:07:35,445 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 269#(= |#race~n~0| 0), 203#$Ultimate##0true, 57#L705-2true, 40#L-1-4true, 277#true, Black: 273#(= |#race~x~0| 0), thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 204#L703-4true, 23#L705-2true]) [2023-11-29 00:07:35,445 INFO L294 olderBase$Statistics]: this new event has 174 ancestors and is cut-off event [2023-11-29 00:07:35,445 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2023-11-29 00:07:35,445 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2023-11-29 00:07:35,445 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2023-11-29 00:07:35,470 INFO L124 PetriNetUnfolderBase]: 7418/26205 cut-off events. [2023-11-29 00:07:35,470 INFO L125 PetriNetUnfolderBase]: For 6145/10716 co-relation queries the response was YES. [2023-11-29 00:07:35,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45332 conditions, 26205 events. 7418/26205 cut-off events. For 6145/10716 co-relation queries the response was YES. Maximal size of possible extension queue 1161. Compared 341632 event pairs, 2943 based on Foata normal form. 7/22226 useless extension candidates. Maximal degree in co-relation 45288. Up to 4820 conditions per place. [2023-11-29 00:07:35,741 INFO L140 encePairwiseOnDemand]: 253/257 looper letters, 22 selfloop transitions, 0 changer transitions 4/216 dead transitions. [2023-11-29 00:07:35,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 216 transitions, 657 flow [2023-11-29 00:07:35,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:07:35,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:07:35,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1112 transitions. [2023-11-29 00:07:35,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8653696498054475 [2023-11-29 00:07:35,747 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1112 transitions. [2023-11-29 00:07:35,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1112 transitions. [2023-11-29 00:07:35,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:07:35,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1112 transitions. [2023-11-29 00:07:35,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 222.4) internal successors, (1112), 5 states have internal predecessors, (1112), 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-29 00:07:35,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 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-29 00:07:35,756 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 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-29 00:07:35,756 INFO L175 Difference]: Start difference. First operand has 202 places, 213 transitions, 599 flow. Second operand 5 states and 1112 transitions. [2023-11-29 00:07:35,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 216 transitions, 657 flow [2023-11-29 00:07:35,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 216 transitions, 629 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:07:35,844 INFO L231 Difference]: Finished difference. Result has 207 places, 212 transitions, 575 flow [2023-11-29 00:07:35,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=575, PETRI_PLACES=207, PETRI_TRANSITIONS=212} [2023-11-29 00:07:35,844 INFO L281 CegarLoopForPetriNet]: 209 programPoint places, -2 predicate places. [2023-11-29 00:07:35,845 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 212 transitions, 575 flow [2023-11-29 00:07:35,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 219.6) internal successors, (1098), 5 states have internal predecessors, (1098), 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-29 00:07:35,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:07:35,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 00:07:35,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 00:07:35,846 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2023-11-29 00:07:35,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:07:35,846 INFO L85 PathProgramCache]: Analyzing trace with hash 82237691, now seen corresponding path program 1 times [2023-11-29 00:07:35,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:07:35,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130186260] [2023-11-29 00:07:35,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:07:35,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:07:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:07:35,870 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:07:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:07:35,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:07:35,905 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:07:35,905 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (26 of 27 remaining) [2023-11-29 00:07:35,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (25 of 27 remaining) [2023-11-29 00:07:35,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (24 of 27 remaining) [2023-11-29 00:07:35,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (23 of 27 remaining) [2023-11-29 00:07:35,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (22 of 27 remaining) [2023-11-29 00:07:35,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (21 of 27 remaining) [2023-11-29 00:07:35,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 27 remaining) [2023-11-29 00:07:35,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (19 of 27 remaining) [2023-11-29 00:07:35,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 27 remaining) [2023-11-29 00:07:35,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (17 of 27 remaining) [2023-11-29 00:07:35,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (16 of 27 remaining) [2023-11-29 00:07:35,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 27 remaining) [2023-11-29 00:07:35,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 27 remaining) [2023-11-29 00:07:35,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (13 of 27 remaining) [2023-11-29 00:07:35,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (12 of 27 remaining) [2023-11-29 00:07:35,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (11 of 27 remaining) [2023-11-29 00:07:35,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (10 of 27 remaining) [2023-11-29 00:07:35,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (9 of 27 remaining) [2023-11-29 00:07:35,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (8 of 27 remaining) [2023-11-29 00:07:35,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (7 of 27 remaining) [2023-11-29 00:07:35,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (6 of 27 remaining) [2023-11-29 00:07:35,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (5 of 27 remaining) [2023-11-29 00:07:35,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 27 remaining) [2023-11-29 00:07:35,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 27 remaining) [2023-11-29 00:07:35,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (2 of 27 remaining) [2023-11-29 00:07:35,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 27 remaining) [2023-11-29 00:07:35,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 27 remaining) [2023-11-29 00:07:35,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 00:07:35,910 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:07:35,916 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2023-11-29 00:07:35,916 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:07:36,021 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated [2023-11-29 00:07:36,022 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated [2023-11-29 00:07:36,023 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short10 could not be translated [2023-11-29 00:07:36,023 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short10 could not be translated [2023-11-29 00:07:36,024 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short10 could not be translated [2023-11-29 00:07:36,025 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 00:07:36,026 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated [2023-11-29 00:07:36,027 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated [2023-11-29 00:07:36,028 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-29 00:07:36,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:07:36 BasicIcfg [2023-11-29 00:07:36,041 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:07:36,041 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:07:36,041 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:07:36,042 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:07:36,042 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:07:15" (3/4) ... [2023-11-29 00:07:36,044 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 00:07:36,045 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:07:36,046 INFO L158 Benchmark]: Toolchain (without parser) took 21389.12ms. Allocated memory was 186.6MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 145.8MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-11-29 00:07:36,046 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 186.6MB. Free memory was 152.1MB in the beginning and 152.0MB in the end (delta: 16.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:07:36,046 INFO L158 Benchmark]: CACSL2BoogieTranslator took 534.47ms. Allocated memory is still 186.6MB. Free memory was 145.2MB in the beginning and 125.3MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 00:07:36,047 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.92ms. Allocated memory is still 186.6MB. Free memory was 125.3MB in the beginning and 122.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:07:36,047 INFO L158 Benchmark]: Boogie Preprocessor took 34.81ms. Allocated memory is still 186.6MB. Free memory was 122.7MB in the beginning and 121.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:07:36,047 INFO L158 Benchmark]: RCFGBuilder took 489.31ms. Allocated memory is still 186.6MB. Free memory was 121.1MB in the beginning and 103.8MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 00:07:36,048 INFO L158 Benchmark]: TraceAbstraction took 20261.98ms. Allocated memory was 186.6MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 103.3MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-11-29 00:07:36,048 INFO L158 Benchmark]: Witness Printer took 3.72ms. Allocated memory is still 3.7GB. Free memory was 2.5GB in the beginning and 2.5GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:07:36,050 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.18ms. Allocated memory is still 186.6MB. Free memory was 152.1MB in the beginning and 152.0MB in the end (delta: 16.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 534.47ms. Allocated memory is still 186.6MB. Free memory was 145.2MB in the beginning and 125.3MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.92ms. Allocated memory is still 186.6MB. Free memory was 125.3MB in the beginning and 122.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.81ms. Allocated memory is still 186.6MB. Free memory was 122.7MB in the beginning and 121.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 489.31ms. Allocated memory is still 186.6MB. Free memory was 121.1MB in the beginning and 103.8MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20261.98ms. Allocated memory was 186.6MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 103.3MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 3.72ms. Allocated memory is still 3.7GB. Free memory was 2.5GB in the beginning and 2.5GB in the end (delta: 1.0MB). 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~nondet9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 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: 694]: Data race detected [2023-11-29 00:07:36,120 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated [2023-11-29 00:07:36,121 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated [2023-11-29 00:07:36,121 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short10 could not be translated [2023-11-29 00:07:36,122 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short10 could not be translated [2023-11-29 00:07:36,122 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short10 could not be translated [2023-11-29 00:07:36,123 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 00:07:36,124 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated [2023-11-29 00:07:36,124 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated [2023-11-29 00:07:36,125 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-29 00:07:36,176 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated [2023-11-29 00:07:36,176 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated [2023-11-29 00:07:36,176 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short10 could not be translated [2023-11-29 00:07:36,177 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short10 could not be translated [2023-11-29 00:07:36,177 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short10 could not be translated [2023-11-29 00:07:36,177 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 00:07:36,178 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated [2023-11-29 00:07:36,179 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated [2023-11-29 00:07:36,180 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated Data race detected The following path leads to a data race: [L690] 0 volatile int x; VAL [x=0] [L691] 0 volatile int n; VAL [n=0, x=0] [L692] 0 pthread_mutex_t mut = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [mut={3:0}, n=0, x=0] [L708] 0 pthread_t t1, t2; VAL [\old(argc)=52, argc=52, argv={50:53}, mut={3:0}, n=0, t1={6:0}, t2={5:0}, x=0] [L709] 0 x = 0 VAL [\old(argc)=52, argc=52, argv={50:53}, mut={3:0}, n=0, t1={6:0}, t2={5:0}, x=0] [L710] 0 n = __VERIFIER_nondet_uint() VAL [\old(argc)=52, argc=52, argv={50:53}, mut={3:0}, n=7, t1={6:0}, t2={5:0}, x=0] [L711] EXPR 0 n >= (10/2) VAL [\old(argc)=52, argc=52, argv={50:53}, mut={3:0}, n=7, t1={6:0}, t2={5:0}, x=0] [L711] EXPR 0 n >= (10/2) && n < 10 VAL [\old(argc)=52, argc=52, argv={50:53}, mut={3:0}, n=7, t1={6:0}, t2={5:0}, x=0] [L711] EXPR 0 n < 10 VAL [\old(argc)=52, argc=52, argv={50:53}, mut={3:0}, n=7, t1={6:0}, t2={5:0}, x=0] [L711] EXPR 0 n >= (10/2) && n < 10 VAL [\old(argc)=52, argc=52, argv={50:53}, mut={3:0}, n=7, t1={6:0}, t2={5:0}, x=0] [L711] CALL 0 assume_abort_if_not(n >= (10/2) && n < 10) [L687] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, mut={3:0}, n=7, x=0] [L711] RET 0 assume_abort_if_not(n >= (10/2) && n < 10) [L712] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [\old(argc)=52, argc=52, argv={50:53}, mut={3:0}, n=7, t1={6:0}, t2={5:0}, x=0] [L694] 1 x <= n VAL [arg={0:0}, arg={0:0}, mut={3:0}, n=7, x=0] [L713] 0 int i = 0; VAL [\old(argc)=52, argc=52, argv={50:53}, i=0, mut={3:0}, n=7, t1={6:0}, t2={5:0}, x=0] [L713] 0 i < n VAL [\old(argc)=52, argc=52, argv={50:53}, i=0, mut={3:0}, n=7, t1={6:0}, t2={5:0}, x=0] [L713] COND TRUE 0 i < n VAL [\old(argc)=52, argc=52, argv={50:53}, i=0, mut={3:0}, n=7, t1={6:0}, t2={5:0}, x=0] [L714] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [\old(argc)=52, argc=52, argv={50:53}, i=0, mut={3:0}, n=7, t1={6:0}, t2={5:0}, x=0] [L697] 2 int t; VAL [arg={0:0}, arg={0:0}, mut={3:0}, n=7, x=0] [L698] 2 int k = __VERIFIER_nondet_uint(); VAL [arg={0:0}, arg={0:0}, k=7, mut={3:0}, n=7, x=0] [L699] CALL 2 assume_abort_if_not(k >= (10/2) && k <= 10) [L687] COND FALSE 2 !(!cond) VAL [\old(cond)=1, cond=1, mut={3:0}, n=7, x=0] [L699] RET 2 assume_abort_if_not(k >= (10/2) && k <= 10) [L701] 2 t = x VAL [arg={0:0}, arg={0:0}, k=7, mut={3:0}, n=7, t=0, x=0] [L702] 2 k == n VAL [arg={0:0}, arg={0:0}, k=7, mut={3:0}, n=7, t=0, x=0] [L702] COND TRUE 2 k == n VAL [arg={0:0}, arg={0:0}, k=7, mut={3:0}, n=7, t=0, x=0] [L703] 2 x = t + 1 VAL [arg={0:0}, arg={0:0}, k=7, mut={3:0}, n=7, t=0, x=1] [L694] 1 x <= n VAL [arg={0:0}, arg={0:0}, mut={3:0}, n=7, x=1] Now there is a data race on ~x~0 between C: x = t + 1 [703] and C: x <= n [694] - UnprovableResult [Line: 701]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 714]: 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: 712]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 191 locations, 17 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: 1.8s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 156 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 168 IncrementalHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 39 mSDtfsCounter, 168 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=291occurred in iteration=0, InterpolantAutomatonStates: 17, 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.4s InterpolantComputationTime, 285 NumberOfCodeBlocks, 285 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 222 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 7/7 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 7 procedures, 244 locations, 22 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: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 284 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 93 mSDsluCounter, 124 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 303 IncrementalHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 95 mSDtfsCounter, 303 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=469occurred in iteration=5, InterpolantAutomatonStates: 20, 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.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 390 NumberOfCodeBlocks, 390 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 316 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 26/26 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 3 thread instances CFG has 9 procedures, 297 locations, 27 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: 15.1s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 384 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 127 mSDsluCounter, 131 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 406 IncrementalHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 93 mSDtfsCounter, 406 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=599occurred in iteration=5, InterpolantAutomatonStates: 20, 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.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 317 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 RESULT: Ultimate proved your program to be incorrect! [2023-11-29 00:07:36,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_561a171a-90bf-4742-a5e4-06d846f751dd/bin/uautomizer-verify-BQ2R08f2Ya/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