/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.positions.where.we.compute.the.hoare.annotation All -i ../../../trunk/examples/svcomp/weaver/chl-array-int-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-14 22:01:58,373 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 22:01:58,435 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-14 22:01:58,470 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 22:01:58,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 22:01:58,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 22:01:58,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 22:01:58,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 22:01:58,471 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 22:01:58,471 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 22:01:58,471 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 22:01:58,471 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 22:01:58,471 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 22:01:58,471 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 22:01:58,471 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 22:01:58,471 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 22:01:58,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 22:01:58,472 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 22:01:58,472 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 22:01:58,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 22:01:58,472 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 22:01:58,472 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-14 22:01:58,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 22:01:58,472 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-14 22:01:58,472 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 22:01:58,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 22:01:58,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 22:01:58,472 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 22:01:58,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 22:01:58,472 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 22:01:58,472 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 22:01:58,473 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 22:01:58,473 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2025-03-14 22:01:58,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 22:01:58,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 22:01:58,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 22:01:58,719 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 22:01:58,719 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 22:01:58,722 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-array-int-subst.wvr.c [2025-03-14 22:01:59,897 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/323a24655/1c493aed58e64885b746e430a8b9d51f/FLAGe9037d48e [2025-03-14 22:02:00,063 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 22:02:00,064 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-subst.wvr.c [2025-03-14 22:02:00,073 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/323a24655/1c493aed58e64885b746e430a8b9d51f/FLAGe9037d48e [2025-03-14 22:02:00,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/323a24655/1c493aed58e64885b746e430a8b9d51f [2025-03-14 22:02:00,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 22:02:00,093 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-14 22:02:00,094 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 22:02:00,094 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 22:02:00,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 22:02:00,099 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 10:02:00" (1/1) ... [2025-03-14 22:02:00,100 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61c5965e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:02:00, skipping insertion in model container [2025-03-14 22:02:00,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 10:02:00" (1/1) ... [2025-03-14 22:02:00,113 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 22:02:00,266 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-subst.wvr.c[2820,2833] [2025-03-14 22:02:00,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 22:02:00,288 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 22:02:00,307 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-subst.wvr.c[2820,2833] [2025-03-14 22:02:00,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 22:02:00,319 INFO L204 MainTranslator]: Completed translation [2025-03-14 22:02:00,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:02:00 WrapperNode [2025-03-14 22:02:00,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 22:02:00,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 22:02:00,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 22:02:00,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 22:02:00,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:02:00" (1/1) ... [2025-03-14 22:02:00,333 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:02:00" (1/1) ... [2025-03-14 22:02:00,352 INFO L138 Inliner]: procedures = 25, calls = 35, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 256 [2025-03-14 22:02:00,352 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 22:02:00,352 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 22:02:00,352 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 22:02:00,352 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 22:02:00,358 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:02:00" (1/1) ... [2025-03-14 22:02:00,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:02:00" (1/1) ... [2025-03-14 22:02:00,360 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:02:00" (1/1) ... [2025-03-14 22:02:00,361 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:02:00" (1/1) ... [2025-03-14 22:02:00,366 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:02:00" (1/1) ... [2025-03-14 22:02:00,368 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:02:00" (1/1) ... [2025-03-14 22:02:00,371 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:02:00" (1/1) ... [2025-03-14 22:02:00,372 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:02:00" (1/1) ... [2025-03-14 22:02:00,373 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:02:00" (1/1) ... [2025-03-14 22:02:00,375 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 22:02:00,375 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-14 22:02:00,375 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-14 22:02:00,376 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-14 22:02:00,376 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:02:00" (1/1) ... [2025-03-14 22:02:00,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 22:02:00,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:02:00,400 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-14 22:02:00,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-14 22:02:00,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 22:02:00,423 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 22:02:00,423 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 22:02:00,423 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 22:02:00,423 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 22:02:00,423 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 22:02:00,423 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 22:02:00,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 22:02:00,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 22:02:00,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 22:02:00,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 22:02:00,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 22:02:00,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 22:02:00,424 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 22:02:00,493 INFO L234 CfgBuilder]: Building ICFG [2025-03-14 22:02:00,495 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 22:02:00,843 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 22:02:00,843 INFO L283 CfgBuilder]: Performing block encoding [2025-03-14 22:02:00,859 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 22:02:00,859 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 22:02:00,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 10:02:00 BoogieIcfgContainer [2025-03-14 22:02:00,859 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-14 22:02:00,862 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 22:02:00,862 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 22:02:00,867 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 22:02:00,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 10:02:00" (1/3) ... [2025-03-14 22:02:00,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2afd68c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 10:02:00, skipping insertion in model container [2025-03-14 22:02:00,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:02:00" (2/3) ... [2025-03-14 22:02:00,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2afd68c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 10:02:00, skipping insertion in model container [2025-03-14 22:02:00,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 10:02:00" (3/3) ... [2025-03-14 22:02:00,869 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-subst.wvr.c [2025-03-14 22:02:00,881 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 22:02:00,882 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-subst.wvr.c that has 4 procedures, 326 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-14 22:02:00,883 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 22:02:00,999 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 22:02:01,040 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 22:02:01,053 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=All, 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;@6413359c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 22:02:01,054 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 22:02:01,170 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 22:02:01,171 INFO L124 PetriNetUnfolderBase]: 23/339 cut-off events. [2025-03-14 22:02:01,173 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 22:02:01,173 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:02:01,174 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 22:02:01,174 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:02:01,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:02:01,185 INFO L85 PathProgramCache]: Analyzing trace with hash 726804190, now seen corresponding path program 1 times [2025-03-14 22:02:01,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:02:01,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996423721] [2025-03-14 22:02:01,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:02:01,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:02:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:02:03,400 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-14 22:02:03,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:02:03,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996423721] [2025-03-14 22:02:03,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996423721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:02:03,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:02:03,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2025-03-14 22:02:03,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197551238] [2025-03-14 22:02:03,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:02:03,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-14 22:02:03,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:02:03,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-14 22:02:03,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2025-03-14 22:02:03,451 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 348 [2025-03-14 22:02:03,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 348 transitions, 717 flow. Second operand has 26 states, 26 states have (on average 214.69230769230768) internal successors, (5582), 26 states have internal predecessors, (5582), 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-14 22:02:03,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:02:03,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 348 [2025-03-14 22:02:03,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:02:07,498 INFO L124 PetriNetUnfolderBase]: 1660/12447 cut-off events. [2025-03-14 22:02:07,498 INFO L125 PetriNetUnfolderBase]: For 565/565 co-relation queries the response was YES. [2025-03-14 22:02:07,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15224 conditions, 12447 events. 1660/12447 cut-off events. For 565/565 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 150553 event pairs, 906 based on Foata normal form. 654/11676 useless extension candidates. Maximal degree in co-relation 4598. Up to 520 conditions per place. [2025-03-14 22:02:07,590 INFO L140 encePairwiseOnDemand]: 276/348 looper letters, 308 selfloop transitions, 61 changer transitions 36/609 dead transitions. [2025-03-14 22:02:07,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 609 transitions, 2127 flow [2025-03-14 22:02:07,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-03-14 22:02:07,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2025-03-14 22:02:07,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 13560 transitions. [2025-03-14 22:02:07,629 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.628476084538376 [2025-03-14 22:02:07,631 INFO L298 CegarLoopForPetriNet]: 335 programPoint places, 53 predicate places. [2025-03-14 22:02:07,632 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 609 transitions, 2127 flow [2025-03-14 22:02:07,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 214.69230769230768) internal successors, (5582), 26 states have internal predecessors, (5582), 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-14 22:02:07,635 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:02:07,635 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 22:02:07,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 22:02:07,635 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:02:07,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:02:07,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1075266134, now seen corresponding path program 2 times [2025-03-14 22:02:07,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:02:07,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961142098] [2025-03-14 22:02:07,637 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:02:07,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:02:07,696 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:02:07,696 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:02:09,025 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-14 22:02:09,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:02:09,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961142098] [2025-03-14 22:02:09,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961142098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:02:09,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:02:09,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2025-03-14 22:02:09,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299653912] [2025-03-14 22:02:09,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:02:09,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-14 22:02:09,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:02:09,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-14 22:02:09,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2025-03-14 22:02:09,031 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 348 [2025-03-14 22:02:09,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 609 transitions, 2127 flow. Second operand has 26 states, 26 states have (on average 214.69230769230768) internal successors, (5582), 26 states have internal predecessors, (5582), 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-14 22:02:09,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:02:09,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 348 [2025-03-14 22:02:09,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:02:12,247 INFO L124 PetriNetUnfolderBase]: 1875/14019 cut-off events. [2025-03-14 22:02:12,248 INFO L125 PetriNetUnfolderBase]: For 1619/4155 co-relation queries the response was YES. [2025-03-14 22:02:12,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20021 conditions, 14019 events. 1875/14019 cut-off events. For 1619/4155 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 173696 event pairs, 844 based on Foata normal form. 29/12415 useless extension candidates. Maximal degree in co-relation 5722. Up to 520 conditions per place. [2025-03-14 22:02:12,325 INFO L140 encePairwiseOnDemand]: 294/348 looper letters, 412 selfloop transitions, 56 changer transitions 56/728 dead transitions. [2025-03-14 22:02:12,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 728 transitions, 3705 flow [2025-03-14 22:02:12,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-14 22:02:12,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2025-03-14 22:02:12,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 10741 transitions. [2025-03-14 22:02:12,338 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6298967863007272 [2025-03-14 22:02:12,339 INFO L298 CegarLoopForPetriNet]: 335 programPoint places, 101 predicate places. [2025-03-14 22:02:12,343 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 728 transitions, 3705 flow [2025-03-14 22:02:12,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 214.69230769230768) internal successors, (5582), 26 states have internal predecessors, (5582), 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-14 22:02:12,345 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:02:12,345 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 22:02:12,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 22:02:12,346 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:02:12,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:02:12,346 INFO L85 PathProgramCache]: Analyzing trace with hash 756173510, now seen corresponding path program 3 times [2025-03-14 22:02:12,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:02:12,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786195831] [2025-03-14 22:02:12,346 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:02:12,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:02:12,374 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 22:02:12,374 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:02:13,310 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-14 22:02:13,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:02:13,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786195831] [2025-03-14 22:02:13,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786195831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:02:13,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:02:13,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2025-03-14 22:02:13,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491837630] [2025-03-14 22:02:13,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:02:13,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-14 22:02:13,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:02:13,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-14 22:02:13,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2025-03-14 22:02:13,315 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 348 [2025-03-14 22:02:13,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 728 transitions, 3705 flow. Second operand has 26 states, 26 states have (on average 214.69230769230768) internal successors, (5582), 26 states have internal predecessors, (5582), 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-14 22:02:13,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:02:13,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 348 [2025-03-14 22:02:13,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:02:16,778 INFO L124 PetriNetUnfolderBase]: 2693/19812 cut-off events. [2025-03-14 22:02:16,778 INFO L125 PetriNetUnfolderBase]: For 4954/16472 co-relation queries the response was YES. [2025-03-14 22:02:16,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32311 conditions, 19812 events. 2693/19812 cut-off events. For 4954/16472 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 262797 event pairs, 958 based on Foata normal form. 64/17476 useless extension candidates. Maximal degree in co-relation 8220. Up to 1358 conditions per place. [2025-03-14 22:02:16,885 INFO L140 encePairwiseOnDemand]: 298/348 looper letters, 520 selfloop transitions, 76 changer transitions 88/888 dead transitions. [2025-03-14 22:02:16,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 888 transitions, 6102 flow [2025-03-14 22:02:16,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-14 22:02:16,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-14 22:02:16,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 9829 transitions. [2025-03-14 22:02:16,889 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6276500638569604 [2025-03-14 22:02:16,890 INFO L298 CegarLoopForPetriNet]: 335 programPoint places, 145 predicate places. [2025-03-14 22:02:16,890 INFO L471 AbstractCegarLoop]: Abstraction has has 480 places, 888 transitions, 6102 flow [2025-03-14 22:02:16,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 214.69230769230768) internal successors, (5582), 26 states have internal predecessors, (5582), 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-14 22:02:16,891 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:02:16,891 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 22:02:16,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 22:02:16,892 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:02:16,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:02:16,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1189351258, now seen corresponding path program 4 times [2025-03-14 22:02:16,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:02:16,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809109034] [2025-03-14 22:02:16,893 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:02:16,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:02:16,914 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:02:16,915 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:02:17,908 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-14 22:02:17,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:02:17,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809109034] [2025-03-14 22:02:17,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809109034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:02:17,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:02:17,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2025-03-14 22:02:17,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227491422] [2025-03-14 22:02:17,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:02:17,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-14 22:02:17,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:02:17,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-14 22:02:17,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2025-03-14 22:02:17,911 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 348 [2025-03-14 22:02:17,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 888 transitions, 6102 flow. Second operand has 29 states, 29 states have (on average 214.31034482758622) internal successors, (6215), 29 states have internal predecessors, (6215), 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-14 22:02:17,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:02:17,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 348 [2025-03-14 22:02:17,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:02:21,395 INFO L124 PetriNetUnfolderBase]: 2691/19760 cut-off events. [2025-03-14 22:02:21,395 INFO L125 PetriNetUnfolderBase]: For 8535/27044 co-relation queries the response was YES. [2025-03-14 22:02:21,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36602 conditions, 19760 events. 2691/19760 cut-off events. For 8535/27044 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 262209 event pairs, 969 based on Foata normal form. 81/17439 useless extension candidates. Maximal degree in co-relation 11789. Up to 1358 conditions per place. [2025-03-14 22:02:21,614 INFO L140 encePairwiseOnDemand]: 294/348 looper letters, 617 selfloop transitions, 65 changer transitions 108/994 dead transitions. [2025-03-14 22:02:21,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 994 transitions, 8581 flow [2025-03-14 22:02:21,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-14 22:02:21,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2025-03-14 22:02:21,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 10740 transitions. [2025-03-14 22:02:21,623 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.629838142153413 [2025-03-14 22:02:21,624 INFO L298 CegarLoopForPetriNet]: 335 programPoint places, 193 predicate places. [2025-03-14 22:02:21,624 INFO L471 AbstractCegarLoop]: Abstraction has has 528 places, 994 transitions, 8581 flow [2025-03-14 22:02:21,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 214.31034482758622) internal successors, (6215), 29 states have internal predecessors, (6215), 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-14 22:02:21,626 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:02:21,626 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 22:02:21,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 22:02:21,626 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:02:21,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:02:21,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1029618832, now seen corresponding path program 5 times [2025-03-14 22:02:21,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:02:21,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714209486] [2025-03-14 22:02:21,627 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:02:21,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:02:21,663 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:02:21,663 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:02:22,591 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-14 22:02:22,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:02:22,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714209486] [2025-03-14 22:02:22,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714209486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:02:22,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:02:22,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2025-03-14 22:02:22,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681529953] [2025-03-14 22:02:22,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:02:22,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-14 22:02:22,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:02:22,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-14 22:02:22,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2025-03-14 22:02:22,595 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 348 [2025-03-14 22:02:22,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 994 transitions, 8581 flow. Second operand has 28 states, 28 states have (on average 214.42857142857142) internal successors, (6004), 28 states have internal predecessors, (6004), 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-14 22:02:22,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:02:22,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 348 [2025-03-14 22:02:22,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:02:26,282 INFO L124 PetriNetUnfolderBase]: 2695/19881 cut-off events. [2025-03-14 22:02:26,282 INFO L125 PetriNetUnfolderBase]: For 13390/38589 co-relation queries the response was YES. [2025-03-14 22:02:26,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40745 conditions, 19881 events. 2695/19881 cut-off events. For 13390/38589 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 263409 event pairs, 962 based on Foata normal form. 102/17571 useless extension candidates. Maximal degree in co-relation 13168. Up to 1358 conditions per place. [2025-03-14 22:02:26,641 INFO L140 encePairwiseOnDemand]: 294/348 looper letters, 604 selfloop transitions, 65 changer transitions 118/991 dead transitions. [2025-03-14 22:02:26,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 991 transitions, 10125 flow [2025-03-14 22:02:26,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-14 22:02:26,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2025-03-14 22:02:26,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 11161 transitions. [2025-03-14 22:02:26,646 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6288595898129367 [2025-03-14 22:02:26,647 INFO L298 CegarLoopForPetriNet]: 335 programPoint places, 243 predicate places. [2025-03-14 22:02:26,647 INFO L471 AbstractCegarLoop]: Abstraction has has 578 places, 991 transitions, 10125 flow [2025-03-14 22:02:26,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 214.42857142857142) internal successors, (6004), 28 states have internal predecessors, (6004), 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-14 22:02:26,649 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:02:26,649 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 22:02:26,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 22:02:26,649 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:02:26,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:02:26,650 INFO L85 PathProgramCache]: Analyzing trace with hash -873552746, now seen corresponding path program 6 times [2025-03-14 22:02:26,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:02:26,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475430054] [2025-03-14 22:02:26,650 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 22:02:26,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:02:26,683 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 22:02:26,683 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:02:27,562 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-14 22:02:27,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:02:27,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475430054] [2025-03-14 22:02:27,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475430054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:02:27,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:02:27,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2025-03-14 22:02:27,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386640618] [2025-03-14 22:02:27,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:02:27,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-14 22:02:27,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:02:27,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-14 22:02:27,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2025-03-14 22:02:27,565 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 348 [2025-03-14 22:02:27,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 578 places, 991 transitions, 10125 flow. Second operand has 29 states, 29 states have (on average 214.31034482758622) internal successors, (6215), 29 states have internal predecessors, (6215), 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-14 22:02:27,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:02:27,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 348 [2025-03-14 22:02:27,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:02:32,807 INFO L124 PetriNetUnfolderBase]: 3037/22497 cut-off events. [2025-03-14 22:02:32,807 INFO L125 PetriNetUnfolderBase]: For 21924/57610 co-relation queries the response was YES. [2025-03-14 22:02:32,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51267 conditions, 22497 events. 3037/22497 cut-off events. For 21924/57610 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 306401 event pairs, 747 based on Foata normal form. 103/19831 useless extension candidates. Maximal degree in co-relation 11116. Up to 1978 conditions per place. [2025-03-14 22:02:32,963 INFO L140 encePairwiseOnDemand]: 295/348 looper letters, 680 selfloop transitions, 95 changer transitions 160/1139 dead transitions. [2025-03-14 22:02:32,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 1139 transitions, 13837 flow [2025-03-14 22:02:32,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-14 22:02:32,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2025-03-14 22:02:32,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 11565 transitions. [2025-03-14 22:02:32,969 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6270331815224464 [2025-03-14 22:02:32,969 INFO L298 CegarLoopForPetriNet]: 335 programPoint places, 295 predicate places. [2025-03-14 22:02:32,969 INFO L471 AbstractCegarLoop]: Abstraction has has 630 places, 1139 transitions, 13837 flow [2025-03-14 22:02:32,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 214.31034482758622) internal successors, (6215), 29 states have internal predecessors, (6215), 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-14 22:02:32,971 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:02:32,971 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 22:02:32,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 22:02:32,971 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:02:32,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:02:32,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1995744230, now seen corresponding path program 1 times [2025-03-14 22:02:32,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:02:32,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970383131] [2025-03-14 22:02:32,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:02:32,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:02:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:02:33,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:02:33,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:02:33,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970383131] [2025-03-14 22:02:33,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970383131] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:02:33,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584151043] [2025-03-14 22:02:33,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:02:33,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:02:33,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:02:33,329 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 22:02:33,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 22:02:33,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:02:33,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-14 22:02:33,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:02:33,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:02:33,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:02:34,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:02:34,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584151043] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 22:02:34,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 22:02:34,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [19, 18] total 36 [2025-03-14 22:02:34,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988071516] [2025-03-14 22:02:34,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:02:34,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-14 22:02:34,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:02:34,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-14 22:02:34,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1082, Unknown=0, NotChecked=0, Total=1260 [2025-03-14 22:02:34,760 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 348 [2025-03-14 22:02:34,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 1139 transitions, 13837 flow. Second operand has 18 states, 18 states have (on average 218.5) internal successors, (3933), 18 states have internal predecessors, (3933), 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-14 22:02:34,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:02:34,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 348 [2025-03-14 22:02:34,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:02:38,471 INFO L124 PetriNetUnfolderBase]: 3134/23663 cut-off events. [2025-03-14 22:02:38,471 INFO L125 PetriNetUnfolderBase]: For 28964/63572 co-relation queries the response was YES. [2025-03-14 22:02:38,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58118 conditions, 23663 events. 3134/23663 cut-off events. For 28964/63572 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 323719 event pairs, 616 based on Foata normal form. 0/20743 useless extension candidates. Maximal degree in co-relation 15586. Up to 1978 conditions per place. [2025-03-14 22:02:38,660 INFO L140 encePairwiseOnDemand]: 303/348 looper letters, 729 selfloop transitions, 56 changer transitions 174/1186 dead transitions. [2025-03-14 22:02:38,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 664 places, 1186 transitions, 16431 flow [2025-03-14 22:02:38,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-14 22:02:38,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-14 22:02:38,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 7812 transitions. [2025-03-14 22:02:38,664 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6413793103448275 [2025-03-14 22:02:38,664 INFO L298 CegarLoopForPetriNet]: 335 programPoint places, 329 predicate places. [2025-03-14 22:02:38,666 INFO L471 AbstractCegarLoop]: Abstraction has has 664 places, 1186 transitions, 16431 flow [2025-03-14 22:02:38,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 218.5) internal successors, (3933), 18 states have internal predecessors, (3933), 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-14 22:02:38,667 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:02:38,667 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 22:02:38,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 22:02:38,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:02:38,871 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:02:38,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:02:38,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1746337246, now seen corresponding path program 2 times [2025-03-14 22:02:38,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:02:38,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029948833] [2025-03-14 22:02:38,872 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:02:38,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:02:38,905 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:02:38,905 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:02:39,749 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-14 22:02:39,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:02:39,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029948833] [2025-03-14 22:02:39,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029948833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:02:39,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:02:39,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-14 22:02:39,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204410247] [2025-03-14 22:02:39,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:02:39,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-14 22:02:39,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:02:39,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-14 22:02:39,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2025-03-14 22:02:39,752 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 348 [2025-03-14 22:02:39,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 664 places, 1186 transitions, 16431 flow. Second operand has 24 states, 24 states have (on average 215.16666666666666) internal successors, (5164), 24 states have internal predecessors, (5164), 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-14 22:02:39,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:02:39,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 348 [2025-03-14 22:02:39,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:02:44,401 INFO L124 PetriNetUnfolderBase]: 3443/25221 cut-off events. [2025-03-14 22:02:44,402 INFO L125 PetriNetUnfolderBase]: For 43208/104416 co-relation queries the response was YES. [2025-03-14 22:02:44,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68824 conditions, 25221 events. 3443/25221 cut-off events. For 43208/104416 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 349008 event pairs, 518 based on Foata normal form. 91/22136 useless extension candidates. Maximal degree in co-relation 16715. Up to 2030 conditions per place. [2025-03-14 22:02:44,887 INFO L140 encePairwiseOnDemand]: 292/348 looper letters, 815 selfloop transitions, 89 changer transitions 216/1324 dead transitions. [2025-03-14 22:02:44,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 1324 transitions, 20938 flow [2025-03-14 22:02:44,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-03-14 22:02:44,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2025-03-14 22:02:44,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 12614 transitions. [2025-03-14 22:02:44,893 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6249504558065795 [2025-03-14 22:02:44,894 INFO L298 CegarLoopForPetriNet]: 335 programPoint places, 386 predicate places. [2025-03-14 22:02:44,894 INFO L471 AbstractCegarLoop]: Abstraction has has 721 places, 1324 transitions, 20938 flow [2025-03-14 22:02:44,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 215.16666666666666) internal successors, (5164), 24 states have internal predecessors, (5164), 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-14 22:02:44,895 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:02:44,895 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 22:02:44,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 22:02:44,895 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:02:44,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:02:44,896 INFO L85 PathProgramCache]: Analyzing trace with hash 683816742, now seen corresponding path program 3 times [2025-03-14 22:02:44,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:02:44,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76261400] [2025-03-14 22:02:44,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:02:44,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:02:44,915 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 22:02:44,915 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:02:45,899 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-14 22:02:45,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:02:45,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76261400] [2025-03-14 22:02:45,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76261400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:02:45,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:02:45,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-03-14 22:02:45,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611742944] [2025-03-14 22:02:45,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:02:45,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-14 22:02:45,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:02:45,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-14 22:02:45,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2025-03-14 22:02:45,907 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 348 [2025-03-14 22:02:45,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 721 places, 1324 transitions, 20938 flow. Second operand has 25 states, 25 states have (on average 215.0) internal successors, (5375), 25 states have internal predecessors, (5375), 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-14 22:02:45,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:02:45,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 348 [2025-03-14 22:02:45,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:02:51,340 INFO L124 PetriNetUnfolderBase]: 3529/26378 cut-off events. [2025-03-14 22:02:51,340 INFO L125 PetriNetUnfolderBase]: For 58618/128529 co-relation queries the response was YES. [2025-03-14 22:02:51,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77210 conditions, 26378 events. 3529/26378 cut-off events. For 58618/128529 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 366139 event pairs, 519 based on Foata normal form. 134/23186 useless extension candidates. Maximal degree in co-relation 18056. Up to 2224 conditions per place. [2025-03-14 22:02:51,606 INFO L140 encePairwiseOnDemand]: 292/348 looper letters, 895 selfloop transitions, 97 changer transitions 236/1432 dead transitions. [2025-03-14 22:02:51,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 778 places, 1432 transitions, 25385 flow [2025-03-14 22:02:51,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-03-14 22:02:51,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2025-03-14 22:02:51,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 12613 transitions. [2025-03-14 22:02:51,612 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.624900911613159 [2025-03-14 22:02:51,613 INFO L298 CegarLoopForPetriNet]: 335 programPoint places, 443 predicate places. [2025-03-14 22:02:51,614 INFO L471 AbstractCegarLoop]: Abstraction has has 778 places, 1432 transitions, 25385 flow [2025-03-14 22:02:51,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 215.0) internal successors, (5375), 25 states have internal predecessors, (5375), 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-14 22:02:51,615 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:02:51,615 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 22:02:51,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 22:02:51,615 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:02:51,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:02:51,618 INFO L85 PathProgramCache]: Analyzing trace with hash -173041882, now seen corresponding path program 4 times [2025-03-14 22:02:51,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:02:51,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213376893] [2025-03-14 22:02:51,618 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:02:51,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:02:51,632 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:02:51,632 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:02:51,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:02:51,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:02:51,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213376893] [2025-03-14 22:02:51,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213376893] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:02:51,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471916672] [2025-03-14 22:02:51,981 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:02:51,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:02:51,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:02:51,983 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 22:02:51,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 22:02:52,054 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:02:52,054 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:02:52,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-14 22:02:52,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:02:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:02:52,492 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:02:53,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:02:53,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471916672] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 22:02:53,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 22:02:53,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [21, 18] total 43 [2025-03-14 22:02:53,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430256250] [2025-03-14 22:02:53,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:02:53,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-14 22:02:53,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:02:53,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-14 22:02:53,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=1548, Unknown=0, NotChecked=0, Total=1806 [2025-03-14 22:02:53,287 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 348 [2025-03-14 22:02:53,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 778 places, 1432 transitions, 25385 flow. Second operand has 18 states, 18 states have (on average 218.5) internal successors, (3933), 18 states have internal predecessors, (3933), 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-14 22:02:53,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:02:53,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 348 [2025-03-14 22:02:53,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:02:57,789 INFO L124 PetriNetUnfolderBase]: 3527/26063 cut-off events. [2025-03-14 22:02:57,789 INFO L125 PetriNetUnfolderBase]: For 70447/146522 co-relation queries the response was YES. [2025-03-14 22:02:57,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82084 conditions, 26063 events. 3527/26063 cut-off events. For 70447/146522 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 361977 event pairs, 521 based on Foata normal form. 44/22811 useless extension candidates. Maximal degree in co-relation 19177. Up to 2218 conditions per place. [2025-03-14 22:02:58,066 INFO L140 encePairwiseOnDemand]: 303/348 looper letters, 867 selfloop transitions, 72 changer transitions 256/1426 dead transitions. [2025-03-14 22:02:58,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 812 places, 1426 transitions, 27655 flow [2025-03-14 22:02:58,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-14 22:02:58,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-14 22:02:58,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 7813 transitions. [2025-03-14 22:02:58,070 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6414614121510673 [2025-03-14 22:02:58,070 INFO L298 CegarLoopForPetriNet]: 335 programPoint places, 477 predicate places. [2025-03-14 22:02:58,070 INFO L471 AbstractCegarLoop]: Abstraction has has 812 places, 1426 transitions, 27655 flow [2025-03-14 22:02:58,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 218.5) internal successors, (3933), 18 states have internal predecessors, (3933), 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-14 22:02:58,072 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:02:58,072 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 22:02:58,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 22:02:58,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-14 22:02:58,273 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:02:58,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:02:58,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1034496626, now seen corresponding path program 1 times [2025-03-14 22:02:58,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:02:58,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244267345] [2025-03-14 22:02:58,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:02:58,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:02:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:02:58,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:02:58,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:02:58,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244267345] [2025-03-14 22:02:58,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244267345] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:02:58,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534807567] [2025-03-14 22:02:58,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:02:58,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:02:58,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:02:58,445 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 22:02:58,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 22:02:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:02:58,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-14 22:02:58,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:02:58,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:02:58,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:02:58,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:02:58,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534807567] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 22:02:58,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 22:02:58,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 13] total 26 [2025-03-14 22:02:58,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102004771] [2025-03-14 22:02:58,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:02:58,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 22:02:58,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:02:58,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 22:02:58,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2025-03-14 22:02:58,981 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 348 [2025-03-14 22:02:58,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 812 places, 1426 transitions, 27655 flow. Second operand has 13 states, 13 states have (on average 224.3846153846154) internal successors, (2917), 13 states have internal predecessors, (2917), 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-14 22:02:58,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:02:58,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 348 [2025-03-14 22:02:58,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:03:03,554 INFO L124 PetriNetUnfolderBase]: 3539/25886 cut-off events. [2025-03-14 22:03:03,554 INFO L125 PetriNetUnfolderBase]: For 76618/156354 co-relation queries the response was YES. [2025-03-14 22:03:03,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86512 conditions, 25886 events. 3539/25886 cut-off events. For 76618/156354 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 358419 event pairs, 510 based on Foata normal form. 5/22615 useless extension candidates. Maximal degree in co-relation 20169. Up to 2446 conditions per place. [2025-03-14 22:03:03,965 INFO L140 encePairwiseOnDemand]: 311/348 looper letters, 804 selfloop transitions, 46 changer transitions 267/1387 dead transitions. [2025-03-14 22:03:03,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 833 places, 1387 transitions, 29049 flow [2025-03-14 22:03:03,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-14 22:03:03,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-14 22:03:03,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 5057 transitions. [2025-03-14 22:03:03,970 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6605276907001045 [2025-03-14 22:03:03,971 INFO L298 CegarLoopForPetriNet]: 335 programPoint places, 498 predicate places. [2025-03-14 22:03:03,971 INFO L471 AbstractCegarLoop]: Abstraction has has 833 places, 1387 transitions, 29049 flow [2025-03-14 22:03:03,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 224.3846153846154) internal successors, (2917), 13 states have internal predecessors, (2917), 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-14 22:03:03,971 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:03:03,972 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 22:03:03,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-14 22:03:04,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:03:04,172 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:03:04,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:03:04,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1995709835, now seen corresponding path program 1 times [2025-03-14 22:03:04,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:03:04,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575553273] [2025-03-14 22:03:04,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:03:04,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:03:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:03:04,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:03:04,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:03:04,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575553273] [2025-03-14 22:03:04,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575553273] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:03:04,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773451472] [2025-03-14 22:03:04,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:03:04,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:03:04,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:03:04,385 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 22:03:04,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-14 22:03:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:03:04,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-14 22:03:04,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:03:04,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:03:04,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:03:05,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:03:05,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773451472] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 22:03:05,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 22:03:05,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 13] total 26 [2025-03-14 22:03:05,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949491064] [2025-03-14 22:03:05,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:03:05,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 22:03:05,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:03:05,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 22:03:05,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2025-03-14 22:03:05,133 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 348 [2025-03-14 22:03:05,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 833 places, 1387 transitions, 29049 flow. Second operand has 13 states, 13 states have (on average 224.3846153846154) internal successors, (2917), 13 states have internal predecessors, (2917), 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-14 22:03:05,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:03:05,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 348 [2025-03-14 22:03:05,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:03:10,141 INFO L124 PetriNetUnfolderBase]: 3923/28626 cut-off events. [2025-03-14 22:03:10,142 INFO L125 PetriNetUnfolderBase]: For 95823/189171 co-relation queries the response was YES. [2025-03-14 22:03:10,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100789 conditions, 28626 events. 3923/28626 cut-off events. For 95823/189171 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 402217 event pairs, 678 based on Foata normal form. 1/25014 useless extension candidates. Maximal degree in co-relation 21191. Up to 4136 conditions per place. [2025-03-14 22:03:10,425 INFO L140 encePairwiseOnDemand]: 314/348 looper letters, 872 selfloop transitions, 46 changer transitions 276/1464 dead transitions. [2025-03-14 22:03:10,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 853 places, 1464 transitions, 33314 flow [2025-03-14 22:03:10,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-14 22:03:10,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-14 22:03:10,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4840 transitions. [2025-03-14 22:03:10,427 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.662287903667214 [2025-03-14 22:03:10,428 INFO L298 CegarLoopForPetriNet]: 335 programPoint places, 518 predicate places. [2025-03-14 22:03:10,428 INFO L471 AbstractCegarLoop]: Abstraction has has 853 places, 1464 transitions, 33314 flow [2025-03-14 22:03:10,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 224.3846153846154) internal successors, (2917), 13 states have internal predecessors, (2917), 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-14 22:03:10,429 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:03:10,429 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 22:03:10,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-14 22:03:10,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:03:10,629 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:03:10,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:03:10,630 INFO L85 PathProgramCache]: Analyzing trace with hash -351468887, now seen corresponding path program 1 times [2025-03-14 22:03:10,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:03:10,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081960665] [2025-03-14 22:03:10,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:03:10,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:03:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:03:10,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:03:10,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:03:10,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081960665] [2025-03-14 22:03:10,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081960665] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:03:10,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405044001] [2025-03-14 22:03:10,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:03:10,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:03:10,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:03:10,796 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 22:03:10,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-14 22:03:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:03:10,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-14 22:03:10,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:03:11,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:03:11,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:03:11,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:03:11,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405044001] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 22:03:11,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 22:03:11,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13, 11] total 23 [2025-03-14 22:03:11,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926456296] [2025-03-14 22:03:11,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:03:11,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 22:03:11,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:03:11,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 22:03:11,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2025-03-14 22:03:11,315 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 348 [2025-03-14 22:03:11,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 853 places, 1464 transitions, 33314 flow. Second operand has 11 states, 11 states have (on average 267.27272727272725) internal successors, (2940), 11 states have internal predecessors, (2940), 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-14 22:03:11,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:03:11,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 348 [2025-03-14 22:03:11,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:03:20,070 INFO L124 PetriNetUnfolderBase]: 8065/50458 cut-off events. [2025-03-14 22:03:20,070 INFO L125 PetriNetUnfolderBase]: For 221620/395804 co-relation queries the response was YES. [2025-03-14 22:03:20,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178835 conditions, 50458 events. 8065/50458 cut-off events. For 221620/395804 co-relation queries the response was YES. Maximal size of possible extension queue 1204. Compared 781004 event pairs, 1979 based on Foata normal form. 10/44290 useless extension candidates. Maximal degree in co-relation 35013. Up to 6673 conditions per place. [2025-03-14 22:03:20,724 INFO L140 encePairwiseOnDemand]: 326/348 looper letters, 713 selfloop transitions, 66 changer transitions 275/1691 dead transitions. [2025-03-14 22:03:20,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 868 places, 1691 transitions, 40601 flow [2025-03-14 22:03:20,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 22:03:20,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 22:03:20,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4397 transitions. [2025-03-14 22:03:20,726 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.789691091954023 [2025-03-14 22:03:20,726 INFO L298 CegarLoopForPetriNet]: 335 programPoint places, 533 predicate places. [2025-03-14 22:03:20,726 INFO L471 AbstractCegarLoop]: Abstraction has has 868 places, 1691 transitions, 40601 flow [2025-03-14 22:03:20,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 267.27272727272725) internal successors, (2940), 11 states have internal predecessors, (2940), 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-14 22:03:20,727 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:03:20,727 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 22:03:20,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-14 22:03:20,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-14 22:03:20,931 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:03:20,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:03:20,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1904582455, now seen corresponding path program 1 times [2025-03-14 22:03:20,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:03:20,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980065738] [2025-03-14 22:03:20,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:03:20,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:03:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:03:21,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:03:21,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:03:21,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980065738] [2025-03-14 22:03:21,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980065738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:03:21,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604365752] [2025-03-14 22:03:21,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:03:21,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:03:21,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:03:21,484 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 22:03:21,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-14 22:03:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:03:21,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-14 22:03:21,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:03:21,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:03:21,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:03:22,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:03:22,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604365752] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 22:03:22,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 22:03:22,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [20, 18] total 37 [2025-03-14 22:03:22,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124795484] [2025-03-14 22:03:22,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:03:22,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-14 22:03:22,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:03:22,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-14 22:03:22,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1146, Unknown=0, NotChecked=0, Total=1332 [2025-03-14 22:03:22,611 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 348 [2025-03-14 22:03:22,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 868 places, 1691 transitions, 40601 flow. Second operand has 18 states, 18 states have (on average 218.77777777777777) internal successors, (3938), 18 states have internal predecessors, (3938), 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-14 22:03:22,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:03:22,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 348 [2025-03-14 22:03:22,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:03:33,493 INFO L124 PetriNetUnfolderBase]: 9223/58843 cut-off events. [2025-03-14 22:03:33,493 INFO L125 PetriNetUnfolderBase]: For 286798/504850 co-relation queries the response was YES. [2025-03-14 22:03:34,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215252 conditions, 58843 events. 9223/58843 cut-off events. For 286798/504850 co-relation queries the response was YES. Maximal size of possible extension queue 1310. Compared 930077 event pairs, 2460 based on Foata normal form. 8/51757 useless extension candidates. Maximal degree in co-relation 36766. Up to 7741 conditions per place. [2025-03-14 22:03:34,396 INFO L140 encePairwiseOnDemand]: 306/348 looper letters, 1201 selfloop transitions, 65 changer transitions 293/1805 dead transitions. [2025-03-14 22:03:34,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 900 places, 1805 transitions, 46866 flow [2025-03-14 22:03:34,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-14 22:03:34,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-14 22:03:34,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 7387 transitions. [2025-03-14 22:03:34,399 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6432427725531173 [2025-03-14 22:03:34,399 INFO L298 CegarLoopForPetriNet]: 335 programPoint places, 565 predicate places. [2025-03-14 22:03:34,399 INFO L471 AbstractCegarLoop]: Abstraction has has 900 places, 1805 transitions, 46866 flow [2025-03-14 22:03:34,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 218.77777777777777) internal successors, (3938), 18 states have internal predecessors, (3938), 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-14 22:03:34,400 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:03:34,400 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 22:03:34,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-14 22:03:34,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:03:34,600 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:03:34,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:03:34,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1797012723, now seen corresponding path program 2 times [2025-03-14 22:03:34,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:03:34,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554640100] [2025-03-14 22:03:34,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:03:34,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:03:34,624 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:03:34,628 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:03:35,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 22:03:35,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:03:35,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554640100] [2025-03-14 22:03:35,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554640100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:03:35,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:03:35,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-14 22:03:35,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198544709] [2025-03-14 22:03:35,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:03:35,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 22:03:35,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:03:35,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 22:03:35,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2025-03-14 22:03:35,047 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 348 [2025-03-14 22:03:35,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 900 places, 1805 transitions, 46866 flow. Second operand has 19 states, 19 states have (on average 216.52631578947367) internal successors, (4114), 19 states have internal predecessors, (4114), 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-14 22:03:35,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:03:35,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 348 [2025-03-14 22:03:35,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:03:48,058 INFO L124 PetriNetUnfolderBase]: 10852/67838 cut-off events. [2025-03-14 22:03:48,058 INFO L125 PetriNetUnfolderBase]: For 406965/701346 co-relation queries the response was YES. [2025-03-14 22:03:48,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264199 conditions, 67838 events. 10852/67838 cut-off events. For 406965/701346 co-relation queries the response was YES. Maximal size of possible extension queue 1548. Compared 1094234 event pairs, 2620 based on Foata normal form. 254/59813 useless extension candidates. Maximal degree in co-relation 43286. Up to 7704 conditions per place. [2025-03-14 22:03:49,337 INFO L140 encePairwiseOnDemand]: 312/348 looper letters, 1393 selfloop transitions, 125 changer transitions 347/2083 dead transitions. [2025-03-14 22:03:49,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 929 places, 2083 transitions, 58686 flow [2025-03-14 22:03:49,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-14 22:03:49,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-14 22:03:49,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 6570 transitions. [2025-03-14 22:03:49,340 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6293103448275862 [2025-03-14 22:03:49,340 INFO L298 CegarLoopForPetriNet]: 335 programPoint places, 594 predicate places. [2025-03-14 22:03:49,341 INFO L471 AbstractCegarLoop]: Abstraction has has 929 places, 2083 transitions, 58686 flow [2025-03-14 22:03:49,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 216.52631578947367) internal successors, (4114), 19 states have internal predecessors, (4114), 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-14 22:03:49,341 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:03:49,341 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 22:03:49,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 22:03:49,341 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:03:49,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:03:49,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1357236907, now seen corresponding path program 3 times [2025-03-14 22:03:49,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:03:49,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588237993] [2025-03-14 22:03:49,342 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:03:49,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:03:49,357 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 22:03:49,357 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:03:49,672 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-14 22:03:49,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:03:49,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588237993] [2025-03-14 22:03:49,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588237993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:03:49,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:03:49,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-14 22:03:49,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669581451] [2025-03-14 22:03:49,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:03:49,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-14 22:03:49,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:03:49,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-14 22:03:49,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2025-03-14 22:03:49,674 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 348 [2025-03-14 22:03:49,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 929 places, 2083 transitions, 58686 flow. Second operand has 17 states, 17 states have (on average 210.47058823529412) internal successors, (3578), 17 states have internal predecessors, (3578), 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-14 22:03:49,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:03:49,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 348 [2025-03-14 22:03:49,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:04:15,192 INFO L124 PetriNetUnfolderBase]: 21239/110229 cut-off events. [2025-03-14 22:04:15,193 INFO L125 PetriNetUnfolderBase]: For 1042259/2346879 co-relation queries the response was YES. [2025-03-14 22:04:16,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516844 conditions, 110229 events. 21239/110229 cut-off events. For 1042259/2346879 co-relation queries the response was YES. Maximal size of possible extension queue 2634. Compared 1857873 event pairs, 2541 based on Foata normal form. 317/94542 useless extension candidates. Maximal degree in co-relation 103512. Up to 14861 conditions per place. [2025-03-14 22:04:17,730 INFO L140 encePairwiseOnDemand]: 315/348 looper letters, 2750 selfloop transitions, 200 changer transitions 685/3832 dead transitions. [2025-03-14 22:04:17,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 957 places, 3832 transitions, 116513 flow [2025-03-14 22:04:17,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-14 22:04:17,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-14 22:04:17,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 6278 transitions. [2025-03-14 22:04:17,733 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6220768925881887 [2025-03-14 22:04:17,734 INFO L298 CegarLoopForPetriNet]: 335 programPoint places, 622 predicate places. [2025-03-14 22:04:17,734 INFO L471 AbstractCegarLoop]: Abstraction has has 957 places, 3832 transitions, 116513 flow [2025-03-14 22:04:17,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 210.47058823529412) internal successors, (3578), 17 states have internal predecessors, (3578), 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-14 22:04:17,734 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:04:17,734 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 22:04:17,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 22:04:17,734 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:04:17,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:04:17,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1916934263, now seen corresponding path program 4 times [2025-03-14 22:04:17,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:04:17,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758419239] [2025-03-14 22:04:17,735 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:04:17,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:04:17,747 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:04:17,747 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:04:18,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:04:18,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:04:18,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758419239] [2025-03-14 22:04:18,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758419239] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:04:18,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303094955] [2025-03-14 22:04:18,072 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:04:18,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:04:18,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:04:18,074 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 22:04:18,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-14 22:04:18,147 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:04:18,148 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:04:18,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-14 22:04:18,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:04:18,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:04:18,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:04:19,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:04:19,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303094955] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 22:04:19,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 22:04:19,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [23, 18] total 45 [2025-03-14 22:04:19,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378123507] [2025-03-14 22:04:19,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:04:19,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-14 22:04:19,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:04:19,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-14 22:04:19,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1694, Unknown=0, NotChecked=0, Total=1980 [2025-03-14 22:04:19,293 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 348 [2025-03-14 22:04:19,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 957 places, 3832 transitions, 116513 flow. Second operand has 18 states, 18 states have (on average 218.77777777777777) internal successors, (3938), 18 states have internal predecessors, (3938), 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-14 22:04:19,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:04:19,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 348 [2025-03-14 22:04:19,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:04:48,397 INFO L124 PetriNetUnfolderBase]: 21133/108655 cut-off events. [2025-03-14 22:04:48,397 INFO L125 PetriNetUnfolderBase]: For 1195503/2680129 co-relation queries the response was YES. [2025-03-14 22:04:49,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 541185 conditions, 108655 events. 21133/108655 cut-off events. For 1195503/2680129 co-relation queries the response was YES. Maximal size of possible extension queue 2633. Compared 1827166 event pairs, 2401 based on Foata normal form. 169/92971 useless extension candidates. Maximal degree in co-relation 108781. Up to 14861 conditions per place. [2025-03-14 22:04:50,912 INFO L140 encePairwiseOnDemand]: 306/348 looper letters, 2640 selfloop transitions, 133 changer transitions 749/3949 dead transitions. [2025-03-14 22:04:50,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 989 places, 3949 transitions, 127427 flow [2025-03-14 22:04:50,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-14 22:04:50,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-14 22:04:50,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 7386 transitions. [2025-03-14 22:04:50,915 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6431556948798328 [2025-03-14 22:04:50,915 INFO L298 CegarLoopForPetriNet]: 335 programPoint places, 654 predicate places. [2025-03-14 22:04:50,915 INFO L471 AbstractCegarLoop]: Abstraction has has 989 places, 3949 transitions, 127427 flow [2025-03-14 22:04:50,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 218.77777777777777) internal successors, (3938), 18 states have internal predecessors, (3938), 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-14 22:04:50,916 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:04:50,916 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 22:04:50,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-14 22:04:51,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:04:51,117 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:04:51,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:04:51,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1418230264, now seen corresponding path program 1 times [2025-03-14 22:04:51,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:04:51,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838298694] [2025-03-14 22:04:51,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:04:51,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:04:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:04:51,184 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-14 22:04:51,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:04:51,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838298694] [2025-03-14 22:04:51,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838298694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:04:51,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:04:51,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 22:04:51,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755270678] [2025-03-14 22:04:51,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:04:51,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 22:04:51,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:04:51,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 22:04:51,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-14 22:04:51,186 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 348 [2025-03-14 22:04:51,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 989 places, 3949 transitions, 127427 flow. Second operand has 7 states, 7 states have (on average 274.14285714285717) internal successors, (1919), 7 states have internal predecessors, (1919), 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-14 22:04:51,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:04:51,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 348 [2025-03-14 22:04:51,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:05:01,472 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([794] L50-1-->L51: Formula: (and (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n1~0_2) (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n2~0_2)) InVars {~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} OutVars{~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} AuxVars[] AssignedVars[][1401], [338#true, 8325#(<= 1 ~n1~0), 91#L66-1true, 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 2196#true, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 8262#(<= ~n3~0 0), 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 695#true, 929#true, 97#L51true, 2452#true, 9565#true, 586#true, 475#true, 294#L78-1true, 812#true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:01,472 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2025-03-14 22:05:01,472 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2025-03-14 22:05:01,472 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2025-03-14 22:05:01,472 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2025-03-14 22:05:01,472 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([793] L50-1-->L50-2: Formula: (or (<= v_~n2~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|) (<= v_~n1~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|)) InVars {~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} OutVars{~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[][1402], [338#true, 8325#(<= 1 ~n1~0), 91#L66-1true, 3599#true, thread2Thread1of1ForFork0InUse, 95#L50-2true, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 2196#true, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 8262#(<= ~n3~0 0), 6954#(<= 1 ~n1~0), 2322#true, 48#L102-4true, 5815#(<= 1 ~n1~0), 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 294#L78-1true, 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:01,472 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2025-03-14 22:05:01,472 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2025-03-14 22:05:01,472 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2025-03-14 22:05:01,472 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2025-03-14 22:05:01,473 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([794] L50-1-->L51: Formula: (and (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n1~0_2) (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n2~0_2)) InVars {~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} OutVars{~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} AuxVars[] AssignedVars[][1401], [338#true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 1056#true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 2196#true, 8262#(<= ~n3~0 0), 6954#(<= 1 ~n1~0), 2322#true, 48#L102-4true, 695#true, 929#true, 97#L51true, 173#L69-1true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 294#L78-1true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:01,473 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2025-03-14 22:05:01,473 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2025-03-14 22:05:01,473 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2025-03-14 22:05:01,473 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2025-03-14 22:05:01,474 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([793] L50-1-->L50-2: Formula: (or (<= v_~n2~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|) (<= v_~n1~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|)) InVars {~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} OutVars{~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[][1402], [338#true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 95#L50-2true, 1056#true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 2196#true, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 8262#(<= ~n3~0 0), 6954#(<= 1 ~n1~0), 2322#true, 48#L102-4true, 5815#(<= 1 ~n1~0), 695#true, 929#true, 173#L69-1true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 294#L78-1true, 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:01,474 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2025-03-14 22:05:01,474 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2025-03-14 22:05:01,474 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2025-03-14 22:05:01,474 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2025-03-14 22:05:02,326 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([794] L50-1-->L51: Formula: (and (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n1~0_2) (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n2~0_2)) InVars {~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} OutVars{~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} AuxVars[] AssignedVars[][1401], [338#true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 2196#true, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 8262#(<= ~n3~0 0), 6954#(<= 1 ~n1~0), 2322#true, 48#L102-4true, 695#true, 929#true, 97#L51true, 2452#true, 219#L66-2true, 9565#true, 586#true, 475#true, 294#L78-1true, 812#true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:02,326 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,326 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,326 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,326 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,328 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([793] L50-1-->L50-2: Formula: (or (<= v_~n2~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|) (<= v_~n1~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|)) InVars {~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} OutVars{~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[][1402], [338#true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 95#L50-2true, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 2196#true, 8262#(<= ~n3~0 0), 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 5815#(<= 1 ~n1~0), 695#true, 929#true, 2452#true, 219#L66-2true, 9565#true, 586#true, 475#true, 294#L78-1true, 812#true, 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:02,328 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,328 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,328 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,328 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,330 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([794] L50-1-->L51: Formula: (and (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n1~0_2) (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n2~0_2)) InVars {~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} OutVars{~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} AuxVars[] AssignedVars[][1401], [338#true, 161#L69-2true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 1056#true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 2196#true, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 8262#(<= ~n3~0 0), 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 695#true, 929#true, 97#L51true, 2452#true, 9565#true, 586#true, 475#true, 294#L78-1true, 812#true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:02,331 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,331 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,331 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,331 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,332 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([793] L50-1-->L50-2: Formula: (or (<= v_~n2~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|) (<= v_~n1~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|)) InVars {~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} OutVars{~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[][1402], [338#true, 161#L69-2true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 95#L50-2true, 1056#true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 2196#true, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 8262#(<= ~n3~0 0), 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 5815#(<= 1 ~n1~0), 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 294#L78-1true, 812#true, 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:02,332 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,332 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,332 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,332 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,342 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([794] L50-1-->L51: Formula: (and (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n1~0_2) (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n2~0_2)) InVars {~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} OutVars{~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} AuxVars[] AssignedVars[][1401], [338#true, 8325#(<= 1 ~n1~0), 91#L66-1true, 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 2196#true, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 8262#(<= ~n3~0 0), 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 202#L79true, 695#true, 929#true, 97#L51true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:02,342 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,342 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,342 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,342 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,342 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([793] L50-1-->L50-2: Formula: (or (<= v_~n2~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|) (<= v_~n1~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|)) InVars {~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} OutVars{~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[][1402], [338#true, 8325#(<= 1 ~n1~0), 91#L66-1true, 3599#true, thread2Thread1of1ForFork0InUse, 95#L50-2true, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 2196#true, 8262#(<= ~n3~0 0), 6954#(<= 1 ~n1~0), 2322#true, 48#L102-4true, 5815#(<= 1 ~n1~0), 202#L79true, 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:02,342 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,342 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,342 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,342 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,343 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([794] L50-1-->L51: Formula: (and (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n1~0_2) (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n2~0_2)) InVars {~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} OutVars{~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} AuxVars[] AssignedVars[][1401], [338#true, 8325#(<= 1 ~n1~0), 91#L66-1true, 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 2196#true, 8262#(<= ~n3~0 0), 6954#(<= 1 ~n1~0), 2322#true, 48#L102-4true, 204#L78-2true, 695#true, 929#true, 97#L51true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:02,343 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,343 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,343 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,343 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,343 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([793] L50-1-->L50-2: Formula: (or (<= v_~n2~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|) (<= v_~n1~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|)) InVars {~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} OutVars{~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[][1402], [338#true, 8325#(<= 1 ~n1~0), 91#L66-1true, 3599#true, thread2Thread1of1ForFork0InUse, 95#L50-2true, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 2196#true, 8262#(<= ~n3~0 0), 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 5815#(<= 1 ~n1~0), 204#L78-2true, 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:02,343 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,343 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,343 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,343 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,344 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([794] L50-1-->L51: Formula: (and (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n1~0_2) (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n2~0_2)) InVars {~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} OutVars{~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} AuxVars[] AssignedVars[][1401], [338#true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 2196#true, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 8262#(<= ~n3~0 0), 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 202#L79true, 695#true, 929#true, 173#L69-1true, 97#L51true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:02,344 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,344 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,344 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,344 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,344 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([793] L50-1-->L50-2: Formula: (or (<= v_~n2~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|) (<= v_~n1~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|)) InVars {~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} OutVars{~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[][1402], [338#true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 95#L50-2true, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 2196#true, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 8262#(<= ~n3~0 0), 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 5815#(<= 1 ~n1~0), 202#L79true, 695#true, 929#true, 173#L69-1true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:02,344 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,344 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,344 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,344 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,345 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([794] L50-1-->L51: Formula: (and (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n1~0_2) (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n2~0_2)) InVars {~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} OutVars{~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} AuxVars[] AssignedVars[][1401], [338#true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 2196#true, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 8262#(<= ~n3~0 0), 6954#(<= 1 ~n1~0), 2322#true, 48#L102-4true, 204#L78-2true, 695#true, 929#true, 173#L69-1true, 97#L51true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:02,345 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,345 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,345 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,345 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,345 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([793] L50-1-->L50-2: Formula: (or (<= v_~n2~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|) (<= v_~n1~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|)) InVars {~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} OutVars{~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[][1402], [338#true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 95#L50-2true, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 2196#true, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 8262#(<= ~n3~0 0), 6954#(<= 1 ~n1~0), 2322#true, 48#L102-4true, 204#L78-2true, 5815#(<= 1 ~n1~0), 695#true, 929#true, 173#L69-1true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:02,345 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,345 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,345 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,345 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,356 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([794] L50-1-->L51: Formula: (and (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n1~0_2) (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n2~0_2)) InVars {~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} OutVars{~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} AuxVars[] AssignedVars[][1401], [338#true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 2196#true, 8262#(<= ~n3~0 0), 6954#(<= 1 ~n1~0), 2322#true, 48#L102-4true, 695#true, 929#true, 97#L51true, 219#L66-2true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 294#L78-1true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:02,356 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,356 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,356 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,356 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,356 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,356 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([793] L50-1-->L50-2: Formula: (or (<= v_~n2~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|) (<= v_~n1~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|)) InVars {~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} OutVars{~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[][1402], [338#true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 95#L50-2true, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 2196#true, 8262#(<= ~n3~0 0), 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 5815#(<= 1 ~n1~0), 695#true, 929#true, 219#L66-2true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 294#L78-1true, 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:02,356 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,356 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,356 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,356 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,356 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,357 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([794] L50-1-->L51: Formula: (and (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n1~0_2) (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n2~0_2)) InVars {~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} OutVars{~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} AuxVars[] AssignedVars[][1401], [338#true, 161#L69-2true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 2196#true, 8262#(<= ~n3~0 0), 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 695#true, 929#true, 97#L51true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 294#L78-1true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:02,357 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,357 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,357 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,357 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,357 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,357 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([793] L50-1-->L50-2: Formula: (or (<= v_~n2~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|) (<= v_~n1~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|)) InVars {~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} OutVars{~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[][1402], [338#true, 161#L69-2true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 95#L50-2true, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 2196#true, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 8262#(<= ~n3~0 0), 6954#(<= 1 ~n1~0), 2322#true, 48#L102-4true, 5815#(<= 1 ~n1~0), 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 294#L78-1true, 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:02,357 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,357 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,357 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,357 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,357 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-14 22:05:02,979 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([794] L50-1-->L51: Formula: (and (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n1~0_2) (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n2~0_2)) InVars {~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} OutVars{~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} AuxVars[] AssignedVars[][1401], [338#true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 1056#true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 2196#true, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 8262#(<= ~n3~0 0), 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 202#L79true, 695#true, 929#true, 97#L51true, 2452#true, 219#L66-2true, 9565#true, 586#true, 475#true, 812#true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:02,979 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-03-14 22:05:02,979 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:02,979 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:02,979 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:02,981 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([794] L50-1-->L51: Formula: (and (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n1~0_2) (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n2~0_2)) InVars {~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} OutVars{~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} AuxVars[] AssignedVars[][1401], [338#true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 2196#true, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 8262#(<= ~n3~0 0), 6954#(<= 1 ~n1~0), 2322#true, 48#L102-4true, 204#L78-2true, 695#true, 929#true, 97#L51true, 219#L66-2true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:02,981 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-03-14 22:05:02,981 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:02,981 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:02,981 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:02,982 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([793] L50-1-->L50-2: Formula: (or (<= v_~n2~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|) (<= v_~n1~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|)) InVars {~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} OutVars{~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[][1402], [338#true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 95#L50-2true, 1056#true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 2196#true, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 8262#(<= ~n3~0 0), 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 5815#(<= 1 ~n1~0), 202#L79true, 695#true, 929#true, 219#L66-2true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:02,982 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-03-14 22:05:02,982 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:02,982 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:02,982 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:02,984 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([793] L50-1-->L50-2: Formula: (or (<= v_~n2~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|) (<= v_~n1~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|)) InVars {~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} OutVars{~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[][1402], [338#true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 95#L50-2true, 1056#true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 2196#true, 8262#(<= ~n3~0 0), 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 5815#(<= 1 ~n1~0), 204#L78-2true, 695#true, 929#true, 2452#true, 219#L66-2true, 9565#true, 586#true, 475#true, 812#true, 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:02,984 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-03-14 22:05:02,984 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:02,984 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:02,984 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:02,990 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([794] L50-1-->L51: Formula: (and (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n1~0_2) (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n2~0_2)) InVars {~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} OutVars{~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} AuxVars[] AssignedVars[][1401], [338#true, 161#L69-2true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 1056#true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 2196#true, 8262#(<= ~n3~0 0), 6954#(<= 1 ~n1~0), 2322#true, 48#L102-4true, 202#L79true, 695#true, 929#true, 97#L51true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:02,990 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-03-14 22:05:02,990 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:02,990 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:02,990 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:02,991 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([794] L50-1-->L51: Formula: (and (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n1~0_2) (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n2~0_2)) InVars {~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} OutVars{~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} AuxVars[] AssignedVars[][1401], [338#true, 161#L69-2true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 1056#true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 2196#true, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 8262#(<= ~n3~0 0), 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 204#L78-2true, 695#true, 929#true, 97#L51true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:02,991 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-03-14 22:05:02,991 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:02,991 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:02,991 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:02,992 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([793] L50-1-->L50-2: Formula: (or (<= v_~n2~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|) (<= v_~n1~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|)) InVars {~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} OutVars{~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[][1402], [338#true, 161#L69-2true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 95#L50-2true, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 2196#true, 8262#(<= ~n3~0 0), 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 5815#(<= 1 ~n1~0), 202#L79true, 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:02,992 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-03-14 22:05:02,992 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:02,992 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:02,992 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:02,994 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([793] L50-1-->L50-2: Formula: (or (<= v_~n2~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|) (<= v_~n1~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|)) InVars {~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} OutVars{~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[][1402], [338#true, 161#L69-2true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 95#L50-2true, 1056#true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 2196#true, 8262#(<= ~n3~0 0), 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 5815#(<= 1 ~n1~0), 204#L78-2true, 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:02,994 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-03-14 22:05:02,994 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:02,994 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:02,994 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,025 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([794] L50-1-->L51: Formula: (and (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n1~0_2) (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n2~0_2)) InVars {~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} OutVars{~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} AuxVars[] AssignedVars[][1401], [338#true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 2196#true, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 8262#(<= ~n3~0 0), 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 202#L79true, 695#true, 929#true, 97#L51true, 219#L66-2true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:03,025 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,025 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,025 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,025 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,026 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,026 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([793] L50-1-->L50-2: Formula: (or (<= v_~n2~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|) (<= v_~n1~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|)) InVars {~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} OutVars{~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[][1402], [338#true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 95#L50-2true, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 2196#true, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 8262#(<= ~n3~0 0), 6954#(<= 1 ~n1~0), 2322#true, 48#L102-4true, 202#L79true, 5815#(<= 1 ~n1~0), 695#true, 929#true, 219#L66-2true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:03,026 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,026 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,026 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,026 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,026 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,026 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([794] L50-1-->L51: Formula: (and (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n1~0_2) (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n2~0_2)) InVars {~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} OutVars{~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} AuxVars[] AssignedVars[][1401], [338#true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 2196#true, 8262#(<= ~n3~0 0), 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 204#L78-2true, 695#true, 929#true, 97#L51true, 219#L66-2true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:03,026 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,026 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,026 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,026 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,026 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,026 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([793] L50-1-->L50-2: Formula: (or (<= v_~n2~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|) (<= v_~n1~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|)) InVars {~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} OutVars{~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[][1402], [338#true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 95#L50-2true, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 2196#true, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 8262#(<= ~n3~0 0), 6954#(<= 1 ~n1~0), 2322#true, 48#L102-4true, 204#L78-2true, 5815#(<= 1 ~n1~0), 695#true, 929#true, 219#L66-2true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:03,026 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,026 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,027 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,027 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,027 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,027 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([794] L50-1-->L51: Formula: (and (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n1~0_2) (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n2~0_2)) InVars {~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} OutVars{~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} AuxVars[] AssignedVars[][1401], [338#true, 161#L69-2true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 1056#true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 2196#true, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 8262#(<= ~n3~0 0), 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 202#L79true, 695#true, 929#true, 97#L51true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:03,027 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,027 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,027 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,027 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,027 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,027 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([793] L50-1-->L50-2: Formula: (or (<= v_~n2~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|) (<= v_~n1~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|)) InVars {~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} OutVars{~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[][1402], [338#true, 161#L69-2true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 95#L50-2true, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 2196#true, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 8262#(<= ~n3~0 0), 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 5815#(<= 1 ~n1~0), 202#L79true, 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:03,027 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,027 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,027 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,027 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,027 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,028 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([794] L50-1-->L51: Formula: (and (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n1~0_2) (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n2~0_2)) InVars {~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} OutVars{~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} AuxVars[] AssignedVars[][1401], [338#true, 161#L69-2true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 2196#true, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 8262#(<= ~n3~0 0), 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 204#L78-2true, 695#true, 929#true, 97#L51true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:03,028 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,028 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,028 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,028 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,028 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,028 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([793] L50-1-->L50-2: Formula: (or (<= v_~n2~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|) (<= v_~n1~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|)) InVars {~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} OutVars{~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[][1402], [338#true, 161#L69-2true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 95#L50-2true, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 2196#true, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 8262#(<= ~n3~0 0), 6954#(<= 1 ~n1~0), 2322#true, 48#L102-4true, 204#L78-2true, 5815#(<= 1 ~n1~0), 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:03,028 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,028 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,028 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,028 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:03,028 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:11,076 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([886] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork0_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][2465], [338#true, 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, 214#L51-2true, thread1Thread1of1ForFork2InUse, 2196#true, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 6954#(<= 1 ~n1~0), 2322#true, 48#L102-4true, 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 294#L78-1true, 176#L66-9true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:11,077 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is cut-off event [2025-03-14 22:05:11,077 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-03-14 22:05:11,077 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-03-14 22:05:11,077 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-03-14 22:05:12,929 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([886] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork0_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][2465], [338#true, 8325#(<= 1 ~n1~0), 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, 214#L51-2true, thread1Thread1of1ForFork2InUse, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 2196#true, 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 202#L79true, 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 176#L66-9true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:12,929 INFO L294 olderBase$Statistics]: this new event has 184 ancestors and is cut-off event [2025-03-14 22:05:12,929 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2025-03-14 22:05:12,929 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2025-03-14 22:05:12,929 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2025-03-14 22:05:12,930 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([886] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork0_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][2465], [338#true, 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, 214#L51-2true, thread1Thread1of1ForFork2InUse, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 2196#true, 6954#(<= 1 ~n1~0), 2322#true, 48#L102-4true, 204#L78-2true, 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 176#L66-9true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:12,930 INFO L294 olderBase$Statistics]: this new event has 184 ancestors and is cut-off event [2025-03-14 22:05:12,930 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2025-03-14 22:05:12,930 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2025-03-14 22:05:12,930 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2025-03-14 22:05:13,277 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([886] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork0_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][2465], [338#true, 8325#(<= 1 ~n1~0), 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 290#L52-1true, 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 2196#true, 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 294#L78-1true, 176#L66-9true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:13,278 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2025-03-14 22:05:13,278 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-03-14 22:05:13,278 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-03-14 22:05:13,278 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-03-14 22:05:13,299 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([886] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork0_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][2466], [338#true, 8325#(<= 1 ~n1~0), 300#L55-2true, 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 2196#true, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 8262#(<= ~n3~0 0), 6954#(<= 1 ~n1~0), 2322#true, 48#L102-4true, 204#L78-2true, 5815#(<= 1 ~n1~0), 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 176#L66-9true, 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:13,299 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is cut-off event [2025-03-14 22:05:13,299 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-03-14 22:05:13,299 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-03-14 22:05:13,299 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-03-14 22:05:13,299 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([886] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork0_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][2466], [338#true, 8325#(<= 1 ~n1~0), 300#L55-2true, 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 2196#true, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 8262#(<= ~n3~0 0), 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 5815#(<= 1 ~n1~0), 202#L79true, 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 176#L66-9true, 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:13,299 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is cut-off event [2025-03-14 22:05:13,299 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-03-14 22:05:13,299 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-03-14 22:05:13,299 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-03-14 22:05:13,299 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([886] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork0_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][2466], [338#true, 8325#(<= 1 ~n1~0), 300#L55-2true, 3599#true, thread2Thread1of1ForFork0InUse, 1056#true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 2196#true, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 8262#(<= ~n3~0 0), 6954#(<= 1 ~n1~0), 2322#true, 48#L102-4true, 5815#(<= 1 ~n1~0), 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 294#L78-1true, 176#L66-9true, 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:13,299 INFO L294 olderBase$Statistics]: this new event has 188 ancestors and is cut-off event [2025-03-14 22:05:13,299 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-14 22:05:13,299 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-14 22:05:13,299 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-14 22:05:13,300 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([886] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork0_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][2465], [338#true, 8325#(<= 1 ~n1~0), 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 2196#true, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 6954#(<= 1 ~n1~0), 2322#true, 48#L102-4true, 695#true, 929#true, 29#L55-1true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 294#L78-1true, 176#L66-9true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:13,300 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2025-03-14 22:05:13,300 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-03-14 22:05:13,300 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-03-14 22:05:13,300 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-03-14 22:05:13,688 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([886] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork0_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][2465], [338#true, 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 2196#true, 6954#(<= 1 ~n1~0), 2322#true, 165#L52-2true, 48#L102-4true, 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 294#L78-1true, 812#true, 176#L66-9true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:13,688 INFO L294 olderBase$Statistics]: this new event has 188 ancestors and is cut-off event [2025-03-14 22:05:13,688 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-14 22:05:13,688 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-14 22:05:13,688 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-14 22:05:13,710 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([886] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork0_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][2466], [338#true, 8325#(<= 1 ~n1~0), 300#L55-2true, 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 2196#true, 8262#(<= ~n3~0 0), 6954#(<= 1 ~n1~0), 2322#true, 48#L102-4true, 5815#(<= 1 ~n1~0), 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 294#L78-1true, 176#L66-9true, 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:13,710 INFO L294 olderBase$Statistics]: this new event has 188 ancestors and is cut-off event [2025-03-14 22:05:13,710 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-14 22:05:13,710 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-14 22:05:13,710 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-14 22:05:13,710 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-14 22:05:14,698 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([886] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork0_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][2465], [338#true, 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 8325#(<= 1 ~n1~0), 290#L52-1true, 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 2196#true, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 202#L79true, 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 176#L66-9true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:14,698 INFO L294 olderBase$Statistics]: this new event has 188 ancestors and is cut-off event [2025-03-14 22:05:14,698 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-14 22:05:14,698 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-14 22:05:14,698 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-14 22:05:14,698 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([886] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork0_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][2465], [338#true, 8325#(<= 1 ~n1~0), 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 3599#true, 290#L52-1true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 2196#true, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 6954#(<= 1 ~n1~0), 2322#true, 48#L102-4true, 204#L78-2true, 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 176#L66-9true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:14,698 INFO L294 olderBase$Statistics]: this new event has 188 ancestors and is cut-off event [2025-03-14 22:05:14,698 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-14 22:05:14,698 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-14 22:05:14,698 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-14 22:05:14,727 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([886] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork0_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][2465], [338#true, 8325#(<= 1 ~n1~0), 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 2196#true, 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 202#L79true, 695#true, 929#true, 29#L55-1true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 176#L66-9true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:14,727 INFO L294 olderBase$Statistics]: this new event has 188 ancestors and is cut-off event [2025-03-14 22:05:14,727 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-14 22:05:14,727 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-14 22:05:14,727 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-14 22:05:14,727 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([886] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork0_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][2465], [338#true, 8325#(<= 1 ~n1~0), 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 2196#true, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 6954#(<= 1 ~n1~0), 2322#true, 48#L102-4true, 204#L78-2true, 695#true, 929#true, 29#L55-1true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 176#L66-9true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:14,727 INFO L294 olderBase$Statistics]: this new event has 188 ancestors and is cut-off event [2025-03-14 22:05:14,727 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-14 22:05:14,727 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-14 22:05:14,727 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-14 22:05:15,133 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([886] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork0_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][2465], [338#true, 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 2196#true, 2322#true, 6954#(<= 1 ~n1~0), 165#L52-2true, 48#L102-4true, 202#L79true, 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 176#L66-9true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:15,133 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is cut-off event [2025-03-14 22:05:15,133 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-03-14 22:05:15,133 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-03-14 22:05:15,133 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-03-14 22:05:15,134 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([886] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork0_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][2465], [338#true, 8325#(<= 1 ~n1~0), 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 2196#true, 6954#(<= 1 ~n1~0), 2322#true, 165#L52-2true, 48#L102-4true, 204#L78-2true, 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 176#L66-9true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:15,134 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is cut-off event [2025-03-14 22:05:15,134 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-03-14 22:05:15,134 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-03-14 22:05:15,134 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-03-14 22:05:15,164 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([886] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork0_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][2466], [338#true, 8325#(<= 1 ~n1~0), 300#L55-2true, 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 2196#true, 8262#(<= ~n3~0 0), 6954#(<= 1 ~n1~0), 2322#true, 48#L102-4true, 202#L79true, 5815#(<= 1 ~n1~0), 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 176#L66-9true, 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:15,164 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is cut-off event [2025-03-14 22:05:15,164 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-03-14 22:05:15,164 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-03-14 22:05:15,164 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-03-14 22:05:15,164 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-03-14 22:05:15,164 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([886] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork0_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][2466], [338#true, 8325#(<= 1 ~n1~0), 300#L55-2true, 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 8236#(and (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (<= 0 ~res3~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 2196#true, 8262#(<= ~n3~0 0), 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 5815#(<= 1 ~n1~0), 204#L78-2true, 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 176#L66-9true, 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:15,164 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is cut-off event [2025-03-14 22:05:15,164 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-03-14 22:05:15,164 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-03-14 22:05:15,164 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-03-14 22:05:15,164 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-03-14 22:05:17,033 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] thread1EXIT-->L103-1: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][2627], [338#true, 695#true, 929#true, 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 2452#true, 219#L66-2true, 54#L103-1true, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), 1056#true, thread3Thread1of1ForFork1InUse, 5798#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), thread1Thread1of1ForFork2NotInUse, 9565#true, 586#true, 2196#true, 475#true, 2322#true, 6954#(<= 1 ~n1~0), 294#L78-1true, 812#true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0))]) [2025-03-14 22:05:17,033 INFO L294 olderBase$Statistics]: this new event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,033 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,033 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,033 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,034 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] thread1EXIT-->L103-1: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][2627], [338#true, 161#L69-2true, 695#true, 929#true, 8325#(<= 1 ~n1~0), 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 3599#true, thread2Thread1of1ForFork0InUse, 2452#true, 54#L103-1true, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), 5798#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), thread3Thread1of1ForFork1InUse, 1056#true, 9565#true, thread1Thread1of1ForFork2NotInUse, 586#true, 2196#true, 475#true, 6954#(<= 1 ~n1~0), 2322#true, 294#L78-1true, 812#true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0))]) [2025-03-14 22:05:17,034 INFO L294 olderBase$Statistics]: this new event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,034 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,034 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,034 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,306 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] thread1EXIT-->L103-1: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][2627], [338#true, 695#true, 929#true, 8325#(<= 1 ~n1~0), 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 91#L66-1true, 3599#true, thread2Thread1of1ForFork0InUse, 2452#true, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), 54#L103-1true, thread3Thread1of1ForFork1InUse, 1056#true, 5798#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 9565#true, thread1Thread1of1ForFork2NotInUse, 586#true, 2196#true, 475#true, 2322#true, 6954#(<= 1 ~n1~0), 812#true, 294#L78-1true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0))]) [2025-03-14 22:05:17,306 INFO L294 olderBase$Statistics]: this new event has 195 ancestors and is cut-off event [2025-03-14 22:05:17,306 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-03-14 22:05:17,306 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-03-14 22:05:17,306 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-03-14 22:05:17,306 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] thread1EXIT-->L103-1: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][2627], [338#true, 695#true, 929#true, 8325#(<= 1 ~n1~0), 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 3599#true, thread2Thread1of1ForFork0InUse, 173#L69-1true, 2452#true, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), 54#L103-1true, thread3Thread1of1ForFork1InUse, 5798#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 1056#true, 9565#true, thread1Thread1of1ForFork2NotInUse, 586#true, 2196#true, 475#true, 2322#true, 6954#(<= 1 ~n1~0), 294#L78-1true, 812#true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0))]) [2025-03-14 22:05:17,306 INFO L294 olderBase$Statistics]: this new event has 195 ancestors and is cut-off event [2025-03-14 22:05:17,306 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-03-14 22:05:17,306 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-03-14 22:05:17,306 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-03-14 22:05:17,309 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] thread1EXIT-->L103-1: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][2627], [338#true, 695#true, 929#true, 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 219#L66-2true, 2452#true, 54#L103-1true, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), 1056#true, thread3Thread1of1ForFork1InUse, 5798#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), thread1Thread1of1ForFork2NotInUse, 9565#true, 586#true, 2196#true, 475#true, 2322#true, 6954#(<= 1 ~n1~0), 812#true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 202#L79true]) [2025-03-14 22:05:17,309 INFO L294 olderBase$Statistics]: this new event has 197 ancestors and is cut-off event [2025-03-14 22:05:17,309 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:17,309 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:17,309 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:17,310 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] thread1EXIT-->L103-1: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][2627], [338#true, 695#true, 929#true, 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 219#L66-2true, 54#L103-1true, 2452#true, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), thread3Thread1of1ForFork1InUse, 1056#true, 5798#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), thread1Thread1of1ForFork2NotInUse, 9565#true, 586#true, 2196#true, 475#true, 6954#(<= 1 ~n1~0), 2322#true, 812#true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 204#L78-2true]) [2025-03-14 22:05:17,310 INFO L294 olderBase$Statistics]: this new event has 197 ancestors and is cut-off event [2025-03-14 22:05:17,310 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:17,310 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:17,310 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:17,310 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] thread1EXIT-->L103-1: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][2627], [338#true, 161#L69-2true, 695#true, 929#true, 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 2452#true, 54#L103-1true, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), 5798#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), thread3Thread1of1ForFork1InUse, 1056#true, 9565#true, thread1Thread1of1ForFork2NotInUse, 586#true, 2196#true, 475#true, 2322#true, 6954#(<= 1 ~n1~0), 812#true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 202#L79true]) [2025-03-14 22:05:17,310 INFO L294 olderBase$Statistics]: this new event has 197 ancestors and is cut-off event [2025-03-14 22:05:17,310 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:17,310 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:17,310 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:17,311 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] thread1EXIT-->L103-1: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][2627], [338#true, 161#L69-2true, 695#true, 929#true, 8325#(<= 1 ~n1~0), 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 3599#true, thread2Thread1of1ForFork0InUse, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), 54#L103-1true, 2452#true, thread3Thread1of1ForFork1InUse, 5798#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 1056#true, thread1Thread1of1ForFork2NotInUse, 9565#true, 586#true, 2196#true, 475#true, 2322#true, 6954#(<= 1 ~n1~0), 812#true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 204#L78-2true]) [2025-03-14 22:05:17,311 INFO L294 olderBase$Statistics]: this new event has 197 ancestors and is cut-off event [2025-03-14 22:05:17,311 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:17,311 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:17,311 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:17,812 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([946] thread1EXIT-->L103-1: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][2627], [338#true, 695#true, 929#true, 8325#(<= 1 ~n1~0), 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 3599#true, thread2Thread1of1ForFork0InUse, 54#L103-1true, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), 2452#true, 219#L66-2true, 1056#true, thread3Thread1of1ForFork1InUse, 5798#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), thread1Thread1of1ForFork2NotInUse, 9565#true, 586#true, 2196#true, 475#true, 6954#(<= 1 ~n1~0), 2322#true, 812#true, 294#L78-1true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0))]) [2025-03-14 22:05:17,813 INFO L294 olderBase$Statistics]: this new event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,813 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,813 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,813 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,813 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,813 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] thread1EXIT-->L103-1: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][2627], [338#true, 695#true, 929#true, 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 8325#(<= 1 ~n1~0), 91#L66-1true, 3599#true, thread2Thread1of1ForFork0InUse, 2452#true, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), 54#L103-1true, 5798#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2NotInUse, 9565#true, 586#true, 2196#true, 475#true, 6954#(<= 1 ~n1~0), 2322#true, 812#true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 202#L79true]) [2025-03-14 22:05:17,813 INFO L294 olderBase$Statistics]: this new event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,813 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,813 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,813 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,814 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] thread1EXIT-->L103-1: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][2627], [338#true, 695#true, 929#true, 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 8325#(<= 1 ~n1~0), 91#L66-1true, 3599#true, thread2Thread1of1ForFork0InUse, 54#L103-1true, 2452#true, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), 1056#true, thread3Thread1of1ForFork1InUse, 5798#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), thread1Thread1of1ForFork2NotInUse, 9565#true, 586#true, 2196#true, 475#true, 2322#true, 6954#(<= 1 ~n1~0), 812#true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 204#L78-2true]) [2025-03-14 22:05:17,814 INFO L294 olderBase$Statistics]: this new event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,814 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,814 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,814 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,815 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([946] thread1EXIT-->L103-1: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][2627], [338#true, 161#L69-2true, 695#true, 929#true, 8325#(<= 1 ~n1~0), 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 3599#true, thread2Thread1of1ForFork0InUse, 2452#true, 54#L103-1true, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), 1056#true, thread3Thread1of1ForFork1InUse, 5798#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), thread1Thread1of1ForFork2NotInUse, 9565#true, 586#true, 2196#true, 475#true, 2322#true, 6954#(<= 1 ~n1~0), 294#L78-1true, 812#true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0))]) [2025-03-14 22:05:17,815 INFO L294 olderBase$Statistics]: this new event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,815 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,815 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,815 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,815 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,815 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] thread1EXIT-->L103-1: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][2627], [338#true, 695#true, 929#true, 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 173#L69-1true, 54#L103-1true, 2452#true, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), thread3Thread1of1ForFork1InUse, 1056#true, 5798#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), thread1Thread1of1ForFork2NotInUse, 9565#true, 586#true, 2196#true, 475#true, 6954#(<= 1 ~n1~0), 2322#true, 812#true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 202#L79true]) [2025-03-14 22:05:17,815 INFO L294 olderBase$Statistics]: this new event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,815 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,815 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,815 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,816 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] thread1EXIT-->L103-1: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][2627], [338#true, 695#true, 929#true, 8325#(<= 1 ~n1~0), 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 3599#true, thread2Thread1of1ForFork0InUse, 173#L69-1true, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), 54#L103-1true, 2452#true, thread3Thread1of1ForFork1InUse, 5798#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 1056#true, 9565#true, thread1Thread1of1ForFork2NotInUse, 586#true, 2196#true, 475#true, 2322#true, 6954#(<= 1 ~n1~0), 812#true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 204#L78-2true]) [2025-03-14 22:05:17,816 INFO L294 olderBase$Statistics]: this new event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,816 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,816 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-14 22:05:17,816 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-14 22:05:18,128 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([946] thread1EXIT-->L103-1: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][2627], [338#true, 695#true, 929#true, 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 219#L66-2true, 54#L103-1true, 2452#true, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), thread3Thread1of1ForFork1InUse, 1056#true, 5798#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 9565#true, thread1Thread1of1ForFork2NotInUse, 586#true, 2196#true, 475#true, 2322#true, 6954#(<= 1 ~n1~0), 812#true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 202#L79true]) [2025-03-14 22:05:18,128 INFO L294 olderBase$Statistics]: this new event has 197 ancestors and is cut-off event [2025-03-14 22:05:18,128 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:18,129 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:18,129 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:18,129 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:18,130 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([946] thread1EXIT-->L103-1: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][2627], [338#true, 695#true, 929#true, 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 2452#true, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), 219#L66-2true, 54#L103-1true, thread3Thread1of1ForFork1InUse, 5798#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 1056#true, thread1Thread1of1ForFork2NotInUse, 9565#true, 586#true, 2196#true, 475#true, 6954#(<= 1 ~n1~0), 2322#true, 812#true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 204#L78-2true]) [2025-03-14 22:05:18,130 INFO L294 olderBase$Statistics]: this new event has 197 ancestors and is cut-off event [2025-03-14 22:05:18,130 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:18,130 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:18,130 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:18,130 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:18,132 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([946] thread1EXIT-->L103-1: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][2627], [338#true, 161#L69-2true, 695#true, 929#true, 8325#(<= 1 ~n1~0), 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 3599#true, thread2Thread1of1ForFork0InUse, 2452#true, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), 54#L103-1true, thread3Thread1of1ForFork1InUse, 5798#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 1056#true, thread1Thread1of1ForFork2NotInUse, 9565#true, 586#true, 2196#true, 475#true, 6954#(<= 1 ~n1~0), 2322#true, 812#true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 202#L79true]) [2025-03-14 22:05:18,132 INFO L294 olderBase$Statistics]: this new event has 197 ancestors and is cut-off event [2025-03-14 22:05:18,132 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:18,132 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:18,132 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:18,132 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:18,133 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([946] thread1EXIT-->L103-1: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][2627], [338#true, 161#L69-2true, 695#true, 929#true, 8325#(<= 1 ~n1~0), 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 3599#true, thread2Thread1of1ForFork0InUse, 54#L103-1true, 2452#true, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), thread3Thread1of1ForFork1InUse, 5798#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 1056#true, thread1Thread1of1ForFork2NotInUse, 9565#true, 586#true, 2196#true, 475#true, 6954#(<= 1 ~n1~0), 2322#true, 812#true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 204#L78-2true]) [2025-03-14 22:05:18,133 INFO L294 olderBase$Statistics]: this new event has 197 ancestors and is cut-off event [2025-03-14 22:05:18,133 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:18,133 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:18,133 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:18,133 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:18,490 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([794] L50-1-->L51: Formula: (and (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n1~0_2) (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n2~0_2)) InVars {~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} OutVars{~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} AuxVars[] AssignedVars[][618], [8234#(and (<= ~n3~0 ~n2~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (<= 0 ~n2~0)), 338#true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 1056#true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 2196#true, 8262#(<= ~n3~0 0), 6954#(<= 1 ~n1~0), 2322#true, 48#L102-4true, 695#true, 929#true, 97#L51true, 2452#true, 219#L66-2true, 9565#true, 586#true, 475#true, 812#true, 13#L80-9true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:18,491 INFO L294 olderBase$Statistics]: this new event has 198 ancestors and is cut-off event [2025-03-14 22:05:18,491 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-03-14 22:05:18,491 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-03-14 22:05:18,491 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-03-14 22:05:18,491 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([793] L50-1-->L50-2: Formula: (or (<= v_~n2~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|) (<= v_~n1~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|)) InVars {~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} OutVars{~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[][619], [8234#(and (<= ~n3~0 ~n2~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (<= 0 ~n2~0)), 338#true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 95#L50-2true, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 2196#true, 8262#(<= ~n3~0 0), 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 5815#(<= 1 ~n1~0), 695#true, 929#true, 2452#true, 219#L66-2true, 9565#true, 586#true, 475#true, 812#true, 13#L80-9true, 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:18,491 INFO L294 olderBase$Statistics]: this new event has 198 ancestors and is cut-off event [2025-03-14 22:05:18,491 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-03-14 22:05:18,491 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-03-14 22:05:18,491 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-03-14 22:05:18,491 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([794] L50-1-->L51: Formula: (and (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n1~0_2) (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n2~0_2)) InVars {~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} OutVars{~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} AuxVars[] AssignedVars[][618], [8234#(and (<= ~n3~0 ~n2~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (<= 0 ~n2~0)), 338#true, 161#L69-2true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 2196#true, 8262#(<= ~n3~0 0), 6954#(<= 1 ~n1~0), 2322#true, 48#L102-4true, 695#true, 929#true, 97#L51true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 13#L80-9true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:18,491 INFO L294 olderBase$Statistics]: this new event has 198 ancestors and is cut-off event [2025-03-14 22:05:18,491 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-03-14 22:05:18,491 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-03-14 22:05:18,492 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-03-14 22:05:18,492 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([793] L50-1-->L50-2: Formula: (or (<= v_~n2~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|) (<= v_~n1~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|)) InVars {~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} OutVars{~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[][619], [8234#(and (<= ~n3~0 ~n2~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (<= 0 ~n2~0)), 338#true, 161#L69-2true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 95#L50-2true, 1056#true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 2196#true, 8262#(<= ~n3~0 0), 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 5815#(<= 1 ~n1~0), 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 13#L80-9true, 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:18,492 INFO L294 olderBase$Statistics]: this new event has 198 ancestors and is cut-off event [2025-03-14 22:05:18,492 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-03-14 22:05:18,492 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-03-14 22:05:18,492 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-03-14 22:05:20,541 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([886] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork0_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][2441], [338#true, 8325#(<= 1 ~n1~0), 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 3599#true, thread2Thread1of1ForFork0InUse, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), 5798#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 2196#true, 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 204#L78-2true, 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 127#L52-9true, 176#L66-9true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0))]) [2025-03-14 22:05:20,541 INFO L294 olderBase$Statistics]: this new event has 212 ancestors and is cut-off event [2025-03-14 22:05:20,541 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2025-03-14 22:05:20,541 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2025-03-14 22:05:20,541 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2025-03-14 22:05:20,542 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([886] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork0_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][2441], [338#true, 8325#(<= 1 ~n1~0), 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 3599#true, thread2Thread1of1ForFork0InUse, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), 1056#true, 5798#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 2196#true, 6954#(<= 1 ~n1~0), 2322#true, 48#L102-4true, 202#L79true, 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 176#L66-9true, 127#L52-9true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0))]) [2025-03-14 22:05:20,542 INFO L294 olderBase$Statistics]: this new event has 212 ancestors and is cut-off event [2025-03-14 22:05:20,542 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2025-03-14 22:05:20,542 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2025-03-14 22:05:20,542 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2025-03-14 22:05:20,542 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([886] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork0_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][2441], [338#true, 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), 5798#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 1056#true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 2196#true, 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 294#L78-1true, 812#true, 176#L66-9true, 127#L52-9true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0))]) [2025-03-14 22:05:20,542 INFO L294 olderBase$Statistics]: this new event has 211 ancestors and is cut-off event [2025-03-14 22:05:20,542 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-03-14 22:05:20,542 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-03-14 22:05:20,542 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-03-14 22:05:20,543 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([886] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork0_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][2441], [338#true, 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), 5798#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 1056#true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 2196#true, 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 202#L79true, 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 127#L52-9true, 176#L66-9true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0))]) [2025-03-14 22:05:20,543 INFO L294 olderBase$Statistics]: this new event has 212 ancestors and is cut-off event [2025-03-14 22:05:20,543 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2025-03-14 22:05:20,543 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2025-03-14 22:05:20,543 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2025-03-14 22:05:20,543 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2025-03-14 22:05:20,543 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([886] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork0_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][2441], [338#true, 8325#(<= 1 ~n1~0), 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 3599#true, thread2Thread1of1ForFork0InUse, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), 1056#true, thread3Thread1of1ForFork1InUse, 5798#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), thread1Thread1of1ForFork2InUse, 2196#true, 6954#(<= 1 ~n1~0), 2322#true, 48#L102-4true, 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 294#L78-1true, 812#true, 127#L52-9true, 176#L66-9true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0))]) [2025-03-14 22:05:20,543 INFO L294 olderBase$Statistics]: this new event has 211 ancestors and is cut-off event [2025-03-14 22:05:20,543 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-03-14 22:05:20,543 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-03-14 22:05:20,544 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-03-14 22:05:20,544 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-03-14 22:05:20,544 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([886] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork0_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][2441], [338#true, 8325#(<= 1 ~n1~0), 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 3599#true, thread2Thread1of1ForFork0InUse, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), 5798#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 1056#true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 2196#true, 6954#(<= 1 ~n1~0), 2322#true, 48#L102-4true, 204#L78-2true, 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 176#L66-9true, 127#L52-9true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0))]) [2025-03-14 22:05:20,544 INFO L294 olderBase$Statistics]: this new event has 212 ancestors and is cut-off event [2025-03-14 22:05:20,544 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2025-03-14 22:05:20,544 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2025-03-14 22:05:20,544 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2025-03-14 22:05:20,544 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2025-03-14 22:05:21,031 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([886] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork0_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][2246], [8234#(and (<= ~n3~0 ~n2~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (<= 0 ~n2~0)), 338#true, 8263#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n3~0 0)), 8325#(<= 1 ~n1~0), 3599#true, 284#L51-1true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 2196#true, 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 13#L80-9true, 176#L66-9true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:21,031 INFO L294 olderBase$Statistics]: this new event has 213 ancestors and is cut-off event [2025-03-14 22:05:21,031 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2025-03-14 22:05:21,031 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2025-03-14 22:05:21,031 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2025-03-14 22:05:21,120 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([886] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork0_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][2246], [8234#(and (<= ~n3~0 ~n2~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (<= 0 ~n2~0)), 338#true, 8263#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n3~0 0)), 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, 214#L51-2true, thread1Thread1of1ForFork2InUse, 2196#true, 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 13#L80-9true, 176#L66-9true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:21,120 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2025-03-14 22:05:21,120 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-14 22:05:21,120 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-14 22:05:21,120 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-14 22:05:21,188 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([886] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork0_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][2246], [8234#(and (<= ~n3~0 ~n2~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (<= 0 ~n2~0)), 338#true, 8263#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n3~0 0)), 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 2196#true, 6954#(<= 1 ~n1~0), 2322#true, 48#L102-4true, 695#true, 29#L55-1true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 13#L80-9true, 176#L66-9true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:21,188 INFO L294 olderBase$Statistics]: this new event has 218 ancestors and is cut-off event [2025-03-14 22:05:21,188 INFO L297 olderBase$Statistics]: existing Event has 218 ancestors and is cut-off event [2025-03-14 22:05:21,188 INFO L297 olderBase$Statistics]: existing Event has 218 ancestors and is cut-off event [2025-03-14 22:05:21,188 INFO L297 olderBase$Statistics]: existing Event has 218 ancestors and is cut-off event [2025-03-14 22:05:21,188 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([886] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork0_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][2246], [8234#(and (<= ~n3~0 ~n2~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (<= 0 ~n2~0)), 338#true, 8263#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n3~0 0)), 8325#(<= 1 ~n1~0), 290#L52-1true, 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 2196#true, 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 13#L80-9true, 176#L66-9true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:21,188 INFO L294 olderBase$Statistics]: this new event has 218 ancestors and is cut-off event [2025-03-14 22:05:21,188 INFO L297 olderBase$Statistics]: existing Event has 218 ancestors and is cut-off event [2025-03-14 22:05:21,188 INFO L297 olderBase$Statistics]: existing Event has 218 ancestors and is cut-off event [2025-03-14 22:05:21,188 INFO L297 olderBase$Statistics]: existing Event has 218 ancestors and is cut-off event [2025-03-14 22:05:21,443 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([886] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork0_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][2246], [8234#(and (<= ~n3~0 ~n2~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (<= 0 ~n2~0)), 338#true, 8263#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n3~0 0)), 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 1056#true, thread1Thread1of1ForFork2InUse, 2196#true, 6954#(<= 1 ~n1~0), 2322#true, 165#L52-2true, 48#L102-4true, 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 13#L80-9true, 176#L66-9true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:21,443 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is cut-off event [2025-03-14 22:05:21,443 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2025-03-14 22:05:21,443 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2025-03-14 22:05:21,443 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2025-03-14 22:05:21,448 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([886] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork0_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][2290], [8234#(and (<= ~n3~0 ~n2~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (<= 0 ~n2~0)), 338#true, 8325#(<= 1 ~n1~0), 300#L55-2true, 3599#true, thread2Thread1of1ForFork0InUse, 1056#true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 2196#true, 8262#(<= ~n3~0 0), 6954#(<= 1 ~n1~0), 2322#true, 48#L102-4true, 5815#(<= 1 ~n1~0), 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 13#L80-9true, 176#L66-9true, 5804#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0)))]) [2025-03-14 22:05:21,448 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is cut-off event [2025-03-14 22:05:21,448 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2025-03-14 22:05:21,448 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2025-03-14 22:05:21,448 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2025-03-14 22:05:22,057 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] thread1EXIT-->L103-1: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][2540], [338#true, 695#true, 8263#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n3~0 0)), 929#true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 2452#true, 219#L66-2true, 54#L103-1true, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), 1056#true, thread3Thread1of1ForFork1InUse, 5798#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), thread1Thread1of1ForFork2NotInUse, 9565#true, 586#true, 2196#true, 475#true, 6954#(<= 1 ~n1~0), 2322#true, 812#true, 13#L80-9true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0))]) [2025-03-14 22:05:22,058 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2025-03-14 22:05:22,058 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-03-14 22:05:22,058 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-03-14 22:05:22,058 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-03-14 22:05:22,059 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] thread1EXIT-->L103-1: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][2540], [338#true, 161#L69-2true, 695#true, 8263#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n3~0 0)), 929#true, 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 54#L103-1true, 2452#true, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), 1056#true, thread3Thread1of1ForFork1InUse, 5798#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), thread1Thread1of1ForFork2NotInUse, 9565#true, 586#true, 2196#true, 475#true, 2322#true, 6954#(<= 1 ~n1~0), 812#true, 13#L80-9true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0))]) [2025-03-14 22:05:22,059 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2025-03-14 22:05:22,059 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-03-14 22:05:22,059 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-03-14 22:05:22,059 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-03-14 22:05:22,482 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([886] L66-8-->L66-9: Formula: (= |v_thread2Thread1of1ForFork0_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][2214], [338#true, 8263#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n3~0 0)), 8325#(<= 1 ~n1~0), 3599#true, thread2Thread1of1ForFork0InUse, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), 1056#true, thread3Thread1of1ForFork1InUse, 5798#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), thread1Thread1of1ForFork2InUse, 2196#true, 2322#true, 6954#(<= 1 ~n1~0), 48#L102-4true, 695#true, 929#true, 2452#true, 9565#true, 586#true, 475#true, 812#true, 13#L80-9true, 176#L66-9true, 127#L52-9true, 6945#(and (<= 1 ~n1~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0))]) [2025-03-14 22:05:22,483 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is not cut-off event [2025-03-14 22:05:22,483 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2025-03-14 22:05:22,483 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2025-03-14 22:05:22,483 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2025-03-14 22:05:22,627 INFO L124 PetriNetUnfolderBase]: 22845/116327 cut-off events. [2025-03-14 22:05:22,628 INFO L125 PetriNetUnfolderBase]: For 1645486/2731514 co-relation queries the response was YES. [2025-03-14 22:05:24,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 587030 conditions, 116327 events. 22845/116327 cut-off events. For 1645486/2731514 co-relation queries the response was YES. Maximal size of possible extension queue 2680. Compared 1966981 event pairs, 4651 based on Foata normal form. 465/101187 useless extension candidates. Maximal degree in co-relation 137070. Up to 16880 conditions per place. [2025-03-14 22:05:25,045 INFO L140 encePairwiseOnDemand]: 336/348 looper letters, 1228 selfloop transitions, 13 changer transitions 741/3581 dead transitions. [2025-03-14 22:05:25,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 994 places, 3581 transitions, 117804 flow [2025-03-14 22:05:25,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 22:05:25,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 22:05:25,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2792 transitions. [2025-03-14 22:05:25,047 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8022988505747126 [2025-03-14 22:05:25,048 INFO L298 CegarLoopForPetriNet]: 335 programPoint places, 659 predicate places. [2025-03-14 22:05:25,048 INFO L471 AbstractCegarLoop]: Abstraction has has 994 places, 3581 transitions, 117804 flow [2025-03-14 22:05:25,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 274.14285714285717) internal successors, (1919), 7 states have internal predecessors, (1919), 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-14 22:05:25,048 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:05:25,048 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 22:05:25,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 22:05:25,048 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:05:25,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:05:25,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1188705376, now seen corresponding path program 1 times [2025-03-14 22:05:25,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:05:25,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869616281] [2025-03-14 22:05:25,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:05:25,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:05:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:05:25,117 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-14 22:05:25,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:05:25,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869616281] [2025-03-14 22:05:25,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869616281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:05:25,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:05:25,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 22:05:25,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838087169] [2025-03-14 22:05:25,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:05:25,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 22:05:25,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:05:25,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 22:05:25,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-14 22:05:25,119 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 348 [2025-03-14 22:05:25,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 994 places, 3581 transitions, 117804 flow. Second operand has 7 states, 7 states have (on average 274.14285714285717) internal successors, (1919), 7 states have internal predecessors, (1919), 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-14 22:05:25,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:05:25,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 348 [2025-03-14 22:05:25,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:05:33,059 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] thread1EXIT-->L103-1: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][982], [8234#(and (<= ~n3~0 ~n2~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (<= 0 ~n2~0)), 8263#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n3~0 0)), 44#L64-2true, 9582#true, 1035#(and (or (= ~res2~0 0) (< ~res1~0 0)) (or (and (or (= ~res3~0 0) (< ~n2~0 ~n1~0)) (<= ~res3~0 0) (= ~n1~0 ~n3~0)) (< ~n1~0 ~n2~0)) (or (< ~n1~0 0) (= ~n1~0 0)) (or (and (<= ~res3~0 0) (or (< 0 ~res1~0) (= ~res3~0 0)) (= ~n1~0 ~n3~0)) (< ~res1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0))), thread2Thread1of1ForFork0InUse, 54#L103-1true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2NotInUse, 817#(<= ~n1~0 0), 2204#(= ~n1~0 0), 9571#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 480#(<= ~n1~0 0), 8318#true, 83#L83-2true, 4705#true, 4700#(and (<= ~n1~0 0) (<= (+ ~n1~0 1) ~n2~0) (not (= ~res1~0 0))), 6948#true, 2457#(<= ~n1~0 0), 346#(= ~n1~0 0), 1061#(<= ~n1~0 0), 670#(and (or (< ~n1~0 0) (= ~n1~0 0)) (or (and (= (+ ~res1~0 ~n2~0) ~n3~0) (= ~n1~0 ~n3~0)) (< ~res1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0)) (or (= ~n1~0 ~n3~0) (< ~n1~0 ~n2~0))), 2330#(= ~n1~0 0), 703#(= ~n1~0 0), 5809#true]) [2025-03-14 22:05:33,059 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2025-03-14 22:05:33,059 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2025-03-14 22:05:33,059 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2025-03-14 22:05:33,059 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2025-03-14 22:05:33,060 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] thread1EXIT-->L103-1: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][982], [8234#(and (<= ~n3~0 ~n2~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (<= 0 ~n2~0)), 44#L64-2true, 8263#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n3~0 0)), 9582#true, 1035#(and (or (= ~res2~0 0) (< ~res1~0 0)) (or (and (or (= ~res3~0 0) (< ~n2~0 ~n1~0)) (<= ~res3~0 0) (= ~n1~0 ~n3~0)) (< ~n1~0 ~n2~0)) (or (< ~n1~0 0) (= ~n1~0 0)) (or (and (<= ~res3~0 0) (or (< 0 ~res1~0) (= ~res3~0 0)) (= ~n1~0 ~n3~0)) (< ~res1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0))), thread2Thread1of1ForFork0InUse, 54#L103-1true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2NotInUse, 817#(<= ~n1~0 0), 2204#(= ~n1~0 0), 480#(<= ~n1~0 0), 9571#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 8318#true, 4705#true, 4700#(and (<= ~n1~0 0) (<= (+ ~n1~0 1) ~n2~0) (not (= ~res1~0 0))), 6948#true, 2457#(<= ~n1~0 0), 116#L80-2true, 346#(= ~n1~0 0), 1061#(<= ~n1~0 0), 670#(and (or (< ~n1~0 0) (= ~n1~0 0)) (or (and (= (+ ~res1~0 ~n2~0) ~n3~0) (= ~n1~0 ~n3~0)) (< ~res1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0)) (or (= ~n1~0 ~n3~0) (< ~n1~0 ~n2~0))), 2330#(= ~n1~0 0), 5809#true, 703#(= ~n1~0 0)]) [2025-03-14 22:05:33,060 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2025-03-14 22:05:33,060 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2025-03-14 22:05:33,060 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2025-03-14 22:05:33,060 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2025-03-14 22:05:42,431 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([794] L50-1-->L51: Formula: (and (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n1~0_2) (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n2~0_2)) InVars {~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} OutVars{~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} AuxVars[] AssignedVars[][1524], [44#L64-2true, 9582#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 8238#(and (or (< 0 ~res3~0) (= ~res2~0 (+ ~res3~0 ~res1~0))) (<= ~n3~0 ~n2~0) (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (or (< 0 ~res2~0) (< (+ ~res3~0 ~res1~0) (+ ~res2~0 1))) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 817#(<= ~n1~0 0), 8262#(<= ~n3~0 0), 2204#(= ~n1~0 0), 480#(<= ~n1~0 0), 9571#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 48#L102-4true, 8318#true, 1006#(and (or (and (or (= ~res3~0 0) (< ~n2~0 ~n1~0)) (<= ~res3~0 0) (= ~n1~0 ~n3~0)) (< ~n1~0 ~n2~0)) (or (< ~n1~0 0) (= ~n1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0))), 83#L83-2true, 4705#true, 4700#(and (<= ~n1~0 0) (<= (+ ~n1~0 1) ~n2~0) (not (= ~res1~0 0))), 97#L51true, 6948#true, 2457#(<= ~n1~0 0), 346#(= ~n1~0 0), 674#(and (or (and (<= 0 ~res2~0) (or (< ~res3~0 0) (= ~res2~0 0))) (< ~res1~0 0)) (or (< ~n1~0 0) (= ~n1~0 0)) (or (and (<= ~res3~0 0) (<= 0 (+ ~res3~0 ~res1~0))) (< ~res1~0 0)) (or (and (= (+ ~res1~0 ~n2~0) ~n3~0) (= ~n1~0 ~n3~0)) (< ~res1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0)) (or (= ~n1~0 ~n3~0) (< ~n1~0 ~n2~0))), 1061#(<= ~n1~0 0), 2330#(= ~n1~0 0), 6464#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 703#(= ~n1~0 0)]) [2025-03-14 22:05:42,432 INFO L294 olderBase$Statistics]: this new event has 177 ancestors and is cut-off event [2025-03-14 22:05:42,432 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:42,432 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:42,432 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:42,432 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([793] L50-1-->L50-2: Formula: (or (<= v_~n2~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|) (<= v_~n1~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|)) InVars {~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} OutVars{~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[][1525], [44#L64-2true, 9582#true, thread2Thread1of1ForFork0InUse, 95#L50-2true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 8238#(and (or (< 0 ~res3~0) (= ~res2~0 (+ ~res3~0 ~res1~0))) (<= ~n3~0 ~n2~0) (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (or (< 0 ~res2~0) (< (+ ~res3~0 ~res1~0) (+ ~res2~0 1))) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 817#(<= ~n1~0 0), 8262#(<= ~n3~0 0), 2204#(= ~n1~0 0), 480#(<= ~n1~0 0), 9571#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 48#L102-4true, 8318#true, 1006#(and (or (and (or (= ~res3~0 0) (< ~n2~0 ~n1~0)) (<= ~res3~0 0) (= ~n1~0 ~n3~0)) (< ~n1~0 ~n2~0)) (or (< ~n1~0 0) (= ~n1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0))), 83#L83-2true, 4705#true, 4700#(and (<= ~n1~0 0) (<= (+ ~n1~0 1) ~n2~0) (not (= ~res1~0 0))), 6948#true, 2457#(<= ~n1~0 0), 346#(= ~n1~0 0), 674#(and (or (and (<= 0 ~res2~0) (or (< ~res3~0 0) (= ~res2~0 0))) (< ~res1~0 0)) (or (< ~n1~0 0) (= ~n1~0 0)) (or (and (<= ~res3~0 0) (<= 0 (+ ~res3~0 ~res1~0))) (< ~res1~0 0)) (or (and (= (+ ~res1~0 ~n2~0) ~n3~0) (= ~n1~0 ~n3~0)) (< ~res1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0)) (or (= ~n1~0 ~n3~0) (< ~n1~0 ~n2~0))), 1061#(<= ~n1~0 0), 2330#(= ~n1~0 0), 703#(= ~n1~0 0), 5809#true]) [2025-03-14 22:05:42,432 INFO L294 olderBase$Statistics]: this new event has 177 ancestors and is cut-off event [2025-03-14 22:05:42,432 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:42,432 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:42,432 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:42,433 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([794] L50-1-->L51: Formula: (and (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n1~0_2) (< |v_thread1Thread1of1ForFork2_~i~0#1_5| v_~n2~0_2)) InVars {~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} OutVars{~n2~0=v_~n2~0_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_5|, ~n1~0=v_~n1~0_2} AuxVars[] AssignedVars[][1524], [44#L64-2true, 9582#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 8238#(and (or (< 0 ~res3~0) (= ~res2~0 (+ ~res3~0 ~res1~0))) (<= ~n3~0 ~n2~0) (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (or (< 0 ~res2~0) (< (+ ~res3~0 ~res1~0) (+ ~res2~0 1))) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 817#(<= ~n1~0 0), 8262#(<= ~n3~0 0), 2204#(= ~n1~0 0), 9571#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 480#(<= ~n1~0 0), 48#L102-4true, 8318#true, 1006#(and (or (and (or (= ~res3~0 0) (< ~n2~0 ~n1~0)) (<= ~res3~0 0) (= ~n1~0 ~n3~0)) (< ~n1~0 ~n2~0)) (or (< ~n1~0 0) (= ~n1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0))), 4705#true, 4700#(and (<= ~n1~0 0) (<= (+ ~n1~0 1) ~n2~0) (not (= ~res1~0 0))), 97#L51true, 6948#true, 2457#(<= ~n1~0 0), 116#L80-2true, 346#(= ~n1~0 0), 674#(and (or (and (<= 0 ~res2~0) (or (< ~res3~0 0) (= ~res2~0 0))) (< ~res1~0 0)) (or (< ~n1~0 0) (= ~n1~0 0)) (or (and (<= ~res3~0 0) (<= 0 (+ ~res3~0 ~res1~0))) (< ~res1~0 0)) (or (and (= (+ ~res1~0 ~n2~0) ~n3~0) (= ~n1~0 ~n3~0)) (< ~res1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0)) (or (= ~n1~0 ~n3~0) (< ~n1~0 ~n2~0))), 1061#(<= ~n1~0 0), 2330#(= ~n1~0 0), 6464#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 703#(= ~n1~0 0)]) [2025-03-14 22:05:42,433 INFO L294 olderBase$Statistics]: this new event has 177 ancestors and is cut-off event [2025-03-14 22:05:42,433 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:42,433 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:42,433 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:42,433 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([793] L50-1-->L50-2: Formula: (or (<= v_~n2~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|) (<= v_~n1~0_3 |v_thread1Thread1of1ForFork2_~i~0#1_3|)) InVars {~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} OutVars{~n2~0=v_~n2~0_3, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_3|, ~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[][1525], [44#L64-2true, 9582#true, thread2Thread1of1ForFork0InUse, 95#L50-2true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 8238#(and (or (< 0 ~res3~0) (= ~res2~0 (+ ~res3~0 ~res1~0))) (<= ~n3~0 ~n2~0) (<= (+ ~res3~0 ~res1~0 ~n3~0) ~n1~0) (or (< 0 ~res2~0) (< (+ ~res3~0 ~res1~0) (+ ~res2~0 1))) (= (+ ~res1~0 ~n2~0) ~n1~0) (or (< 0 ~res3~0) (= ~n1~0 (+ ~res3~0 ~res1~0 ~n3~0))) (<= 0 ~n2~0)), 817#(<= ~n1~0 0), 8262#(<= ~n3~0 0), 2204#(= ~n1~0 0), 9571#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 480#(<= ~n1~0 0), 48#L102-4true, 8318#true, 1006#(and (or (and (or (= ~res3~0 0) (< ~n2~0 ~n1~0)) (<= ~res3~0 0) (= ~n1~0 ~n3~0)) (< ~n1~0 ~n2~0)) (or (< ~n1~0 0) (= ~n1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0))), 4705#true, 4700#(and (<= ~n1~0 0) (<= (+ ~n1~0 1) ~n2~0) (not (= ~res1~0 0))), 6948#true, 2457#(<= ~n1~0 0), 116#L80-2true, 346#(= ~n1~0 0), 674#(and (or (and (<= 0 ~res2~0) (or (< ~res3~0 0) (= ~res2~0 0))) (< ~res1~0 0)) (or (< ~n1~0 0) (= ~n1~0 0)) (or (and (<= ~res3~0 0) (<= 0 (+ ~res3~0 ~res1~0))) (< ~res1~0 0)) (or (and (= (+ ~res1~0 ~n2~0) ~n3~0) (= ~n1~0 ~n3~0)) (< ~res1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0)) (or (= ~n1~0 ~n3~0) (< ~n1~0 ~n2~0))), 1061#(<= ~n1~0 0), 2330#(= ~n1~0 0), 703#(= ~n1~0 0), 5809#true]) [2025-03-14 22:05:42,433 INFO L294 olderBase$Statistics]: this new event has 177 ancestors and is cut-off event [2025-03-14 22:05:42,433 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:42,433 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:42,433 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-14 22:05:46,305 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] L80-8-->L80-9: Formula: (= v_~res3~0_2 |v_thread3Thread1of1ForFork1_#t~ret17#1_5|) InVars {thread3Thread1of1ForFork1_#t~ret17#1=|v_thread3Thread1of1ForFork1_#t~ret17#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ret17#1=|v_thread3Thread1of1ForFork1_#t~ret17#1_5|, ~res3~0=v_~res3~0_2} AuxVars[] AssignedVars[~res3~0][2355], [8234#(and (<= ~n3~0 ~n2~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (<= 0 ~n2~0)), 8263#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n3~0 0)), 44#L64-2true, 9582#true, thread2Thread1of1ForFork0InUse, 95#L50-2true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 817#(<= ~n1~0 0), 2204#(= ~n1~0 0), 9571#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 480#(<= ~n1~0 0), 48#L102-4true, 8318#true, 4705#true, 4700#(and (<= ~n1~0 0) (<= (+ ~n1~0 1) ~n2~0) (not (= ~res1~0 0))), 6948#true, 2457#(<= ~n1~0 0), 346#(= ~n1~0 0), 1061#(<= ~n1~0 0), 961#(and (or (< ~n1~0 0) (= ~n1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0)) (or (= ~n1~0 ~n3~0) (< ~n1~0 ~n2~0))), 2330#(= ~n1~0 0), 670#(and (or (< ~n1~0 0) (= ~n1~0 0)) (or (and (= (+ ~res1~0 ~n2~0) ~n3~0) (= ~n1~0 ~n3~0)) (< ~res1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0)) (or (= ~n1~0 ~n3~0) (< ~n1~0 ~n2~0))), 13#L80-9true, 5809#true, 703#(= ~n1~0 0)]) [2025-03-14 22:05:46,306 INFO L294 olderBase$Statistics]: this new event has 182 ancestors and is cut-off event [2025-03-14 22:05:46,306 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2025-03-14 22:05:46,306 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2025-03-14 22:05:46,306 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2025-03-14 22:05:51,700 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] L80-8-->L80-9: Formula: (= v_~res3~0_2 |v_thread3Thread1of1ForFork1_#t~ret17#1_5|) InVars {thread3Thread1of1ForFork1_#t~ret17#1=|v_thread3Thread1of1ForFork1_#t~ret17#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ret17#1=|v_thread3Thread1of1ForFork1_#t~ret17#1_5|, ~res3~0=v_~res3~0_2} AuxVars[] AssignedVars[~res3~0][2464], [8234#(and (<= ~n3~0 ~n2~0) (= (+ ~res1~0 ~n2~0) ~n1~0) (<= 0 ~n2~0)), 44#L64-2true, 9582#true, 300#L55-2true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 817#(<= ~n1~0 0), 8262#(<= ~n3~0 0), 2204#(= ~n1~0 0), 480#(<= ~n1~0 0), 9571#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 48#L102-4true, 8318#true, 4705#true, 4700#(and (<= ~n1~0 0) (<= (+ ~n1~0 1) ~n2~0) (not (= ~res1~0 0))), 6948#true, 2457#(<= ~n1~0 0), 346#(= ~n1~0 0), 1061#(<= ~n1~0 0), 961#(and (or (< ~n1~0 0) (= ~n1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0)) (or (= ~n1~0 ~n3~0) (< ~n1~0 ~n2~0))), 670#(and (or (< ~n1~0 0) (= ~n1~0 0)) (or (and (= (+ ~res1~0 ~n2~0) ~n3~0) (= ~n1~0 ~n3~0)) (< ~res1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0)) (or (= ~n1~0 ~n3~0) (< ~n1~0 ~n2~0))), 2330#(= ~n1~0 0), 13#L80-9true, 703#(= ~n1~0 0), 5809#true]) [2025-03-14 22:05:51,701 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is cut-off event [2025-03-14 22:05:51,701 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-03-14 22:05:51,701 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-03-14 22:05:51,701 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-03-14 22:05:55,622 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] thread1EXIT-->L103-1: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][2560], [44#L64-2true, 9582#true, 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), thread2Thread1of1ForFork0InUse, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), 54#L103-1true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2NotInUse, 817#(<= ~n1~0 0), 2204#(= ~n1~0 0), 9571#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 480#(<= ~n1~0 0), 8318#true, 1006#(and (or (and (or (= ~res3~0 0) (< ~n2~0 ~n1~0)) (<= ~res3~0 0) (= ~n1~0 ~n3~0)) (< ~n1~0 ~n2~0)) (or (< ~n1~0 0) (= ~n1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0))), 4694#(and (<= ~n1~0 0) (<= (+ ~n1~0 1) ~n2~0)), 83#L83-2true, 617#(and (or (< ~n1~0 0) (= ~n1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0)) (or (= ~n1~0 ~n3~0) (< ~n1~0 ~n2~0))), 4705#true, 6948#true, 2457#(<= ~n1~0 0), 346#(= ~n1~0 0), 1061#(<= ~n1~0 0), 2330#(= ~n1~0 0), 6464#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 703#(= ~n1~0 0)]) [2025-03-14 22:05:55,622 INFO L294 olderBase$Statistics]: this new event has 197 ancestors and is cut-off event [2025-03-14 22:05:55,622 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:55,622 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:55,622 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:55,623 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] thread1EXIT-->L103-1: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][2560], [44#L64-2true, 8264#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 ~res3~0) (<= ~n3~0 0)), 9582#true, thread2Thread1of1ForFork0InUse, 54#L103-1true, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2NotInUse, 817#(<= ~n1~0 0), 2204#(= ~n1~0 0), 480#(<= ~n1~0 0), 9571#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 8318#true, 1006#(and (or (and (or (= ~res3~0 0) (< ~n2~0 ~n1~0)) (<= ~res3~0 0) (= ~n1~0 ~n3~0)) (< ~n1~0 ~n2~0)) (or (< ~n1~0 0) (= ~n1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0))), 4694#(and (<= ~n1~0 0) (<= (+ ~n1~0 1) ~n2~0)), 617#(and (or (< ~n1~0 0) (= ~n1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0)) (or (= ~n1~0 ~n3~0) (< ~n1~0 ~n2~0))), 4705#true, 6948#true, 2457#(<= ~n1~0 0), 116#L80-2true, 346#(= ~n1~0 0), 1061#(<= ~n1~0 0), 2330#(= ~n1~0 0), 6464#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 703#(= ~n1~0 0)]) [2025-03-14 22:05:55,624 INFO L294 olderBase$Statistics]: this new event has 197 ancestors and is cut-off event [2025-03-14 22:05:55,624 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:55,624 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:55,624 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-14 22:05:56,074 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] thread1EXIT-->L103-1: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][2683], [9582#true, thread2Thread1of1ForFork0InUse, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), 54#L103-1true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2NotInUse, 817#(<= ~n1~0 0), 8262#(<= ~n3~0 0), 2204#(= ~n1~0 0), 9571#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 480#(<= ~n1~0 0), 103#L79-1true, 222#L63true, 8318#true, 1006#(and (or (and (or (= ~res3~0 0) (< ~n2~0 ~n1~0)) (<= ~res3~0 0) (= ~n1~0 ~n3~0)) (< ~n1~0 ~n2~0)) (or (< ~n1~0 0) (= ~n1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0))), 4694#(and (<= ~n1~0 0) (<= (+ ~n1~0 1) ~n2~0)), 617#(and (or (< ~n1~0 0) (= ~n1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0)) (or (= ~n1~0 ~n3~0) (< ~n1~0 ~n2~0))), 4705#true, 6948#true, 2457#(<= ~n1~0 0), 346#(= ~n1~0 0), 1061#(<= ~n1~0 0), 2330#(= ~n1~0 0), 6464#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 703#(= ~n1~0 0)]) [2025-03-14 22:05:56,074 INFO L294 olderBase$Statistics]: this new event has 198 ancestors and is cut-off event [2025-03-14 22:05:56,074 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-03-14 22:05:56,074 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-03-14 22:05:56,074 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-03-14 22:05:56,668 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] thread1EXIT-->L103-1: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][2683], [292#L79-2true, 9582#true, thread2Thread1of1ForFork0InUse, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), 54#L103-1true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2NotInUse, 817#(<= ~n1~0 0), 8262#(<= ~n3~0 0), 2204#(= ~n1~0 0), 480#(<= ~n1~0 0), 9571#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 222#L63true, 8318#true, 1006#(and (or (and (or (= ~res3~0 0) (< ~n2~0 ~n1~0)) (<= ~res3~0 0) (= ~n1~0 ~n3~0)) (< ~n1~0 ~n2~0)) (or (< ~n1~0 0) (= ~n1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0))), 617#(and (or (< ~n1~0 0) (= ~n1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0)) (or (= ~n1~0 ~n3~0) (< ~n1~0 ~n2~0))), 4694#(and (<= ~n1~0 0) (<= (+ ~n1~0 1) ~n2~0)), 4705#true, 6948#true, 2457#(<= ~n1~0 0), 346#(= ~n1~0 0), 1061#(<= ~n1~0 0), 2330#(= ~n1~0 0), 6464#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 703#(= ~n1~0 0)]) [2025-03-14 22:05:56,668 INFO L294 olderBase$Statistics]: this new event has 199 ancestors and is cut-off event [2025-03-14 22:05:56,668 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2025-03-14 22:05:56,668 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2025-03-14 22:05:56,668 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2025-03-14 22:05:57,635 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] thread1EXIT-->L103-1: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][2683], [9582#true, thread2Thread1of1ForFork0InUse, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), 54#L103-1true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2NotInUse, 817#(<= ~n1~0 0), 8262#(<= ~n3~0 0), 2204#(= ~n1~0 0), 480#(<= ~n1~0 0), 9571#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 222#L63true, 8318#true, 1006#(and (or (and (or (= ~res3~0 0) (< ~n2~0 ~n1~0)) (<= ~res3~0 0) (= ~n1~0 ~n3~0)) (< ~n1~0 ~n2~0)) (or (< ~n1~0 0) (= ~n1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0))), 4694#(and (<= ~n1~0 0) (<= (+ ~n1~0 1) ~n2~0)), 617#(and (or (< ~n1~0 0) (= ~n1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0)) (or (= ~n1~0 ~n3~0) (< ~n1~0 ~n2~0))), 83#L83-2true, 4705#true, 6948#true, 2457#(<= ~n1~0 0), 346#(= ~n1~0 0), 1061#(<= ~n1~0 0), 2330#(= ~n1~0 0), 6464#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 703#(= ~n1~0 0)]) [2025-03-14 22:05:57,635 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is cut-off event [2025-03-14 22:05:57,635 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-03-14 22:05:57,635 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-03-14 22:05:57,636 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-03-14 22:05:57,636 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] thread1EXIT-->L103-1: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][2683], [9582#true, thread2Thread1of1ForFork0InUse, 54#L103-1true, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2NotInUse, 817#(<= ~n1~0 0), 8262#(<= ~n3~0 0), 2204#(= ~n1~0 0), 480#(<= ~n1~0 0), 9571#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 222#L63true, 8318#true, 1006#(and (or (and (or (= ~res3~0 0) (< ~n2~0 ~n1~0)) (<= ~res3~0 0) (= ~n1~0 ~n3~0)) (< ~n1~0 ~n2~0)) (or (< ~n1~0 0) (= ~n1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0))), 617#(and (or (< ~n1~0 0) (= ~n1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0)) (or (= ~n1~0 ~n3~0) (< ~n1~0 ~n2~0))), 4694#(and (<= ~n1~0 0) (<= (+ ~n1~0 1) ~n2~0)), 4705#true, 6948#true, 2457#(<= ~n1~0 0), 116#L80-2true, 346#(= ~n1~0 0), 1061#(<= ~n1~0 0), 2330#(= ~n1~0 0), 6464#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 703#(= ~n1~0 0)]) [2025-03-14 22:05:57,636 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is cut-off event [2025-03-14 22:05:57,636 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-03-14 22:05:57,636 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-03-14 22:05:57,636 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-03-14 22:05:57,900 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] thread1EXIT-->L103-1: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][2683], [9582#true, thread2Thread1of1ForFork0InUse, 54#L103-1true, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2NotInUse, 817#(<= ~n1~0 0), 8262#(<= ~n3~0 0), 2204#(= ~n1~0 0), 9571#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 480#(<= ~n1~0 0), 222#L63true, 8318#true, 1006#(and (or (and (or (= ~res3~0 0) (< ~n2~0 ~n1~0)) (<= ~res3~0 0) (= ~n1~0 ~n3~0)) (< ~n1~0 ~n2~0)) (or (< ~n1~0 0) (= ~n1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0))), 617#(and (or (< ~n1~0 0) (= ~n1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0)) (or (= ~n1~0 ~n3~0) (< ~n1~0 ~n2~0))), 4694#(and (<= ~n1~0 0) (<= (+ ~n1~0 1) ~n2~0)), 4705#true, 6948#true, 2457#(<= ~n1~0 0), 346#(= ~n1~0 0), 1061#(<= ~n1~0 0), 2330#(= ~n1~0 0), 64#L83-1true, 6464#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 703#(= ~n1~0 0)]) [2025-03-14 22:05:57,900 INFO L294 olderBase$Statistics]: this new event has 203 ancestors and is cut-off event [2025-03-14 22:05:57,900 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-14 22:05:57,900 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-14 22:05:57,900 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-14 22:05:57,900 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] thread1EXIT-->L103-1: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][2683], [9582#true, thread2Thread1of1ForFork0InUse, 54#L103-1true, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2NotInUse, 817#(<= ~n1~0 0), 8262#(<= ~n3~0 0), 2204#(= ~n1~0 0), 480#(<= ~n1~0 0), 9571#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 222#L63true, 327#L80-1true, 8318#true, 1006#(and (or (and (or (= ~res3~0 0) (< ~n2~0 ~n1~0)) (<= ~res3~0 0) (= ~n1~0 ~n3~0)) (< ~n1~0 ~n2~0)) (or (< ~n1~0 0) (= ~n1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0))), 4694#(and (<= ~n1~0 0) (<= (+ ~n1~0 1) ~n2~0)), 617#(and (or (< ~n1~0 0) (= ~n1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0)) (or (= ~n1~0 ~n3~0) (< ~n1~0 ~n2~0))), 4705#true, 6948#true, 2457#(<= ~n1~0 0), 346#(= ~n1~0 0), 1061#(<= ~n1~0 0), 2330#(= ~n1~0 0), 6464#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 703#(= ~n1~0 0)]) [2025-03-14 22:05:57,900 INFO L294 olderBase$Statistics]: this new event has 203 ancestors and is cut-off event [2025-03-14 22:05:57,900 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-14 22:05:57,901 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-14 22:05:57,901 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-14 22:05:58,168 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([946] thread1EXIT-->L103-1: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][2683], [9582#true, thread2Thread1of1ForFork0InUse, 54#L103-1true, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2NotInUse, 817#(<= ~n1~0 0), 8262#(<= ~n3~0 0), 2204#(= ~n1~0 0), 480#(<= ~n1~0 0), 9571#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 222#L63true, 8318#true, 1006#(and (or (and (or (= ~res3~0 0) (< ~n2~0 ~n1~0)) (<= ~res3~0 0) (= ~n1~0 ~n3~0)) (< ~n1~0 ~n2~0)) (or (< ~n1~0 0) (= ~n1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0))), 83#L83-2true, 617#(and (or (< ~n1~0 0) (= ~n1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0)) (or (= ~n1~0 ~n3~0) (< ~n1~0 ~n2~0))), 4694#(and (<= ~n1~0 0) (<= (+ ~n1~0 1) ~n2~0)), 4705#true, 6948#true, 2457#(<= ~n1~0 0), 346#(= ~n1~0 0), 1061#(<= ~n1~0 0), 2330#(= ~n1~0 0), 6464#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 703#(= ~n1~0 0)]) [2025-03-14 22:05:58,168 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is cut-off event [2025-03-14 22:05:58,169 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-03-14 22:05:58,169 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-03-14 22:05:58,169 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-03-14 22:05:58,169 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-03-14 22:05:58,170 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([946] thread1EXIT-->L103-1: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][2683], [9582#true, thread2Thread1of1ForFork0InUse, 54#L103-1true, 8207#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2NotInUse, 817#(<= ~n1~0 0), 8262#(<= ~n3~0 0), 2204#(= ~n1~0 0), 480#(<= ~n1~0 0), 9571#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 222#L63true, 8318#true, 1006#(and (or (and (or (= ~res3~0 0) (< ~n2~0 ~n1~0)) (<= ~res3~0 0) (= ~n1~0 ~n3~0)) (< ~n1~0 ~n2~0)) (or (< ~n1~0 0) (= ~n1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0))), 617#(and (or (< ~n1~0 0) (= ~n1~0 0)) (or (= ~n1~0 0) (< ~n1~0 ~n2~0)) (or (= ~n1~0 ~n3~0) (< ~n1~0 ~n2~0))), 4694#(and (<= ~n1~0 0) (<= (+ ~n1~0 1) ~n2~0)), 4705#true, 6948#true, 2457#(<= ~n1~0 0), 116#L80-2true, 346#(= ~n1~0 0), 1061#(<= ~n1~0 0), 2330#(= ~n1~0 0), 6464#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n2~0) (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~n1~0)), 703#(= ~n1~0 0)]) [2025-03-14 22:05:58,170 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is cut-off event [2025-03-14 22:05:58,170 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-03-14 22:05:58,170 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-03-14 22:05:58,170 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-03-14 22:05:58,170 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event