./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a30f96d-f8d6-42ed-b08f-6ef34abd7be3/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a30f96d-f8d6-42ed-b08f-6ef34abd7be3/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a30f96d-f8d6-42ed-b08f-6ef34abd7be3/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a30f96d-f8d6-42ed-b08f-6ef34abd7be3/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a30f96d-f8d6-42ed-b08f-6ef34abd7be3/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a30f96d-f8d6-42ed-b08f-6ef34abd7be3/bin/uautomizer-verify-qhAvR1uOyd --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 801883caffd8b582a36607f9ec62109ac5c5dc10c811693a281fb396b4b60131 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:25:05,986 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:25:06,074 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a30f96d-f8d6-42ed-b08f-6ef34abd7be3/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-13 16:25:06,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:25:06,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:25:06,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:25:06,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:25:06,113 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:25:06,113 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:25:06,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 16:25:06,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:25:06,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:25:06,115 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:25:06,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:25:06,116 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 16:25:06,116 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:25:06,116 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 16:25:06,116 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:25:06,117 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:25:06,117 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 16:25:06,117 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:25:06,117 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 16:25:06,117 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-13 16:25:06,117 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:25:06,117 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 16:25:06,117 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:25:06,118 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 16:25:06,118 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:25:06,118 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:25:06,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:25:06,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 16:25:06,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:25:06,118 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:25:06,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:25:06,119 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 16:25:06,119 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 16:25:06,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 16:25:06,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 16:25:06,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 16:25:06,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 16:25:06,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 16:25:06,120 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_5a30f96d-f8d6-42ed-b08f-6ef34abd7be3/bin/uautomizer-verify-qhAvR1uOyd 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 -> 801883caffd8b582a36607f9ec62109ac5c5dc10c811693a281fb396b4b60131 [2024-11-13 16:25:06,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:25:06,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:25:06,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:25:06,488 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:25:06,488 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:25:06,490 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a30f96d-f8d6-42ed-b08f-6ef34abd7be3/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i Unable to find full path for "g++" [2024-11-13 16:25:08,349 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:25:08,648 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:25:08,648 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a30f96d-f8d6-42ed-b08f-6ef34abd7be3/sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2024-11-13 16:25:08,664 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a30f96d-f8d6-42ed-b08f-6ef34abd7be3/bin/uautomizer-verify-qhAvR1uOyd/data/cdc58bfbc/014e2e725801407aa381d8258c5d9ff0/FLAGd6e0c31e0 [2024-11-13 16:25:08,687 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a30f96d-f8d6-42ed-b08f-6ef34abd7be3/bin/uautomizer-verify-qhAvR1uOyd/data/cdc58bfbc/014e2e725801407aa381d8258c5d9ff0 [2024-11-13 16:25:08,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:25:08,691 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:25:08,692 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:25:08,693 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:25:08,697 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:25:08,698 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:25:08" (1/1) ... [2024-11-13 16:25:08,699 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aa294a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:25:08, skipping insertion in model container [2024-11-13 16:25:08,699 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:25:08" (1/1) ... [2024-11-13 16:25:08,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:25:09,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:25:09,099 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:25:09,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:25:09,186 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:25:09,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:25:09 WrapperNode [2024-11-13 16:25:09,187 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:25:09,188 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:25:09,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:25:09,189 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:25:09,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:25:09" (1/1) ... [2024-11-13 16:25:09,207 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:25:09" (1/1) ... [2024-11-13 16:25:09,226 INFO L138 Inliner]: procedures = 167, calls = 20, calls flagged for inlining = 4, calls inlined = 5, statements flattened = 89 [2024-11-13 16:25:09,226 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:25:09,227 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:25:09,227 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:25:09,227 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:25:09,233 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:25:09" (1/1) ... [2024-11-13 16:25:09,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:25:09" (1/1) ... [2024-11-13 16:25:09,236 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:25:09" (1/1) ... [2024-11-13 16:25:09,236 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:25:09" (1/1) ... [2024-11-13 16:25:09,241 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:25:09" (1/1) ... [2024-11-13 16:25:09,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:25:09" (1/1) ... [2024-11-13 16:25:09,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:25:09" (1/1) ... [2024-11-13 16:25:09,246 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:25:09" (1/1) ... [2024-11-13 16:25:09,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:25:09,249 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:25:09,249 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:25:09,249 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:25:09,250 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:25:09" (1/1) ... [2024-11-13 16:25:09,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:25:09,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a30f96d-f8d6-42ed-b08f-6ef34abd7be3/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:25:09,286 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a30f96d-f8d6-42ed-b08f-6ef34abd7be3/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 16:25:09,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a30f96d-f8d6-42ed-b08f-6ef34abd7be3/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 16:25:09,311 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-13 16:25:09,312 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-13 16:25:09,312 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-13 16:25:09,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:25:09,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-13 16:25:09,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 16:25:09,312 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-13 16:25:09,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:25:09,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:25:09,313 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 16:25:09,498 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:25:09,500 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:25:09,761 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 16:25:09,762 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:25:09,801 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:25:09,801 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 16:25:09,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:25:09 BoogieIcfgContainer [2024-11-13 16:25:09,802 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:25:09,806 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 16:25:09,806 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 16:25:09,811 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 16:25:09,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 04:25:08" (1/3) ... [2024-11-13 16:25:09,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74fc2449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:25:09, skipping insertion in model container [2024-11-13 16:25:09,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:25:09" (2/3) ... [2024-11-13 16:25:09,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74fc2449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:25:09, skipping insertion in model container [2024-11-13 16:25:09,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:25:09" (3/3) ... [2024-11-13 16:25:09,816 INFO L112 eAbstractionObserver]: Analyzing ICFG 48_ticket_lock_low_contention_vs-pthread.i [2024-11-13 16:25:09,835 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 16:25:09,837 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG 48_ticket_lock_low_contention_vs-pthread.i that has 2 procedures, 97 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2024-11-13 16:25:09,838 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 16:25:09,922 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 16:25:09,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 102 transitions, 208 flow [2024-11-13 16:25:10,060 INFO L124 PetriNetUnfolderBase]: 8/152 cut-off events. [2024-11-13 16:25:10,063 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 16:25:10,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 152 events. 8/152 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 361 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 80. Up to 4 conditions per place. [2024-11-13 16:25:10,071 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 102 transitions, 208 flow [2024-11-13 16:25:10,077 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 102 transitions, 208 flow [2024-11-13 16:25:10,091 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 16:25:10,110 INFO L333 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, 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;@2d6f29ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 16:25:10,111 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-13 16:25:10,131 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 16:25:10,131 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2024-11-13 16:25:10,131 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 16:25:10,131 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:25:10,132 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:25:10,132 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-13 16:25:10,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:10,138 INFO L85 PathProgramCache]: Analyzing trace with hash -536072465, now seen corresponding path program 1 times [2024-11-13 16:25:10,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:10,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043199890] [2024-11-13 16:25:10,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:10,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:10,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:25:10,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:10,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043199890] [2024-11-13 16:25:10,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043199890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:10,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:10,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:25:10,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878045793] [2024-11-13 16:25:10,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:10,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 16:25:10,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:10,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 16:25:10,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 16:25:10,379 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 102 [2024-11-13 16:25:10,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 102 transitions, 208 flow. Second operand has 2 states, 2 states have (on average 91.0) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:25:10,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:25:10,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 102 [2024-11-13 16:25:10,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:25:10,473 INFO L124 PetriNetUnfolderBase]: 4/192 cut-off events. [2024-11-13 16:25:10,473 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-13 16:25:10,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 192 events. 4/192 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 539 event pairs, 4 based on Foata normal form. 16/184 useless extension candidates. Maximal degree in co-relation 137. Up to 16 conditions per place. [2024-11-13 16:25:10,476 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 5 selfloop transitions, 0 changer transitions 0/93 dead transitions. [2024-11-13 16:25:10,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 93 transitions, 200 flow [2024-11-13 16:25:10,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 16:25:10,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-13 16:25:10,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 190 transitions. [2024-11-13 16:25:10,530 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9313725490196079 [2024-11-13 16:25:10,533 INFO L175 Difference]: Start difference. First operand has 100 places, 102 transitions, 208 flow. Second operand 2 states and 190 transitions. [2024-11-13 16:25:10,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 93 transitions, 200 flow [2024-11-13 16:25:10,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 93 transitions, 200 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 16:25:10,550 INFO L231 Difference]: Finished difference. Result has 97 places, 93 transitions, 190 flow [2024-11-13 16:25:10,554 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=190, PETRI_PLACES=97, PETRI_TRANSITIONS=93} [2024-11-13 16:25:10,559 INFO L277 CegarLoopForPetriNet]: 100 programPoint places, -3 predicate places. [2024-11-13 16:25:10,559 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 93 transitions, 190 flow [2024-11-13 16:25:10,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 91.0) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:25:10,560 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:25:10,560 INFO L204 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] [2024-11-13 16:25:10,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 16:25:10,562 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-13 16:25:10,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:10,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1403006105, now seen corresponding path program 1 times [2024-11-13 16:25:10,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:10,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557734797] [2024-11-13 16:25:10,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:10,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:10,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:25:10,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:10,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557734797] [2024-11-13 16:25:10,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557734797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:10,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:10,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:25:10,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738237991] [2024-11-13 16:25:10,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:10,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:25:10,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:10,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:25:10,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:25:10,801 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 102 [2024-11-13 16:25:10,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 93 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:25:10,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:25:10,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 102 [2024-11-13 16:25:10,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:25:10,988 INFO L124 PetriNetUnfolderBase]: 59/451 cut-off events. [2024-11-13 16:25:10,988 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-13 16:25:10,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 451 events. 59/451 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2346 event pairs, 41 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 600. Up to 126 conditions per place. [2024-11-13 16:25:10,992 INFO L140 encePairwiseOnDemand]: 95/102 looper letters, 18 selfloop transitions, 6 changer transitions 0/100 dead transitions. [2024-11-13 16:25:10,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 100 transitions, 252 flow [2024-11-13 16:25:10,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:25:10,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:25:10,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2024-11-13 16:25:10,995 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8464052287581699 [2024-11-13 16:25:10,995 INFO L175 Difference]: Start difference. First operand has 97 places, 93 transitions, 190 flow. Second operand 3 states and 259 transitions. [2024-11-13 16:25:10,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 100 transitions, 252 flow [2024-11-13 16:25:10,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 100 transitions, 252 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 16:25:10,999 INFO L231 Difference]: Finished difference. Result has 101 places, 98 transitions, 236 flow [2024-11-13 16:25:11,000 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=101, PETRI_TRANSITIONS=98} [2024-11-13 16:25:11,000 INFO L277 CegarLoopForPetriNet]: 100 programPoint places, 1 predicate places. [2024-11-13 16:25:11,001 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 98 transitions, 236 flow [2024-11-13 16:25:11,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:25:11,001 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:25:11,001 INFO L204 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] [2024-11-13 16:25:11,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 16:25:11,002 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-13 16:25:11,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:11,002 INFO L85 PathProgramCache]: Analyzing trace with hash 764949786, now seen corresponding path program 1 times [2024-11-13 16:25:11,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:11,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724687811] [2024-11-13 16:25:11,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:11,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:11,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:25:11,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:11,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724687811] [2024-11-13 16:25:11,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724687811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:11,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:11,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:25:11,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578013825] [2024-11-13 16:25:11,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:11,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:25:11,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:11,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:25:11,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:25:11,175 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 102 [2024-11-13 16:25:11,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 98 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:25:11,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:25:11,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 102 [2024-11-13 16:25:11,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:25:11,282 INFO L124 PetriNetUnfolderBase]: 64/430 cut-off events. [2024-11-13 16:25:11,282 INFO L125 PetriNetUnfolderBase]: For 46/48 co-relation queries the response was YES. [2024-11-13 16:25:11,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 676 conditions, 430 events. 64/430 cut-off events. For 46/48 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2337 event pairs, 32 based on Foata normal form. 0/375 useless extension candidates. Maximal degree in co-relation 670. Up to 119 conditions per place. [2024-11-13 16:25:11,286 INFO L140 encePairwiseOnDemand]: 95/102 looper letters, 18 selfloop transitions, 7 changer transitions 0/105 dead transitions. [2024-11-13 16:25:11,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 105 transitions, 304 flow [2024-11-13 16:25:11,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:25:11,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:25:11,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2024-11-13 16:25:11,294 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8594771241830066 [2024-11-13 16:25:11,295 INFO L175 Difference]: Start difference. First operand has 101 places, 98 transitions, 236 flow. Second operand 3 states and 263 transitions. [2024-11-13 16:25:11,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 105 transitions, 304 flow [2024-11-13 16:25:11,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 105 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:25:11,301 INFO L231 Difference]: Finished difference. Result has 103 places, 103 transitions, 276 flow [2024-11-13 16:25:11,304 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=103, PETRI_TRANSITIONS=103} [2024-11-13 16:25:11,305 INFO L277 CegarLoopForPetriNet]: 100 programPoint places, 3 predicate places. [2024-11-13 16:25:11,306 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 103 transitions, 276 flow [2024-11-13 16:25:11,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:25:11,306 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:25:11,306 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:25:11,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 16:25:11,307 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-13 16:25:11,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:11,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1044898571, now seen corresponding path program 1 times [2024-11-13 16:25:11,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:11,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288113964] [2024-11-13 16:25:11,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:11,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:11,361 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:25:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:11,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:25:11,404 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 16:25:11,405 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2024-11-13 16:25:11,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2024-11-13 16:25:11,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2024-11-13 16:25:11,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2024-11-13 16:25:11,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2024-11-13 16:25:11,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2024-11-13 16:25:11,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2024-11-13 16:25:11,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2024-11-13 16:25:11,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2024-11-13 16:25:11,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2024-11-13 16:25:11,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 16:25:11,413 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-13 16:25:11,420 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 16:25:11,420 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-13 16:25:11,474 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 16:25:11,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 133 transitions, 276 flow [2024-11-13 16:25:11,525 INFO L124 PetriNetUnfolderBase]: 13/233 cut-off events. [2024-11-13 16:25:11,526 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-13 16:25:11,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 233 events. 13/233 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 766 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 153. Up to 6 conditions per place. [2024-11-13 16:25:11,529 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 133 transitions, 276 flow [2024-11-13 16:25:11,531 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 133 transitions, 276 flow [2024-11-13 16:25:11,538 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 16:25:11,539 INFO L333 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, 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;@2d6f29ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 16:25:11,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-13 16:25:11,547 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 16:25:11,547 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2024-11-13 16:25:11,548 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 16:25:11,548 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:25:11,548 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:25:11,548 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-13 16:25:11,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:11,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1395220, now seen corresponding path program 1 times [2024-11-13 16:25:11,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:11,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135887289] [2024-11-13 16:25:11,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:11,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:11,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:25:11,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:11,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135887289] [2024-11-13 16:25:11,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135887289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:11,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:11,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:25:11,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471083434] [2024-11-13 16:25:11,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:11,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 16:25:11,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:11,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 16:25:11,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 16:25:11,615 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 133 [2024-11-13 16:25:11,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 133 transitions, 276 flow. Second operand has 2 states, 2 states have (on average 116.0) internal successors, (232), 2 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:25:11,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:25:11,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 133 [2024-11-13 16:25:11,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:25:11,776 INFO L124 PetriNetUnfolderBase]: 34/569 cut-off events. [2024-11-13 16:25:11,777 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-13 16:25:11,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 656 conditions, 569 events. 34/569 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3251 event pairs, 34 based on Foata normal form. 67/549 useless extension candidates. Maximal degree in co-relation 429. Up to 73 conditions per place. [2024-11-13 16:25:11,781 INFO L140 encePairwiseOnDemand]: 126/133 looper letters, 8 selfloop transitions, 0 changer transitions 0/120 dead transitions. [2024-11-13 16:25:11,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 120 transitions, 266 flow [2024-11-13 16:25:11,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 16:25:11,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-13 16:25:11,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 245 transitions. [2024-11-13 16:25:11,783 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9210526315789473 [2024-11-13 16:25:11,784 INFO L175 Difference]: Start difference. First operand has 131 places, 133 transitions, 276 flow. Second operand 2 states and 245 transitions. [2024-11-13 16:25:11,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 120 transitions, 266 flow [2024-11-13 16:25:11,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 120 transitions, 266 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 16:25:11,790 INFO L231 Difference]: Finished difference. Result has 126 places, 120 transitions, 250 flow [2024-11-13 16:25:11,790 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=250, PETRI_PLACES=126, PETRI_TRANSITIONS=120} [2024-11-13 16:25:11,791 INFO L277 CegarLoopForPetriNet]: 131 programPoint places, -5 predicate places. [2024-11-13 16:25:11,791 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 120 transitions, 250 flow [2024-11-13 16:25:11,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 116.0) internal successors, (232), 2 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:25:11,795 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:25:11,796 INFO L204 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] [2024-11-13 16:25:11,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 16:25:11,796 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-13 16:25:11,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:11,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1464862521, now seen corresponding path program 1 times [2024-11-13 16:25:11,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:11,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464641364] [2024-11-13 16:25:11,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:11,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:11,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:25:11,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:11,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464641364] [2024-11-13 16:25:11,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464641364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:11,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:11,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:25:11,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129437485] [2024-11-13 16:25:11,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:11,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:25:11,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:11,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:25:11,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:25:11,988 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 133 [2024-11-13 16:25:11,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 120 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:25:11,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:25:11,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 133 [2024-11-13 16:25:11,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:25:12,553 INFO L124 PetriNetUnfolderBase]: 845/3286 cut-off events. [2024-11-13 16:25:12,554 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-13 16:25:12,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4736 conditions, 3286 events. 845/3286 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 29765 event pairs, 632 based on Foata normal form. 0/2786 useless extension candidates. Maximal degree in co-relation 4731. Up to 1252 conditions per place. [2024-11-13 16:25:12,581 INFO L140 encePairwiseOnDemand]: 123/133 looper letters, 26 selfloop transitions, 9 changer transitions 0/132 dead transitions. [2024-11-13 16:25:12,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 132 transitions, 344 flow [2024-11-13 16:25:12,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:25:12,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:25:12,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2024-11-13 16:25:12,583 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8421052631578947 [2024-11-13 16:25:12,583 INFO L175 Difference]: Start difference. First operand has 126 places, 120 transitions, 250 flow. Second operand 3 states and 336 transitions. [2024-11-13 16:25:12,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 132 transitions, 344 flow [2024-11-13 16:25:12,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 132 transitions, 344 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 16:25:12,587 INFO L231 Difference]: Finished difference. Result has 130 places, 128 transitions, 320 flow [2024-11-13 16:25:12,588 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=320, PETRI_PLACES=130, PETRI_TRANSITIONS=128} [2024-11-13 16:25:12,589 INFO L277 CegarLoopForPetriNet]: 131 programPoint places, -1 predicate places. [2024-11-13 16:25:12,589 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 128 transitions, 320 flow [2024-11-13 16:25:12,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:25:12,590 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:25:12,590 INFO L204 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] [2024-11-13 16:25:12,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 16:25:12,592 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-13 16:25:12,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:12,592 INFO L85 PathProgramCache]: Analyzing trace with hash 875044351, now seen corresponding path program 1 times [2024-11-13 16:25:12,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:12,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481403524] [2024-11-13 16:25:12,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:12,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:12,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:25:12,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:12,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481403524] [2024-11-13 16:25:12,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481403524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:12,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:12,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:25:12,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303631516] [2024-11-13 16:25:12,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:12,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:25:12,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:12,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:25:12,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:25:12,758 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 133 [2024-11-13 16:25:12,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 128 transitions, 320 flow. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:25:12,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:25:12,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 133 [2024-11-13 16:25:12,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:25:13,327 INFO L124 PetriNetUnfolderBase]: 1084/3755 cut-off events. [2024-11-13 16:25:13,327 INFO L125 PetriNetUnfolderBase]: For 840/983 co-relation queries the response was YES. [2024-11-13 16:25:13,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6650 conditions, 3755 events. 1084/3755 cut-off events. For 840/983 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 35103 event pairs, 603 based on Foata normal form. 3/3173 useless extension candidates. Maximal degree in co-relation 6643. Up to 1421 conditions per place. [2024-11-13 16:25:13,358 INFO L140 encePairwiseOnDemand]: 123/133 looper letters, 30 selfloop transitions, 13 changer transitions 0/144 dead transitions. [2024-11-13 16:25:13,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 144 transitions, 465 flow [2024-11-13 16:25:13,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:25:13,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:25:13,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2024-11-13 16:25:13,361 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8546365914786967 [2024-11-13 16:25:13,361 INFO L175 Difference]: Start difference. First operand has 130 places, 128 transitions, 320 flow. Second operand 3 states and 341 transitions. [2024-11-13 16:25:13,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 144 transitions, 465 flow [2024-11-13 16:25:13,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 144 transitions, 439 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:25:13,378 INFO L231 Difference]: Finished difference. Result has 132 places, 139 transitions, 414 flow [2024-11-13 16:25:13,378 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=414, PETRI_PLACES=132, PETRI_TRANSITIONS=139} [2024-11-13 16:25:13,379 INFO L277 CegarLoopForPetriNet]: 131 programPoint places, 1 predicate places. [2024-11-13 16:25:13,379 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 139 transitions, 414 flow [2024-11-13 16:25:13,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:25:13,380 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:25:13,380 INFO L204 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] [2024-11-13 16:25:13,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 16:25:13,381 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-13 16:25:13,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:13,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1442953430, now seen corresponding path program 1 times [2024-11-13 16:25:13,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:13,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80572692] [2024-11-13 16:25:13,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:13,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:13,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:25:13,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:13,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80572692] [2024-11-13 16:25:13,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80572692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:13,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:13,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:25:13,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570303145] [2024-11-13 16:25:13,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:13,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:25:13,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:13,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:25:13,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:25:13,525 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 133 [2024-11-13 16:25:13,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 139 transitions, 414 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:25:13,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:25:13,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 133 [2024-11-13 16:25:13,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:25:14,603 INFO L124 PetriNetUnfolderBase]: 2061/6893 cut-off events. [2024-11-13 16:25:14,603 INFO L125 PetriNetUnfolderBase]: For 3718/3891 co-relation queries the response was YES. [2024-11-13 16:25:14,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13662 conditions, 6893 events. 2061/6893 cut-off events. For 3718/3891 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 72234 event pairs, 630 based on Foata normal form. 7/5764 useless extension candidates. Maximal degree in co-relation 13654. Up to 1788 conditions per place. [2024-11-13 16:25:14,658 INFO L140 encePairwiseOnDemand]: 118/133 looper letters, 44 selfloop transitions, 26 changer transitions 0/171 dead transitions. [2024-11-13 16:25:14,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 171 transitions, 713 flow [2024-11-13 16:25:14,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:25:14,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:25:14,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2024-11-13 16:25:14,660 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8646616541353384 [2024-11-13 16:25:14,660 INFO L175 Difference]: Start difference. First operand has 132 places, 139 transitions, 414 flow. Second operand 3 states and 345 transitions. [2024-11-13 16:25:14,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 171 transitions, 713 flow [2024-11-13 16:25:14,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 171 transitions, 669 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:25:14,673 INFO L231 Difference]: Finished difference. Result has 134 places, 164 transitions, 670 flow [2024-11-13 16:25:14,673 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=670, PETRI_PLACES=134, PETRI_TRANSITIONS=164} [2024-11-13 16:25:14,674 INFO L277 CegarLoopForPetriNet]: 131 programPoint places, 3 predicate places. [2024-11-13 16:25:14,674 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 164 transitions, 670 flow [2024-11-13 16:25:14,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:25:14,674 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:25:14,675 INFO L204 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] [2024-11-13 16:25:14,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 16:25:14,675 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-13 16:25:14,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:14,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1787316801, now seen corresponding path program 1 times [2024-11-13 16:25:14,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:14,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972981552] [2024-11-13 16:25:14,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:14,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:14,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:25:14,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:14,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972981552] [2024-11-13 16:25:14,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972981552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:14,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:14,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:25:14,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552739963] [2024-11-13 16:25:14,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:14,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:25:14,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:14,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:25:14,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:25:14,820 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 133 [2024-11-13 16:25:14,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 164 transitions, 670 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:25:14,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:25:14,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 133 [2024-11-13 16:25:14,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:25:16,130 INFO L124 PetriNetUnfolderBase]: 2966/9758 cut-off events. [2024-11-13 16:25:16,131 INFO L125 PetriNetUnfolderBase]: For 14821/15248 co-relation queries the response was YES. [2024-11-13 16:25:16,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23392 conditions, 9758 events. 2966/9758 cut-off events. For 14821/15248 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 105997 event pairs, 1072 based on Foata normal form. 41/8332 useless extension candidates. Maximal degree in co-relation 23383. Up to 3627 conditions per place. [2024-11-13 16:25:16,204 INFO L140 encePairwiseOnDemand]: 123/133 looper letters, 60 selfloop transitions, 22 changer transitions 0/186 dead transitions. [2024-11-13 16:25:16,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 186 transitions, 982 flow [2024-11-13 16:25:16,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:25:16,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:25:16,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2024-11-13 16:25:16,207 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8421052631578947 [2024-11-13 16:25:16,207 INFO L175 Difference]: Start difference. First operand has 134 places, 164 transitions, 670 flow. Second operand 3 states and 336 transitions. [2024-11-13 16:25:16,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 186 transitions, 982 flow [2024-11-13 16:25:16,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 186 transitions, 914 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:25:16,226 INFO L231 Difference]: Finished difference. Result has 136 places, 182 transitions, 868 flow [2024-11-13 16:25:16,227 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=868, PETRI_PLACES=136, PETRI_TRANSITIONS=182} [2024-11-13 16:25:16,230 INFO L277 CegarLoopForPetriNet]: 131 programPoint places, 5 predicate places. [2024-11-13 16:25:16,231 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 182 transitions, 868 flow [2024-11-13 16:25:16,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:25:16,231 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:25:16,231 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:25:16,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 16:25:16,232 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-13 16:25:16,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:16,232 INFO L85 PathProgramCache]: Analyzing trace with hash -461021812, now seen corresponding path program 1 times [2024-11-13 16:25:16,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:16,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048841718] [2024-11-13 16:25:16,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:16,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:16,277 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 16:25:16,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:16,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048841718] [2024-11-13 16:25:16,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048841718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:16,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:16,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:25:16,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063135350] [2024-11-13 16:25:16,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:16,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:25:16,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:16,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:25:16,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:25:16,335 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 133 [2024-11-13 16:25:16,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 182 transitions, 868 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:25:16,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:25:16,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 133 [2024-11-13 16:25:16,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:25:17,623 INFO L124 PetriNetUnfolderBase]: 3533/10649 cut-off events. [2024-11-13 16:25:17,623 INFO L125 PetriNetUnfolderBase]: For 19248/19689 co-relation queries the response was YES. [2024-11-13 16:25:17,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27776 conditions, 10649 events. 3533/10649 cut-off events. For 19248/19689 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 115646 event pairs, 994 based on Foata normal form. 26/8883 useless extension candidates. Maximal degree in co-relation 27766. Up to 3995 conditions per place. [2024-11-13 16:25:17,715 INFO L140 encePairwiseOnDemand]: 123/133 looper letters, 68 selfloop transitions, 36 changer transitions 0/212 dead transitions. [2024-11-13 16:25:17,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 212 transitions, 1290 flow [2024-11-13 16:25:17,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:25:17,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:25:17,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2024-11-13 16:25:17,718 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8521303258145363 [2024-11-13 16:25:17,718 INFO L175 Difference]: Start difference. First operand has 136 places, 182 transitions, 868 flow. Second operand 3 states and 340 transitions. [2024-11-13 16:25:17,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 212 transitions, 1290 flow [2024-11-13 16:25:17,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 212 transitions, 1190 flow, removed 20 selfloop flow, removed 2 redundant places. [2024-11-13 16:25:17,780 INFO L231 Difference]: Finished difference. Result has 138 places, 208 transitions, 1172 flow [2024-11-13 16:25:17,781 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1172, PETRI_PLACES=138, PETRI_TRANSITIONS=208} [2024-11-13 16:25:17,782 INFO L277 CegarLoopForPetriNet]: 131 programPoint places, 7 predicate places. [2024-11-13 16:25:17,782 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 208 transitions, 1172 flow [2024-11-13 16:25:17,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:25:17,784 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:25:17,784 INFO L204 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] [2024-11-13 16:25:17,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 16:25:17,784 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-13 16:25:17,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:17,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1440669848, now seen corresponding path program 1 times [2024-11-13 16:25:17,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:17,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921838824] [2024-11-13 16:25:17,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:17,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:17,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:25:17,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:17,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921838824] [2024-11-13 16:25:17,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921838824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:17,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:17,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:25:17,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210760744] [2024-11-13 16:25:17,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:17,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:25:17,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:17,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:25:17,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:25:17,911 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 133 [2024-11-13 16:25:17,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 208 transitions, 1172 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:25:17,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:25:17,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 133 [2024-11-13 16:25:17,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:25:19,510 INFO L124 PetriNetUnfolderBase]: 4494/13133 cut-off events. [2024-11-13 16:25:19,511 INFO L125 PetriNetUnfolderBase]: For 33654/34227 co-relation queries the response was YES. [2024-11-13 16:25:19,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37404 conditions, 13133 events. 4494/13133 cut-off events. For 33654/34227 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 144716 event pairs, 1133 based on Foata normal form. 23/11006 useless extension candidates. Maximal degree in co-relation 37393. Up to 4861 conditions per place. [2024-11-13 16:25:19,594 INFO L140 encePairwiseOnDemand]: 123/133 looper letters, 91 selfloop transitions, 38 changer transitions 0/239 dead transitions. [2024-11-13 16:25:19,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 239 transitions, 1691 flow [2024-11-13 16:25:19,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:25:19,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:25:19,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2024-11-13 16:25:19,596 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8546365914786967 [2024-11-13 16:25:19,596 INFO L175 Difference]: Start difference. First operand has 138 places, 208 transitions, 1172 flow. Second operand 3 states and 341 transitions. [2024-11-13 16:25:19,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 239 transitions, 1691 flow [2024-11-13 16:25:19,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 239 transitions, 1603 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:25:19,625 INFO L231 Difference]: Finished difference. Result has 140 places, 234 transitions, 1536 flow [2024-11-13 16:25:19,626 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=1100, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1536, PETRI_PLACES=140, PETRI_TRANSITIONS=234} [2024-11-13 16:25:19,627 INFO L277 CegarLoopForPetriNet]: 131 programPoint places, 9 predicate places. [2024-11-13 16:25:19,627 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 234 transitions, 1536 flow [2024-11-13 16:25:19,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:25:19,628 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:25:19,629 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:25:19,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 16:25:19,629 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-13 16:25:19,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:19,629 INFO L85 PathProgramCache]: Analyzing trace with hash -395312282, now seen corresponding path program 1 times [2024-11-13 16:25:19,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:19,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678005379] [2024-11-13 16:25:19,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:19,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:19,655 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:25:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:19,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:25:19,678 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 16:25:19,678 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2024-11-13 16:25:19,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2024-11-13 16:25:19,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2024-11-13 16:25:19,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2024-11-13 16:25:19,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2024-11-13 16:25:19,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2024-11-13 16:25:19,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2024-11-13 16:25:19,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2024-11-13 16:25:19,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2024-11-13 16:25:19,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2024-11-13 16:25:19,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2024-11-13 16:25:19,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2024-11-13 16:25:19,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2024-11-13 16:25:19,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 16:25:19,680 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:25:19,681 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 16:25:19,681 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-13 16:25:19,721 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 16:25:19,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 164 transitions, 346 flow [2024-11-13 16:25:19,751 INFO L124 PetriNetUnfolderBase]: 18/314 cut-off events. [2024-11-13 16:25:19,751 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-13 16:25:19,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327 conditions, 314 events. 18/314 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1203 event pairs, 0 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 237. Up to 8 conditions per place. [2024-11-13 16:25:19,753 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 164 transitions, 346 flow [2024-11-13 16:25:19,757 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 164 transitions, 346 flow [2024-11-13 16:25:19,758 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 16:25:19,758 INFO L333 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, 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;@2d6f29ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 16:25:19,759 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-13 16:25:19,762 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 16:25:19,762 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2024-11-13 16:25:19,762 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 16:25:19,762 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:25:19,762 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:25:19,763 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-13 16:25:19,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:19,763 INFO L85 PathProgramCache]: Analyzing trace with hash 179742520, now seen corresponding path program 1 times [2024-11-13 16:25:19,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:19,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441216072] [2024-11-13 16:25:19,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:19,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:19,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:25:19,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:19,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441216072] [2024-11-13 16:25:19,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441216072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:19,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:19,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:25:19,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262577937] [2024-11-13 16:25:19,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:19,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 16:25:19,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:19,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 16:25:19,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 16:25:19,792 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 164 [2024-11-13 16:25:19,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 164 transitions, 346 flow. Second operand has 2 states, 2 states have (on average 141.0) internal successors, (282), 2 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:25:19,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:25:19,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 164 [2024-11-13 16:25:19,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:25:19,990 INFO L124 PetriNetUnfolderBase]: 178/1735 cut-off events. [2024-11-13 16:25:19,991 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-11-13 16:25:19,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2084 conditions, 1735 events. 178/1735 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 14468 event pairs, 178 based on Foata normal form. 260/1712 useless extension candidates. Maximal degree in co-relation 1375. Up to 298 conditions per place. [2024-11-13 16:25:20,004 INFO L140 encePairwiseOnDemand]: 155/164 looper letters, 11 selfloop transitions, 0 changer transitions 0/147 dead transitions. [2024-11-13 16:25:20,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 147 transitions, 334 flow [2024-11-13 16:25:20,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 16:25:20,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-13 16:25:20,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 300 transitions. [2024-11-13 16:25:20,006 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9146341463414634 [2024-11-13 16:25:20,006 INFO L175 Difference]: Start difference. First operand has 162 places, 164 transitions, 346 flow. Second operand 2 states and 300 transitions. [2024-11-13 16:25:20,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 147 transitions, 334 flow [2024-11-13 16:25:20,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 147 transitions, 332 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-11-13 16:25:20,008 INFO L231 Difference]: Finished difference. Result has 155 places, 147 transitions, 310 flow [2024-11-13 16:25:20,009 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=310, PETRI_PLACES=155, PETRI_TRANSITIONS=147} [2024-11-13 16:25:20,009 INFO L277 CegarLoopForPetriNet]: 162 programPoint places, -7 predicate places. [2024-11-13 16:25:20,009 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 147 transitions, 310 flow [2024-11-13 16:25:20,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 141.0) internal successors, (282), 2 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:25:20,010 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:25:20,011 INFO L204 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] [2024-11-13 16:25:20,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 16:25:20,011 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-13 16:25:20,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:20,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1734894521, now seen corresponding path program 1 times [2024-11-13 16:25:20,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:20,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840331805] [2024-11-13 16:25:20,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:20,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:20,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:25:20,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:20,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840331805] [2024-11-13 16:25:20,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840331805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:20,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:20,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:25:20,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693232149] [2024-11-13 16:25:20,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:20,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:25:20,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:20,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:25:20,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:25:20,119 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 164 [2024-11-13 16:25:20,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 147 transitions, 310 flow. Second operand has 3 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) [2024-11-13 16:25:20,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:25:20,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 164 [2024-11-13 16:25:20,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:25:22,142 INFO L124 PetriNetUnfolderBase]: 8153/23047 cut-off events. [2024-11-13 16:25:22,143 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2024-11-13 16:25:22,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34914 conditions, 23047 events. 8153/23047 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 265886 event pairs, 6332 based on Foata normal form. 0/19802 useless extension candidates. Maximal degree in co-relation 34908. Up to 10488 conditions per place. [2024-11-13 16:25:22,270 INFO L140 encePairwiseOnDemand]: 151/164 looper letters, 34 selfloop transitions, 12 changer transitions 0/164 dead transitions. [2024-11-13 16:25:22,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 164 transitions, 436 flow [2024-11-13 16:25:22,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:25:22,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:25:22,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2024-11-13 16:25:22,272 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8394308943089431 [2024-11-13 16:25:22,273 INFO L175 Difference]: Start difference. First operand has 155 places, 147 transitions, 310 flow. Second operand 3 states and 413 transitions. [2024-11-13 16:25:22,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 164 transitions, 436 flow [2024-11-13 16:25:22,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 164 transitions, 436 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 16:25:22,276 INFO L231 Difference]: Finished difference. Result has 159 places, 158 transitions, 404 flow [2024-11-13 16:25:22,276 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=404, PETRI_PLACES=159, PETRI_TRANSITIONS=158} [2024-11-13 16:25:22,277 INFO L277 CegarLoopForPetriNet]: 162 programPoint places, -3 predicate places. [2024-11-13 16:25:22,277 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 158 transitions, 404 flow [2024-11-13 16:25:22,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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) [2024-11-13 16:25:22,277 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:25:22,278 INFO L204 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] [2024-11-13 16:25:22,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 16:25:22,278 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-13 16:25:22,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:22,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1400804421, now seen corresponding path program 1 times [2024-11-13 16:25:22,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:22,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130250675] [2024-11-13 16:25:22,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:22,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:22,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:25:22,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:22,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130250675] [2024-11-13 16:25:22,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130250675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:22,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:22,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:25:22,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338371517] [2024-11-13 16:25:22,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:22,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:25:22,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:22,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:25:22,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:25:22,387 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 164 [2024-11-13 16:25:22,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 158 transitions, 404 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:25:22,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:25:22,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 164 [2024-11-13 16:25:22,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:25:25,190 INFO L124 PetriNetUnfolderBase]: 11178/29087 cut-off events. [2024-11-13 16:25:25,190 INFO L125 PetriNetUnfolderBase]: For 7954/9108 co-relation queries the response was YES. [2024-11-13 16:25:25,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55171 conditions, 29087 events. 11178/29087 cut-off events. For 7954/9108 co-relation queries the response was YES. Maximal size of possible extension queue 1023. Compared 339404 event pairs, 6744 based on Foata normal form. 28/24712 useless extension candidates. Maximal degree in co-relation 55163. Up to 13136 conditions per place. [2024-11-13 16:25:25,393 INFO L140 encePairwiseOnDemand]: 151/164 looper letters, 42 selfloop transitions, 19 changer transitions 0/183 dead transitions. [2024-11-13 16:25:25,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 183 transitions, 626 flow [2024-11-13 16:25:25,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:25:25,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:25:25,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2024-11-13 16:25:25,396 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8516260162601627 [2024-11-13 16:25:25,396 INFO L175 Difference]: Start difference. First operand has 159 places, 158 transitions, 404 flow. Second operand 3 states and 419 transitions. [2024-11-13 16:25:25,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 183 transitions, 626 flow [2024-11-13 16:25:25,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 183 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:25:25,491 INFO L231 Difference]: Finished difference. Result has 161 places, 175 transitions, 552 flow [2024-11-13 16:25:25,491 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=161, PETRI_TRANSITIONS=175} [2024-11-13 16:25:25,492 INFO L277 CegarLoopForPetriNet]: 162 programPoint places, -1 predicate places. [2024-11-13 16:25:25,492 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 175 transitions, 552 flow [2024-11-13 16:25:25,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:25:25,492 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:25:25,492 INFO L204 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] [2024-11-13 16:25:25,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 16:25:25,493 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-13 16:25:25,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:25,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1393223986, now seen corresponding path program 1 times [2024-11-13 16:25:25,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:25,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296731546] [2024-11-13 16:25:25,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:25,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:25,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:25:25,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:25,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296731546] [2024-11-13 16:25:25,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296731546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:25,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:25,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:25:25,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635384779] [2024-11-13 16:25:25,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:25,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:25:25,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:25,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:25:25,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:25:25,807 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 164 [2024-11-13 16:25:25,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 175 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:25:25,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:25:25,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 164 [2024-11-13 16:25:25,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:25:30,230 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][151], [Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 26#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 161#true, 172#true, 179#(= |#race~c~0| 0), 110#L693-7true, 16#L693-6true, 165#true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 71#L693-7true, 159#true, 163#true]) [2024-11-13 16:25:30,230 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-13 16:25:30,230 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:30,230 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:30,231 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:30,546 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][217], [Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 177#true, 26#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 161#true, 172#true, 165#true, 107#L693-4true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 71#L693-7true, 159#true, 163#true, 55#L693-14true]) [2024-11-13 16:25:30,546 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2024-11-13 16:25:30,546 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:30,546 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:30,547 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:30,559 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([625] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][199], [Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 177#true, 26#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 161#true, 172#true, 110#L693-7true, 165#true, 107#L693-4true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 159#true, 163#true, 92#L693-14true]) [2024-11-13 16:25:30,559 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2024-11-13 16:25:30,559 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:30,559 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:30,559 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:31,226 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([625] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][128], [Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 177#true, 26#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 161#true, 172#true, 110#L693-7true, 165#true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 159#true, 163#true, 92#L693-14true, 150#L693-5true]) [2024-11-13 16:25:31,226 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2024-11-13 16:25:31,226 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:31,226 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:31,226 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:31,227 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][177], [Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 177#true, 26#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 161#true, 172#true, 165#true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 71#L693-7true, 159#true, 163#true, 55#L693-14true, 150#L693-5true]) [2024-11-13 16:25:31,228 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2024-11-13 16:25:31,228 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:31,228 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:31,228 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:34,332 INFO L124 PetriNetUnfolderBase]: 31822/78790 cut-off events. [2024-11-13 16:25:34,332 INFO L125 PetriNetUnfolderBase]: For 55750/57426 co-relation queries the response was YES. [2024-11-13 16:25:34,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171120 conditions, 78790 events. 31822/78790 cut-off events. For 55750/57426 co-relation queries the response was YES. Maximal size of possible extension queue 2883. Compared 1032601 event pairs, 10576 based on Foata normal form. 71/64975 useless extension candidates. Maximal degree in co-relation 171111. Up to 24692 conditions per place. [2024-11-13 16:25:34,812 INFO L140 encePairwiseOnDemand]: 144/164 looper letters, 65 selfloop transitions, 40 changer transitions 0/225 dead transitions. [2024-11-13 16:25:34,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 225 transitions, 1034 flow [2024-11-13 16:25:34,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:25:34,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:25:34,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2024-11-13 16:25:34,814 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8556910569105691 [2024-11-13 16:25:34,814 INFO L175 Difference]: Start difference. First operand has 161 places, 175 transitions, 552 flow. Second operand 3 states and 421 transitions. [2024-11-13 16:25:34,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 225 transitions, 1034 flow [2024-11-13 16:25:35,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 225 transitions, 962 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:25:35,067 INFO L231 Difference]: Finished difference. Result has 163 places, 215 transitions, 970 flow [2024-11-13 16:25:35,067 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=970, PETRI_PLACES=163, PETRI_TRANSITIONS=215} [2024-11-13 16:25:35,068 INFO L277 CegarLoopForPetriNet]: 162 programPoint places, 1 predicate places. [2024-11-13 16:25:35,068 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 215 transitions, 970 flow [2024-11-13 16:25:35,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:25:35,068 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:25:35,068 INFO L204 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] [2024-11-13 16:25:35,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 16:25:35,068 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-13 16:25:35,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:35,069 INFO L85 PathProgramCache]: Analyzing trace with hash 766097601, now seen corresponding path program 1 times [2024-11-13 16:25:35,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:35,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113888932] [2024-11-13 16:25:35,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:35,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:35,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:25:35,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:35,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113888932] [2024-11-13 16:25:35,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113888932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:35,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:35,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:25:35,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941987112] [2024-11-13 16:25:35,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:35,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:25:35,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:35,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:25:35,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:25:35,205 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 164 [2024-11-13 16:25:35,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 215 transitions, 970 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) [2024-11-13 16:25:35,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:25:35,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 164 [2024-11-13 16:25:35,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:25:38,661 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][144], [161#true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 71#L693-7true, 117#L693-7true, 159#true, 87#L693-6true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, 179#(= |#race~c~0| 0), Black: 177#true, 165#true, 163#true, 89#L692-3true]) [2024-11-13 16:25:38,661 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2024-11-13 16:25:38,661 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-13 16:25:38,661 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-13 16:25:38,661 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-13 16:25:38,688 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][145], [161#true, 16#L693-6true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, 71#L693-7true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, 179#(= |#race~c~0| 0), Black: 177#true, 165#true, 89#L692-3true, 163#true]) [2024-11-13 16:25:38,688 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2024-11-13 16:25:38,688 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-13 16:25:38,688 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-13 16:25:38,688 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-13 16:25:38,763 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([549] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][199], [120#L693-3true, 161#true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-4true, 117#L693-7true, 71#L693-7true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, 177#true, Black: 179#(= |#race~c~0| 0), 165#true, 163#true]) [2024-11-13 16:25:38,763 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-13 16:25:38,763 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-13 16:25:38,763 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-13 16:25:38,763 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-13 16:25:38,815 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([549] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][219], [120#L693-3true, 161#true, 107#L693-4true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, 71#L693-7true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 177#true, 182#true, Black: 179#(= |#race~c~0| 0), 165#true, 163#true]) [2024-11-13 16:25:38,815 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-13 16:25:38,815 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-13 16:25:38,815 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-13 16:25:38,815 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-13 16:25:39,081 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([625] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][168], [161#true, 91#L693-4true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 117#L693-7true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 177#true, 182#true, Black: 179#(= |#race~c~0| 0), 165#true, 92#L693-14true, 89#L692-3true, 163#true]) [2024-11-13 16:25:39,082 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-13 16:25:39,082 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-13 16:25:39,082 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-13 16:25:39,082 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-13 16:25:39,161 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([625] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][198], [161#true, 107#L693-4true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 177#true, 182#true, Black: 179#(= |#race~c~0| 0), 165#true, 163#true, 89#L692-3true, 92#L693-14true]) [2024-11-13 16:25:39,161 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-13 16:25:39,161 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-13 16:25:39,161 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-13 16:25:39,161 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-13 16:25:39,207 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([595] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread1of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][159], [161#true, 107#L693-4true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 71#L693-7true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 177#true, 182#true, Black: 179#(= |#race~c~0| 0), 39#L693-14true, 165#true, 89#L692-3true, 163#true]) [2024-11-13 16:25:39,207 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-13 16:25:39,207 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-13 16:25:39,207 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-13 16:25:39,207 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-13 16:25:39,728 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([595] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread1of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][74], [161#true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 71#L693-7true, 159#true, 150#L693-5true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, 177#true, Black: 179#(= |#race~c~0| 0), 39#L693-14true, 165#true, 89#L692-3true, 163#true]) [2024-11-13 16:25:39,728 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2024-11-13 16:25:39,728 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-11-13 16:25:39,728 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-11-13 16:25:39,728 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-11-13 16:25:40,005 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([625] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][123], [161#true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 117#L693-7true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 177#true, 182#true, Black: 179#(= |#race~c~0| 0), 165#true, 58#L693-5true, 89#L692-3true, 92#L693-14true, 163#true]) [2024-11-13 16:25:40,005 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2024-11-13 16:25:40,005 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-11-13 16:25:40,005 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-11-13 16:25:40,005 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-11-13 16:25:40,055 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([625] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][123], [161#true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, 159#true, 150#L693-5true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, 177#true, Black: 179#(= |#race~c~0| 0), 165#true, 92#L693-14true, 89#L692-3true, 163#true]) [2024-11-13 16:25:40,055 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2024-11-13 16:25:40,055 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-11-13 16:25:40,055 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-11-13 16:25:40,055 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-11-13 16:25:40,345 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([549] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][163], [120#L693-3true, 161#true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 71#L693-7true, 117#L693-7true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 177#true, 182#true, Black: 179#(= |#race~c~0| 0), 165#true, 58#L693-5true, 163#true]) [2024-11-13 16:25:40,345 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is not cut-off event [2024-11-13 16:25:40,345 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is not cut-off event [2024-11-13 16:25:40,345 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is not cut-off event [2024-11-13 16:25:40,346 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is not cut-off event [2024-11-13 16:25:40,403 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([549] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][163], [120#L693-3true, 161#true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 71#L693-7true, 108#L693-7true, 159#true, 150#L693-5true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 177#true, 182#true, Black: 179#(= |#race~c~0| 0), 165#true, 163#true]) [2024-11-13 16:25:40,404 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is not cut-off event [2024-11-13 16:25:40,404 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is not cut-off event [2024-11-13 16:25:40,404 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is not cut-off event [2024-11-13 16:25:40,404 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is not cut-off event [2024-11-13 16:25:41,259 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][145], [26#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 161#true, 110#L693-7true, 16#L693-6true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 71#L693-7true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, 179#(= |#race~c~0| 0), Black: 177#true, 165#true, 163#true]) [2024-11-13 16:25:41,259 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-13 16:25:41,259 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:41,259 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:41,259 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:41,319 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][144], [161#true, 110#L693-7true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 71#L693-7true, 159#true, 87#L693-6true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, 106#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 179#(= |#race~c~0| 0), Black: 177#true, 165#true, 163#true]) [2024-11-13 16:25:41,319 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-13 16:25:41,319 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:41,319 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:41,319 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:41,708 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][204], [161#true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-4true, 71#L693-7true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 177#true, 182#true, 106#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 179#(= |#race~c~0| 0), 165#true, 163#true, 55#L693-14true]) [2024-11-13 16:25:41,708 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2024-11-13 16:25:41,708 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:41,708 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:41,708 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:41,709 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][224], [26#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 161#true, 107#L693-4true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 71#L693-7true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 177#true, 182#true, Black: 179#(= |#race~c~0| 0), 165#true, 163#true, 55#L693-14true]) [2024-11-13 16:25:41,709 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2024-11-13 16:25:41,709 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:41,709 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:41,709 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:41,715 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([625] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][168], [161#true, 110#L693-7true, 91#L693-4true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 177#true, 182#true, 106#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 179#(= |#race~c~0| 0), 165#true, 92#L693-14true, 163#true]) [2024-11-13 16:25:41,715 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2024-11-13 16:25:41,715 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:41,715 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:41,715 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:41,733 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([625] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][198], [26#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 161#true, 110#L693-7true, 107#L693-4true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 177#true, 182#true, Black: 179#(= |#race~c~0| 0), 165#true, 163#true, 92#L693-14true]) [2024-11-13 16:25:41,733 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2024-11-13 16:25:41,734 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:41,734 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:41,734 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:42,810 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([625] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][123], [26#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 161#true, 110#L693-7true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 159#true, 150#L693-5true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 177#true, 182#true, Black: 179#(= |#race~c~0| 0), 165#true, 92#L693-14true, 163#true]) [2024-11-13 16:25:42,810 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2024-11-13 16:25:42,810 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:42,810 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:42,810 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:42,812 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][176], [26#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 161#true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 71#L693-7true, 159#true, 150#L693-5true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 177#true, 182#true, Black: 179#(= |#race~c~0| 0), 165#true, 163#true, 55#L693-14true]) [2024-11-13 16:25:42,812 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2024-11-13 16:25:42,813 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:42,813 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:42,813 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:42,864 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([625] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][123], [161#true, 110#L693-7true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, 177#true, 106#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 179#(= |#race~c~0| 0), 165#true, 58#L693-5true, 92#L693-14true, 163#true]) [2024-11-13 16:25:42,865 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2024-11-13 16:25:42,865 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:42,865 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:42,865 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:42,866 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][176], [161#true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 71#L693-7true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 177#true, 182#true, 106#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 179#(= |#race~c~0| 0), 165#true, 58#L693-5true, 163#true, 55#L693-14true]) [2024-11-13 16:25:42,866 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2024-11-13 16:25:42,867 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:42,867 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:42,867 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:46,108 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([625] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][168], [18#L694-3true, 161#true, 91#L693-4true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 182#true, 177#true, Black: 179#(= |#race~c~0| 0), 165#true, 92#L693-14true, 163#true]) [2024-11-13 16:25:46,108 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2024-11-13 16:25:46,108 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-13 16:25:46,108 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-13 16:25:46,108 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-13 16:25:46,109 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][204], [18#L694-3true, 161#true, 70#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-4true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 177#true, 182#true, Black: 179#(= |#race~c~0| 0), 165#true, 163#true, 55#L693-14true]) [2024-11-13 16:25:46,109 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2024-11-13 16:25:46,109 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-13 16:25:46,109 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-13 16:25:46,109 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-13 16:25:46,296 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][176], [26#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 18#L694-3true, 161#true, 70#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, 177#true, Black: 179#(= |#race~c~0| 0), 165#true, 163#true, 55#L693-14true]) [2024-11-13 16:25:46,297 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2024-11-13 16:25:46,297 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-13 16:25:46,297 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-13 16:25:46,297 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-13 16:25:46,297 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([625] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][123], [18#L694-3true, 26#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 161#true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 159#true, 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 177#true, 182#true, Black: 179#(= |#race~c~0| 0), 165#true, 163#true, 92#L693-14true]) [2024-11-13 16:25:46,298 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2024-11-13 16:25:46,298 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-13 16:25:46,298 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-13 16:25:46,298 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-13 16:25:46,738 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([625] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][168], [161#true, 29#L701-3true, 91#L693-4true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 182#true, 177#true, Black: 179#(= |#race~c~0| 0), 165#true, 92#L693-14true, 163#true]) [2024-11-13 16:25:46,738 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2024-11-13 16:25:46,738 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-13 16:25:46,738 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-13 16:25:46,738 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-13 16:25:46,740 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][204], [161#true, 29#L701-3true, 70#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 91#L693-4true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 177#true, 182#true, Black: 179#(= |#race~c~0| 0), 165#true, 163#true, 55#L693-14true]) [2024-11-13 16:25:46,740 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2024-11-13 16:25:46,740 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-13 16:25:46,740 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-13 16:25:46,740 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-13 16:25:46,861 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([625] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][123], [26#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 161#true, 29#L701-3true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 159#true, 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 177#true, 182#true, Black: 179#(= |#race~c~0| 0), 165#true, 163#true, 92#L693-14true]) [2024-11-13 16:25:46,861 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2024-11-13 16:25:46,861 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-13 16:25:46,861 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-13 16:25:46,861 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-13 16:25:46,867 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][176], [26#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 161#true, 29#L701-3true, 70#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, 177#true, Black: 179#(= |#race~c~0| 0), 165#true, 163#true, 55#L693-14true]) [2024-11-13 16:25:46,867 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2024-11-13 16:25:46,867 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-13 16:25:46,867 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-13 16:25:46,867 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-13 16:25:47,825 INFO L124 PetriNetUnfolderBase]: 45404/114071 cut-off events. [2024-11-13 16:25:47,825 INFO L125 PetriNetUnfolderBase]: For 222881/228882 co-relation queries the response was YES. [2024-11-13 16:25:48,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305843 conditions, 114071 events. 45404/114071 cut-off events. For 222881/228882 co-relation queries the response was YES. Maximal size of possible extension queue 3863. Compared 1555228 event pairs, 17118 based on Foata normal form. 381/95250 useless extension candidates. Maximal degree in co-relation 305833. Up to 49201 conditions per place. [2024-11-13 16:25:48,472 INFO L140 encePairwiseOnDemand]: 151/164 looper letters, 91 selfloop transitions, 36 changer transitions 0/253 dead transitions. [2024-11-13 16:25:48,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 253 transitions, 1502 flow [2024-11-13 16:25:48,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:25:48,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:25:48,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2024-11-13 16:25:48,474 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8394308943089431 [2024-11-13 16:25:48,475 INFO L175 Difference]: Start difference. First operand has 163 places, 215 transitions, 970 flow. Second operand 3 states and 413 transitions. [2024-11-13 16:25:48,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 253 transitions, 1502 flow [2024-11-13 16:25:48,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 253 transitions, 1392 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:25:48,579 INFO L231 Difference]: Finished difference. Result has 165 places, 247 transitions, 1336 flow [2024-11-13 16:25:48,580 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1336, PETRI_PLACES=165, PETRI_TRANSITIONS=247} [2024-11-13 16:25:48,581 INFO L277 CegarLoopForPetriNet]: 162 programPoint places, 3 predicate places. [2024-11-13 16:25:48,581 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 247 transitions, 1336 flow [2024-11-13 16:25:48,581 INFO L472 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) [2024-11-13 16:25:48,581 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:25:48,582 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:25:48,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 16:25:48,582 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-13 16:25:48,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:48,582 INFO L85 PathProgramCache]: Analyzing trace with hash -254846032, now seen corresponding path program 1 times [2024-11-13 16:25:48,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:48,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641843275] [2024-11-13 16:25:48,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:48,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:48,624 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 16:25:48,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:48,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641843275] [2024-11-13 16:25:48,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641843275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:48,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:48,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:25:48,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972987395] [2024-11-13 16:25:48,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:48,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:25:48,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:48,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:25:48,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:25:48,680 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 164 [2024-11-13 16:25:48,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 247 transitions, 1336 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:25:48,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:25:48,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 164 [2024-11-13 16:25:48,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:25:53,330 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][300], [161#true, 110#L693-7true, 104#L693-4true, 16#L693-6true, 91#L693-4true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 187#true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, Black: 177#true, 165#true, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true]) [2024-11-13 16:25:53,330 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-13 16:25:53,330 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-13 16:25:53,330 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-13 16:25:53,330 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-13 16:25:53,396 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][298], [161#true, 110#L693-7true, 104#L693-4true, 107#L693-4true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 187#true, 159#true, 87#L693-6true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, Black: 177#true, 165#true, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true]) [2024-11-13 16:25:53,397 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-13 16:25:53,397 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-13 16:25:53,397 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-13 16:25:53,397 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-13 16:25:53,401 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][297], [154#L693-6true, 161#true, 110#L693-7true, 107#L693-4true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-4true, 187#true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, Black: 177#true, 165#true, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true]) [2024-11-13 16:25:53,401 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-13 16:25:53,401 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-13 16:25:53,401 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-13 16:25:53,401 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-13 16:25:53,488 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][303], [161#true, 104#L693-4true, 107#L693-4true, 91#L693-4true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 187#true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, Black: 179#(= |#race~c~0| 0), 165#true, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true, 55#L693-14true]) [2024-11-13 16:25:53,488 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-13 16:25:53,488 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-13 16:25:53,488 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-13 16:25:53,488 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-13 16:25:54,576 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][257], [161#true, 104#L693-4true, 91#L693-4true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 187#true, 159#true, 150#L693-5true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, Black: 179#(= |#race~c~0| 0), 165#true, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true, 55#L693-14true]) [2024-11-13 16:25:54,576 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-13 16:25:54,576 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:54,576 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:54,576 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:54,624 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][284], [8#L693-5true, 161#true, 107#L693-4true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-4true, 187#true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, Black: 179#(= |#race~c~0| 0), 165#true, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true, 55#L693-14true]) [2024-11-13 16:25:54,624 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-13 16:25:54,624 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:54,624 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:54,624 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:54,630 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][285], [161#true, 104#L693-4true, 107#L693-4true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 187#true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, Black: 179#(= |#race~c~0| 0), 165#true, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 58#L693-5true, 163#true, 55#L693-14true]) [2024-11-13 16:25:54,630 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-13 16:25:54,630 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:54,630 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:54,630 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:55,185 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][152], [161#true, 110#L693-7true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 187#true, 117#L693-7true, 159#true, 87#L693-6true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, Black: 177#true, 165#true, 35#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true]) [2024-11-13 16:25:55,185 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-13 16:25:55,186 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:55,186 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:55,186 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:55,228 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][153], [161#true, 110#L693-7true, 16#L693-6true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, 187#true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, Black: 177#true, 165#true, 35#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true]) [2024-11-13 16:25:55,228 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-13 16:25:55,228 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:55,228 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:55,228 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:55,621 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][160], [154#L693-6true, 26#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 161#true, 110#L693-7true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 187#true, 117#L693-7true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, Black: 177#true, 165#true, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true]) [2024-11-13 16:25:55,621 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-13 16:25:55,621 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:55,621 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:55,621 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:55,636 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][227], [26#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 161#true, 104#L693-4true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 117#L693-7true, 187#true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, Black: 179#(= |#race~c~0| 0), 165#true, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true, 55#L693-14true]) [2024-11-13 16:25:55,636 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2024-11-13 16:25:55,636 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:55,636 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:55,636 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:55,705 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][160], [154#L693-6true, 161#true, 110#L693-7true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, 187#true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, 106#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 177#true, 165#true, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true]) [2024-11-13 16:25:55,705 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-13 16:25:55,705 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:55,705 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:55,706 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:55,711 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][227], [161#true, 104#L693-4true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 187#true, 108#L693-7true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, 106#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 179#(= |#race~c~0| 0), 165#true, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true, 55#L693-14true]) [2024-11-13 16:25:55,711 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2024-11-13 16:25:55,711 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:55,711 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:55,711 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:55,715 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][152], [161#true, 110#L693-7true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 71#L693-7true, 187#true, 159#true, 87#L693-6true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, 106#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 177#true, 165#true, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true]) [2024-11-13 16:25:55,715 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-13 16:25:55,715 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:55,715 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:55,715 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-13 16:25:55,943 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][226], [161#true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-4true, 117#L693-7true, 187#true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, Black: 179#(= |#race~c~0| 0), 165#true, 35#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true, 55#L693-14true]) [2024-11-13 16:25:55,943 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2024-11-13 16:25:55,943 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:55,943 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:55,943 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:55,992 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L693-13-->L693-14: Formula: (= |v_#race~c~0_16| |v_ULTIMATE.start_thr1_#t~nondet3#1_4|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} OutVars{#race~c~0=|v_#race~c~0_16|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} AuxVars[] AssignedVars[#race~c~0][214], [26#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 161#true, 110#L693-7true, 104#L693-4true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 187#true, 159#true, 52#L693-14true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 179#(= |#race~c~0| 0), 165#true, Black: 182#true, 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true]) [2024-11-13 16:25:55,992 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2024-11-13 16:25:55,992 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:55,992 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:55,992 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:56,047 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L693-13-->L693-14: Formula: (= |v_#race~c~0_16| |v_ULTIMATE.start_thr1_#t~nondet3#1_4|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} OutVars{#race~c~0=|v_#race~c~0_16|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} AuxVars[] AssignedVars[#race~c~0][166], [161#true, 110#L693-7true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-4true, 187#true, 159#true, 52#L693-14true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 179#(= |#race~c~0| 0), 165#true, 35#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 182#true, 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true]) [2024-11-13 16:25:56,047 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2024-11-13 16:25:56,047 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:56,047 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:56,048 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:56,082 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([595] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread1of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][178], [161#true, 110#L693-7true, 104#L693-4true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 187#true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, 106#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 179#(= |#race~c~0| 0), 39#L693-14true, 165#true, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true]) [2024-11-13 16:25:56,082 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2024-11-13 16:25:56,083 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:56,083 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:56,083 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:56,098 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][226], [161#true, 91#L693-4true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 187#true, 71#L693-7true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, 106#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 179#(= |#race~c~0| 0), 165#true, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true, 55#L693-14true]) [2024-11-13 16:25:56,098 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2024-11-13 16:25:56,098 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:56,098 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:56,098 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:56,104 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([625] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][179], [161#true, 110#L693-7true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-4true, 187#true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, 106#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 179#(= |#race~c~0| 0), 165#true, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true, 92#L693-14true]) [2024-11-13 16:25:56,104 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2024-11-13 16:25:56,104 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:56,104 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:56,105 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-13 16:25:56,640 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L693-13-->L693-14: Formula: (= |v_#race~c~0_16| |v_ULTIMATE.start_thr1_#t~nondet3#1_4|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} OutVars{#race~c~0=|v_#race~c~0_16|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} AuxVars[] AssignedVars[#race~c~0][69], [161#true, 110#L693-7true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 187#true, 159#true, 52#L693-14true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 179#(= |#race~c~0| 0), 165#true, 35#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 182#true, 58#L693-5true, 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true]) [2024-11-13 16:25:56,640 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2024-11-13 16:25:56,640 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:56,640 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:56,640 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:56,644 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][188], [161#true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 187#true, 117#L693-7true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, Black: 179#(= |#race~c~0| 0), 165#true, 35#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 58#L693-5true, 163#true, 55#L693-14true]) [2024-11-13 16:25:56,644 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2024-11-13 16:25:56,644 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:56,644 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:56,644 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:56,711 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([595] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread1of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][74], [161#true, 110#L693-7true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 187#true, 159#true, 150#L693-5true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, Black: 179#(= |#race~c~0| 0), 39#L693-14true, 165#true, 35#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true]) [2024-11-13 16:25:56,711 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2024-11-13 16:25:56,712 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:56,712 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:56,712 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:56,715 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][188], [161#true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 187#true, 108#L693-7true, 159#true, 150#L693-5true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, Black: 179#(= |#race~c~0| 0), 165#true, 35#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true, 55#L693-14true]) [2024-11-13 16:25:56,715 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2024-11-13 16:25:56,715 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:56,715 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:56,715 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:57,108 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L693-13-->L693-14: Formula: (= |v_#race~c~0_16| |v_ULTIMATE.start_thr1_#t~nondet3#1_4|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} OutVars{#race~c~0=|v_#race~c~0_16|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} AuxVars[] AssignedVars[#race~c~0][69], [8#L693-5true, 26#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 161#true, 110#L693-7true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 187#true, 159#true, 52#L693-14true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 179#(= |#race~c~0| 0), 165#true, Black: 182#true, 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true]) [2024-11-13 16:25:57,108 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2024-11-13 16:25:57,109 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:57,109 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:57,109 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:57,139 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][188], [8#L693-5true, 26#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 161#true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 117#L693-7true, 187#true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, Black: 179#(= |#race~c~0| 0), 165#true, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true, 55#L693-14true]) [2024-11-13 16:25:57,139 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2024-11-13 16:25:57,139 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:57,139 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:57,139 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:57,227 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([595] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread1of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][74], [8#L693-5true, 161#true, 110#L693-7true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 187#true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, 106#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 179#(= |#race~c~0| 0), 39#L693-14true, 165#true, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true]) [2024-11-13 16:25:57,227 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2024-11-13 16:25:57,227 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:57,227 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:57,227 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:57,244 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][188], [8#L693-5true, 161#true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, 187#true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, 106#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 179#(= |#race~c~0| 0), 165#true, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true, 55#L693-14true]) [2024-11-13 16:25:57,244 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2024-11-13 16:25:57,244 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:57,244 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:57,245 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:57,269 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([625] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][126], [161#true, 110#L693-7true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 187#true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, 106#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 179#(= |#race~c~0| 0), 165#true, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 58#L693-5true, 163#true, 92#L693-14true]) [2024-11-13 16:25:57,269 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2024-11-13 16:25:57,269 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:57,269 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:57,270 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:57,272 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][188], [161#true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 187#true, 71#L693-7true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, 106#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 179#(= |#race~c~0| 0), 165#true, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 58#L693-5true, 163#true, 55#L693-14true]) [2024-11-13 16:25:57,272 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2024-11-13 16:25:57,272 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:57,272 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:57,272 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-13 16:25:57,519 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][316], [161#true, 110#L693-7true, 104#L693-4true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 187#true, 159#true, 87#L693-6true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, Black: 177#true, 143#L693-15true, 165#true, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true]) [2024-11-13 16:25:57,520 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2024-11-13 16:25:57,520 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-13 16:25:57,520 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-13 16:25:57,520 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-13 16:25:57,616 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([549] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][150], [120#L693-3true, 161#true, 70#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-4true, 187#true, 159#true, 97#L694true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, Black: 179#(= |#race~c~0| 0), 165#true, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true]) [2024-11-13 16:25:57,616 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is not cut-off event [2024-11-13 16:25:57,616 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is not cut-off event [2024-11-13 16:25:57,616 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is not cut-off event [2024-11-13 16:25:57,616 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is not cut-off event [2024-11-13 16:25:57,624 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][314], [154#L693-6true, 161#true, 110#L693-7true, 91#L693-4true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 187#true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, Black: 177#true, 143#L693-15true, 165#true, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true]) [2024-11-13 16:25:57,624 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2024-11-13 16:25:57,624 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-13 16:25:57,624 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-13 16:25:57,625 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-13 16:25:57,837 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][317], [161#true, 104#L693-4true, 91#L693-4true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 187#true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, 143#L693-15true, Black: 179#(= |#race~c~0| 0), 165#true, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true, 55#L693-14true]) [2024-11-13 16:25:57,837 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2024-11-13 16:25:57,837 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2024-11-13 16:25:57,837 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2024-11-13 16:25:57,837 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2024-11-13 16:25:58,232 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([549] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][150], [120#L693-3true, 18#L694-3true, 161#true, 70#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 91#L693-4true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 187#true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, Black: 179#(= |#race~c~0| 0), 165#true, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true]) [2024-11-13 16:25:58,232 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is not cut-off event [2024-11-13 16:25:58,233 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is not cut-off event [2024-11-13 16:25:58,233 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is not cut-off event [2024-11-13 16:25:58,233 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is not cut-off event [2024-11-13 16:25:58,252 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][136], [154#L693-6true, 161#true, 88#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-4true, 187#true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 182#true, Black: 177#true, 165#true, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true]) [2024-11-13 16:25:58,252 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2024-11-13 16:25:58,252 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-13 16:25:58,252 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-13 16:25:58,252 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-13 16:25:58,440 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][135], [161#true, 104#L693-4true, 88#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 187#true, 159#true, 87#L693-6true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 182#true, Black: 177#true, 165#true, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true]) [2024-11-13 16:25:58,441 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2024-11-13 16:25:58,441 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-13 16:25:58,441 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-13 16:25:58,441 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-13 16:25:58,813 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][310], [161#true, 104#L693-4true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 187#true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, 143#L693-15true, Black: 179#(= |#race~c~0| 0), 165#true, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 58#L693-5true, 163#true, 55#L693-14true]) [2024-11-13 16:25:58,813 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2024-11-13 16:25:58,813 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2024-11-13 16:25:58,813 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2024-11-13 16:25:58,813 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2024-11-13 16:25:58,997 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][257], [161#true, 104#L693-4true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-4true, 187#true, 97#L694true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, Black: 179#(= |#race~c~0| 0), 165#true, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true, 55#L693-14true]) [2024-11-13 16:25:58,997 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2024-11-13 16:25:58,997 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2024-11-13 16:25:58,998 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2024-11-13 16:25:58,998 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2024-11-13 16:25:59,026 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][309], [8#L693-5true, 161#true, Black: 169#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-4true, 187#true, 159#true, Black: 174#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, Black: 179#(= |#race~c~0| 0), 143#L693-15true, 165#true, Black: 184#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 163#true, 55#L693-14true]) [2024-11-13 16:25:59,026 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2024-11-13 16:25:59,026 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2024-11-13 16:25:59,026 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2024-11-13 16:25:59,026 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event