./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b4439281d7e12bca3fd2bd39ebda4196e341f38fedf1c370a96bdabb4944cfe7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:26:31,614 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:26:31,649 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:26:31,655 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:26:31,655 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:26:31,668 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:26:31,669 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:26:31,669 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:26:31,669 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:26:31,669 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:26:31,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:26:31,670 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:26:31,670 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:26:31,670 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:26:31,670 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:26:31,670 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:26:31,670 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:26:31,670 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:26:31,670 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:26:31,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:26:31,671 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:26:31,671 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:26:31,671 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:26:31,671 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:26:31,671 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:26:31,671 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:26:31,671 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:26:31,671 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:26:31,671 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:26:31,671 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:26:31,671 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:26:31,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:26:31,672 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:26:31,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:26:31,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:26:31,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:26:31,672 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:26:31,672 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:26:31,672 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:26:31,672 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:26:31,672 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:26:31,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:26:31,672 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:26:31,672 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:26:31,672 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:26:31,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:26:31,673 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b4439281d7e12bca3fd2bd39ebda4196e341f38fedf1c370a96bdabb4944cfe7 [2025-01-09 21:26:31,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:26:31,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:26:31,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:26:31,886 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:26:31,887 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:26:31,891 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i [2025-01-09 21:26:33,053 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/72807d6a2/1f4cea134ce5427db3fc331839854764/FLAG85bbe40ca [2025-01-09 21:26:33,390 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:26:33,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i [2025-01-09 21:26:33,415 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/72807d6a2/1f4cea134ce5427db3fc331839854764/FLAG85bbe40ca [2025-01-09 21:26:33,647 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/72807d6a2/1f4cea134ce5427db3fc331839854764 [2025-01-09 21:26:33,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:26:33,650 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:26:33,653 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:26:33,653 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:26:33,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:26:33,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:26:33" (1/1) ... [2025-01-09 21:26:33,663 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fa47c8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:33, skipping insertion in model container [2025-01-09 21:26:33,665 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:26:33" (1/1) ... [2025-01-09 21:26:33,721 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:26:34,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:26:34,184 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:26:34,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:26:34,324 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:26:34,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:34 WrapperNode [2025-01-09 21:26:34,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:26:34,326 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:26:34,326 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:26:34,326 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:26:34,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:34" (1/1) ... [2025-01-09 21:26:34,340 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:34" (1/1) ... [2025-01-09 21:26:34,354 INFO L138 Inliner]: procedures = 271, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 150 [2025-01-09 21:26:34,354 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:26:34,355 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:26:34,355 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:26:34,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:26:34,360 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:34" (1/1) ... [2025-01-09 21:26:34,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:34" (1/1) ... [2025-01-09 21:26:34,363 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:34" (1/1) ... [2025-01-09 21:26:34,363 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:34" (1/1) ... [2025-01-09 21:26:34,369 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:34" (1/1) ... [2025-01-09 21:26:34,370 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:34" (1/1) ... [2025-01-09 21:26:34,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:34" (1/1) ... [2025-01-09 21:26:34,374 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:34" (1/1) ... [2025-01-09 21:26:34,375 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:34" (1/1) ... [2025-01-09 21:26:34,377 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:26:34,377 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:26:34,377 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:26:34,378 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:26:34,378 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:34" (1/1) ... [2025-01-09 21:26:34,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:26:34,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:26:34,407 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:26:34,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:26:34,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:26:34,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:26:34,427 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:26:34,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:26:34,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:26:34,428 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:26:34,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:26:34,428 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:26:34,428 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:26:34,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:26:34,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:26:34,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:26:34,430 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:26:34,522 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:26:34,524 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:26:34,772 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:26:34,773 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:26:34,793 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:26:34,793 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 21:26:34,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:26:34 BoogieIcfgContainer [2025-01-09 21:26:34,793 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:26:34,795 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:26:34,795 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:26:34,798 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:26:34,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:26:33" (1/3) ... [2025-01-09 21:26:34,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60af1b06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:26:34, skipping insertion in model container [2025-01-09 21:26:34,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:34" (2/3) ... [2025-01-09 21:26:34,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60af1b06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:26:34, skipping insertion in model container [2025-01-09 21:26:34,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:26:34" (3/3) ... [2025-01-09 21:26:34,800 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_08-cond_racefree.i [2025-01-09 21:26:34,814 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:26:34,815 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_08-cond_racefree.i that has 2 procedures, 195 locations, 1 initial locations, 6 loop locations, and 7 error locations. [2025-01-09 21:26:34,815 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:26:34,890 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:26:34,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 209 transitions, 425 flow [2025-01-09 21:26:35,020 INFO L124 PetriNetUnfolderBase]: 21/276 cut-off events. [2025-01-09 21:26:35,022 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:26:35,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 276 events. 21/276 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 679 event pairs, 0 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 153. Up to 6 conditions per place. [2025-01-09 21:26:35,030 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 209 transitions, 425 flow [2025-01-09 21:26:35,038 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 209 transitions, 425 flow [2025-01-09 21:26:35,047 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:26:35,056 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;@177c8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:26:35,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-01-09 21:26:35,082 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:26:35,082 INFO L124 PetriNetUnfolderBase]: 2/111 cut-off events. [2025-01-09 21:26:35,082 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:26:35,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:35,083 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:35,087 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:26:35,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:35,092 INFO L85 PathProgramCache]: Analyzing trace with hash -429726862, now seen corresponding path program 1 times [2025-01-09 21:26:35,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:35,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082818994] [2025-01-09 21:26:35,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:35,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:35,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 21:26:35,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 21:26:35,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:35,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:35,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:35,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:35,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082818994] [2025-01-09 21:26:35,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082818994] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:35,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:35,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:26:35,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440646308] [2025-01-09 21:26:35,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:35,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:26:35,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:35,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:26:35,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:26:36,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 209 [2025-01-09 21:26:36,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 209 transitions, 425 flow. Second operand has 6 states, 6 states have (on average 169.5) internal successors, (1017), 6 states have internal predecessors, (1017), 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) [2025-01-09 21:26:36,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:36,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 209 [2025-01-09 21:26:36,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:36,199 INFO L124 PetriNetUnfolderBase]: 135/927 cut-off events. [2025-01-09 21:26:36,200 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2025-01-09 21:26:36,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 927 events. 135/927 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5440 event pairs, 60 based on Foata normal form. 86/907 useless extension candidates. Maximal degree in co-relation 1021. Up to 198 conditions per place. [2025-01-09 21:26:36,206 INFO L140 encePairwiseOnDemand]: 193/209 looper letters, 48 selfloop transitions, 5 changer transitions 0/220 dead transitions. [2025-01-09 21:26:36,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 220 transitions, 553 flow [2025-01-09 21:26:36,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:26:36,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:26:36,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1096 transitions. [2025-01-09 21:26:36,222 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8740031897926634 [2025-01-09 21:26:36,224 INFO L175 Difference]: Start difference. First operand has 198 places, 209 transitions, 425 flow. Second operand 6 states and 1096 transitions. [2025-01-09 21:26:36,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 220 transitions, 553 flow [2025-01-09 21:26:36,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 220 transitions, 553 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:26:36,233 INFO L231 Difference]: Finished difference. Result has 200 places, 196 transitions, 409 flow [2025-01-09 21:26:36,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=409, PETRI_PLACES=200, PETRI_TRANSITIONS=196} [2025-01-09 21:26:36,237 INFO L279 CegarLoopForPetriNet]: 198 programPoint places, 2 predicate places. [2025-01-09 21:26:36,237 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 196 transitions, 409 flow [2025-01-09 21:26:36,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 169.5) internal successors, (1017), 6 states have internal predecessors, (1017), 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) [2025-01-09 21:26:36,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:36,238 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:36,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:26:36,238 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:26:36,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:36,239 INFO L85 PathProgramCache]: Analyzing trace with hash -934569391, now seen corresponding path program 1 times [2025-01-09 21:26:36,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:36,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255102261] [2025-01-09 21:26:36,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:36,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:36,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 21:26:36,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 21:26:36,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:36,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:36,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:36,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:36,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255102261] [2025-01-09 21:26:36,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255102261] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:36,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:36,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:26:36,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620075800] [2025-01-09 21:26:36,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:36,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:36,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:36,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:36,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:36,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 209 [2025-01-09 21:26:36,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 196 transitions, 409 flow. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 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) [2025-01-09 21:26:36,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:36,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 209 [2025-01-09 21:26:36,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:36,443 INFO L124 PetriNetUnfolderBase]: 57/640 cut-off events. [2025-01-09 21:26:36,443 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-09 21:26:36,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 640 events. 57/640 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2927 event pairs, 25 based on Foata normal form. 1/572 useless extension candidates. Maximal degree in co-relation 634. Up to 96 conditions per place. [2025-01-09 21:26:36,448 INFO L140 encePairwiseOnDemand]: 206/209 looper letters, 22 selfloop transitions, 2 changer transitions 0/202 dead transitions. [2025-01-09 21:26:36,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 202 transitions, 469 flow [2025-01-09 21:26:36,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:36,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 565 transitions. [2025-01-09 21:26:36,451 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9011164274322169 [2025-01-09 21:26:36,451 INFO L175 Difference]: Start difference. First operand has 200 places, 196 transitions, 409 flow. Second operand 3 states and 565 transitions. [2025-01-09 21:26:36,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 202 transitions, 469 flow [2025-01-09 21:26:36,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 202 transitions, 459 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:26:36,457 INFO L231 Difference]: Finished difference. Result has 198 places, 196 transitions, 407 flow [2025-01-09 21:26:36,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=407, PETRI_PLACES=198, PETRI_TRANSITIONS=196} [2025-01-09 21:26:36,458 INFO L279 CegarLoopForPetriNet]: 198 programPoint places, 0 predicate places. [2025-01-09 21:26:36,459 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 196 transitions, 407 flow [2025-01-09 21:26:36,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 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) [2025-01-09 21:26:36,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:36,460 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:36,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:26:36,461 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:26:36,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:36,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1901264912, now seen corresponding path program 1 times [2025-01-09 21:26:36,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:36,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586048635] [2025-01-09 21:26:36,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:36,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:36,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 21:26:36,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 21:26:36,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:36,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:36,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:36,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:36,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586048635] [2025-01-09 21:26:36,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586048635] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:36,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:36,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:26:36,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35103093] [2025-01-09 21:26:36,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:36,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:36,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:36,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:36,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:36,556 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 209 [2025-01-09 21:26:36,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 196 transitions, 407 flow. Second operand has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 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) [2025-01-09 21:26:36,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:36,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 209 [2025-01-09 21:26:36,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:36,707 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([570] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_5| v_t_funThread1of1ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_5|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_5|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][202], [211#true, Black: 209#(= |ULTIMATE.start_main_~i~1#1| 0), 207#true, 198#true, 119#L952-8true]) [2025-01-09 21:26:36,707 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is not cut-off event [2025-01-09 21:26:36,708 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is not cut-off event [2025-01-09 21:26:36,708 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2025-01-09 21:26:36,708 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2025-01-09 21:26:36,718 INFO L124 PetriNetUnfolderBase]: 134/951 cut-off events. [2025-01-09 21:26:36,718 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-01-09 21:26:36,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1215 conditions, 951 events. 134/951 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 5563 event pairs, 32 based on Foata normal form. 0/852 useless extension candidates. Maximal degree in co-relation 1105. Up to 130 conditions per place. [2025-01-09 21:26:36,723 INFO L140 encePairwiseOnDemand]: 200/209 looper letters, 30 selfloop transitions, 6 changer transitions 0/209 dead transitions. [2025-01-09 21:26:36,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 209 transitions, 508 flow [2025-01-09 21:26:36,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:36,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:36,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 564 transitions. [2025-01-09 21:26:36,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8995215311004785 [2025-01-09 21:26:36,727 INFO L175 Difference]: Start difference. First operand has 198 places, 196 transitions, 407 flow. Second operand 3 states and 564 transitions. [2025-01-09 21:26:36,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 209 transitions, 508 flow [2025-01-09 21:26:36,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 209 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:26:36,731 INFO L231 Difference]: Finished difference. Result has 198 places, 198 transitions, 441 flow [2025-01-09 21:26:36,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=441, PETRI_PLACES=198, PETRI_TRANSITIONS=198} [2025-01-09 21:26:36,734 INFO L279 CegarLoopForPetriNet]: 198 programPoint places, 0 predicate places. [2025-01-09 21:26:36,734 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 198 transitions, 441 flow [2025-01-09 21:26:36,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 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) [2025-01-09 21:26:36,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:36,734 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:36,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:26:36,735 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:26:36,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:36,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1501440717, now seen corresponding path program 1 times [2025-01-09 21:26:36,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:36,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464866552] [2025-01-09 21:26:36,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:36,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:36,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 21:26:36,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 21:26:36,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:36,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:36,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:26:36,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:36,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464866552] [2025-01-09 21:26:36,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464866552] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:36,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:36,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:26:36,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405775529] [2025-01-09 21:26:36,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:36,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:36,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:36,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:36,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:36,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 209 [2025-01-09 21:26:36,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 198 transitions, 441 flow. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 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) [2025-01-09 21:26:36,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:36,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 209 [2025-01-09 21:26:36,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:36,920 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([570] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_5| v_t_funThread1of1ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_5|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_5|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][201], [211#true, Black: 209#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 213#(= |#race~global~0| 0), 198#true, 216#true, 119#L952-8true]) [2025-01-09 21:26:36,920 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is not cut-off event [2025-01-09 21:26:36,920 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2025-01-09 21:26:36,920 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2025-01-09 21:26:36,920 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is not cut-off event [2025-01-09 21:26:36,926 INFO L124 PetriNetUnfolderBase]: 139/1033 cut-off events. [2025-01-09 21:26:36,926 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2025-01-09 21:26:36,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1407 conditions, 1033 events. 139/1033 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 6384 event pairs, 50 based on Foata normal form. 0/919 useless extension candidates. Maximal degree in co-relation 1284. Up to 220 conditions per place. [2025-01-09 21:26:36,929 INFO L140 encePairwiseOnDemand]: 204/209 looper letters, 27 selfloop transitions, 4 changer transitions 0/205 dead transitions. [2025-01-09 21:26:36,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 205 transitions, 521 flow [2025-01-09 21:26:36,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:36,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:36,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 560 transitions. [2025-01-09 21:26:36,931 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8931419457735247 [2025-01-09 21:26:36,931 INFO L175 Difference]: Start difference. First operand has 198 places, 198 transitions, 441 flow. Second operand 3 states and 560 transitions. [2025-01-09 21:26:36,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 205 transitions, 521 flow [2025-01-09 21:26:36,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 205 transitions, 507 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:26:36,934 INFO L231 Difference]: Finished difference. Result has 200 places, 201 transitions, 461 flow [2025-01-09 21:26:36,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=461, PETRI_PLACES=200, PETRI_TRANSITIONS=201} [2025-01-09 21:26:36,935 INFO L279 CegarLoopForPetriNet]: 198 programPoint places, 2 predicate places. [2025-01-09 21:26:36,935 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 201 transitions, 461 flow [2025-01-09 21:26:36,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 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) [2025-01-09 21:26:36,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:36,936 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:36,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:26:36,936 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:26:36,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:36,937 INFO L85 PathProgramCache]: Analyzing trace with hash -821167152, now seen corresponding path program 1 times [2025-01-09 21:26:36,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:36,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477400999] [2025-01-09 21:26:36,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:36,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:36,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 21:26:36,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 21:26:36,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:36,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:26:36,959 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:26:36,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 21:26:36,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 21:26:36,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:36,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:26:36,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:26:36,994 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:26:36,995 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-01-09 21:26:36,996 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-01-09 21:26:36,996 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-01-09 21:26:36,996 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-01-09 21:26:36,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-01-09 21:26:36,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-01-09 21:26:36,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2025-01-09 21:26:36,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-01-09 21:26:36,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-01-09 21:26:36,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-01-09 21:26:36,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-01-09 21:26:36,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-01-09 21:26:36,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:26:36,998 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 21:26:36,999 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:26:36,999 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:26:37,029 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:26:37,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 242 places, 258 transitions, 532 flow [2025-01-09 21:26:37,074 INFO L124 PetriNetUnfolderBase]: 36/419 cut-off events. [2025-01-09 21:26:37,074 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:26:37,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 419 events. 36/419 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1291 event pairs, 0 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 278. Up to 9 conditions per place. [2025-01-09 21:26:37,076 INFO L82 GeneralOperation]: Start removeDead. Operand has 242 places, 258 transitions, 532 flow [2025-01-09 21:26:37,080 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 242 places, 258 transitions, 532 flow [2025-01-09 21:26:37,081 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:26:37,082 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;@177c8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:26:37,082 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-01-09 21:26:37,089 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:26:37,089 INFO L124 PetriNetUnfolderBase]: 2/111 cut-off events. [2025-01-09 21:26:37,089 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:26:37,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:37,090 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:37,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:37,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:37,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1300918130, now seen corresponding path program 1 times [2025-01-09 21:26:37,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:37,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415192872] [2025-01-09 21:26:37,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:37,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:37,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 21:26:37,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 21:26:37,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:37,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:37,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:37,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:37,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415192872] [2025-01-09 21:26:37,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415192872] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:37,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:37,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:26:37,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50889656] [2025-01-09 21:26:37,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:37,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:26:37,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:37,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:26:37,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:26:37,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 258 [2025-01-09 21:26:37,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 258 transitions, 532 flow. Second operand has 6 states, 6 states have (on average 204.5) internal successors, (1227), 6 states have internal predecessors, (1227), 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) [2025-01-09 21:26:37,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:37,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 258 [2025-01-09 21:26:37,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:38,462 INFO L124 PetriNetUnfolderBase]: 1710/6577 cut-off events. [2025-01-09 21:26:38,463 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-01-09 21:26:38,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9292 conditions, 6577 events. 1710/6577 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 64657 event pairs, 168 based on Foata normal form. 1223/7142 useless extension candidates. Maximal degree in co-relation 4038. Up to 1840 conditions per place. [2025-01-09 21:26:38,493 INFO L140 encePairwiseOnDemand]: 236/258 looper letters, 80 selfloop transitions, 5 changer transitions 0/287 dead transitions. [2025-01-09 21:26:38,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 287 transitions, 760 flow [2025-01-09 21:26:38,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:26:38,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:26:38,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1368 transitions. [2025-01-09 21:26:38,497 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8837209302325582 [2025-01-09 21:26:38,497 INFO L175 Difference]: Start difference. First operand has 242 places, 258 transitions, 532 flow. Second operand 6 states and 1368 transitions. [2025-01-09 21:26:38,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 287 transitions, 760 flow [2025-01-09 21:26:38,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 287 transitions, 760 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:26:38,501 INFO L231 Difference]: Finished difference. Result has 244 places, 239 transitions, 504 flow [2025-01-09 21:26:38,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=504, PETRI_PLACES=244, PETRI_TRANSITIONS=239} [2025-01-09 21:26:38,502 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 2 predicate places. [2025-01-09 21:26:38,502 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 239 transitions, 504 flow [2025-01-09 21:26:38,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 204.5) internal successors, (1227), 6 states have internal predecessors, (1227), 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) [2025-01-09 21:26:38,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:38,503 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:38,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:26:38,503 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:38,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:38,503 INFO L85 PathProgramCache]: Analyzing trace with hash 62932625, now seen corresponding path program 1 times [2025-01-09 21:26:38,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:38,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725425393] [2025-01-09 21:26:38,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:38,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:38,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 21:26:38,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 21:26:38,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:38,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:38,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:38,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:38,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725425393] [2025-01-09 21:26:38,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725425393] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:38,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:38,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:26:38,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787390931] [2025-01-09 21:26:38,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:38,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:38,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:38,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:38,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:38,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 258 [2025-01-09 21:26:38,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 239 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 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) [2025-01-09 21:26:38,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:38,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 258 [2025-01-09 21:26:38,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:38,985 INFO L124 PetriNetUnfolderBase]: 972/5053 cut-off events. [2025-01-09 21:26:38,985 INFO L125 PetriNetUnfolderBase]: For 208/208 co-relation queries the response was YES. [2025-01-09 21:26:38,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6683 conditions, 5053 events. 972/5053 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 48840 event pairs, 327 based on Foata normal form. 1/4517 useless extension candidates. Maximal degree in co-relation 876. Up to 1438 conditions per place. [2025-01-09 21:26:39,012 INFO L140 encePairwiseOnDemand]: 255/258 looper letters, 31 selfloop transitions, 2 changer transitions 0/246 dead transitions. [2025-01-09 21:26:39,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 246 transitions, 586 flow [2025-01-09 21:26:39,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:39,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:39,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2025-01-09 21:26:39,014 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8772609819121447 [2025-01-09 21:26:39,014 INFO L175 Difference]: Start difference. First operand has 244 places, 239 transitions, 504 flow. Second operand 3 states and 679 transitions. [2025-01-09 21:26:39,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 246 transitions, 586 flow [2025-01-09 21:26:39,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 246 transitions, 574 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:26:39,017 INFO L231 Difference]: Finished difference. Result has 242 places, 240 transitions, 506 flow [2025-01-09 21:26:39,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=242, PETRI_TRANSITIONS=240} [2025-01-09 21:26:39,018 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 0 predicate places. [2025-01-09 21:26:39,018 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 240 transitions, 506 flow [2025-01-09 21:26:39,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 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) [2025-01-09 21:26:39,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:39,019 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:39,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:26:39,019 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:39,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:39,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1118350015, now seen corresponding path program 1 times [2025-01-09 21:26:39,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:39,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945173561] [2025-01-09 21:26:39,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:39,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:39,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 21:26:39,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 21:26:39,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:39,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:39,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:39,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:39,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945173561] [2025-01-09 21:26:39,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945173561] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:39,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:39,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:26:39,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182273234] [2025-01-09 21:26:39,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:39,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:39,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:39,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:39,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:39,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 258 [2025-01-09 21:26:39,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 240 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 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) [2025-01-09 21:26:39,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:39,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 258 [2025-01-09 21:26:39,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:39,601 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [240#true, 251#true, 255#true, 242#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:39,601 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is not cut-off event [2025-01-09 21:26:39,602 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2025-01-09 21:26:39,602 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is not cut-off event [2025-01-09 21:26:39,602 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2025-01-09 21:26:40,070 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [240#true, 251#true, 255#true, 28#$Ultimate##0true, 243#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,070 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is not cut-off event [2025-01-09 21:26:40,070 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is not cut-off event [2025-01-09 21:26:40,070 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is not cut-off event [2025-01-09 21:26:40,070 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is not cut-off event [2025-01-09 21:26:40,075 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][267], [251#true, 241#true, 16#$Ultimate##0true, 255#true, 242#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,075 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is not cut-off event [2025-01-09 21:26:40,075 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is not cut-off event [2025-01-09 21:26:40,075 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is not cut-off event [2025-01-09 21:26:40,075 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is not cut-off event [2025-01-09 21:26:40,095 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][267], [251#true, 241#true, 255#true, 73#L938-3true, 242#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,095 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-01-09 21:26:40,095 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2025-01-09 21:26:40,095 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2025-01-09 21:26:40,096 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2025-01-09 21:26:40,114 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [30#L938-3true, 240#true, 251#true, 255#true, 243#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,115 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is not cut-off event [2025-01-09 21:26:40,115 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2025-01-09 21:26:40,115 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is not cut-off event [2025-01-09 21:26:40,115 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is not cut-off event [2025-01-09 21:26:40,164 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][267], [251#true, 241#true, 255#true, 70#L939-3true, 242#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,164 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2025-01-09 21:26:40,164 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-01-09 21:26:40,164 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-01-09 21:26:40,164 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-01-09 21:26:40,185 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [240#true, 251#true, 255#true, 243#true, 134#L939-3true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,185 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is not cut-off event [2025-01-09 21:26:40,185 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is not cut-off event [2025-01-09 21:26:40,185 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event [2025-01-09 21:26:40,185 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is not cut-off event [2025-01-09 21:26:40,185 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][269], [240#true, 251#true, 243#true, 257#(= |#race~global~0| 0), 53#L939-5true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,185 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is cut-off event [2025-01-09 21:26:40,185 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-01-09 21:26:40,185 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-01-09 21:26:40,186 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-01-09 21:26:40,227 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][269], [240#true, 251#true, 243#true, 257#(= |#race~global~0| 0), 151#L952-8true, 209#L939-6true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,227 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2025-01-09 21:26:40,227 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-01-09 21:26:40,227 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-01-09 21:26:40,228 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is cut-off event [2025-01-09 21:26:40,228 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [240#true, 251#true, 255#true, 243#true, 53#L939-5true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,228 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is not cut-off event [2025-01-09 21:26:40,228 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is not cut-off event [2025-01-09 21:26:40,228 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2025-01-09 21:26:40,228 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2025-01-09 21:26:40,228 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [208#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 240#true, 251#true, 255#true, 243#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,228 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2025-01-09 21:26:40,228 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-01-09 21:26:40,228 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is cut-off event [2025-01-09 21:26:40,229 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-01-09 21:26:40,248 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [240#true, 251#true, 255#true, 243#true, 151#L952-8true, 209#L939-6true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,248 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is not cut-off event [2025-01-09 21:26:40,248 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is not cut-off event [2025-01-09 21:26:40,248 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is not cut-off event [2025-01-09 21:26:40,248 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is not cut-off event [2025-01-09 21:26:40,303 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][267], [251#true, 241#true, 255#true, 47#L939-10true, 242#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,303 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is cut-off event [2025-01-09 21:26:40,303 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-01-09 21:26:40,303 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2025-01-09 21:26:40,303 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2025-01-09 21:26:40,317 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [240#true, 251#true, 255#true, 243#true, 151#L952-8true, 117#L939-10true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,317 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is not cut-off event [2025-01-09 21:26:40,317 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is not cut-off event [2025-01-09 21:26:40,317 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is not cut-off event [2025-01-09 21:26:40,317 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is not cut-off event [2025-01-09 21:26:40,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][267], [90#L939-16true, 251#true, 241#true, 255#true, 242#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,354 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2025-01-09 21:26:40,354 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2025-01-09 21:26:40,354 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:26:40,354 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:26:40,364 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [240#true, 251#true, 255#true, 243#true, 190#L939-16true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,364 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is not cut-off event [2025-01-09 21:26:40,364 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is not cut-off event [2025-01-09 21:26:40,364 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is not cut-off event [2025-01-09 21:26:40,364 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is not cut-off event [2025-01-09 21:26:40,384 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][267], [141#L939-23true, 251#true, 241#true, 255#true, 242#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,385 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is cut-off event [2025-01-09 21:26:40,385 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:26:40,385 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-01-09 21:26:40,385 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-01-09 21:26:40,393 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [240#true, 251#true, 255#true, 243#true, 151#L952-8true, 121#L939-23true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,393 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is not cut-off event [2025-01-09 21:26:40,393 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2025-01-09 21:26:40,393 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is not cut-off event [2025-01-09 21:26:40,393 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is not cut-off event [2025-01-09 21:26:40,400 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][268], [251#true, 241#true, 242#true, 257#(= |#race~global~0| 0), 151#L952-8true, 155#L939-25true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,400 INFO L294 olderBase$Statistics]: this new event has 192 ancestors and is cut-off event [2025-01-09 21:26:40,401 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2025-01-09 21:26:40,401 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-01-09 21:26:40,401 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-01-09 21:26:40,408 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [240#true, 251#true, 255#true, 243#true, 67#L939-25true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,408 INFO L294 olderBase$Statistics]: this new event has 192 ancestors and is not cut-off event [2025-01-09 21:26:40,408 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is not cut-off event [2025-01-09 21:26:40,408 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is not cut-off event [2025-01-09 21:26:40,408 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is not cut-off event [2025-01-09 21:26:40,408 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [240#true, 251#true, 255#true, 243#true, 186#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,408 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2025-01-09 21:26:40,408 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:26:40,408 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-01-09 21:26:40,408 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-01-09 21:26:40,409 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][268], [251#true, 241#true, 242#true, 257#(= |#race~global~0| 0), 11#L939-26true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,409 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2025-01-09 21:26:40,409 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:26:40,409 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-01-09 21:26:40,409 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-01-09 21:26:40,409 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][267], [251#true, 241#true, 255#true, 242#true, 151#L952-8true, 155#L939-25true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,409 INFO L294 olderBase$Statistics]: this new event has 192 ancestors and is not cut-off event [2025-01-09 21:26:40,409 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is not cut-off event [2025-01-09 21:26:40,409 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is not cut-off event [2025-01-09 21:26:40,410 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is not cut-off event [2025-01-09 21:26:40,410 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][267], [251#true, 241#true, 255#true, 242#true, 135#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,410 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2025-01-09 21:26:40,410 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-01-09 21:26:40,410 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:26:40,410 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-01-09 21:26:40,417 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [240#true, 251#true, 255#true, 243#true, 151#L952-8true, 217#L939-26true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,417 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is not cut-off event [2025-01-09 21:26:40,417 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is not cut-off event [2025-01-09 21:26:40,417 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is not cut-off event [2025-01-09 21:26:40,417 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is not cut-off event [2025-01-09 21:26:40,418 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][267], [251#true, 241#true, 255#true, 242#true, 11#L939-26true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,418 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is not cut-off event [2025-01-09 21:26:40,418 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is not cut-off event [2025-01-09 21:26:40,418 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is not cut-off event [2025-01-09 21:26:40,418 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is not cut-off event [2025-01-09 21:26:40,435 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][267], [251#true, 241#true, 255#true, 76#L939-30true, 242#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,436 INFO L294 olderBase$Statistics]: this new event has 197 ancestors and is cut-off event [2025-01-09 21:26:40,436 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-01-09 21:26:40,436 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-01-09 21:26:40,436 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-01-09 21:26:40,448 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [214#L939-30true, 240#true, 251#true, 255#true, 243#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,449 INFO L294 olderBase$Statistics]: this new event has 210 ancestors and is cut-off event [2025-01-09 21:26:40,449 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-01-09 21:26:40,449 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-01-09 21:26:40,449 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-01-09 21:26:40,449 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][269], [240#true, 251#true, 243#true, 257#(= |#race~global~0| 0), 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0), 217#L939-26true]) [2025-01-09 21:26:40,449 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2025-01-09 21:26:40,449 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-01-09 21:26:40,449 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-01-09 21:26:40,449 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-01-09 21:26:40,449 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][269], [240#true, 251#true, 243#true, 67#L939-25true, 257#(= |#race~global~0| 0), 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,449 INFO L294 olderBase$Statistics]: this new event has 205 ancestors and is cut-off event [2025-01-09 21:26:40,449 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is cut-off event [2025-01-09 21:26:40,449 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-01-09 21:26:40,449 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-01-09 21:26:40,457 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][267], [251#true, 241#true, 255#true, 242#true, 108#L939-36true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,457 INFO L294 olderBase$Statistics]: this new event has 201 ancestors and is cut-off event [2025-01-09 21:26:40,457 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-01-09 21:26:40,457 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-01-09 21:26:40,457 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-01-09 21:26:40,461 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [240#true, 251#true, 255#true, 243#true, 165#L939-36true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,461 INFO L294 olderBase$Statistics]: this new event has 201 ancestors and is not cut-off event [2025-01-09 21:26:40,461 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is not cut-off event [2025-01-09 21:26:40,461 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is not cut-off event [2025-01-09 21:26:40,461 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is not cut-off event [2025-01-09 21:26:40,470 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][267], [251#true, 241#true, 255#true, 242#true, 98#L940-2true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,471 INFO L294 olderBase$Statistics]: this new event has 205 ancestors and is cut-off event [2025-01-09 21:26:40,471 INFO L297 olderBase$Statistics]: existing Event has 218 ancestors and is cut-off event [2025-01-09 21:26:40,471 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:26:40,471 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:26:40,473 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [240#true, 32#L940-2true, 251#true, 255#true, 243#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:40,473 INFO L294 olderBase$Statistics]: this new event has 205 ancestors and is not cut-off event [2025-01-09 21:26:40,473 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is not cut-off event [2025-01-09 21:26:40,473 INFO L297 olderBase$Statistics]: existing Event has 218 ancestors and is not cut-off event [2025-01-09 21:26:40,473 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is not cut-off event [2025-01-09 21:26:40,493 INFO L124 PetriNetUnfolderBase]: 4754/15634 cut-off events. [2025-01-09 21:26:40,493 INFO L125 PetriNetUnfolderBase]: For 570/570 co-relation queries the response was YES. [2025-01-09 21:26:40,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23014 conditions, 15634 events. 4754/15634 cut-off events. For 570/570 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 174730 event pairs, 1581 based on Foata normal form. 0/13827 useless extension candidates. Maximal degree in co-relation 22903. Up to 3673 conditions per place. [2025-01-09 21:26:40,570 INFO L140 encePairwiseOnDemand]: 239/258 looper letters, 58 selfloop transitions, 14 changer transitions 0/273 dead transitions. [2025-01-09 21:26:40,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 273 transitions, 727 flow [2025-01-09 21:26:40,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:40,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:40,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 683 transitions. [2025-01-09 21:26:40,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8824289405684754 [2025-01-09 21:26:40,572 INFO L175 Difference]: Start difference. First operand has 242 places, 240 transitions, 506 flow. Second operand 3 states and 683 transitions. [2025-01-09 21:26:40,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 273 transitions, 727 flow [2025-01-09 21:26:40,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 273 transitions, 725 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:26:40,659 INFO L231 Difference]: Finished difference. Result has 245 places, 254 transitions, 626 flow [2025-01-09 21:26:40,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=245, PETRI_TRANSITIONS=254} [2025-01-09 21:26:40,660 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 3 predicate places. [2025-01-09 21:26:40,660 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 254 transitions, 626 flow [2025-01-09 21:26:40,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 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) [2025-01-09 21:26:40,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:40,661 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:40,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:26:40,661 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:40,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:40,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1422592220, now seen corresponding path program 1 times [2025-01-09 21:26:40,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:40,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994656226] [2025-01-09 21:26:40,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:40,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:40,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 21:26:40,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 21:26:40,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:40,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:40,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:26:40,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:40,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994656226] [2025-01-09 21:26:40,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994656226] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:40,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:40,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:26:40,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651518483] [2025-01-09 21:26:40,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:40,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:40,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:40,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:40,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:40,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 258 [2025-01-09 21:26:40,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 254 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:40,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:40,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 258 [2025-01-09 21:26:40,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:41,313 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [260#true, Black: 257#(= |#race~global~0| 0), 240#true, 255#true, 242#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:41,313 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is not cut-off event [2025-01-09 21:26:41,313 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is not cut-off event [2025-01-09 21:26:41,313 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2025-01-09 21:26:41,314 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2025-01-09 21:26:41,717 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [260#true, Black: 257#(= |#race~global~0| 0), 240#true, 255#true, 28#$Ultimate##0true, 243#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:41,717 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is not cut-off event [2025-01-09 21:26:41,717 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is not cut-off event [2025-01-09 21:26:41,717 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is not cut-off event [2025-01-09 21:26:41,717 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is not cut-off event [2025-01-09 21:26:41,720 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][270], [260#true, Black: 257#(= |#race~global~0| 0), 241#true, 16#$Ultimate##0true, 255#true, 242#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:41,720 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is not cut-off event [2025-01-09 21:26:41,720 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is not cut-off event [2025-01-09 21:26:41,720 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is not cut-off event [2025-01-09 21:26:41,720 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is not cut-off event [2025-01-09 21:26:41,740 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][270], [260#true, Black: 257#(= |#race~global~0| 0), 241#true, 255#true, 73#L938-3true, 242#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:41,740 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-01-09 21:26:41,740 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2025-01-09 21:26:41,740 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2025-01-09 21:26:41,740 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2025-01-09 21:26:41,758 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [260#true, 30#L938-3true, Black: 257#(= |#race~global~0| 0), 240#true, 255#true, 243#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:41,758 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is not cut-off event [2025-01-09 21:26:41,758 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2025-01-09 21:26:41,758 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is not cut-off event [2025-01-09 21:26:41,758 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is not cut-off event [2025-01-09 21:26:41,798 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][270], [260#true, Black: 257#(= |#race~global~0| 0), 241#true, 255#true, 70#L939-3true, 242#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:41,798 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2025-01-09 21:26:41,798 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-01-09 21:26:41,798 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-01-09 21:26:41,798 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-01-09 21:26:41,814 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [260#true, Black: 257#(= |#race~global~0| 0), 240#true, 255#true, 243#true, 134#L939-3true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:41,814 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is not cut-off event [2025-01-09 21:26:41,814 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event [2025-01-09 21:26:41,814 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is not cut-off event [2025-01-09 21:26:41,814 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is not cut-off event [2025-01-09 21:26:41,814 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [260#true, Black: 255#true, 240#true, 243#true, 257#(= |#race~global~0| 0), 53#L939-5true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:41,814 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is cut-off event [2025-01-09 21:26:41,814 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-01-09 21:26:41,814 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-01-09 21:26:41,814 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-01-09 21:26:41,846 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [260#true, Black: 257#(= |#race~global~0| 0), 240#true, 255#true, 243#true, 53#L939-5true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:41,846 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is not cut-off event [2025-01-09 21:26:41,846 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2025-01-09 21:26:41,846 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2025-01-09 21:26:41,846 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is not cut-off event [2025-01-09 21:26:41,863 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [260#true, Black: 257#(= |#race~global~0| 0), 240#true, 255#true, 243#true, 151#L952-8true, 209#L939-6true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:41,863 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is not cut-off event [2025-01-09 21:26:41,863 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is not cut-off event [2025-01-09 21:26:41,863 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is not cut-off event [2025-01-09 21:26:41,863 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is not cut-off event [2025-01-09 21:26:41,912 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [260#true, Black: 257#(= |#race~global~0| 0), 240#true, 255#true, 243#true, 117#L939-10true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:41,912 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is not cut-off event [2025-01-09 21:26:41,912 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is not cut-off event [2025-01-09 21:26:41,912 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is not cut-off event [2025-01-09 21:26:41,912 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is not cut-off event [2025-01-09 21:26:41,932 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][270], [260#true, Black: 257#(= |#race~global~0| 0), 241#true, 255#true, 242#true, 46#L939-13true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:41,932 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-01-09 21:26:41,932 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2025-01-09 21:26:41,932 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-01-09 21:26:41,932 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-01-09 21:26:41,941 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][270], [260#true, Black: 257#(= |#race~global~0| 0), 90#L939-16true, 241#true, 255#true, 242#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:41,941 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2025-01-09 21:26:41,941 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:26:41,941 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:26:41,941 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2025-01-09 21:26:41,950 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [260#true, Black: 257#(= |#race~global~0| 0), 240#true, 255#true, 243#true, 190#L939-16true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:41,950 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is not cut-off event [2025-01-09 21:26:41,950 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is not cut-off event [2025-01-09 21:26:41,950 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is not cut-off event [2025-01-09 21:26:41,950 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is not cut-off event [2025-01-09 21:26:41,967 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][270], [260#true, Black: 257#(= |#race~global~0| 0), 141#L939-23true, 241#true, 255#true, 242#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:41,968 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is cut-off event [2025-01-09 21:26:41,968 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-01-09 21:26:41,968 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:26:41,968 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-01-09 21:26:41,975 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [260#true, Black: 257#(= |#race~global~0| 0), 240#true, 255#true, 243#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0), 121#L939-23true]) [2025-01-09 21:26:41,975 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is not cut-off event [2025-01-09 21:26:41,975 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2025-01-09 21:26:41,975 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is not cut-off event [2025-01-09 21:26:41,975 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is not cut-off event [2025-01-09 21:26:41,982 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][270], [260#true, Black: 255#true, 241#true, 257#(= |#race~global~0| 0), 242#true, 151#L952-8true, 155#L939-25true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:41,982 INFO L294 olderBase$Statistics]: this new event has 192 ancestors and is cut-off event [2025-01-09 21:26:41,982 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-01-09 21:26:41,982 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2025-01-09 21:26:41,982 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-01-09 21:26:42,009 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][270], [260#true, Black: 257#(= |#race~global~0| 0), 241#true, 255#true, 242#true, 76#L939-30true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:42,009 INFO L294 olderBase$Statistics]: this new event has 197 ancestors and is cut-off event [2025-01-09 21:26:42,009 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-01-09 21:26:42,009 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-01-09 21:26:42,009 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-01-09 21:26:42,014 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [260#true, 214#L939-30true, Black: 257#(= |#race~global~0| 0), 240#true, 255#true, 243#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:42,014 INFO L294 olderBase$Statistics]: this new event has 197 ancestors and is not cut-off event [2025-01-09 21:26:42,014 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is not cut-off event [2025-01-09 21:26:42,014 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is not cut-off event [2025-01-09 21:26:42,014 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is not cut-off event [2025-01-09 21:26:42,087 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [260#true, Black: 255#true, 240#true, 243#true, 67#L939-25true, 257#(= |#race~global~0| 0), 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:42,087 INFO L294 olderBase$Statistics]: this new event has 205 ancestors and is cut-off event [2025-01-09 21:26:42,087 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-01-09 21:26:42,087 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-01-09 21:26:42,087 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is cut-off event [2025-01-09 21:26:42,092 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][270], [260#true, Black: 257#(= |#race~global~0| 0), 241#true, 255#true, 242#true, 108#L939-36true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:42,092 INFO L294 olderBase$Statistics]: this new event has 201 ancestors and is cut-off event [2025-01-09 21:26:42,092 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-01-09 21:26:42,092 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-01-09 21:26:42,092 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-01-09 21:26:42,096 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [260#true, Black: 257#(= |#race~global~0| 0), 240#true, 255#true, 243#true, 165#L939-36true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:42,096 INFO L294 olderBase$Statistics]: this new event has 201 ancestors and is not cut-off event [2025-01-09 21:26:42,096 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is not cut-off event [2025-01-09 21:26:42,096 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is not cut-off event [2025-01-09 21:26:42,096 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is not cut-off event [2025-01-09 21:26:42,104 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] t_funEXIT-->L952-8: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][270], [260#true, Black: 257#(= |#race~global~0| 0), 241#true, 255#true, 242#true, 98#L940-2true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:42,104 INFO L294 olderBase$Statistics]: this new event has 205 ancestors and is cut-off event [2025-01-09 21:26:42,104 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:26:42,105 INFO L297 olderBase$Statistics]: existing Event has 218 ancestors and is cut-off event [2025-01-09 21:26:42,105 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:26:42,107 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][241], [260#true, Black: 257#(= |#race~global~0| 0), 240#true, 32#L940-2true, 255#true, 243#true, 151#L952-8true, Black: 253#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:26:42,107 INFO L294 olderBase$Statistics]: this new event has 205 ancestors and is not cut-off event [2025-01-09 21:26:42,107 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is not cut-off event [2025-01-09 21:26:42,107 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is not cut-off event [2025-01-09 21:26:42,107 INFO L297 olderBase$Statistics]: existing Event has 218 ancestors and is not cut-off event [2025-01-09 21:26:42,127 INFO L124 PetriNetUnfolderBase]: 4902/18005 cut-off events. [2025-01-09 21:26:42,127 INFO L125 PetriNetUnfolderBase]: For 4558/4716 co-relation queries the response was YES. [2025-01-09 21:26:42,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29579 conditions, 18005 events. 4902/18005 cut-off events. For 4558/4716 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 214252 event pairs, 2418 based on Foata normal form. 45/16200 useless extension candidates. Maximal degree in co-relation 28053. Up to 6184 conditions per place. [2025-01-09 21:26:42,217 INFO L140 encePairwiseOnDemand]: 249/258 looper letters, 52 selfloop transitions, 14 changer transitions 0/278 dead transitions. [2025-01-09 21:26:42,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 278 transitions, 844 flow [2025-01-09 21:26:42,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:42,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:42,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 677 transitions. [2025-01-09 21:26:42,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8746770025839793 [2025-01-09 21:26:42,220 INFO L175 Difference]: Start difference. First operand has 245 places, 254 transitions, 626 flow. Second operand 3 states and 677 transitions. [2025-01-09 21:26:42,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 278 transitions, 844 flow [2025-01-09 21:26:42,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 278 transitions, 806 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:26:42,233 INFO L231 Difference]: Finished difference. Result has 247 places, 266 transitions, 724 flow [2025-01-09 21:26:42,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=724, PETRI_PLACES=247, PETRI_TRANSITIONS=266} [2025-01-09 21:26:42,235 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 5 predicate places. [2025-01-09 21:26:42,235 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 266 transitions, 724 flow [2025-01-09 21:26:42,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:42,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:42,236 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:42,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:26:42,236 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:42,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:42,238 INFO L85 PathProgramCache]: Analyzing trace with hash -896994886, now seen corresponding path program 1 times [2025-01-09 21:26:42,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:42,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597757903] [2025-01-09 21:26:42,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:42,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:42,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 21:26:42,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 21:26:42,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:42,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:42,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:26:42,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:42,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597757903] [2025-01-09 21:26:42,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597757903] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:42,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:42,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:26:42,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079527250] [2025-01-09 21:26:42,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:42,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:26:42,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:42,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:26:42,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:26:42,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 258 [2025-01-09 21:26:42,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 266 transitions, 724 flow. Second operand has 5 states, 5 states have (on average 214.6) internal successors, (1073), 5 states have internal predecessors, (1073), 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) [2025-01-09 21:26:42,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:42,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 258 [2025-01-09 21:26:42,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:44,286 INFO L124 PetriNetUnfolderBase]: 3981/20483 cut-off events. [2025-01-09 21:26:44,286 INFO L125 PetriNetUnfolderBase]: For 2390/2778 co-relation queries the response was YES. [2025-01-09 21:26:44,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29978 conditions, 20483 events. 3981/20483 cut-off events. For 2390/2778 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 264948 event pairs, 1214 based on Foata normal form. 28/17951 useless extension candidates. Maximal degree in co-relation 13515. Up to 4007 conditions per place. [2025-01-09 21:26:44,363 INFO L140 encePairwiseOnDemand]: 253/258 looper letters, 56 selfloop transitions, 5 changer transitions 0/298 dead transitions. [2025-01-09 21:26:44,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 298 transitions, 910 flow [2025-01-09 21:26:44,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:26:44,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:26:44,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1340 transitions. [2025-01-09 21:26:44,366 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8656330749354005 [2025-01-09 21:26:44,366 INFO L175 Difference]: Start difference. First operand has 247 places, 266 transitions, 724 flow. Second operand 6 states and 1340 transitions. [2025-01-09 21:26:44,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 298 transitions, 910 flow [2025-01-09 21:26:44,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 298 transitions, 882 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:26:44,375 INFO L231 Difference]: Finished difference. Result has 253 places, 268 transitions, 722 flow [2025-01-09 21:26:44,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=722, PETRI_PLACES=253, PETRI_TRANSITIONS=268} [2025-01-09 21:26:44,376 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 11 predicate places. [2025-01-09 21:26:44,376 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 268 transitions, 722 flow [2025-01-09 21:26:44,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 214.6) internal successors, (1073), 5 states have internal predecessors, (1073), 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) [2025-01-09 21:26:44,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:44,377 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:44,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:26:44,377 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:44,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:44,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1037473512, now seen corresponding path program 1 times [2025-01-09 21:26:44,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:44,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642663861] [2025-01-09 21:26:44,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:44,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:44,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 21:26:44,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 21:26:44,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:44,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:44,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:26:44,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:44,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642663861] [2025-01-09 21:26:44,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642663861] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:44,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:44,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:26:44,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470650385] [2025-01-09 21:26:44,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:44,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:44,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:44,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:44,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:44,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 258 [2025-01-09 21:26:44,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 268 transitions, 722 flow. Second operand has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 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) [2025-01-09 21:26:44,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:44,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 258 [2025-01-09 21:26:44,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:46,050 INFO L124 PetriNetUnfolderBase]: 5587/21320 cut-off events. [2025-01-09 21:26:46,050 INFO L125 PetriNetUnfolderBase]: For 5247/5442 co-relation queries the response was YES. [2025-01-09 21:26:46,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34628 conditions, 21320 events. 5587/21320 cut-off events. For 5247/5442 co-relation queries the response was YES. Maximal size of possible extension queue 732. Compared 266716 event pairs, 2594 based on Foata normal form. 39/18948 useless extension candidates. Maximal degree in co-relation 34383. Up to 6886 conditions per place. [2025-01-09 21:26:46,144 INFO L140 encePairwiseOnDemand]: 249/258 looper letters, 59 selfloop transitions, 17 changer transitions 0/292 dead transitions. [2025-01-09 21:26:46,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 292 transitions, 957 flow [2025-01-09 21:26:46,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:46,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:46,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 676 transitions. [2025-01-09 21:26:46,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8733850129198967 [2025-01-09 21:26:46,146 INFO L175 Difference]: Start difference. First operand has 253 places, 268 transitions, 722 flow. Second operand 3 states and 676 transitions. [2025-01-09 21:26:46,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 292 transitions, 957 flow [2025-01-09 21:26:46,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 292 transitions, 951 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-09 21:26:46,151 INFO L231 Difference]: Finished difference. Result has 255 places, 281 transitions, 870 flow [2025-01-09 21:26:46,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=870, PETRI_PLACES=255, PETRI_TRANSITIONS=281} [2025-01-09 21:26:46,152 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 13 predicate places. [2025-01-09 21:26:46,152 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 281 transitions, 870 flow [2025-01-09 21:26:46,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 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) [2025-01-09 21:26:46,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:46,153 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:46,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:26:46,153 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:46,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:46,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1479670545, now seen corresponding path program 1 times [2025-01-09 21:26:46,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:46,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549429713] [2025-01-09 21:26:46,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:46,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:46,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 21:26:46,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 21:26:46,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:46,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:46,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:26:46,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:46,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549429713] [2025-01-09 21:26:46,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549429713] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:46,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:46,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:26:46,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136879881] [2025-01-09 21:26:46,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:46,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:46,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:46,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:46,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:46,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 258 [2025-01-09 21:26:46,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 281 transitions, 870 flow. Second operand has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 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) [2025-01-09 21:26:46,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:46,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 258 [2025-01-09 21:26:46,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:48,707 INFO L124 PetriNetUnfolderBase]: 6260/24125 cut-off events. [2025-01-09 21:26:48,707 INFO L125 PetriNetUnfolderBase]: For 12675/13127 co-relation queries the response was YES. [2025-01-09 21:26:48,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42176 conditions, 24125 events. 6260/24125 cut-off events. For 12675/13127 co-relation queries the response was YES. Maximal size of possible extension queue 790. Compared 308839 event pairs, 2799 based on Foata normal form. 59/21507 useless extension candidates. Maximal degree in co-relation 41910. Up to 7732 conditions per place. [2025-01-09 21:26:48,818 INFO L140 encePairwiseOnDemand]: 249/258 looper letters, 71 selfloop transitions, 17 changer transitions 0/306 dead transitions. [2025-01-09 21:26:48,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 306 transitions, 1164 flow [2025-01-09 21:26:48,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:48,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:48,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 677 transitions. [2025-01-09 21:26:48,820 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8746770025839793 [2025-01-09 21:26:48,820 INFO L175 Difference]: Start difference. First operand has 255 places, 281 transitions, 870 flow. Second operand 3 states and 677 transitions. [2025-01-09 21:26:48,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 306 transitions, 1164 flow [2025-01-09 21:26:48,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 306 transitions, 1124 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:26:48,837 INFO L231 Difference]: Finished difference. Result has 257 places, 294 transitions, 1012 flow [2025-01-09 21:26:48,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1012, PETRI_PLACES=257, PETRI_TRANSITIONS=294} [2025-01-09 21:26:48,838 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 15 predicate places. [2025-01-09 21:26:48,838 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 294 transitions, 1012 flow [2025-01-09 21:26:48,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 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) [2025-01-09 21:26:48,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:48,839 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:48,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:26:48,840 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:48,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:48,840 INFO L85 PathProgramCache]: Analyzing trace with hash -110095157, now seen corresponding path program 1 times [2025-01-09 21:26:48,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:48,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361125179] [2025-01-09 21:26:48,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:48,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:48,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 21:26:48,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 21:26:48,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:48,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:26:48,864 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:26:48,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 21:26:48,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 21:26:48,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:48,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:26:48,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:26:48,891 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:26:48,891 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-01-09 21:26:48,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-01-09 21:26:48,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-01-09 21:26:48,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-01-09 21:26:48,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-01-09 21:26:48,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-01-09 21:26:48,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-01-09 21:26:48,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-01-09 21:26:48,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-01-09 21:26:48,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-01-09 21:26:48,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-01-09 21:26:48,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-01-09 21:26:48,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-01-09 21:26:48,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-01-09 21:26:48,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-01-09 21:26:48,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-01-09 21:26:48,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:26:48,893 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:48,894 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:26:48,894 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:26:48,916 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:26:48,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 286 places, 307 transitions, 641 flow [2025-01-09 21:26:48,959 INFO L124 PetriNetUnfolderBase]: 54/605 cut-off events. [2025-01-09 21:26:48,959 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-09 21:26:48,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 605 events. 54/605 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2135 event pairs, 1 based on Foata normal form. 0/519 useless extension candidates. Maximal degree in co-relation 427. Up to 12 conditions per place. [2025-01-09 21:26:48,962 INFO L82 GeneralOperation]: Start removeDead. Operand has 286 places, 307 transitions, 641 flow [2025-01-09 21:26:48,965 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 286 places, 307 transitions, 641 flow [2025-01-09 21:26:48,967 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:26:48,967 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;@177c8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:26:48,968 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-01-09 21:26:48,973 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:26:48,973 INFO L124 PetriNetUnfolderBase]: 2/111 cut-off events. [2025-01-09 21:26:48,973 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:26:48,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:48,974 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:48,974 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:26:48,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:48,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1762124146, now seen corresponding path program 1 times [2025-01-09 21:26:48,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:48,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983442330] [2025-01-09 21:26:48,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:48,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:48,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 21:26:48,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 21:26:48,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:48,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:49,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:49,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:49,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983442330] [2025-01-09 21:26:49,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983442330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:49,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:49,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:26:49,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038080603] [2025-01-09 21:26:49,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:49,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:26:49,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:49,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:26:49,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:26:49,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 307 [2025-01-09 21:26:49,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 307 transitions, 641 flow. Second operand has 6 states, 6 states have (on average 239.5) internal successors, (1437), 6 states have internal predecessors, (1437), 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) [2025-01-09 21:26:49,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:49,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 307 [2025-01-09 21:26:49,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:55,819 INFO L124 PetriNetUnfolderBase]: 20344/69062 cut-off events. [2025-01-09 21:26:55,819 INFO L125 PetriNetUnfolderBase]: For 1107/1109 co-relation queries the response was YES. [2025-01-09 21:26:55,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97669 conditions, 69062 events. 20344/69062 cut-off events. For 1107/1109 co-relation queries the response was YES. Maximal size of possible extension queue 1510. Compared 951414 event pairs, 6970 based on Foata normal form. 13397/75651 useless extension candidates. Maximal degree in co-relation 11521. Up to 20303 conditions per place. [2025-01-09 21:26:56,223 INFO L140 encePairwiseOnDemand]: 279/307 looper letters, 112 selfloop transitions, 5 changer transitions 0/354 dead transitions. [2025-01-09 21:26:56,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 354 transitions, 969 flow [2025-01-09 21:26:56,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:26:56,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:26:56,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1640 transitions. [2025-01-09 21:26:56,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8903365906623235 [2025-01-09 21:26:56,227 INFO L175 Difference]: Start difference. First operand has 286 places, 307 transitions, 641 flow. Second operand 6 states and 1640 transitions. [2025-01-09 21:26:56,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 354 transitions, 969 flow [2025-01-09 21:26:56,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 354 transitions, 969 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:26:56,232 INFO L231 Difference]: Finished difference. Result has 288 places, 282 transitions, 601 flow [2025-01-09 21:26:56,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=601, PETRI_PLACES=288, PETRI_TRANSITIONS=282} [2025-01-09 21:26:56,233 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 2 predicate places. [2025-01-09 21:26:56,233 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 282 transitions, 601 flow [2025-01-09 21:26:56,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 239.5) internal successors, (1437), 6 states have internal predecessors, (1437), 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) [2025-01-09 21:26:56,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:56,234 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:56,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:26:56,235 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:26:56,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:56,235 INFO L85 PathProgramCache]: Analyzing trace with hash 900292337, now seen corresponding path program 1 times [2025-01-09 21:26:56,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:56,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424838288] [2025-01-09 21:26:56,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:56,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:56,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 21:26:56,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 21:26:56,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:56,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:56,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:56,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:56,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424838288] [2025-01-09 21:26:56,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424838288] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:56,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:56,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:26:56,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724910711] [2025-01-09 21:26:56,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:56,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:56,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:56,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:56,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:56,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 307 [2025-01-09 21:26:56,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 282 transitions, 601 flow. Second operand has 3 states, 3 states have (on average 251.66666666666666) internal successors, (755), 3 states have internal predecessors, (755), 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) [2025-01-09 21:26:56,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:56,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 307 [2025-01-09 21:26:56,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:00,158 INFO L124 PetriNetUnfolderBase]: 10694/37921 cut-off events. [2025-01-09 21:27:00,158 INFO L125 PetriNetUnfolderBase]: For 2257/2257 co-relation queries the response was YES. [2025-01-09 21:27:00,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53569 conditions, 37921 events. 10694/37921 cut-off events. For 2257/2257 co-relation queries the response was YES. Maximal size of possible extension queue 907. Compared 489065 event pairs, 5582 based on Foata normal form. 1/34178 useless extension candidates. Maximal degree in co-relation 7136. Up to 14422 conditions per place. [2025-01-09 21:27:00,354 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 39 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2025-01-09 21:27:00,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 289 transitions, 699 flow [2025-01-09 21:27:00,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:27:00,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:27:00,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 792 transitions. [2025-01-09 21:27:00,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8599348534201955 [2025-01-09 21:27:00,359 INFO L175 Difference]: Start difference. First operand has 288 places, 282 transitions, 601 flow. Second operand 3 states and 792 transitions. [2025-01-09 21:27:00,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 289 transitions, 699 flow [2025-01-09 21:27:00,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 289 transitions, 687 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:27:00,363 INFO L231 Difference]: Finished difference. Result has 286 places, 283 transitions, 603 flow [2025-01-09 21:27:00,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=603, PETRI_PLACES=286, PETRI_TRANSITIONS=283} [2025-01-09 21:27:00,364 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 0 predicate places. [2025-01-09 21:27:00,364 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 283 transitions, 603 flow [2025-01-09 21:27:00,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 251.66666666666666) internal successors, (755), 3 states have internal predecessors, (755), 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) [2025-01-09 21:27:00,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:00,364 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:00,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:27:00,364 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:27:00,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:00,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1357658915, now seen corresponding path program 1 times [2025-01-09 21:27:00,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:00,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729208592] [2025-01-09 21:27:00,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:00,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:00,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 21:27:00,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 21:27:00,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:00,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:00,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:27:00,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:00,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729208592] [2025-01-09 21:27:00,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729208592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:00,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:00,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:27:00,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288351823] [2025-01-09 21:27:00,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:00,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:27:00,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:00,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:27:00,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:27:00,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 307 [2025-01-09 21:27:00,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 283 transitions, 603 flow. Second operand has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 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) [2025-01-09 21:27:00,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:00,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 307 [2025-01-09 21:27:00,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:02,044 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1231] t_funEXIT-->L952-8: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_11|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} AuxVars[] AssignedVars[][254], [299#true, 282#true, 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 284#true, 174#L952-8true, 295#true]) [2025-01-09 21:27:02,044 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is not cut-off event [2025-01-09 21:27:02,044 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2025-01-09 21:27:02,044 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2025-01-09 21:27:02,044 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is not cut-off event [2025-01-09 21:27:05,480 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1231] t_funEXIT-->L952-8: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_11|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} AuxVars[] AssignedVars[][254], [299#true, 282#true, 135#$Ultimate##0true, 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 174#L952-8true, 285#true, 295#true]) [2025-01-09 21:27:05,480 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is not cut-off event [2025-01-09 21:27:05,481 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is not cut-off event [2025-01-09 21:27:05,481 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is not cut-off event [2025-01-09 21:27:05,481 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is not cut-off event [2025-01-09 21:27:05,486 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1232] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_13| v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_13|} AuxVars[] AssignedVars[][302], [299#true, 78#$Ultimate##0true, 283#true, 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 284#true, 174#L952-8true, 295#true]) [2025-01-09 21:27:05,486 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is not cut-off event [2025-01-09 21:27:05,486 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is not cut-off event [2025-01-09 21:27:05,486 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is not cut-off event [2025-01-09 21:27:05,487 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is not cut-off event [2025-01-09 21:27:05,870 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1232] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_13| v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_13|} AuxVars[] AssignedVars[][302], [299#true, 283#true, 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 284#true, 82#L938-3true, 174#L952-8true, 295#true]) [2025-01-09 21:27:05,871 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-01-09 21:27:05,871 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2025-01-09 21:27:05,871 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2025-01-09 21:27:05,871 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2025-01-09 21:27:06,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1231] t_funEXIT-->L952-8: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_11|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} AuxVars[] AssignedVars[][254], [299#true, 282#true, 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 173#L938-3true, 174#L952-8true, 285#true, 295#true]) [2025-01-09 21:27:06,450 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is not cut-off event [2025-01-09 21:27:06,450 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2025-01-09 21:27:06,450 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is not cut-off event [2025-01-09 21:27:06,450 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is not cut-off event [2025-01-09 21:27:07,241 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1232] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_13| v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_13|} AuxVars[] AssignedVars[][302], [299#true, 110#L939-3true, 283#true, 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 284#true, 174#L952-8true, 295#true]) [2025-01-09 21:27:07,241 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2025-01-09 21:27:07,241 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-01-09 21:27:07,241 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-01-09 21:27:07,241 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-01-09 21:27:07,561 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1231] t_funEXIT-->L952-8: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_11|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} AuxVars[] AssignedVars[][254], [299#true, 282#true, 286#true, 7#L939-3true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 174#L952-8true, 285#true, 295#true]) [2025-01-09 21:27:07,561 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is not cut-off event [2025-01-09 21:27:07,561 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event [2025-01-09 21:27:07,561 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is not cut-off event [2025-01-09 21:27:07,561 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is not cut-off event [2025-01-09 21:27:07,561 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1231] t_funEXIT-->L952-8: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_11|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} AuxVars[] AssignedVars[][311], [282#true, 301#(= |#race~global~0| 0), 157#L939-5true, 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 174#L952-8true, 285#true, 295#true]) [2025-01-09 21:27:07,562 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is cut-off event [2025-01-09 21:27:07,562 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-01-09 21:27:07,562 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-01-09 21:27:07,562 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-01-09 21:27:08,403 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1231] t_funEXIT-->L952-8: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_11|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} AuxVars[] AssignedVars[][311], [75#L939-6true, 282#true, 301#(= |#race~global~0| 0), 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 174#L952-8true, 285#true, 295#true]) [2025-01-09 21:27:08,403 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2025-01-09 21:27:08,403 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-01-09 21:27:08,403 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is cut-off event [2025-01-09 21:27:08,404 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-01-09 21:27:08,404 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1231] t_funEXIT-->L952-8: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_11|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} AuxVars[] AssignedVars[][254], [299#true, 282#true, 157#L939-5true, 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 174#L952-8true, 285#true, 295#true]) [2025-01-09 21:27:08,404 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is not cut-off event [2025-01-09 21:27:08,404 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is not cut-off event [2025-01-09 21:27:08,404 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2025-01-09 21:27:08,404 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2025-01-09 21:27:08,404 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1231] t_funEXIT-->L952-8: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_11|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} AuxVars[] AssignedVars[][254], [299#true, 282#true, 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 19#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 174#L952-8true, 285#true, 295#true]) [2025-01-09 21:27:08,404 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2025-01-09 21:27:08,404 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is cut-off event [2025-01-09 21:27:08,404 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-01-09 21:27:08,404 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-01-09 21:27:08,795 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1231] t_funEXIT-->L952-8: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_11|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} AuxVars[] AssignedVars[][254], [75#L939-6true, 299#true, 282#true, 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 174#L952-8true, 285#true, 295#true]) [2025-01-09 21:27:08,795 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is not cut-off event [2025-01-09 21:27:08,795 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is not cut-off event [2025-01-09 21:27:08,795 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is not cut-off event [2025-01-09 21:27:08,795 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is not cut-off event [2025-01-09 21:27:10,651 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1232] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_13| v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_13|} AuxVars[] AssignedVars[][302], [299#true, 141#L939-10true, 283#true, 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 284#true, 174#L952-8true, 295#true]) [2025-01-09 21:27:10,651 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is cut-off event [2025-01-09 21:27:10,651 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2025-01-09 21:27:10,651 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2025-01-09 21:27:10,651 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-01-09 21:27:11,049 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1231] t_funEXIT-->L952-8: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_11|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} AuxVars[] AssignedVars[][254], [211#L939-10true, 299#true, 282#true, 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 174#L952-8true, 285#true, 295#true]) [2025-01-09 21:27:11,049 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is not cut-off event [2025-01-09 21:27:11,049 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is not cut-off event [2025-01-09 21:27:11,049 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is not cut-off event [2025-01-09 21:27:11,050 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is not cut-off event [2025-01-09 21:27:11,804 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1231] t_funEXIT-->L952-8: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_11|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} AuxVars[] AssignedVars[][254], [299#true, 282#true, 135#$Ultimate##0true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 64#$Ultimate##0true, 174#L952-8true, 285#true, 295#true, 287#true]) [2025-01-09 21:27:11,804 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is not cut-off event [2025-01-09 21:27:11,804 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2025-01-09 21:27:11,804 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is not cut-off event [2025-01-09 21:27:11,804 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2025-01-09 21:27:11,804 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1231] t_funEXIT-->L952-8: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_11|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} AuxVars[] AssignedVars[][254], [299#true, 282#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 64#$Ultimate##0true, 173#L938-3true, 174#L952-8true, 285#true, 295#true, 287#true]) [2025-01-09 21:27:11,805 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2025-01-09 21:27:11,805 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:27:11,805 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2025-01-09 21:27:11,805 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:27:12,012 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1232] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_13| v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_13|} AuxVars[] AssignedVars[][302], [299#true, 78#$Ultimate##0true, 283#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 64#$Ultimate##0true, 284#true, 174#L952-8true, 295#true, 287#true]) [2025-01-09 21:27:12,012 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is not cut-off event [2025-01-09 21:27:12,012 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2025-01-09 21:27:12,012 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2025-01-09 21:27:12,012 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is not cut-off event [2025-01-09 21:27:12,013 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1233] t_funEXIT-->L952-8: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_15|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][328], [299#true, 78#$Ultimate##0true, 283#true, 135#$Ultimate##0true, 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 174#L952-8true, 285#true, 295#true]) [2025-01-09 21:27:12,013 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is not cut-off event [2025-01-09 21:27:12,013 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2025-01-09 21:27:12,013 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is not cut-off event [2025-01-09 21:27:12,013 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2025-01-09 21:27:12,577 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1233] t_funEXIT-->L952-8: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_15|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][328], [299#true, 283#true, 135#$Ultimate##0true, 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 82#L938-3true, 174#L952-8true, 285#true, 295#true]) [2025-01-09 21:27:12,577 INFO L294 olderBase$Statistics]: this new event has 200 ancestors and is cut-off event [2025-01-09 21:27:12,577 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:27:12,577 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-01-09 21:27:12,577 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:27:12,630 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1233] t_funEXIT-->L952-8: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_15|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][328], [299#true, 78#$Ultimate##0true, 283#true, 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 173#L938-3true, 174#L952-8true, 285#true, 295#true]) [2025-01-09 21:27:12,630 INFO L294 olderBase$Statistics]: this new event has 200 ancestors and is cut-off event [2025-01-09 21:27:12,630 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:27:12,630 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-01-09 21:27:12,630 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:27:12,647 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1232] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_13| v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_13|} AuxVars[] AssignedVars[][302], [116#L939-16true, 299#true, 283#true, 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 284#true, 174#L952-8true, 295#true]) [2025-01-09 21:27:12,647 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2025-01-09 21:27:12,647 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:27:12,647 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:27:12,647 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2025-01-09 21:27:12,854 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1231] t_funEXIT-->L952-8: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_11|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} AuxVars[] AssignedVars[][254], [299#true, 282#true, 135#$Ultimate##0true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 196#L938-3true, 174#L952-8true, 285#true, 295#true, 287#true]) [2025-01-09 21:27:12,855 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is not cut-off event [2025-01-09 21:27:12,855 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is not cut-off event [2025-01-09 21:27:12,855 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is not cut-off event [2025-01-09 21:27:12,855 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is not cut-off event [2025-01-09 21:27:12,855 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1231] t_funEXIT-->L952-8: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_11|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} AuxVars[] AssignedVars[][254], [299#true, 282#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 173#L938-3true, 196#L938-3true, 174#L952-8true, 285#true, 295#true, 287#true]) [2025-01-09 21:27:12,855 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is cut-off event [2025-01-09 21:27:12,855 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2025-01-09 21:27:12,855 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-01-09 21:27:12,855 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2025-01-09 21:27:12,964 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1232] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_13| v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_13|} AuxVars[] AssignedVars[][302], [299#true, 283#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 64#$Ultimate##0true, 284#true, 82#L938-3true, 174#L952-8true, 295#true, 287#true]) [2025-01-09 21:27:12,964 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is not cut-off event [2025-01-09 21:27:12,964 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is not cut-off event [2025-01-09 21:27:12,964 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is not cut-off event [2025-01-09 21:27:12,964 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is not cut-off event [2025-01-09 21:27:13,021 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1232] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_13| v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_13|} AuxVars[] AssignedVars[][302], [299#true, 78#$Ultimate##0true, 283#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 284#true, 196#L938-3true, 174#L952-8true, 295#true, 287#true]) [2025-01-09 21:27:13,022 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is not cut-off event [2025-01-09 21:27:13,022 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is not cut-off event [2025-01-09 21:27:13,022 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is not cut-off event [2025-01-09 21:27:13,022 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is not cut-off event [2025-01-09 21:27:13,030 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1231] t_funEXIT-->L952-8: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_11|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} AuxVars[] AssignedVars[][254], [299#true, 282#true, 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 58#L939-16true, 174#L952-8true, 285#true, 295#true]) [2025-01-09 21:27:13,031 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is not cut-off event [2025-01-09 21:27:13,031 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is not cut-off event [2025-01-09 21:27:13,031 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is not cut-off event [2025-01-09 21:27:13,031 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is not cut-off event [2025-01-09 21:27:13,650 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1233] t_funEXIT-->L952-8: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_15|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][328], [299#true, 283#true, 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 173#L938-3true, 82#L938-3true, 174#L952-8true, 285#true, 295#true]) [2025-01-09 21:27:13,650 INFO L294 olderBase$Statistics]: this new event has 202 ancestors and is cut-off event [2025-01-09 21:27:13,650 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2025-01-09 21:27:13,650 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-01-09 21:27:13,650 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2025-01-09 21:27:14,127 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1231] t_funEXIT-->L952-8: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_11|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_11|} AuxVars[] AssignedVars[][254], [299#true, 282#true, 7#L939-3true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 64#$Ultimate##0true, 174#L952-8true, 285#true, 295#true, 287#true]) [2025-01-09 21:27:14,128 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is cut-off event [2025-01-09 21:27:14,128 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-01-09 21:27:14,128 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-01-09 21:27:14,128 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:27:14,267 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1233] t_funEXIT-->L952-8: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_15|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][328], [299#true, 110#L939-3true, 283#true, 135#$Ultimate##0true, 286#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 174#L952-8true, 285#true, 295#true]) [2025-01-09 21:27:14,267 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is cut-off event [2025-01-09 21:27:14,267 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-01-09 21:27:14,268 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-01-09 21:27:14,268 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-01-09 21:27:14,296 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1232] t_funEXIT-->L952-8: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_13| v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_13|} AuxVars[] AssignedVars[][302], [299#true, 283#true, Black: 297#(= |ULTIMATE.start_main_~i~1#1| 0), 284#true, 82#L938-3true, 196#L938-3true, 174#L952-8true, 295#true, 287#true]) [2025-01-09 21:27:14,296 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is not cut-off event [2025-01-09 21:27:14,296 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is not cut-off event [2025-01-09 21:27:14,296 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is not cut-off event [2025-01-09 21:27:14,296 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is not cut-off event