./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 830cb16a3cbc120e059f0ed7638e33ed20360a11f425952cf536aa3d659b86fc --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:19:25,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:19:25,825 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:19:25,831 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:19:25,832 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:19:25,850 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:19:25,851 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:19:25,851 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:19:25,852 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:19:25,852 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:19:25,852 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:19:25,852 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:19:25,852 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:19:25,853 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:19:25,853 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:19:25,854 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:19:25,854 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:19:25,854 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:19:25,854 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:19:25,854 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:19:25,854 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:19:25,854 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:19:25,854 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:19:25,854 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:19:25,854 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:19:25,854 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:19:25,854 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:19:25,854 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:19:25,855 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:19:25,855 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:19:25,855 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:19:25,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:19:25,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:19:25,855 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:19:25,855 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:19:25,855 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:19:25,855 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:19:25,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:19:25,855 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:19:25,855 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:19:25,855 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:19:25,855 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:19:25,855 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/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 -> 830cb16a3cbc120e059f0ed7638e33ed20360a11f425952cf536aa3d659b86fc [2025-03-13 22:19:26,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:19:26,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:19:26,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:19:26,087 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:19:26,087 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:19:26,088 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.i [2025-03-13 22:19:27,260 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a31d690a/e2f5cc402ab24e2087934af549b09dc9/FLAG75beb8b44 [2025-03-13 22:19:27,552 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:19:27,555 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.i [2025-03-13 22:19:27,569 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a31d690a/e2f5cc402ab24e2087934af549b09dc9/FLAG75beb8b44 [2025-03-13 22:19:27,587 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a31d690a/e2f5cc402ab24e2087934af549b09dc9 [2025-03-13 22:19:27,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:19:27,591 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:19:27,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:19:27,594 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:19:27,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:19:27,599 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:19:27" (1/1) ... [2025-03-13 22:19:27,600 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@498f2ed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:27, skipping insertion in model container [2025-03-13 22:19:27,600 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:19:27" (1/1) ... [2025-03-13 22:19:27,635 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:19:27,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:19:27,930 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:19:27,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:19:28,016 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:19:28,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:28 WrapperNode [2025-03-13 22:19:28,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:19:28,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:19:28,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:19:28,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:19:28,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:28" (1/1) ... [2025-03-13 22:19:28,032 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:28" (1/1) ... [2025-03-13 22:19:28,047 INFO L138 Inliner]: procedures = 271, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 102 [2025-03-13 22:19:28,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:19:28,048 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:19:28,050 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:19:28,050 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:19:28,055 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:28" (1/1) ... [2025-03-13 22:19:28,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:28" (1/1) ... [2025-03-13 22:19:28,057 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:28" (1/1) ... [2025-03-13 22:19:28,057 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:28" (1/1) ... [2025-03-13 22:19:28,061 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:28" (1/1) ... [2025-03-13 22:19:28,064 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:28" (1/1) ... [2025-03-13 22:19:28,065 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:28" (1/1) ... [2025-03-13 22:19:28,065 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:28" (1/1) ... [2025-03-13 22:19:28,067 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:19:28,068 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:19:28,068 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:19:28,069 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:19:28,069 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:28" (1/1) ... [2025-03-13 22:19:28,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:19:28,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:19:28,096 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:19:28,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:19:28,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-13 22:19:28,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 22:19:28,115 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 22:19:28,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:19:28,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:19:28,115 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 22:19:28,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:19:28,116 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-13 22:19:28,116 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-13 22:19:28,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:19:28,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:19:28,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:19:28,117 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:19:28,226 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:19:28,227 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:19:28,392 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L945: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-13 22:19:28,393 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L945-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-13 22:19:28,442 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:19:28,443 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:19:28,443 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:19:28,470 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:19:28,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:19:28 BoogieIcfgContainer [2025-03-13 22:19:28,471 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:19:28,473 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:19:28,473 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:19:28,476 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:19:28,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:19:27" (1/3) ... [2025-03-13 22:19:28,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@560c51bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:19:28, skipping insertion in model container [2025-03-13 22:19:28,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:28" (2/3) ... [2025-03-13 22:19:28,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@560c51bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:19:28, skipping insertion in model container [2025-03-13 22:19:28,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:19:28" (3/3) ... [2025-03-13 22:19:28,478 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_06-cond_racing1.i [2025-03-13 22:19:28,490 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:19:28,492 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_06-cond_racing1.i that has 2 procedures, 144 locations, 1 initial locations, 5 loop locations, and 7 error locations. [2025-03-13 22:19:28,492 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:19:28,559 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-13 22:19:28,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 158 transitions, 323 flow [2025-03-13 22:19:28,680 INFO L124 PetriNetUnfolderBase]: 21/225 cut-off events. [2025-03-13 22:19:28,682 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:19:28,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 225 events. 21/225 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 675 event pairs, 0 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 116. Up to 6 conditions per place. [2025-03-13 22:19:28,688 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 158 transitions, 323 flow [2025-03-13 22:19:28,693 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 158 transitions, 323 flow [2025-03-13 22:19:28,702 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:19:28,710 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;@a1abb50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:19:28,711 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-13 22:19:28,728 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:19:28,732 INFO L124 PetriNetUnfolderBase]: 2/60 cut-off events. [2025-03-13 22:19:28,732 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:19:28,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:28,733 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] [2025-03-13 22:19:28,733 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:19:28,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:28,746 INFO L85 PathProgramCache]: Analyzing trace with hash -366710727, now seen corresponding path program 1 times [2025-03-13 22:19:28,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:28,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784292356] [2025-03-13 22:19:28,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:28,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:28,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-13 22:19:28,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-13 22:19:28,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:28,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:29,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:19:29,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:29,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784292356] [2025-03-13 22:19:29,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784292356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:29,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:29,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:19:29,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659680792] [2025-03-13 22:19:29,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:29,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:19:29,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:29,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:19:29,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:19:29,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 158 [2025-03-13 22:19:29,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 158 transitions, 323 flow. Second operand has 6 states, 6 states have (on average 118.5) internal successors, (711), 6 states have internal predecessors, (711), 0 states have call successors, (0), 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-03-13 22:19:29,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:29,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 158 [2025-03-13 22:19:29,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:29,886 INFO L124 PetriNetUnfolderBase]: 121/794 cut-off events. [2025-03-13 22:19:29,887 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 22:19:29,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1050 conditions, 794 events. 121/794 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4872 event pairs, 7 based on Foata normal form. 75/783 useless extension candidates. Maximal degree in co-relation 919. Up to 174 conditions per place. [2025-03-13 22:19:29,893 INFO L140 encePairwiseOnDemand]: 142/158 looper letters, 48 selfloop transitions, 5 changer transitions 0/169 dead transitions. [2025-03-13 22:19:29,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 169 transitions, 451 flow [2025-03-13 22:19:29,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:19:29,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:19:29,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 790 transitions. [2025-03-13 22:19:29,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2025-03-13 22:19:29,911 INFO L175 Difference]: Start difference. First operand has 147 places, 158 transitions, 323 flow. Second operand 6 states and 790 transitions. [2025-03-13 22:19:29,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 169 transitions, 451 flow [2025-03-13 22:19:29,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 169 transitions, 451 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:19:29,919 INFO L231 Difference]: Finished difference. Result has 149 places, 145 transitions, 307 flow [2025-03-13 22:19:29,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=307, PETRI_PLACES=149, PETRI_TRANSITIONS=145} [2025-03-13 22:19:29,924 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 2 predicate places. [2025-03-13 22:19:29,925 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 145 transitions, 307 flow [2025-03-13 22:19:29,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.5) internal successors, (711), 6 states have internal predecessors, (711), 0 states have call successors, (0), 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-03-13 22:19:29,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:29,926 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] [2025-03-13 22:19:29,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:19:29,926 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:19:29,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:29,927 INFO L85 PathProgramCache]: Analyzing trace with hash 979207949, now seen corresponding path program 1 times [2025-03-13 22:19:29,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:29,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137224933] [2025-03-13 22:19:29,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:29,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:29,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-13 22:19:29,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-13 22:19:29,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:29,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:29,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:19:29,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:29,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137224933] [2025-03-13 22:19:29,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137224933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:29,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:29,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:19:29,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804736893] [2025-03-13 22:19:29,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:29,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:19:29,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:29,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:19:29,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:19:30,019 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 158 [2025-03-13 22:19:30,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 145 transitions, 307 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 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-03-13 22:19:30,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:30,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 158 [2025-03-13 22:19:30,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:30,101 INFO L124 PetriNetUnfolderBase]: 57/557 cut-off events. [2025-03-13 22:19:30,101 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-13 22:19:30,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 557 events. 57/557 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2703 event pairs, 20 based on Foata normal form. 1/493 useless extension candidates. Maximal degree in co-relation 604. Up to 96 conditions per place. [2025-03-13 22:19:30,107 INFO L140 encePairwiseOnDemand]: 155/158 looper letters, 22 selfloop transitions, 2 changer transitions 0/151 dead transitions. [2025-03-13 22:19:30,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 151 transitions, 367 flow [2025-03-13 22:19:30,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:19:30,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:19:30,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2025-03-13 22:19:30,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.869198312236287 [2025-03-13 22:19:30,109 INFO L175 Difference]: Start difference. First operand has 149 places, 145 transitions, 307 flow. Second operand 3 states and 412 transitions. [2025-03-13 22:19:30,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 151 transitions, 367 flow [2025-03-13 22:19:30,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 151 transitions, 357 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:19:30,113 INFO L231 Difference]: Finished difference. Result has 147 places, 145 transitions, 305 flow [2025-03-13 22:19:30,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=305, PETRI_PLACES=147, PETRI_TRANSITIONS=145} [2025-03-13 22:19:30,115 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 0 predicate places. [2025-03-13 22:19:30,115 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 145 transitions, 305 flow [2025-03-13 22:19:30,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 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-03-13 22:19:30,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:30,116 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] [2025-03-13 22:19:30,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:19:30,116 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:19:30,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:30,117 INFO L85 PathProgramCache]: Analyzing trace with hash 292300978, now seen corresponding path program 1 times [2025-03-13 22:19:30,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:30,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212433411] [2025-03-13 22:19:30,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:30,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:30,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-13 22:19:30,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-13 22:19:30,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:30,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:30,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:19:30,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:30,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212433411] [2025-03-13 22:19:30,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212433411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:30,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:30,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:19:30,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259693301] [2025-03-13 22:19:30,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:30,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:19:30,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:30,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:19:30,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:19:30,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 158 [2025-03-13 22:19:30,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 145 transitions, 305 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:19:30,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:30,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 158 [2025-03-13 22:19:30,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:30,334 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] t_funEXIT-->L952-3: 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[][151], [24#L952-3true, 147#true, 156#true, 160#true, Black: 158#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-03-13 22:19:30,334 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is not cut-off event [2025-03-13 22:19:30,334 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is not cut-off event [2025-03-13 22:19:30,334 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is not cut-off event [2025-03-13 22:19:30,334 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is not cut-off event [2025-03-13 22:19:30,342 INFO L124 PetriNetUnfolderBase]: 133/936 cut-off events. [2025-03-13 22:19:30,342 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-13 22:19:30,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1198 conditions, 936 events. 133/936 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 5906 event pairs, 22 based on Foata normal form. 0/830 useless extension candidates. Maximal degree in co-relation 1138. Up to 128 conditions per place. [2025-03-13 22:19:30,347 INFO L140 encePairwiseOnDemand]: 149/158 looper letters, 30 selfloop transitions, 6 changer transitions 0/158 dead transitions. [2025-03-13 22:19:30,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 158 transitions, 406 flow [2025-03-13 22:19:30,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:19:30,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:19:30,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions. [2025-03-13 22:19:30,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8670886075949367 [2025-03-13 22:19:30,349 INFO L175 Difference]: Start difference. First operand has 147 places, 145 transitions, 305 flow. Second operand 3 states and 411 transitions. [2025-03-13 22:19:30,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 158 transitions, 406 flow [2025-03-13 22:19:30,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 158 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:19:30,351 INFO L231 Difference]: Finished difference. Result has 147 places, 147 transitions, 339 flow [2025-03-13 22:19:30,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=339, PETRI_PLACES=147, PETRI_TRANSITIONS=147} [2025-03-13 22:19:30,352 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 0 predicate places. [2025-03-13 22:19:30,352 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 147 transitions, 339 flow [2025-03-13 22:19:30,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:19:30,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:30,353 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] [2025-03-13 22:19:30,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:19:30,353 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:19:30,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:30,354 INFO L85 PathProgramCache]: Analyzing trace with hash 2005297455, now seen corresponding path program 1 times [2025-03-13 22:19:30,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:30,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072905833] [2025-03-13 22:19:30,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:30,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:30,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-13 22:19:30,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-13 22:19:30,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:30,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:30,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:19:30,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:30,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072905833] [2025-03-13 22:19:30,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072905833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:30,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:30,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:19:30,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411851243] [2025-03-13 22:19:30,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:30,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:19:30,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:30,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:19:30,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:19:30,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 158 [2025-03-13 22:19:30,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 147 transitions, 339 flow. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 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-03-13 22:19:30,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:30,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 158 [2025-03-13 22:19:30,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:30,551 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] t_funEXIT-->L952-3: 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[][150], [24#L952-3true, 147#true, Black: 162#(= |#race~global~0| 0), 165#true, 160#true, Black: 158#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-03-13 22:19:30,551 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is not cut-off event [2025-03-13 22:19:30,551 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is not cut-off event [2025-03-13 22:19:30,551 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is not cut-off event [2025-03-13 22:19:30,551 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is not cut-off event [2025-03-13 22:19:30,558 INFO L124 PetriNetUnfolderBase]: 139/962 cut-off events. [2025-03-13 22:19:30,558 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2025-03-13 22:19:30,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 962 events. 139/962 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 6195 event pairs, 56 based on Foata normal form. 0/850 useless extension candidates. Maximal degree in co-relation 1263. Up to 220 conditions per place. [2025-03-13 22:19:30,564 INFO L140 encePairwiseOnDemand]: 153/158 looper letters, 27 selfloop transitions, 4 changer transitions 0/154 dead transitions. [2025-03-13 22:19:30,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 154 transitions, 419 flow [2025-03-13 22:19:30,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:19:30,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:19:30,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2025-03-13 22:19:30,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8586497890295358 [2025-03-13 22:19:30,567 INFO L175 Difference]: Start difference. First operand has 147 places, 147 transitions, 339 flow. Second operand 3 states and 407 transitions. [2025-03-13 22:19:30,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 154 transitions, 419 flow [2025-03-13 22:19:30,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 154 transitions, 405 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:19:30,571 INFO L231 Difference]: Finished difference. Result has 149 places, 150 transitions, 359 flow [2025-03-13 22:19:30,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=359, PETRI_PLACES=149, PETRI_TRANSITIONS=150} [2025-03-13 22:19:30,573 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 2 predicate places. [2025-03-13 22:19:30,573 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 150 transitions, 359 flow [2025-03-13 22:19:30,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 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-03-13 22:19:30,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:30,574 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] [2025-03-13 22:19:30,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:19:30,575 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:19:30,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:30,577 INFO L85 PathProgramCache]: Analyzing trace with hash -508694711, now seen corresponding path program 1 times [2025-03-13 22:19:30,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:30,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485910769] [2025-03-13 22:19:30,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:30,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:30,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-13 22:19:30,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-13 22:19:30,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:30,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:19:30,604 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:19:30,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-13 22:19:30,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-13 22:19:30,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:30,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:19:30,636 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:19:30,638 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:19:30,639 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-03-13 22:19:30,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-03-13 22:19:30,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-03-13 22:19:30,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-03-13 22:19:30,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-03-13 22:19:30,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-03-13 22:19:30,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2025-03-13 22:19:30,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-03-13 22:19:30,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-03-13 22:19:30,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-03-13 22:19:30,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-03-13 22:19:30,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-03-13 22:19:30,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:19:30,644 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-13 22:19:30,646 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:19:30,646 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 22:19:30,673 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 22:19:30,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 206 transitions, 428 flow [2025-03-13 22:19:30,715 INFO L124 PetriNetUnfolderBase]: 36/367 cut-off events. [2025-03-13 22:19:30,715 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:19:30,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 367 events. 36/367 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1275 event pairs, 0 based on Foata normal form. 0/309 useless extension candidates. Maximal degree in co-relation 227. Up to 9 conditions per place. [2025-03-13 22:19:30,718 INFO L82 GeneralOperation]: Start removeDead. Operand has 190 places, 206 transitions, 428 flow [2025-03-13 22:19:30,720 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 190 places, 206 transitions, 428 flow [2025-03-13 22:19:30,721 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:19:30,721 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;@a1abb50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:19:30,721 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-13 22:19:30,725 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:19:30,726 INFO L124 PetriNetUnfolderBase]: 2/60 cut-off events. [2025-03-13 22:19:30,726 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:19:30,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:30,726 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] [2025-03-13 22:19:30,726 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:19:30,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:30,726 INFO L85 PathProgramCache]: Analyzing trace with hash -2008477575, now seen corresponding path program 1 times [2025-03-13 22:19:30,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:30,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380163858] [2025-03-13 22:19:30,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:30,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:30,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-13 22:19:30,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-13 22:19:30,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:30,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:30,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:19:30,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:30,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380163858] [2025-03-13 22:19:30,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380163858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:30,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:30,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:19:30,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870277258] [2025-03-13 22:19:30,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:30,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:19:30,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:30,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:19:30,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:19:31,067 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 206 [2025-03-13 22:19:31,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 206 transitions, 428 flow. Second operand has 6 states, 6 states have (on average 152.5) internal successors, (915), 6 states have internal predecessors, (915), 0 states have call successors, (0), 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-03-13 22:19:31,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:31,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 206 [2025-03-13 22:19:31,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:31,723 INFO L124 PetriNetUnfolderBase]: 1749/6493 cut-off events. [2025-03-13 22:19:31,723 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-03-13 22:19:31,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9269 conditions, 6493 events. 1749/6493 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 62861 event pairs, 597 based on Foata normal form. 984/6856 useless extension candidates. Maximal degree in co-relation 4925. Up to 1901 conditions per place. [2025-03-13 22:19:31,761 INFO L140 encePairwiseOnDemand]: 184/206 looper letters, 80 selfloop transitions, 5 changer transitions 0/235 dead transitions. [2025-03-13 22:19:31,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 235 transitions, 656 flow [2025-03-13 22:19:31,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:19:31,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:19:31,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1056 transitions. [2025-03-13 22:19:31,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8543689320388349 [2025-03-13 22:19:31,765 INFO L175 Difference]: Start difference. First operand has 190 places, 206 transitions, 428 flow. Second operand 6 states and 1056 transitions. [2025-03-13 22:19:31,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 235 transitions, 656 flow [2025-03-13 22:19:31,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 235 transitions, 656 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:19:31,768 INFO L231 Difference]: Finished difference. Result has 192 places, 187 transitions, 400 flow [2025-03-13 22:19:31,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=400, PETRI_PLACES=192, PETRI_TRANSITIONS=187} [2025-03-13 22:19:31,769 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, 2 predicate places. [2025-03-13 22:19:31,769 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 187 transitions, 400 flow [2025-03-13 22:19:31,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 152.5) internal successors, (915), 6 states have internal predecessors, (915), 0 states have call successors, (0), 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-03-13 22:19:31,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:31,770 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] [2025-03-13 22:19:31,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:19:31,770 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:19:31,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:31,770 INFO L85 PathProgramCache]: Analyzing trace with hash -505728755, now seen corresponding path program 1 times [2025-03-13 22:19:31,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:31,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607351288] [2025-03-13 22:19:31,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:31,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:31,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-13 22:19:31,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-13 22:19:31,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:31,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:31,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:19:31,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:31,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607351288] [2025-03-13 22:19:31,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607351288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:31,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:31,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:19:31,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454080486] [2025-03-13 22:19:31,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:31,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:19:31,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:31,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:19:31,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:19:31,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 206 [2025-03-13 22:19:31,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 187 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 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-03-13 22:19:31,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:31,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 206 [2025-03-13 22:19:31,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:32,232 INFO L124 PetriNetUnfolderBase]: 972/4951 cut-off events. [2025-03-13 22:19:32,232 INFO L125 PetriNetUnfolderBase]: For 208/208 co-relation queries the response was YES. [2025-03-13 22:19:32,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6581 conditions, 4951 events. 972/4951 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 48238 event pairs, 327 based on Foata normal form. 1/4400 useless extension candidates. Maximal degree in co-relation 867. Up to 1438 conditions per place. [2025-03-13 22:19:32,257 INFO L140 encePairwiseOnDemand]: 203/206 looper letters, 31 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2025-03-13 22:19:32,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 194 transitions, 482 flow [2025-03-13 22:19:32,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:19:32,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:19:32,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions. [2025-03-13 22:19:32,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8462783171521036 [2025-03-13 22:19:32,259 INFO L175 Difference]: Start difference. First operand has 192 places, 187 transitions, 400 flow. Second operand 3 states and 523 transitions. [2025-03-13 22:19:32,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 194 transitions, 482 flow [2025-03-13 22:19:32,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 194 transitions, 470 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:19:32,261 INFO L231 Difference]: Finished difference. Result has 190 places, 188 transitions, 402 flow [2025-03-13 22:19:32,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=402, PETRI_PLACES=190, PETRI_TRANSITIONS=188} [2025-03-13 22:19:32,264 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, 0 predicate places. [2025-03-13 22:19:32,264 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 188 transitions, 402 flow [2025-03-13 22:19:32,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 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-03-13 22:19:32,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:32,265 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] [2025-03-13 22:19:32,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:19:32,266 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:19:32,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:32,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1614176260, now seen corresponding path program 1 times [2025-03-13 22:19:32,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:32,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14740230] [2025-03-13 22:19:32,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:32,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:32,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-13 22:19:32,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-13 22:19:32,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:32,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:32,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:19:32,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:32,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14740230] [2025-03-13 22:19:32,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14740230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:32,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:32,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:19:32,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886040182] [2025-03-13 22:19:32,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:32,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:19:32,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:32,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:19:32,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:19:32,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 206 [2025-03-13 22:19:32,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 188 transitions, 402 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 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-03-13 22:19:32,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:32,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 206 [2025-03-13 22:19:32,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:32,894 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([658] t_funEXIT-->L952-3: 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[][189], [30#L952-3true, 199#true, 190#true, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 188#true, 203#true]) [2025-03-13 22:19:32,895 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is not cut-off event [2025-03-13 22:19:32,895 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is not cut-off event [2025-03-13 22:19:32,895 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is not cut-off event [2025-03-13 22:19:32,895 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is not cut-off event [2025-03-13 22:19:33,257 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([658] t_funEXIT-->L952-3: 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[][189], [30#L952-3true, 199#true, 28#t_funENTRYtrue, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 191#true, 188#true, 203#true]) [2025-03-13 22:19:33,257 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is not cut-off event [2025-03-13 22:19:33,257 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is not cut-off event [2025-03-13 22:19:33,257 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is not cut-off event [2025-03-13 22:19:33,257 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is not cut-off event [2025-03-13 22:19:33,257 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([658] t_funEXIT-->L952-3: 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[][189], [30#L952-3true, 199#true, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 191#true, 159#L938true, 188#true, 203#true]) [2025-03-13 22:19:33,257 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2025-03-13 22:19:33,257 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-03-13 22:19:33,257 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-03-13 22:19:33,257 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-03-13 22:19:33,260 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([659] t_funEXIT-->L952-3: 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[][215], [30#L952-3true, 189#true, 199#true, 190#true, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 103#t_funENTRYtrue, 203#true]) [2025-03-13 22:19:33,260 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is not cut-off event [2025-03-13 22:19:33,260 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is not cut-off event [2025-03-13 22:19:33,260 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is not cut-off event [2025-03-13 22:19:33,261 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is not cut-off event [2025-03-13 22:19:33,277 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([659] t_funEXIT-->L952-3: 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[][215], [30#L952-3true, 189#true, 199#true, 41#L938true, 190#true, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 203#true]) [2025-03-13 22:19:33,277 INFO L294 olderBase$Statistics]: this new event has 135 ancestors and is cut-off event [2025-03-13 22:19:33,277 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-03-13 22:19:33,277 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-03-13 22:19:33,277 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-03-13 22:19:33,312 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([658] t_funEXIT-->L952-3: 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[][189], [65#L939-36true, 30#L952-3true, 199#true, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 191#true, 188#true, 203#true]) [2025-03-13 22:19:33,312 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is cut-off event [2025-03-13 22:19:33,312 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-13 22:19:33,312 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-03-13 22:19:33,312 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-13 22:19:33,314 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([659] t_funEXIT-->L952-3: 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[][215], [30#L952-3true, 189#true, 170#L939-36true, 199#true, 190#true, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 203#true]) [2025-03-13 22:19:33,314 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is cut-off event [2025-03-13 22:19:33,314 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-03-13 22:19:33,314 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-13 22:19:33,314 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-13 22:19:33,420 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([658] t_funEXIT-->L952-3: 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[][216], [30#L952-3true, 205#(= |#race~global~0| 0), 199#true, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 191#true, 58#L939-33true, 188#true]) [2025-03-13 22:19:33,420 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2025-03-13 22:19:33,420 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-13 22:19:33,420 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-13 22:19:33,420 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-13 22:19:33,433 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([658] t_funEXIT-->L952-3: 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[][216], [30#L952-3true, 205#(= |#race~global~0| 0), 32#L939-34true, 199#true, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 191#true, 188#true]) [2025-03-13 22:19:33,433 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-03-13 22:19:33,434 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-13 22:19:33,434 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-13 22:19:33,434 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-13 22:19:33,434 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([658] t_funEXIT-->L952-3: 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[][189], [30#L952-3true, 199#true, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 191#true, 58#L939-33true, 188#true, 203#true]) [2025-03-13 22:19:33,434 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is not cut-off event [2025-03-13 22:19:33,434 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2025-03-13 22:19:33,434 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2025-03-13 22:19:33,434 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2025-03-13 22:19:33,434 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([658] t_funEXIT-->L952-3: 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[][189], [30#L952-3true, 199#true, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 191#true, 188#true, 203#true, 119#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue]) [2025-03-13 22:19:33,434 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-03-13 22:19:33,434 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-13 22:19:33,434 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-13 22:19:33,434 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-13 22:19:33,446 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([658] t_funEXIT-->L952-3: 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[][189], [30#L952-3true, 32#L939-34true, 199#true, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 191#true, 188#true, 203#true]) [2025-03-13 22:19:33,447 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is not cut-off event [2025-03-13 22:19:33,447 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is not cut-off event [2025-03-13 22:19:33,447 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is not cut-off event [2025-03-13 22:19:33,447 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is not cut-off event [2025-03-13 22:19:33,481 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([658] t_funEXIT-->L952-3: 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[][189], [30#L952-3true, 199#true, 128#L939-28true, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 191#true, 188#true, 203#true]) [2025-03-13 22:19:33,481 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2025-03-13 22:19:33,481 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-03-13 22:19:33,481 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-13 22:19:33,481 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-03-13 22:19:33,491 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([659] t_funEXIT-->L952-3: 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[][215], [30#L952-3true, 189#true, 199#true, 190#true, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 152#L939-28true, 203#true]) [2025-03-13 22:19:33,491 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is not cut-off event [2025-03-13 22:19:33,492 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is not cut-off event [2025-03-13 22:19:33,492 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2025-03-13 22:19:33,492 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is not cut-off event [2025-03-13 22:19:33,516 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([658] t_funEXIT-->L952-3: 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[][189], [30#L952-3true, 199#true, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 191#true, 184#L939-23true, 188#true, 203#true]) [2025-03-13 22:19:33,516 INFO L294 olderBase$Statistics]: this new event has 135 ancestors and is cut-off event [2025-03-13 22:19:33,516 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-03-13 22:19:33,516 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-03-13 22:19:33,516 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-13 22:19:33,523 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([659] t_funEXIT-->L952-3: 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[][215], [30#L952-3true, 27#L939-23true, 189#true, 199#true, 190#true, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 203#true]) [2025-03-13 22:19:33,523 INFO L294 olderBase$Statistics]: this new event has 135 ancestors and is not cut-off event [2025-03-13 22:19:33,523 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is not cut-off event [2025-03-13 22:19:33,523 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is not cut-off event [2025-03-13 22:19:33,523 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is not cut-off event [2025-03-13 22:19:33,537 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([658] t_funEXIT-->L952-3: 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[][189], [30#L952-3true, 199#true, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 191#true, 173#L939-17true, 188#true, 203#true]) [2025-03-13 22:19:33,537 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is cut-off event [2025-03-13 22:19:33,537 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-13 22:19:33,537 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-13 22:19:33,537 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-13 22:19:33,543 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([659] t_funEXIT-->L952-3: 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[][215], [30#L952-3true, 189#true, 199#true, 190#true, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 203#true, 55#L939-17true]) [2025-03-13 22:19:33,543 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is not cut-off event [2025-03-13 22:19:33,543 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2025-03-13 22:19:33,543 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2025-03-13 22:19:33,543 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2025-03-13 22:19:33,543 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([659] t_funEXIT-->L952-3: 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[][217], [30#L952-3true, 189#true, 205#(= |#race~global~0| 0), 88#L939-14true, 199#true, 190#true, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-03-13 22:19:33,543 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2025-03-13 22:19:33,543 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-13 22:19:33,543 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-03-13 22:19:33,543 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-03-13 22:19:33,555 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([658] t_funEXIT-->L952-3: 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[][189], [30#L952-3true, 199#true, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 191#true, 108#L939-14true, 188#true, 203#true]) [2025-03-13 22:19:33,555 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is not cut-off event [2025-03-13 22:19:33,555 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is not cut-off event [2025-03-13 22:19:33,555 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2025-03-13 22:19:33,555 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2025-03-13 22:19:33,556 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([658] t_funEXIT-->L952-3: 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[][189], [30#L952-3true, 199#true, 100#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 191#true, 188#true, 203#true]) [2025-03-13 22:19:33,556 INFO L294 olderBase$Statistics]: this new event has 141 ancestors and is cut-off event [2025-03-13 22:19:33,556 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-13 22:19:33,556 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-13 22:19:33,556 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-13 22:19:33,556 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([659] t_funEXIT-->L952-3: 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[][217], [30#L952-3true, 189#true, 205#(= |#race~global~0| 0), 199#true, 190#true, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 54#L939-15true]) [2025-03-13 22:19:33,556 INFO L294 olderBase$Statistics]: this new event has 141 ancestors and is cut-off event [2025-03-13 22:19:33,556 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-13 22:19:33,556 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-13 22:19:33,556 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-13 22:19:33,556 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([659] t_funEXIT-->L952-3: 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[][215], [30#L952-3true, 189#true, 88#L939-14true, 199#true, 190#true, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 203#true]) [2025-03-13 22:19:33,556 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is not cut-off event [2025-03-13 22:19:33,557 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is not cut-off event [2025-03-13 22:19:33,557 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2025-03-13 22:19:33,557 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2025-03-13 22:19:33,557 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([659] t_funEXIT-->L952-3: 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[][215], [30#L952-3true, 189#true, 199#true, 190#true, 166#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 203#true]) [2025-03-13 22:19:33,557 INFO L294 olderBase$Statistics]: this new event has 141 ancestors and is cut-off event [2025-03-13 22:19:33,557 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-13 22:19:33,557 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-13 22:19:33,558 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-13 22:19:33,563 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([658] t_funEXIT-->L952-3: 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[][189], [30#L952-3true, 37#L939-15true, 199#true, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 191#true, 203#true, 188#true]) [2025-03-13 22:19:33,563 INFO L294 olderBase$Statistics]: this new event has 141 ancestors and is not cut-off event [2025-03-13 22:19:33,563 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2025-03-13 22:19:33,563 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is not cut-off event [2025-03-13 22:19:33,563 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is not cut-off event [2025-03-13 22:19:33,563 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([659] t_funEXIT-->L952-3: 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[][215], [30#L952-3true, 189#true, 199#true, 190#true, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 54#L939-15true, 203#true]) [2025-03-13 22:19:33,563 INFO L294 olderBase$Statistics]: this new event has 141 ancestors and is not cut-off event [2025-03-13 22:19:33,563 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is not cut-off event [2025-03-13 22:19:33,563 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2025-03-13 22:19:33,563 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is not cut-off event [2025-03-13 22:19:33,580 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([659] t_funEXIT-->L952-3: 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[][215], [30#L952-3true, 189#true, 199#true, 190#true, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 203#true, 81#L939-9true]) [2025-03-13 22:19:33,581 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is not cut-off event [2025-03-13 22:19:33,581 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is not cut-off event [2025-03-13 22:19:33,581 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2025-03-13 22:19:33,581 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is not cut-off event [2025-03-13 22:19:33,586 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([658] t_funEXIT-->L952-3: 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[][216], [30#L952-3true, 205#(= |#race~global~0| 0), 199#true, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 191#true, 108#L939-14true, 188#true]) [2025-03-13 22:19:33,586 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-13 22:19:33,586 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-13 22:19:33,586 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-03-13 22:19:33,586 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-03-13 22:19:33,587 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([658] t_funEXIT-->L952-3: 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[][216], [30#L952-3true, 205#(= |#race~global~0| 0), 37#L939-15true, 199#true, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 191#true, 188#true]) [2025-03-13 22:19:33,587 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-03-13 22:19:33,587 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-03-13 22:19:33,587 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-13 22:19:33,587 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-13 22:19:33,587 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([658] t_funEXIT-->L952-3: 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[][189], [30#L952-3true, 104#L939-9true, 199#true, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 191#true, 188#true, 203#true]) [2025-03-13 22:19:33,587 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2025-03-13 22:19:33,587 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-13 22:19:33,587 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-13 22:19:33,587 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-13 22:19:33,594 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([658] t_funEXIT-->L952-3: 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[][189], [30#L952-3true, 199#true, 133#L939-4true, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 191#true, 188#true, 203#true]) [2025-03-13 22:19:33,594 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2025-03-13 22:19:33,594 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-13 22:19:33,594 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-03-13 22:19:33,594 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-13 22:19:33,598 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([659] t_funEXIT-->L952-3: 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[][215], [30#L952-3true, 189#true, 49#L939-4true, 199#true, 190#true, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 203#true]) [2025-03-13 22:19:33,599 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is not cut-off event [2025-03-13 22:19:33,599 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is not cut-off event [2025-03-13 22:19:33,599 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is not cut-off event [2025-03-13 22:19:33,599 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is not cut-off event [2025-03-13 22:19:33,606 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([658] t_funEXIT-->L952-3: 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[][189], [30#L952-3true, 199#true, 22#L940true, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 191#true, 188#true, 203#true]) [2025-03-13 22:19:33,606 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-13 22:19:33,606 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-13 22:19:33,606 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-13 22:19:33,608 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2025-03-13 22:19:33,610 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([659] t_funEXIT-->L952-3: 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[][215], [30#L952-3true, 189#true, 199#true, 190#true, 21#L940true, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 203#true]) [2025-03-13 22:19:33,610 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is not cut-off event [2025-03-13 22:19:33,610 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2025-03-13 22:19:33,610 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is not cut-off event [2025-03-13 22:19:33,610 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2025-03-13 22:19:33,622 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([658] t_funEXIT-->L952-3: 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[][189], [30#L952-3true, 199#true, 190#true, Black: 201#(= |ULTIMATE.start_main_~i~1#1| 0), 188#true, 203#true]) [2025-03-13 22:19:33,622 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-03-13 22:19:33,623 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-13 22:19:33,623 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-13 22:19:33,623 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-03-13 22:19:33,623 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-13 22:19:33,626 INFO L124 PetriNetUnfolderBase]: 4692/15673 cut-off events. [2025-03-13 22:19:33,626 INFO L125 PetriNetUnfolderBase]: For 574/574 co-relation queries the response was YES. [2025-03-13 22:19:33,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22987 conditions, 15673 events. 4692/15673 cut-off events. For 574/574 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 176535 event pairs, 1302 based on Foata normal form. 0/13820 useless extension candidates. Maximal degree in co-relation 22926. Up to 3640 conditions per place. [2025-03-13 22:19:33,716 INFO L140 encePairwiseOnDemand]: 187/206 looper letters, 58 selfloop transitions, 14 changer transitions 0/221 dead transitions. [2025-03-13 22:19:33,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 221 transitions, 623 flow [2025-03-13 22:19:33,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:19:33,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:19:33,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2025-03-13 22:19:33,718 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8527508090614887 [2025-03-13 22:19:33,718 INFO L175 Difference]: Start difference. First operand has 190 places, 188 transitions, 402 flow. Second operand 3 states and 527 transitions. [2025-03-13 22:19:33,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 221 transitions, 623 flow [2025-03-13 22:19:33,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 221 transitions, 621 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:19:33,724 INFO L231 Difference]: Finished difference. Result has 193 places, 202 transitions, 522 flow [2025-03-13 22:19:33,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=522, PETRI_PLACES=193, PETRI_TRANSITIONS=202} [2025-03-13 22:19:33,725 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, 3 predicate places. [2025-03-13 22:19:33,725 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 202 transitions, 522 flow [2025-03-13 22:19:33,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 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-03-13 22:19:33,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:33,726 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] [2025-03-13 22:19:33,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:19:33,726 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:19:33,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:33,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1227596395, now seen corresponding path program 1 times [2025-03-13 22:19:33,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:33,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225477849] [2025-03-13 22:19:33,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:33,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:33,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-13 22:19:33,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-13 22:19:33,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:33,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:33,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:19:33,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:33,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225477849] [2025-03-13 22:19:33,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225477849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:33,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:33,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:19:33,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026318379] [2025-03-13 22:19:33,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:33,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:19:33,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:33,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:19:33,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:19:33,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 206 [2025-03-13 22:19:33,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 202 transitions, 522 flow. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 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-03-13 22:19:33,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:33,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 206 [2025-03-13 22:19:33,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:35,067 INFO L124 PetriNetUnfolderBase]: 4842/17770 cut-off events. [2025-03-13 22:19:35,067 INFO L125 PetriNetUnfolderBase]: For 4516/4675 co-relation queries the response was YES. [2025-03-13 22:19:35,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29221 conditions, 17770 events. 4842/17770 cut-off events. For 4516/4675 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 212506 event pairs, 2392 based on Foata normal form. 45/15984 useless extension candidates. Maximal degree in co-relation 27766. Up to 6119 conditions per place. [2025-03-13 22:19:35,163 INFO L140 encePairwiseOnDemand]: 197/206 looper letters, 52 selfloop transitions, 14 changer transitions 0/226 dead transitions. [2025-03-13 22:19:35,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 226 transitions, 740 flow [2025-03-13 22:19:35,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:19:35,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:19:35,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2025-03-13 22:19:35,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.843042071197411 [2025-03-13 22:19:35,165 INFO L175 Difference]: Start difference. First operand has 193 places, 202 transitions, 522 flow. Second operand 3 states and 521 transitions. [2025-03-13 22:19:35,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 226 transitions, 740 flow [2025-03-13 22:19:35,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 226 transitions, 702 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:19:35,176 INFO L231 Difference]: Finished difference. Result has 195 places, 214 transitions, 620 flow [2025-03-13 22:19:35,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=620, PETRI_PLACES=195, PETRI_TRANSITIONS=214} [2025-03-13 22:19:35,178 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, 5 predicate places. [2025-03-13 22:19:35,179 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 214 transitions, 620 flow [2025-03-13 22:19:35,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 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-03-13 22:19:35,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:35,179 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] [2025-03-13 22:19:35,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:19:35,179 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:19:35,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:35,180 INFO L85 PathProgramCache]: Analyzing trace with hash -784707184, now seen corresponding path program 1 times [2025-03-13 22:19:35,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:35,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141234196] [2025-03-13 22:19:35,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:35,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:35,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-13 22:19:35,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-13 22:19:35,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:35,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:35,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:19:35,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:35,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141234196] [2025-03-13 22:19:35,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141234196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:35,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:35,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:19:35,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678190019] [2025-03-13 22:19:35,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:35,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:19:35,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:35,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:19:35,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:19:35,308 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 206 [2025-03-13 22:19:35,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 214 transitions, 620 flow. Second operand has 5 states, 5 states have (on average 162.6) internal successors, (813), 5 states have internal predecessors, (813), 0 states have call successors, (0), 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-03-13 22:19:35,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:35,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 206 [2025-03-13 22:19:35,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:36,978 INFO L124 PetriNetUnfolderBase]: 3251/19657 cut-off events. [2025-03-13 22:19:36,979 INFO L125 PetriNetUnfolderBase]: For 1508/2715 co-relation queries the response was YES. [2025-03-13 22:19:37,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27023 conditions, 19657 events. 3251/19657 cut-off events. For 1508/2715 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 259555 event pairs, 928 based on Foata normal form. 18/17124 useless extension candidates. Maximal degree in co-relation 12386. Up to 3499 conditions per place. [2025-03-13 22:19:37,072 INFO L140 encePairwiseOnDemand]: 201/206 looper letters, 56 selfloop transitions, 5 changer transitions 0/246 dead transitions. [2025-03-13 22:19:37,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 246 transitions, 806 flow [2025-03-13 22:19:37,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:19:37,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:19:37,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1028 transitions. [2025-03-13 22:19:37,075 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8317152103559871 [2025-03-13 22:19:37,075 INFO L175 Difference]: Start difference. First operand has 195 places, 214 transitions, 620 flow. Second operand 6 states and 1028 transitions. [2025-03-13 22:19:37,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 246 transitions, 806 flow [2025-03-13 22:19:37,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 246 transitions, 778 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:19:37,081 INFO L231 Difference]: Finished difference. Result has 201 places, 216 transitions, 618 flow [2025-03-13 22:19:37,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=618, PETRI_PLACES=201, PETRI_TRANSITIONS=216} [2025-03-13 22:19:37,082 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, 11 predicate places. [2025-03-13 22:19:37,082 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 216 transitions, 618 flow [2025-03-13 22:19:37,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 162.6) internal successors, (813), 5 states have internal predecessors, (813), 0 states have call successors, (0), 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-03-13 22:19:37,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:37,083 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] [2025-03-13 22:19:37,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:19:37,083 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:19:37,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:37,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1979288632, now seen corresponding path program 1 times [2025-03-13 22:19:37,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:37,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498523553] [2025-03-13 22:19:37,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:37,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:37,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-13 22:19:37,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-13 22:19:37,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:37,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:37,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 22:19:37,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:37,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498523553] [2025-03-13 22:19:37,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498523553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:37,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:37,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:19:37,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443049858] [2025-03-13 22:19:37,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:37,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:19:37,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:37,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:19:37,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:19:37,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 206 [2025-03-13 22:19:37,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 216 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 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-03-13 22:19:37,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:37,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 206 [2025-03-13 22:19:37,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:38,696 INFO L124 PetriNetUnfolderBase]: 5590/21239 cut-off events. [2025-03-13 22:19:38,697 INFO L125 PetriNetUnfolderBase]: For 5302/5499 co-relation queries the response was YES. [2025-03-13 22:19:38,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34550 conditions, 21239 events. 5590/21239 cut-off events. For 5302/5499 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 266226 event pairs, 2593 based on Foata normal form. 39/18855 useless extension candidates. Maximal degree in co-relation 34356. Up to 6886 conditions per place. [2025-03-13 22:19:38,786 INFO L140 encePairwiseOnDemand]: 197/206 looper letters, 59 selfloop transitions, 17 changer transitions 0/240 dead transitions. [2025-03-13 22:19:38,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 240 transitions, 853 flow [2025-03-13 22:19:38,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:19:38,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:19:38,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2025-03-13 22:19:38,787 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8414239482200647 [2025-03-13 22:19:38,788 INFO L175 Difference]: Start difference. First operand has 201 places, 216 transitions, 618 flow. Second operand 3 states and 520 transitions. [2025-03-13 22:19:38,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 240 transitions, 853 flow [2025-03-13 22:19:38,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 240 transitions, 847 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-13 22:19:38,792 INFO L231 Difference]: Finished difference. Result has 203 places, 229 transitions, 766 flow [2025-03-13 22:19:38,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=766, PETRI_PLACES=203, PETRI_TRANSITIONS=229} [2025-03-13 22:19:38,792 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, 13 predicate places. [2025-03-13 22:19:38,793 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 229 transitions, 766 flow [2025-03-13 22:19:38,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 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-03-13 22:19:38,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:38,793 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] [2025-03-13 22:19:38,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:19:38,793 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:19:38,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:38,794 INFO L85 PathProgramCache]: Analyzing trace with hash 819254327, now seen corresponding path program 1 times [2025-03-13 22:19:38,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:38,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133823094] [2025-03-13 22:19:38,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:38,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:38,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-13 22:19:38,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-13 22:19:38,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:38,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:38,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:19:38,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:38,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133823094] [2025-03-13 22:19:38,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133823094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:38,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:38,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:19:38,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90897915] [2025-03-13 22:19:38,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:38,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:19:38,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:38,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:19:38,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:19:38,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 206 [2025-03-13 22:19:38,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 229 transitions, 766 flow. Second operand has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 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-03-13 22:19:38,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:38,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 206 [2025-03-13 22:19:38,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:41,116 INFO L124 PetriNetUnfolderBase]: 6252/23860 cut-off events. [2025-03-13 22:19:41,116 INFO L125 PetriNetUnfolderBase]: For 12748/13204 co-relation queries the response was YES. [2025-03-13 22:19:41,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41884 conditions, 23860 events. 6252/23860 cut-off events. For 12748/13204 co-relation queries the response was YES. Maximal size of possible extension queue 796. Compared 305141 event pairs, 2774 based on Foata normal form. 59/21244 useless extension candidates. Maximal degree in co-relation 41669. Up to 7709 conditions per place. [2025-03-13 22:19:41,239 INFO L140 encePairwiseOnDemand]: 197/206 looper letters, 71 selfloop transitions, 17 changer transitions 0/254 dead transitions. [2025-03-13 22:19:41,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 254 transitions, 1060 flow [2025-03-13 22:19:41,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:19:41,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:19:41,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2025-03-13 22:19:41,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.843042071197411 [2025-03-13 22:19:41,241 INFO L175 Difference]: Start difference. First operand has 203 places, 229 transitions, 766 flow. Second operand 3 states and 521 transitions. [2025-03-13 22:19:41,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 254 transitions, 1060 flow [2025-03-13 22:19:41,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 254 transitions, 1020 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:19:41,256 INFO L231 Difference]: Finished difference. Result has 205 places, 242 transitions, 908 flow [2025-03-13 22:19:41,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=908, PETRI_PLACES=205, PETRI_TRANSITIONS=242} [2025-03-13 22:19:41,256 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, 15 predicate places. [2025-03-13 22:19:41,256 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 242 transitions, 908 flow [2025-03-13 22:19:41,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 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-03-13 22:19:41,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:41,257 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] [2025-03-13 22:19:41,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:19:41,257 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:19:41,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:41,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1182998768, now seen corresponding path program 1 times [2025-03-13 22:19:41,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:41,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336243991] [2025-03-13 22:19:41,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:41,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:41,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-13 22:19:41,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-13 22:19:41,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:41,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:19:41,274 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:19:41,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-13 22:19:41,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-13 22:19:41,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:41,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:19:41,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:19:41,295 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:19:41,295 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-03-13 22:19:41,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-03-13 22:19:41,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-03-13 22:19:41,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-03-13 22:19:41,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-03-13 22:19:41,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-03-13 22:19:41,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-03-13 22:19:41,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-03-13 22:19:41,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-03-13 22:19:41,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-03-13 22:19:41,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-03-13 22:19:41,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-03-13 22:19:41,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-03-13 22:19:41,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-03-13 22:19:41,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-03-13 22:19:41,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-03-13 22:19:41,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:19:41,296 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:19:41,297 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:19:41,297 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-13 22:19:41,319 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 22:19:41,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 254 transitions, 535 flow [2025-03-13 22:19:41,354 INFO L124 PetriNetUnfolderBase]: 54/552 cut-off events. [2025-03-13 22:19:41,354 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-13 22:19:41,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 552 events. 54/552 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2127 event pairs, 1 based on Foata normal form. 0/466 useless extension candidates. Maximal degree in co-relation 375. Up to 12 conditions per place. [2025-03-13 22:19:41,357 INFO L82 GeneralOperation]: Start removeDead. Operand has 233 places, 254 transitions, 535 flow [2025-03-13 22:19:41,360 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 254 transitions, 535 flow [2025-03-13 22:19:41,361 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:19:41,361 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;@a1abb50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:19:41,361 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-13 22:19:41,363 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:19:41,363 INFO L124 PetriNetUnfolderBase]: 2/60 cut-off events. [2025-03-13 22:19:41,363 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:19:41,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:41,363 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] [2025-03-13 22:19:41,363 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-13 22:19:41,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:41,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1221245625, now seen corresponding path program 1 times [2025-03-13 22:19:41,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:41,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349290131] [2025-03-13 22:19:41,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:41,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:41,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-13 22:19:41,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-13 22:19:41,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:41,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:41,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:19:41,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:41,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349290131] [2025-03-13 22:19:41,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349290131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:41,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:41,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:19:41,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843894521] [2025-03-13 22:19:41,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:41,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:19:41,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:41,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:19:41,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:19:41,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 254 [2025-03-13 22:19:41,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 254 transitions, 535 flow. Second operand has 6 states, 6 states have (on average 186.5) internal successors, (1119), 6 states have internal predecessors, (1119), 0 states have call successors, (0), 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-03-13 22:19:41,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:41,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 254 [2025-03-13 22:19:41,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:46,625 INFO L124 PetriNetUnfolderBase]: 19438/54770 cut-off events. [2025-03-13 22:19:46,626 INFO L125 PetriNetUnfolderBase]: For 1031/1031 co-relation queries the response was YES. [2025-03-13 22:19:46,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82098 conditions, 54770 events. 19438/54770 cut-off events. For 1031/1031 co-relation queries the response was YES. Maximal size of possible extension queue 1407. Compared 679867 event pairs, 6109 based on Foata normal form. 10471/60831 useless extension candidates. Maximal degree in co-relation 9342. Up to 19024 conditions per place. [2025-03-13 22:19:46,930 INFO L140 encePairwiseOnDemand]: 226/254 looper letters, 112 selfloop transitions, 5 changer transitions 0/301 dead transitions. [2025-03-13 22:19:46,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 301 transitions, 863 flow [2025-03-13 22:19:46,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:19:46,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:19:46,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1322 transitions. [2025-03-13 22:19:46,933 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8674540682414699 [2025-03-13 22:19:46,933 INFO L175 Difference]: Start difference. First operand has 233 places, 254 transitions, 535 flow. Second operand 6 states and 1322 transitions. [2025-03-13 22:19:46,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 301 transitions, 863 flow [2025-03-13 22:19:46,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 301 transitions, 863 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:19:46,936 INFO L231 Difference]: Finished difference. Result has 235 places, 229 transitions, 495 flow [2025-03-13 22:19:46,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=495, PETRI_PLACES=235, PETRI_TRANSITIONS=229} [2025-03-13 22:19:46,937 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 2 predicate places. [2025-03-13 22:19:46,937 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 229 transitions, 495 flow [2025-03-13 22:19:46,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 186.5) internal successors, (1119), 6 states have internal predecessors, (1119), 0 states have call successors, (0), 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-03-13 22:19:46,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:46,938 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] [2025-03-13 22:19:46,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:19:46,938 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-13 22:19:46,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:46,938 INFO L85 PathProgramCache]: Analyzing trace with hash -2003080435, now seen corresponding path program 1 times [2025-03-13 22:19:46,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:46,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262623288] [2025-03-13 22:19:46,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:46,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:46,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-13 22:19:46,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-13 22:19:46,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:46,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:46,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:19:46,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:46,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262623288] [2025-03-13 22:19:46,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262623288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:46,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:46,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:19:46,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365606597] [2025-03-13 22:19:46,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:46,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:19:46,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:46,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:19:46,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:19:46,977 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 254 [2025-03-13 22:19:46,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 229 transitions, 495 flow. Second operand has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 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-03-13 22:19:46,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:46,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 254 [2025-03-13 22:19:46,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:50,217 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([704] L-1-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret46#1=|v_ULTIMATE.start_main_#t~ret46#1_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_#t~ret52#1=|v_ULTIMATE.start_main_#t~ret52#1_1|, ULTIMATE.start_main_#t~post54#1=|v_ULTIMATE.start_main_#t~post54#1_1|, ULTIMATE.start_main_#t~ret50#1=|v_ULTIMATE.start_main_#t~ret50#1_1|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_1|, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_1|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_1|, ULTIMATE.start_main_#t~ret48#1=|v_ULTIMATE.start_main_#t~ret48#1_1|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_1|, ULTIMATE.start_main_#t~ret49#1=|v_ULTIMATE.start_main_#t~ret49#1_1|, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_1|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_1|, ULTIMATE.start_main_#t~ret51#1=|v_ULTIMATE.start_main_#t~ret51#1_1|, ULTIMATE.start_main_#t~post45#1=|v_ULTIMATE.start_main_#t~post45#1_1|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_1|, ULTIMATE.start_main_#t~ret47#1=|v_ULTIMATE.start_main_#t~ret47#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret46#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~ret52#1, ULTIMATE.start_main_#t~post54#1, ULTIMATE.start_main_#t~ret50#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~mem53#1, ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_#t~ret48#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_#t~ret49#1, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_~#t_ids~0#1.offset, ULTIMATE.start_main_#t~ret51#1, ULTIMATE.start_main_#t~post45#1, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_main_#t~ret47#1][135], [110#L939-36true, 236#true, 233#true, 164#L939-17true, 175#ULTIMATE.startFINALtrue, 242#true, 230#true, 232#true]) [2025-03-13 22:19:50,217 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2025-03-13 22:19:50,217 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-13 22:19:50,217 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-03-13 22:19:50,217 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-13 22:19:50,403 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([704] L-1-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret46#1=|v_ULTIMATE.start_main_#t~ret46#1_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_#t~ret52#1=|v_ULTIMATE.start_main_#t~ret52#1_1|, ULTIMATE.start_main_#t~post54#1=|v_ULTIMATE.start_main_#t~post54#1_1|, ULTIMATE.start_main_#t~ret50#1=|v_ULTIMATE.start_main_#t~ret50#1_1|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_1|, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_1|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_1|, ULTIMATE.start_main_#t~ret48#1=|v_ULTIMATE.start_main_#t~ret48#1_1|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_1|, ULTIMATE.start_main_#t~ret49#1=|v_ULTIMATE.start_main_#t~ret49#1_1|, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_1|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_1|, ULTIMATE.start_main_#t~ret51#1=|v_ULTIMATE.start_main_#t~ret51#1_1|, ULTIMATE.start_main_#t~post45#1=|v_ULTIMATE.start_main_#t~post45#1_1|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_1|, ULTIMATE.start_main_#t~ret47#1=|v_ULTIMATE.start_main_#t~ret47#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret46#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~ret52#1, ULTIMATE.start_main_#t~post54#1, ULTIMATE.start_main_#t~ret50#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~mem53#1, ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_#t~ret48#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_#t~ret49#1, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_~#t_ids~0#1.offset, ULTIMATE.start_main_#t~ret51#1, ULTIMATE.start_main_#t~post45#1, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_main_#t~ret47#1][135], [236#true, 233#true, 164#L939-17true, 175#ULTIMATE.startFINALtrue, 242#true, 66#L939-23true, 230#true, 232#true]) [2025-03-13 22:19:50,403 INFO L294 olderBase$Statistics]: this new event has 177 ancestors and is cut-off event [2025-03-13 22:19:50,403 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2025-03-13 22:19:50,403 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2025-03-13 22:19:50,403 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2025-03-13 22:19:50,403 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([704] L-1-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret46#1=|v_ULTIMATE.start_main_#t~ret46#1_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_#t~ret52#1=|v_ULTIMATE.start_main_#t~ret52#1_1|, ULTIMATE.start_main_#t~post54#1=|v_ULTIMATE.start_main_#t~post54#1_1|, ULTIMATE.start_main_#t~ret50#1=|v_ULTIMATE.start_main_#t~ret50#1_1|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_1|, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_1|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_1|, ULTIMATE.start_main_#t~ret48#1=|v_ULTIMATE.start_main_#t~ret48#1_1|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_1|, ULTIMATE.start_main_#t~ret49#1=|v_ULTIMATE.start_main_#t~ret49#1_1|, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_1|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_1|, ULTIMATE.start_main_#t~ret51#1=|v_ULTIMATE.start_main_#t~ret51#1_1|, ULTIMATE.start_main_#t~post45#1=|v_ULTIMATE.start_main_#t~post45#1_1|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_1|, ULTIMATE.start_main_#t~ret47#1=|v_ULTIMATE.start_main_#t~ret47#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret46#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~ret52#1, ULTIMATE.start_main_#t~post54#1, ULTIMATE.start_main_#t~ret50#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~mem53#1, ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_#t~ret48#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_#t~ret49#1, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_~#t_ids~0#1.offset, ULTIMATE.start_main_#t~ret51#1, ULTIMATE.start_main_#t~post45#1, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_main_#t~ret47#1][135], [110#L939-36true, 236#true, 88#L939-4true, 233#true, 175#ULTIMATE.startFINALtrue, 242#true, 230#true, 232#true]) [2025-03-13 22:19:50,404 INFO L294 olderBase$Statistics]: this new event has 177 ancestors and is cut-off event [2025-03-13 22:19:50,404 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2025-03-13 22:19:50,404 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2025-03-13 22:19:50,404 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2025-03-13 22:19:50,440 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([704] L-1-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret46#1=|v_ULTIMATE.start_main_#t~ret46#1_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_#t~ret52#1=|v_ULTIMATE.start_main_#t~ret52#1_1|, ULTIMATE.start_main_#t~post54#1=|v_ULTIMATE.start_main_#t~post54#1_1|, ULTIMATE.start_main_#t~ret50#1=|v_ULTIMATE.start_main_#t~ret50#1_1|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_1|, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_1|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_1|, ULTIMATE.start_main_#t~ret48#1=|v_ULTIMATE.start_main_#t~ret48#1_1|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_1|, ULTIMATE.start_main_#t~ret49#1=|v_ULTIMATE.start_main_#t~ret49#1_1|, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_1|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_1|, ULTIMATE.start_main_#t~ret51#1=|v_ULTIMATE.start_main_#t~ret51#1_1|, ULTIMATE.start_main_#t~post45#1=|v_ULTIMATE.start_main_#t~post45#1_1|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_1|, ULTIMATE.start_main_#t~ret47#1=|v_ULTIMATE.start_main_#t~ret47#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret46#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~ret52#1, ULTIMATE.start_main_#t~post54#1, ULTIMATE.start_main_#t~ret50#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~mem53#1, ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_#t~ret48#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_#t~ret49#1, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_~#t_ids~0#1.offset, ULTIMATE.start_main_#t~ret51#1, ULTIMATE.start_main_#t~post45#1, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_main_#t~ret47#1][135], [236#true, 164#L939-17true, 233#true, 175#ULTIMATE.startFINALtrue, 242#true, 176#L939-17true, 230#true, 232#true]) [2025-03-13 22:19:50,440 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2025-03-13 22:19:50,440 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-03-13 22:19:50,440 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-13 22:19:50,440 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-13 22:19:50,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([704] L-1-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret46#1=|v_ULTIMATE.start_main_#t~ret46#1_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_#t~ret52#1=|v_ULTIMATE.start_main_#t~ret52#1_1|, ULTIMATE.start_main_#t~post54#1=|v_ULTIMATE.start_main_#t~post54#1_1|, ULTIMATE.start_main_#t~ret50#1=|v_ULTIMATE.start_main_#t~ret50#1_1|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_1|, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_1|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_1|, ULTIMATE.start_main_#t~ret48#1=|v_ULTIMATE.start_main_#t~ret48#1_1|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_1|, ULTIMATE.start_main_#t~ret49#1=|v_ULTIMATE.start_main_#t~ret49#1_1|, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_1|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_1|, ULTIMATE.start_main_#t~ret51#1=|v_ULTIMATE.start_main_#t~ret51#1_1|, ULTIMATE.start_main_#t~post45#1=|v_ULTIMATE.start_main_#t~post45#1_1|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_1|, ULTIMATE.start_main_#t~ret47#1=|v_ULTIMATE.start_main_#t~ret47#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret46#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~ret52#1, ULTIMATE.start_main_#t~post54#1, ULTIMATE.start_main_#t~ret50#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~mem53#1, ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_#t~ret48#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_#t~ret49#1, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_~#t_ids~0#1.offset, ULTIMATE.start_main_#t~ret51#1, ULTIMATE.start_main_#t~post45#1, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_main_#t~ret47#1][135], [194#L940true, 110#L939-36true, 236#true, 233#true, 175#ULTIMATE.startFINALtrue, 242#true, 230#true, 232#true]) [2025-03-13 22:19:50,450 INFO L294 olderBase$Statistics]: this new event has 181 ancestors and is cut-off event [2025-03-13 22:19:50,450 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-13 22:19:50,450 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-13 22:19:50,450 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-13 22:19:50,459 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([959] t_funEXIT-->L952-3: 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[][198], [17#L952-3true, 110#L939-36true, 236#true, 233#true, 229#true, 242#true, 232#true]) [2025-03-13 22:19:50,459 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2025-03-13 22:19:50,461 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-13 22:19:50,462 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2025-03-13 22:19:50,462 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-13 22:19:50,504 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([704] L-1-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret46#1=|v_ULTIMATE.start_main_#t~ret46#1_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_#t~ret52#1=|v_ULTIMATE.start_main_#t~ret52#1_1|, ULTIMATE.start_main_#t~post54#1=|v_ULTIMATE.start_main_#t~post54#1_1|, ULTIMATE.start_main_#t~ret50#1=|v_ULTIMATE.start_main_#t~ret50#1_1|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_1|, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_1|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_1|, ULTIMATE.start_main_#t~ret48#1=|v_ULTIMATE.start_main_#t~ret48#1_1|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_1|, ULTIMATE.start_main_#t~ret49#1=|v_ULTIMATE.start_main_#t~ret49#1_1|, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_1|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_1|, ULTIMATE.start_main_#t~ret51#1=|v_ULTIMATE.start_main_#t~ret51#1_1|, ULTIMATE.start_main_#t~post45#1=|v_ULTIMATE.start_main_#t~post45#1_1|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_1|, ULTIMATE.start_main_#t~ret47#1=|v_ULTIMATE.start_main_#t~ret47#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret46#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~ret52#1, ULTIMATE.start_main_#t~post54#1, ULTIMATE.start_main_#t~ret50#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~mem53#1, ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_#t~ret48#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_#t~ret49#1, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_~#t_ids~0#1.offset, ULTIMATE.start_main_#t~ret51#1, ULTIMATE.start_main_#t~post45#1, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_main_#t~ret47#1][135], [236#true, 88#L939-4true, 233#true, 175#ULTIMATE.startFINALtrue, 242#true, 66#L939-23true, 230#true, 232#true]) [2025-03-13 22:19:50,504 INFO L294 olderBase$Statistics]: this new event has 188 ancestors and is cut-off event [2025-03-13 22:19:50,504 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-13 22:19:50,504 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-13 22:19:50,504 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-13 22:19:50,520 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([704] L-1-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret46#1=|v_ULTIMATE.start_main_#t~ret46#1_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_#t~ret52#1=|v_ULTIMATE.start_main_#t~ret52#1_1|, ULTIMATE.start_main_#t~post54#1=|v_ULTIMATE.start_main_#t~post54#1_1|, ULTIMATE.start_main_#t~ret50#1=|v_ULTIMATE.start_main_#t~ret50#1_1|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_1|, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_1|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_1|, ULTIMATE.start_main_#t~ret48#1=|v_ULTIMATE.start_main_#t~ret48#1_1|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_1|, ULTIMATE.start_main_#t~ret49#1=|v_ULTIMATE.start_main_#t~ret49#1_1|, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_1|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_1|, ULTIMATE.start_main_#t~ret51#1=|v_ULTIMATE.start_main_#t~ret51#1_1|, ULTIMATE.start_main_#t~post45#1=|v_ULTIMATE.start_main_#t~post45#1_1|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_1|, ULTIMATE.start_main_#t~ret47#1=|v_ULTIMATE.start_main_#t~ret47#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret46#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~ret52#1, ULTIMATE.start_main_#t~post54#1, ULTIMATE.start_main_#t~ret50#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~mem53#1, ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_#t~ret48#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_#t~ret49#1, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_~#t_ids~0#1.offset, ULTIMATE.start_main_#t~ret51#1, ULTIMATE.start_main_#t~post45#1, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_main_#t~ret47#1][135], [236#true, 88#L939-4true, 233#true, 175#ULTIMATE.startFINALtrue, 242#true, 176#L939-17true, 230#true, 232#true]) [2025-03-13 22:19:50,520 INFO L294 olderBase$Statistics]: this new event has 191 ancestors and is cut-off event [2025-03-13 22:19:50,520 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-03-13 22:19:50,520 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-03-13 22:19:50,520 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-03-13 22:19:50,521 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([704] L-1-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret46#1=|v_ULTIMATE.start_main_#t~ret46#1_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_#t~ret52#1=|v_ULTIMATE.start_main_#t~ret52#1_1|, ULTIMATE.start_main_#t~post54#1=|v_ULTIMATE.start_main_#t~post54#1_1|, ULTIMATE.start_main_#t~ret50#1=|v_ULTIMATE.start_main_#t~ret50#1_1|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_1|, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_1|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_1|, ULTIMATE.start_main_#t~ret48#1=|v_ULTIMATE.start_main_#t~ret48#1_1|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_1|, ULTIMATE.start_main_#t~ret49#1=|v_ULTIMATE.start_main_#t~ret49#1_1|, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_1|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_1|, ULTIMATE.start_main_#t~ret51#1=|v_ULTIMATE.start_main_#t~ret51#1_1|, ULTIMATE.start_main_#t~post45#1=|v_ULTIMATE.start_main_#t~post45#1_1|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_1|, ULTIMATE.start_main_#t~ret47#1=|v_ULTIMATE.start_main_#t~ret47#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret46#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~ret52#1, ULTIMATE.start_main_#t~post54#1, ULTIMATE.start_main_#t~ret50#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~mem53#1, ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_#t~ret48#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_#t~ret49#1, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_~#t_ids~0#1.offset, ULTIMATE.start_main_#t~ret51#1, ULTIMATE.start_main_#t~post45#1, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_main_#t~ret47#1][135], [236#true, 164#L939-17true, 233#true, 175#ULTIMATE.startFINALtrue, 67#L939-4true, 242#true, 230#true, 232#true]) [2025-03-13 22:19:50,521 INFO L294 olderBase$Statistics]: this new event has 191 ancestors and is cut-off event [2025-03-13 22:19:50,521 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-03-13 22:19:50,521 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-03-13 22:19:50,521 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-03-13 22:19:50,526 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([704] L-1-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret46#1=|v_ULTIMATE.start_main_#t~ret46#1_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_#t~ret52#1=|v_ULTIMATE.start_main_#t~ret52#1_1|, ULTIMATE.start_main_#t~post54#1=|v_ULTIMATE.start_main_#t~post54#1_1|, ULTIMATE.start_main_#t~ret50#1=|v_ULTIMATE.start_main_#t~ret50#1_1|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_1|, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_1|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_1|, ULTIMATE.start_main_#t~ret48#1=|v_ULTIMATE.start_main_#t~ret48#1_1|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_1|, ULTIMATE.start_main_#t~ret49#1=|v_ULTIMATE.start_main_#t~ret49#1_1|, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_1|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_1|, ULTIMATE.start_main_#t~ret51#1=|v_ULTIMATE.start_main_#t~ret51#1_1|, ULTIMATE.start_main_#t~post45#1=|v_ULTIMATE.start_main_#t~post45#1_1|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_1|, ULTIMATE.start_main_#t~ret47#1=|v_ULTIMATE.start_main_#t~ret47#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret46#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~ret52#1, ULTIMATE.start_main_#t~post54#1, ULTIMATE.start_main_#t~ret50#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~mem53#1, ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_#t~ret48#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_#t~ret49#1, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_~#t_ids~0#1.offset, ULTIMATE.start_main_#t~ret51#1, ULTIMATE.start_main_#t~post45#1, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_main_#t~ret47#1][135], [194#L940true, 236#true, 233#true, 175#ULTIMATE.startFINALtrue, 242#true, 66#L939-23true, 230#true, 232#true]) [2025-03-13 22:19:50,526 INFO L294 olderBase$Statistics]: this new event has 192 ancestors and is cut-off event [2025-03-13 22:19:50,526 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-03-13 22:19:50,526 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-03-13 22:19:50,526 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-03-13 22:19:50,529 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([959] t_funEXIT-->L952-3: 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[][198], [17#L952-3true, 236#true, 233#true, 229#true, 242#true, 66#L939-23true, 232#true]) [2025-03-13 22:19:50,529 INFO L294 olderBase$Statistics]: this new event has 196 ancestors and is cut-off event [2025-03-13 22:19:50,529 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-03-13 22:19:50,529 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-03-13 22:19:50,529 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-03-13 22:19:50,538 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([704] L-1-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret46#1=|v_ULTIMATE.start_main_#t~ret46#1_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_#t~ret52#1=|v_ULTIMATE.start_main_#t~ret52#1_1|, ULTIMATE.start_main_#t~post54#1=|v_ULTIMATE.start_main_#t~post54#1_1|, ULTIMATE.start_main_#t~ret50#1=|v_ULTIMATE.start_main_#t~ret50#1_1|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_1|, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_1|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_1|, ULTIMATE.start_main_#t~ret48#1=|v_ULTIMATE.start_main_#t~ret48#1_1|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_1|, ULTIMATE.start_main_#t~ret49#1=|v_ULTIMATE.start_main_#t~ret49#1_1|, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_1|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_1|, ULTIMATE.start_main_#t~ret51#1=|v_ULTIMATE.start_main_#t~ret51#1_1|, ULTIMATE.start_main_#t~post45#1=|v_ULTIMATE.start_main_#t~post45#1_1|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_1|, ULTIMATE.start_main_#t~ret47#1=|v_ULTIMATE.start_main_#t~ret47#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret46#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~ret52#1, ULTIMATE.start_main_#t~post54#1, ULTIMATE.start_main_#t~ret50#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~mem53#1, ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_#t~ret48#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_#t~ret49#1, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_~#t_ids~0#1.offset, ULTIMATE.start_main_#t~ret51#1, ULTIMATE.start_main_#t~post45#1, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_main_#t~ret47#1][135], [194#L940true, 236#true, 233#true, 175#ULTIMATE.startFINALtrue, 242#true, 176#L939-17true, 230#true, 232#true]) [2025-03-13 22:19:50,538 INFO L294 olderBase$Statistics]: this new event has 195 ancestors and is cut-off event [2025-03-13 22:19:50,538 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2025-03-13 22:19:50,538 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-03-13 22:19:50,538 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-03-13 22:19:50,539 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([704] L-1-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret46#1=|v_ULTIMATE.start_main_#t~ret46#1_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_#t~ret52#1=|v_ULTIMATE.start_main_#t~ret52#1_1|, ULTIMATE.start_main_#t~post54#1=|v_ULTIMATE.start_main_#t~post54#1_1|, ULTIMATE.start_main_#t~ret50#1=|v_ULTIMATE.start_main_#t~ret50#1_1|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_1|, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_1|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_1|, ULTIMATE.start_main_#t~ret48#1=|v_ULTIMATE.start_main_#t~ret48#1_1|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_1|, ULTIMATE.start_main_#t~ret49#1=|v_ULTIMATE.start_main_#t~ret49#1_1|, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_1|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_1|, ULTIMATE.start_main_#t~ret51#1=|v_ULTIMATE.start_main_#t~ret51#1_1|, ULTIMATE.start_main_#t~post45#1=|v_ULTIMATE.start_main_#t~post45#1_1|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_1|, ULTIMATE.start_main_#t~ret47#1=|v_ULTIMATE.start_main_#t~ret47#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret46#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~ret52#1, ULTIMATE.start_main_#t~post54#1, ULTIMATE.start_main_#t~ret50#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~mem53#1, ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_#t~ret48#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_#t~ret49#1, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_~#t_ids~0#1.offset, ULTIMATE.start_main_#t~ret51#1, ULTIMATE.start_main_#t~post45#1, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_main_#t~ret47#1][135], [236#true, 233#true, 164#L939-17true, 175#ULTIMATE.startFINALtrue, 128#L940true, 242#true, 230#true, 232#true]) [2025-03-13 22:19:50,539 INFO L294 olderBase$Statistics]: this new event has 195 ancestors and is cut-off event [2025-03-13 22:19:50,539 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-03-13 22:19:50,539 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2025-03-13 22:19:50,539 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-03-13 22:19:50,540 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([959] t_funEXIT-->L952-3: 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[][198], [17#L952-3true, 236#true, 229#true, 233#true, 242#true, 176#L939-17true, 232#true]) [2025-03-13 22:19:50,540 INFO L294 olderBase$Statistics]: this new event has 199 ancestors and is cut-off event [2025-03-13 22:19:50,541 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2025-03-13 22:19:50,541 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-13 22:19:50,541 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-13 22:19:50,541 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([960] t_funEXIT-->L952-3: 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[][223], [17#L952-3true, 231#true, 236#true, 233#true, 164#L939-17true, 242#true, 230#true]) [2025-03-13 22:19:50,541 INFO L294 olderBase$Statistics]: this new event has 199 ancestors and is cut-off event [2025-03-13 22:19:50,541 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2025-03-13 22:19:50,541 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-13 22:19:50,541 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-13 22:19:50,555 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([704] L-1-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret46#1=|v_ULTIMATE.start_main_#t~ret46#1_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_#t~ret52#1=|v_ULTIMATE.start_main_#t~ret52#1_1|, ULTIMATE.start_main_#t~post54#1=|v_ULTIMATE.start_main_#t~post54#1_1|, ULTIMATE.start_main_#t~ret50#1=|v_ULTIMATE.start_main_#t~ret50#1_1|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_1|, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_1|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_1|, ULTIMATE.start_main_#t~ret48#1=|v_ULTIMATE.start_main_#t~ret48#1_1|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_1|, ULTIMATE.start_main_#t~ret49#1=|v_ULTIMATE.start_main_#t~ret49#1_1|, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_1|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_1|, ULTIMATE.start_main_#t~ret51#1=|v_ULTIMATE.start_main_#t~ret51#1_1|, ULTIMATE.start_main_#t~post45#1=|v_ULTIMATE.start_main_#t~post45#1_1|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_1|, ULTIMATE.start_main_#t~ret47#1=|v_ULTIMATE.start_main_#t~ret47#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret46#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~ret52#1, ULTIMATE.start_main_#t~post54#1, ULTIMATE.start_main_#t~ret50#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~mem53#1, ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_#t~ret48#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_#t~ret49#1, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_~#t_ids~0#1.offset, ULTIMATE.start_main_#t~ret51#1, ULTIMATE.start_main_#t~post45#1, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_main_#t~ret47#1][135], [236#true, 88#L939-4true, 233#true, 67#L939-4true, 175#ULTIMATE.startFINALtrue, 242#true, 230#true, 232#true]) [2025-03-13 22:19:50,555 INFO L294 olderBase$Statistics]: this new event has 202 ancestors and is cut-off event [2025-03-13 22:19:50,555 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-13 22:19:50,555 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-03-13 22:19:50,555 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-13 22:19:50,561 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([704] L-1-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret46#1=|v_ULTIMATE.start_main_#t~ret46#1_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_#t~ret52#1=|v_ULTIMATE.start_main_#t~ret52#1_1|, ULTIMATE.start_main_#t~post54#1=|v_ULTIMATE.start_main_#t~post54#1_1|, ULTIMATE.start_main_#t~ret50#1=|v_ULTIMATE.start_main_#t~ret50#1_1|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_1|, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_1|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_1|, ULTIMATE.start_main_#t~ret48#1=|v_ULTIMATE.start_main_#t~ret48#1_1|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_1|, ULTIMATE.start_main_#t~ret49#1=|v_ULTIMATE.start_main_#t~ret49#1_1|, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_1|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_1|, ULTIMATE.start_main_#t~ret51#1=|v_ULTIMATE.start_main_#t~ret51#1_1|, ULTIMATE.start_main_#t~post45#1=|v_ULTIMATE.start_main_#t~post45#1_1|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_1|, ULTIMATE.start_main_#t~ret47#1=|v_ULTIMATE.start_main_#t~ret47#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret46#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~ret52#1, ULTIMATE.start_main_#t~post54#1, ULTIMATE.start_main_#t~ret50#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~mem53#1, ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_#t~ret48#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_#t~ret49#1, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_~#t_ids~0#1.offset, ULTIMATE.start_main_#t~ret51#1, ULTIMATE.start_main_#t~post45#1, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_main_#t~ret47#1][135], [194#L940true, 236#true, 233#true, 175#ULTIMATE.startFINALtrue, 67#L939-4true, 242#true, 230#true, 232#true]) [2025-03-13 22:19:50,561 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2025-03-13 22:19:50,561 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-13 22:19:50,561 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-13 22:19:50,561 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-13 22:19:50,562 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([704] L-1-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret46#1=|v_ULTIMATE.start_main_#t~ret46#1_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_#t~ret52#1=|v_ULTIMATE.start_main_#t~ret52#1_1|, ULTIMATE.start_main_#t~post54#1=|v_ULTIMATE.start_main_#t~post54#1_1|, ULTIMATE.start_main_#t~ret50#1=|v_ULTIMATE.start_main_#t~ret50#1_1|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_1|, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_1|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_1|, ULTIMATE.start_main_#t~ret48#1=|v_ULTIMATE.start_main_#t~ret48#1_1|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_1|, ULTIMATE.start_main_#t~ret49#1=|v_ULTIMATE.start_main_#t~ret49#1_1|, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_1|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_1|, ULTIMATE.start_main_#t~ret51#1=|v_ULTIMATE.start_main_#t~ret51#1_1|, ULTIMATE.start_main_#t~post45#1=|v_ULTIMATE.start_main_#t~post45#1_1|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_1|, ULTIMATE.start_main_#t~ret47#1=|v_ULTIMATE.start_main_#t~ret47#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret46#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~ret52#1, ULTIMATE.start_main_#t~post54#1, ULTIMATE.start_main_#t~ret50#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~mem53#1, ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_#t~ret48#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_#t~ret49#1, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_~#t_ids~0#1.offset, ULTIMATE.start_main_#t~ret51#1, ULTIMATE.start_main_#t~post45#1, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_main_#t~ret47#1][135], [236#true, 88#L939-4true, 233#true, 175#ULTIMATE.startFINALtrue, 242#true, 128#L940true, 230#true, 232#true]) [2025-03-13 22:19:50,562 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2025-03-13 22:19:50,562 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-13 22:19:50,562 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-13 22:19:50,562 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-13 22:19:50,562 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([959] t_funEXIT-->L952-3: 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[][198], [17#L952-3true, 236#true, 233#true, 229#true, 67#L939-4true, 242#true, 232#true]) [2025-03-13 22:19:50,562 INFO L294 olderBase$Statistics]: this new event has 210 ancestors and is cut-off event [2025-03-13 22:19:50,562 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-13 22:19:50,562 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-13 22:19:50,562 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-13 22:19:50,563 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([960] t_funEXIT-->L952-3: 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[][223], [17#L952-3true, 231#true, 236#true, 233#true, 88#L939-4true, 242#true, 230#true]) [2025-03-13 22:19:50,563 INFO L294 olderBase$Statistics]: this new event has 210 ancestors and is cut-off event [2025-03-13 22:19:50,563 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-13 22:19:50,563 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-13 22:19:50,563 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-13 22:19:50,568 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([704] L-1-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret46#1=|v_ULTIMATE.start_main_#t~ret46#1_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_#t~ret52#1=|v_ULTIMATE.start_main_#t~ret52#1_1|, ULTIMATE.start_main_#t~post54#1=|v_ULTIMATE.start_main_#t~post54#1_1|, ULTIMATE.start_main_#t~ret50#1=|v_ULTIMATE.start_main_#t~ret50#1_1|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_1|, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_1|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_1|, ULTIMATE.start_main_#t~ret48#1=|v_ULTIMATE.start_main_#t~ret48#1_1|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_1|, ULTIMATE.start_main_#t~ret49#1=|v_ULTIMATE.start_main_#t~ret49#1_1|, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_1|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_1|, ULTIMATE.start_main_#t~ret51#1=|v_ULTIMATE.start_main_#t~ret51#1_1|, ULTIMATE.start_main_#t~post45#1=|v_ULTIMATE.start_main_#t~post45#1_1|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_1|, ULTIMATE.start_main_#t~ret47#1=|v_ULTIMATE.start_main_#t~ret47#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret46#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~ret52#1, ULTIMATE.start_main_#t~post54#1, ULTIMATE.start_main_#t~ret50#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~mem53#1, ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_#t~ret48#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_#t~ret49#1, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_~#t_ids~0#1.offset, ULTIMATE.start_main_#t~ret51#1, ULTIMATE.start_main_#t~post45#1, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_main_#t~ret47#1][135], [194#L940true, 236#true, 233#true, 175#ULTIMATE.startFINALtrue, 242#true, 128#L940true, 230#true, 232#true]) [2025-03-13 22:19:50,568 INFO L294 olderBase$Statistics]: this new event has 210 ancestors and is cut-off event [2025-03-13 22:19:50,568 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-13 22:19:50,568 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-13 22:19:50,568 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-13 22:19:50,568 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([960] t_funEXIT-->L952-3: 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[][223], [17#L952-3true, 194#L940true, 231#true, 236#true, 233#true, 242#true, 230#true]) [2025-03-13 22:19:50,568 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2025-03-13 22:19:50,568 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-13 22:19:50,568 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-13 22:19:50,568 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-13 22:19:50,568 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([959] t_funEXIT-->L952-3: 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[][198], [17#L952-3true, 236#true, 233#true, 229#true, 128#L940true, 242#true, 232#true]) [2025-03-13 22:19:50,568 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2025-03-13 22:19:50,568 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-13 22:19:50,568 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-13 22:19:50,568 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-13 22:19:50,572 INFO L124 PetriNetUnfolderBase]: 10750/37559 cut-off events. [2025-03-13 22:19:50,572 INFO L125 PetriNetUnfolderBase]: For 2290/2290 co-relation queries the response was YES. [2025-03-13 22:19:50,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53286 conditions, 37559 events. 10750/37559 cut-off events. For 2290/2290 co-relation queries the response was YES. Maximal size of possible extension queue 921. Compared 480744 event pairs, 7190 based on Foata normal form. 1/33819 useless extension candidates. Maximal degree in co-relation 26169. Up to 14523 conditions per place. [2025-03-13 22:19:50,861 INFO L140 encePairwiseOnDemand]: 251/254 looper letters, 39 selfloop transitions, 2 changer transitions 0/236 dead transitions. [2025-03-13 22:19:50,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 236 transitions, 593 flow [2025-03-13 22:19:50,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:19:50,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:19:50,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 633 transitions. [2025-03-13 22:19:50,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8307086614173228 [2025-03-13 22:19:50,865 INFO L175 Difference]: Start difference. First operand has 235 places, 229 transitions, 495 flow. Second operand 3 states and 633 transitions. [2025-03-13 22:19:50,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 236 transitions, 593 flow [2025-03-13 22:19:50,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 236 transitions, 581 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:19:50,870 INFO L231 Difference]: Finished difference. Result has 233 places, 230 transitions, 497 flow [2025-03-13 22:19:50,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=497, PETRI_PLACES=233, PETRI_TRANSITIONS=230} [2025-03-13 22:19:50,872 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 0 predicate places. [2025-03-13 22:19:50,872 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 230 transitions, 497 flow [2025-03-13 22:19:50,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 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-03-13 22:19:50,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:50,873 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] [2025-03-13 22:19:50,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:19:50,873 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-13 22:19:50,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:50,874 INFO L85 PathProgramCache]: Analyzing trace with hash 800163634, now seen corresponding path program 1 times [2025-03-13 22:19:50,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:50,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705837551] [2025-03-13 22:19:50,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:50,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:50,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-13 22:19:50,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-13 22:19:50,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:50,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:50,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:19:50,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:50,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705837551] [2025-03-13 22:19:50,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705837551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:50,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:50,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:19:50,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713071504] [2025-03-13 22:19:50,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:50,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:19:50,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:50,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:19:50,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:19:50,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 254 [2025-03-13 22:19:50,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 230 transitions, 497 flow. Second operand has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 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-03-13 22:19:50,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:50,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 254 [2025-03-13 22:19:50,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand