/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 ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:12:57,085 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:12:57,135 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 20:12:57,138 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:12:57,139 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:12:57,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:12:57,160 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:12:57,160 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:12:57,160 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:12:57,160 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:12:57,161 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:12:57,161 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:12:57,161 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:12:57,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:12:57,161 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:12:57,161 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:12:57,161 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:12:57,161 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:12:57,161 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:12:57,161 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:12:57,161 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:12:57,161 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:12:57,161 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:12:57,161 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:12:57,162 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:12:57,162 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:12:57,162 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:12:57,162 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:12:57,162 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:12:57,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:12:57,162 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:12:57,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:12:57,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:12:57,162 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:12:57,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:12:57,162 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:12:57,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:12:57,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:12:57,162 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:12:57,162 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:12:57,162 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:12:57,162 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:12:57,162 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:12:57,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:12:57,163 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:12:57,163 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:12:57,163 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:12:57,163 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 20:12:57,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:12:57,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:12:57,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:12:57,403 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:12:57,404 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:12:57,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c [2025-04-13 20:12:58,694 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2002c7faa/63d726facb054d74b1c4e29fa6f0e350/FLAGb11c8acbf [2025-04-13 20:12:58,887 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:12:58,888 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c [2025-04-13 20:12:58,893 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2002c7faa/63d726facb054d74b1c4e29fa6f0e350/FLAGb11c8acbf [2025-04-13 20:12:59,745 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2002c7faa/63d726facb054d74b1c4e29fa6f0e350 [2025-04-13 20:12:59,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:12:59,748 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:12:59,748 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:12:59,749 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:12:59,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:12:59,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:12:59" (1/1) ... [2025-04-13 20:12:59,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db589ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:12:59, skipping insertion in model container [2025-04-13 20:12:59,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:12:59" (1/1) ... [2025-04-13 20:12:59,765 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:12:59,947 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/parallel-bakery-3.wvr.c[3633,3646] [2025-04-13 20:12:59,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:12:59,961 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:13:00,005 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/parallel-bakery-3.wvr.c[3633,3646] [2025-04-13 20:13:00,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:13:00,026 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:13:00,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:13:00 WrapperNode [2025-04-13 20:13:00,026 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:13:00,027 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:13:00,027 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:13:00,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:13:00,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:13:00" (1/1) ... [2025-04-13 20:13:00,040 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:13:00" (1/1) ... [2025-04-13 20:13:00,059 INFO L138 Inliner]: procedures = 19, calls = 23, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 238 [2025-04-13 20:13:00,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:13:00,061 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:13:00,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:13:00,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:13:00,067 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:13:00" (1/1) ... [2025-04-13 20:13:00,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:13:00" (1/1) ... [2025-04-13 20:13:00,070 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:13:00" (1/1) ... [2025-04-13 20:13:00,083 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 20:13:00,084 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:13:00" (1/1) ... [2025-04-13 20:13:00,084 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:13:00" (1/1) ... [2025-04-13 20:13:00,087 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:13:00" (1/1) ... [2025-04-13 20:13:00,088 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:13:00" (1/1) ... [2025-04-13 20:13:00,089 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:13:00" (1/1) ... [2025-04-13 20:13:00,090 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:13:00" (1/1) ... [2025-04-13 20:13:00,090 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:13:00" (1/1) ... [2025-04-13 20:13:00,094 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:13:00,094 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:13:00,094 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:13:00,094 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:13:00,096 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:13:00" (1/1) ... [2025-04-13 20:13:00,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:13:00,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:13:00,120 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 20:13:00,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 20:13:00,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:13:00,138 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:13:00,138 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:13:00,138 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:13:00,138 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:13:00,138 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:13:00,138 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:13:00,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:13:00,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:13:00,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:13:00,139 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:13:00,218 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:13:00,219 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:13:00,478 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:13:00,479 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:13:00,479 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:13:00,628 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:13:00,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:13:00 BoogieIcfgContainer [2025-04-13 20:13:00,629 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:13:00,630 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:13:00,630 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:13:00,633 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:13:00,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:12:59" (1/3) ... [2025-04-13 20:13:00,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e94dede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:13:00, skipping insertion in model container [2025-04-13 20:13:00,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:13:00" (2/3) ... [2025-04-13 20:13:00,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e94dede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:13:00, skipping insertion in model container [2025-04-13 20:13:00,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:13:00" (3/3) ... [2025-04-13 20:13:00,635 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-bakery-3.wvr.c [2025-04-13 20:13:00,657 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:13:00,659 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-bakery-3.wvr.c that has 4 procedures, 78 locations, 80 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 20:13:00,659 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:13:00,707 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 20:13:00,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 83 transitions, 187 flow [2025-04-13 20:13:00,772 INFO L116 PetriNetUnfolderBase]: 6/80 cut-off events. [2025-04-13 20:13:00,775 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:13:00,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 80 events. 6/80 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 118 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2025-04-13 20:13:00,778 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 83 transitions, 187 flow [2025-04-13 20:13:00,780 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 79 transitions, 176 flow [2025-04-13 20:13:00,788 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:13:00,797 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4f4ae6ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:13:00,797 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 20:13:00,817 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:13:00,817 INFO L116 PetriNetUnfolderBase]: 6/78 cut-off events. [2025-04-13 20:13:00,817 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:13:00,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:00,818 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:00,818 INFO L403 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-04-13 20:13:00,822 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:00,822 INFO L85 PathProgramCache]: Analyzing trace with hash 388598440, now seen corresponding path program 1 times [2025-04-13 20:13:00,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:00,827 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740194815] [2025-04-13 20:13:00,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:13:00,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:00,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-13 20:13:00,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 20:13:00,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:13:00,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:01,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:13:01,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:01,376 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740194815] [2025-04-13 20:13:01,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740194815] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:13:01,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:13:01,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:13:01,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281405170] [2025-04-13 20:13:01,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:13:01,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:13:01,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:01,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:13:01,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:13:01,471 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 83 [2025-04-13 20:13:01,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 176 flow. Second operand has 9 states, 9 states have (on average 32.44444444444444) internal successors, (292), 9 states have internal predecessors, (292), 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-04-13 20:13:01,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:01,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 83 [2025-04-13 20:13:01,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:02,862 INFO L116 PetriNetUnfolderBase]: 7915/13147 cut-off events. [2025-04-13 20:13:02,863 INFO L117 PetriNetUnfolderBase]: For 547/547 co-relation queries the response was YES. [2025-04-13 20:13:02,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25051 conditions, 13147 events. 7915/13147 cut-off events. For 547/547 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 91102 event pairs, 3351 based on Foata normal form. 1/11277 useless extension candidates. Maximal degree in co-relation 23528. Up to 4572 conditions per place. [2025-04-13 20:13:02,939 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 176 selfloop transitions, 18 changer transitions 16/234 dead transitions. [2025-04-13 20:13:02,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 234 transitions, 960 flow [2025-04-13 20:13:02,941 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 20:13:02,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 20:13:02,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 508 transitions. [2025-04-13 20:13:02,953 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.556407447973713 [2025-04-13 20:13:02,954 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 176 flow. Second operand 11 states and 508 transitions. [2025-04-13 20:13:02,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 234 transitions, 960 flow [2025-04-13 20:13:02,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 234 transitions, 912 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 20:13:02,975 INFO L231 Difference]: Finished difference. Result has 91 places, 95 transitions, 262 flow [2025-04-13 20:13:02,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=262, PETRI_PLACES=91, PETRI_TRANSITIONS=95} [2025-04-13 20:13:02,980 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 8 predicate places. [2025-04-13 20:13:02,980 INFO L485 AbstractCegarLoop]: Abstraction has has 91 places, 95 transitions, 262 flow [2025-04-13 20:13:02,980 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 32.44444444444444) internal successors, (292), 9 states have internal predecessors, (292), 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-04-13 20:13:02,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:02,980 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:02,981 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:13:02,981 INFO L403 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-04-13 20:13:02,981 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:02,981 INFO L85 PathProgramCache]: Analyzing trace with hash -645292502, now seen corresponding path program 2 times [2025-04-13 20:13:02,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:02,981 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543682041] [2025-04-13 20:13:02,981 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:13:02,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:02,995 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 1 equivalence classes. [2025-04-13 20:13:03,013 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 20:13:03,013 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:13:03,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:03,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:13:03,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:03,148 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543682041] [2025-04-13 20:13:03,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543682041] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:13:03,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:13:03,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:13:03,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013238392] [2025-04-13 20:13:03,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:13:03,149 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:13:03,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:03,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:13:03,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:13:03,156 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-04-13 20:13:03,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 95 transitions, 262 flow. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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-04-13 20:13:03,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:03,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-04-13 20:13:03,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:04,126 INFO L116 PetriNetUnfolderBase]: 9845/16823 cut-off events. [2025-04-13 20:13:04,127 INFO L117 PetriNetUnfolderBase]: For 339/343 co-relation queries the response was YES. [2025-04-13 20:13:04,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33039 conditions, 16823 events. 9845/16823 cut-off events. For 339/343 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 126918 event pairs, 1865 based on Foata normal form. 0/14514 useless extension candidates. Maximal degree in co-relation 33017. Up to 9323 conditions per place. [2025-04-13 20:13:04,227 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 97 selfloop transitions, 20 changer transitions 0/159 dead transitions. [2025-04-13 20:13:04,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 159 transitions, 629 flow [2025-04-13 20:13:04,227 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:13:04,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:13:04,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 236 transitions. [2025-04-13 20:13:04,228 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7108433734939759 [2025-04-13 20:13:04,229 INFO L175 Difference]: Start difference. First operand has 91 places, 95 transitions, 262 flow. Second operand 4 states and 236 transitions. [2025-04-13 20:13:04,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 159 transitions, 629 flow [2025-04-13 20:13:04,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 159 transitions, 627 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 20:13:04,236 INFO L231 Difference]: Finished difference. Result has 94 places, 112 transitions, 400 flow [2025-04-13 20:13:04,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=400, PETRI_PLACES=94, PETRI_TRANSITIONS=112} [2025-04-13 20:13:04,237 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 11 predicate places. [2025-04-13 20:13:04,237 INFO L485 AbstractCegarLoop]: Abstraction has has 94 places, 112 transitions, 400 flow [2025-04-13 20:13:04,237 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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-04-13 20:13:04,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:04,237 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:04,237 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:13:04,237 INFO L403 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-04-13 20:13:04,242 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:04,242 INFO L85 PathProgramCache]: Analyzing trace with hash -411329666, now seen corresponding path program 3 times [2025-04-13 20:13:04,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:04,242 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676506725] [2025-04-13 20:13:04,242 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:13:04,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:04,256 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 1 equivalence classes. [2025-04-13 20:13:04,273 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 20:13:04,273 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:13:04,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:04,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:13:04,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:04,369 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676506725] [2025-04-13 20:13:04,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676506725] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:13:04,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:13:04,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:13:04,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298650081] [2025-04-13 20:13:04,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:13:04,369 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:13:04,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:04,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:13:04,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:13:04,371 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2025-04-13 20:13:04,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 112 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-04-13 20:13:04,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:04,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2025-04-13 20:13:04,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:05,059 INFO L116 PetriNetUnfolderBase]: 8116/14617 cut-off events. [2025-04-13 20:13:05,059 INFO L117 PetriNetUnfolderBase]: For 3728/3986 co-relation queries the response was YES. [2025-04-13 20:13:05,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33569 conditions, 14617 events. 8116/14617 cut-off events. For 3728/3986 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 115872 event pairs, 3676 based on Foata normal form. 450/13405 useless extension candidates. Maximal degree in co-relation 25632. Up to 5904 conditions per place. [2025-04-13 20:13:05,118 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 71 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2025-04-13 20:13:05,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 131 transitions, 602 flow [2025-04-13 20:13:05,119 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:13:05,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:13:05,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2025-04-13 20:13:05,119 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.678714859437751 [2025-04-13 20:13:05,120 INFO L175 Difference]: Start difference. First operand has 94 places, 112 transitions, 400 flow. Second operand 3 states and 169 transitions. [2025-04-13 20:13:05,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 131 transitions, 602 flow [2025-04-13 20:13:05,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 131 transitions, 602 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 20:13:05,125 INFO L231 Difference]: Finished difference. Result has 97 places, 112 transitions, 410 flow [2025-04-13 20:13:05,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=97, PETRI_TRANSITIONS=112} [2025-04-13 20:13:05,126 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 14 predicate places. [2025-04-13 20:13:05,126 INFO L485 AbstractCegarLoop]: Abstraction has has 97 places, 112 transitions, 410 flow [2025-04-13 20:13:05,126 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-04-13 20:13:05,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:05,126 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:05,126 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:13:05,126 INFO L403 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-04-13 20:13:05,126 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:05,127 INFO L85 PathProgramCache]: Analyzing trace with hash -857134182, now seen corresponding path program 4 times [2025-04-13 20:13:05,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:05,127 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34668663] [2025-04-13 20:13:05,127 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:13:05,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:05,134 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 67 statements into 2 equivalence classes. [2025-04-13 20:13:05,143 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 20:13:05,143 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:13:05,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:05,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:13:05,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:05,371 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34668663] [2025-04-13 20:13:05,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34668663] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:13:05,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:13:05,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:13:05,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459933909] [2025-04-13 20:13:05,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:13:05,371 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:13:05,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:05,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:13:05,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:13:05,409 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 83 [2025-04-13 20:13:05,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 112 transitions, 410 flow. Second operand has 9 states, 9 states have (on average 32.44444444444444) internal successors, (292), 9 states have internal predecessors, (292), 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-04-13 20:13:05,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:05,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 83 [2025-04-13 20:13:05,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:07,278 INFO L116 PetriNetUnfolderBase]: 15698/25980 cut-off events. [2025-04-13 20:13:07,281 INFO L117 PetriNetUnfolderBase]: For 9546/9833 co-relation queries the response was YES. [2025-04-13 20:13:07,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63772 conditions, 25980 events. 15698/25980 cut-off events. For 9546/9833 co-relation queries the response was YES. Maximal size of possible extension queue 719. Compared 198641 event pairs, 5170 based on Foata normal form. 224/24165 useless extension candidates. Maximal degree in co-relation 33379. Up to 6886 conditions per place. [2025-04-13 20:13:07,380 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 225 selfloop transitions, 29 changer transitions 15/304 dead transitions. [2025-04-13 20:13:07,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 304 transitions, 1584 flow [2025-04-13 20:13:07,381 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 20:13:07,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 20:13:07,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 522 transitions. [2025-04-13 20:13:07,382 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5717415115005476 [2025-04-13 20:13:07,382 INFO L175 Difference]: Start difference. First operand has 97 places, 112 transitions, 410 flow. Second operand 11 states and 522 transitions. [2025-04-13 20:13:07,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 304 transitions, 1584 flow [2025-04-13 20:13:07,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 304 transitions, 1580 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:13:07,402 INFO L231 Difference]: Finished difference. Result has 111 places, 133 transitions, 621 flow [2025-04-13 20:13:07,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=621, PETRI_PLACES=111, PETRI_TRANSITIONS=133} [2025-04-13 20:13:07,403 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 28 predicate places. [2025-04-13 20:13:07,403 INFO L485 AbstractCegarLoop]: Abstraction has has 111 places, 133 transitions, 621 flow [2025-04-13 20:13:07,403 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 32.44444444444444) internal successors, (292), 9 states have internal predecessors, (292), 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-04-13 20:13:07,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:07,403 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:07,404 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:13:07,404 INFO L403 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-04-13 20:13:07,405 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:07,405 INFO L85 PathProgramCache]: Analyzing trace with hash 688584512, now seen corresponding path program 5 times [2025-04-13 20:13:07,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:07,405 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684092947] [2025-04-13 20:13:07,405 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:13:07,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:07,413 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 67 statements into 1 equivalence classes. [2025-04-13 20:13:07,423 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 20:13:07,423 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:13:07,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:07,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:13:07,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:07,500 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684092947] [2025-04-13 20:13:07,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684092947] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:13:07,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:13:07,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:13:07,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682405110] [2025-04-13 20:13:07,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:13:07,500 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:13:07,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:07,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:13:07,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:13:07,508 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-04-13 20:13:07,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 133 transitions, 621 flow. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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-04-13 20:13:07,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:07,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-04-13 20:13:07,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:09,035 INFO L116 PetriNetUnfolderBase]: 17377/30315 cut-off events. [2025-04-13 20:13:09,035 INFO L117 PetriNetUnfolderBase]: For 15768/16621 co-relation queries the response was YES. [2025-04-13 20:13:09,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76752 conditions, 30315 events. 17377/30315 cut-off events. For 15768/16621 co-relation queries the response was YES. Maximal size of possible extension queue 967. Compared 255440 event pairs, 3456 based on Foata normal form. 263/28064 useless extension candidates. Maximal degree in co-relation 76693. Up to 17879 conditions per place. [2025-04-13 20:13:09,161 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 120 selfloop transitions, 36 changer transitions 0/224 dead transitions. [2025-04-13 20:13:09,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 224 transitions, 1265 flow [2025-04-13 20:13:09,161 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:13:09,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:13:09,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-04-13 20:13:09,162 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7198795180722891 [2025-04-13 20:13:09,162 INFO L175 Difference]: Start difference. First operand has 111 places, 133 transitions, 621 flow. Second operand 4 states and 239 transitions. [2025-04-13 20:13:09,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 224 transitions, 1265 flow [2025-04-13 20:13:09,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 224 transitions, 1259 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-13 20:13:09,279 INFO L231 Difference]: Finished difference. Result has 114 places, 166 transitions, 947 flow [2025-04-13 20:13:09,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=947, PETRI_PLACES=114, PETRI_TRANSITIONS=166} [2025-04-13 20:13:09,280 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 31 predicate places. [2025-04-13 20:13:09,280 INFO L485 AbstractCegarLoop]: Abstraction has has 114 places, 166 transitions, 947 flow [2025-04-13 20:13:09,280 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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-04-13 20:13:09,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:09,280 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:09,280 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:13:09,280 INFO L403 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-04-13 20:13:09,281 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:09,281 INFO L85 PathProgramCache]: Analyzing trace with hash 200033184, now seen corresponding path program 6 times [2025-04-13 20:13:09,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:09,281 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259189050] [2025-04-13 20:13:09,281 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:13:09,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:09,288 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 67 statements into 1 equivalence classes. [2025-04-13 20:13:09,298 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 20:13:09,298 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:13:09,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:09,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:13:09,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:09,407 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259189050] [2025-04-13 20:13:09,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259189050] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:13:09,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:13:09,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:13:09,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793451494] [2025-04-13 20:13:09,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:13:09,408 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:13:09,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:09,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:13:09,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:13:09,414 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-04-13 20:13:09,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 166 transitions, 947 flow. Second operand has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 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-04-13 20:13:09,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:09,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-04-13 20:13:09,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:11,329 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][216], [24#thread3EXITtrue, Black: 132#(= ~i1~0 0), 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 33#L131-4true, Black: 120#(<= ~n3~0 ~n2~0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), Black: 92#(= ~i~0 0), 159#true, 118#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 39#L80true, Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), 129#true, 19#L56true, Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:11,329 INFO L286 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2025-04-13 20:13:11,329 INFO L289 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2025-04-13 20:13:11,329 INFO L289 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2025-04-13 20:13:11,329 INFO L289 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2025-04-13 20:13:11,398 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][216], [24#thread3EXITtrue, 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 132#(= ~i1~0 0), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), Black: 92#(= ~i~0 0), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 159#true, 118#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 39#L80true, Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), 19#L56true, 129#true, Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:11,399 INFO L286 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2025-04-13 20:13:11,399 INFO L289 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2025-04-13 20:13:11,399 INFO L289 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2025-04-13 20:13:11,399 INFO L289 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2025-04-13 20:13:11,411 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][196], [18#L106true, Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 120#(<= ~n3~0 ~n2~0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), 80#L82true, Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 92#(= ~i~0 0), 159#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 129#true, 19#L56true, 93#(= ~i3~0 0), Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:11,411 INFO L286 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2025-04-13 20:13:11,411 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:11,411 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:11,411 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:11,412 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][199], [18#L106true, Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 120#(<= ~n3~0 ~n2~0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 92#(= ~i~0 0), 118#true, 159#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 39#L80true, Black: 127#(= ~e3~0 1), 129#true, 68#L58true, Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:11,412 INFO L286 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2025-04-13 20:13:11,412 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:11,412 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:11,412 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:11,483 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][196], [18#L106true, Black: 132#(= ~i1~0 0), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), 80#L82true, Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 92#(= ~i~0 0), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 159#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 19#L56true, 129#true, 93#(= ~i3~0 0), Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:11,484 INFO L286 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2025-04-13 20:13:11,484 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:11,484 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:11,484 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:11,484 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][199], [18#L106true, Black: 132#(= ~i1~0 0), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 166#true, Black: 92#(= ~i~0 0), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 159#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 39#L80true, Black: 127#(= ~e3~0 1), 129#true, 68#L58true, Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:11,484 INFO L286 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2025-04-13 20:13:11,484 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:11,484 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:11,484 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:11,495 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][199], [18#L106true, Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 120#(<= ~n3~0 ~n2~0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 6#L80-1true, 166#true, Black: 92#(= ~i~0 0), 118#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 159#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 129#true, 68#L58true, Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:11,495 INFO L286 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2025-04-13 20:13:11,495 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:11,495 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:11,495 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:11,495 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][196], [18#L106true, Black: 132#(= ~i1~0 0), 33#L131-4true, 20#L56-1true, Black: 120#(<= ~n3~0 ~n2~0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), 80#L82true, Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 92#(= ~i~0 0), 109#(and (= ~i3~0 0) (= ~i1~0 1)), 159#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 129#true, Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:11,495 INFO L286 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2025-04-13 20:13:11,495 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:11,495 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:11,495 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:11,554 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][199], [18#L106true, Black: 132#(= ~i1~0 0), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 6#L80-1true, 166#true, Black: 92#(= ~i~0 0), 159#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 129#true, 68#L58true, Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:11,555 INFO L286 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2025-04-13 20:13:11,555 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:11,555 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:11,555 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:11,555 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][196], [18#L106true, Black: 132#(= ~i1~0 0), 20#L56-1true, 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), 80#L82true, Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 92#(= ~i~0 0), 109#(and (= ~i3~0 0) (= ~i1~0 1)), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 159#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 129#true, Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:11,555 INFO L286 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2025-04-13 20:13:11,555 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:11,555 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:11,555 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:11,562 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][199], [18#L106true, Black: 132#(= ~i1~0 0), 33#L131-4true, 37#L81true, Black: 120#(<= ~n3~0 ~n2~0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 92#(= ~i~0 0), 118#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 159#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 93#(= ~i3~0 0), 129#true, 68#L58true, Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:11,562 INFO L286 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2025-04-13 20:13:11,562 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:11,562 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:11,562 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:11,562 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][196], [18#L106true, Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 120#(<= ~n3~0 ~n2~0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), 80#L82true, Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, 109#(and (= ~i3~0 0) (= ~i1~0 1)), Black: 92#(= ~i~0 0), 159#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), 38#L57true, Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 129#true, Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:11,563 INFO L286 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2025-04-13 20:13:11,563 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:11,563 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:11,563 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:11,563 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][199], [18#L106true, Black: 132#(= ~i1~0 0), 33#L131-4true, 37#L81true, Black: 120#(<= ~n3~0 ~n2~0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 92#(= ~i~0 0), 118#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 159#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 129#true, 68#L58true, Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:11,563 INFO L286 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2025-04-13 20:13:11,563 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:11,563 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:11,563 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:11,605 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][199], [18#L106true, Black: 132#(= ~i1~0 0), 37#L81true, 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 92#(= ~i~0 0), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 159#true, 118#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 93#(= ~i3~0 0), 129#true, 68#L58true, Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:11,605 INFO L286 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2025-04-13 20:13:11,605 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:11,605 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:11,606 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:11,606 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][196], [18#L106true, Black: 132#(= ~i1~0 0), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), 80#L82true, Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, 109#(and (= ~i3~0 0) (= ~i1~0 1)), Black: 92#(= ~i~0 0), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 159#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), 38#L57true, Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 129#true, Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:11,606 INFO L286 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2025-04-13 20:13:11,606 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:11,606 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:11,606 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:11,606 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][199], [18#L106true, Black: 132#(= ~i1~0 0), 37#L81true, 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 92#(= ~i~0 0), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 159#true, 118#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 129#true, 68#L58true, Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:11,606 INFO L286 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2025-04-13 20:13:11,606 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:11,606 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:11,606 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:11,694 INFO L116 PetriNetUnfolderBase]: 17949/32275 cut-off events. [2025-04-13 20:13:11,694 INFO L117 PetriNetUnfolderBase]: For 32777/33572 co-relation queries the response was YES. [2025-04-13 20:13:11,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93563 conditions, 32275 events. 17949/32275 cut-off events. For 32777/33572 co-relation queries the response was YES. Maximal size of possible extension queue 1255. Compared 287204 event pairs, 4306 based on Foata normal form. 223/30432 useless extension candidates. Maximal degree in co-relation 85873. Up to 19209 conditions per place. [2025-04-13 20:13:11,878 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 138 selfloop transitions, 25 changer transitions 0/248 dead transitions. [2025-04-13 20:13:11,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 248 transitions, 1631 flow [2025-04-13 20:13:11,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:13:11,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:13:11,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 260 transitions. [2025-04-13 20:13:11,880 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6265060240963856 [2025-04-13 20:13:11,880 INFO L175 Difference]: Start difference. First operand has 114 places, 166 transitions, 947 flow. Second operand 5 states and 260 transitions. [2025-04-13 20:13:11,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 248 transitions, 1631 flow [2025-04-13 20:13:12,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 248 transitions, 1631 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 20:13:12,136 INFO L231 Difference]: Finished difference. Result has 121 places, 186 transitions, 1158 flow [2025-04-13 20:13:12,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1158, PETRI_PLACES=121, PETRI_TRANSITIONS=186} [2025-04-13 20:13:12,136 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 38 predicate places. [2025-04-13 20:13:12,136 INFO L485 AbstractCegarLoop]: Abstraction has has 121 places, 186 transitions, 1158 flow [2025-04-13 20:13:12,136 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 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-04-13 20:13:12,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:12,137 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:12,137 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:13:12,137 INFO L403 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-04-13 20:13:12,137 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:12,137 INFO L85 PathProgramCache]: Analyzing trace with hash -342691494, now seen corresponding path program 7 times [2025-04-13 20:13:12,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:12,137 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922120927] [2025-04-13 20:13:12,137 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:13:12,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:12,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-13 20:13:12,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 20:13:12,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:13:12,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:12,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:13:12,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:12,196 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922120927] [2025-04-13 20:13:12,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922120927] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:13:12,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:13:12,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:13:12,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557072786] [2025-04-13 20:13:12,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:13:12,197 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:13:12,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:12,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:13:12,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:13:12,200 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2025-04-13 20:13:12,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 186 transitions, 1158 flow. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-04-13 20:13:12,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:12,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2025-04-13 20:13:12,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:12,887 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([658] L82-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset][117], [Black: 132#(= ~i1~0 0), 33#L131-4true, 161#(<= ~n3~0 ~n1~0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), 63#thread2EXITtrue, Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 90#true, Black: 159#true, 21#L45-3true, 48#L91-3true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 129#true]) [2025-04-13 20:13:12,887 INFO L286 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2025-04-13 20:13:12,887 INFO L289 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2025-04-13 20:13:12,887 INFO L289 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2025-04-13 20:13:12,887 INFO L289 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2025-04-13 20:13:12,934 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([664] L91-3-->L93-1: Formula: (and (= |v_thread3Thread1of1ForFork1_~tmp2~1#1_3| v_~n2~0_125) (< v_~n3~0_115 |v_thread3Thread1of1ForFork1_~tmp2~1#1_3|)) InVars {~n2~0=v_~n2~0_125, ~n3~0=v_~n3~0_115} OutVars{~n2~0=v_~n2~0_125, thread3Thread1of1ForFork1_~tmp2~1#1=|v_thread3Thread1of1ForFork1_~tmp2~1#1_3|, ~n3~0=v_~n3~0_115} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~tmp2~1#1][59], [Black: 132#(= ~i1~0 0), 33#L131-4true, 161#(<= ~n3~0 ~n1~0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), 90#true, Black: 159#true, 21#L45-3true, 121#(<= (+ ~n3~0 1) ~n2~0), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 80#L82true, Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 118#true, 76#L93-1true, 129#true]) [2025-04-13 20:13:12,934 INFO L286 olderBase$Statistics]: this new event has 45 ancestors and is not cut-off event [2025-04-13 20:13:12,934 INFO L289 olderBase$Statistics]: existing Event has 45 ancestors and is not cut-off event [2025-04-13 20:13:12,934 INFO L289 olderBase$Statistics]: existing Event has 46 ancestors and is not cut-off event [2025-04-13 20:13:12,934 INFO L289 olderBase$Statistics]: existing Event has 46 ancestors and is not cut-off event [2025-04-13 20:13:12,935 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([635] L45-3-->L46-1: Formula: (and (= v_~n1~0_21 (+ |v_thread1Thread1of1ForFork2_#t~post1#1_1| 1)) (= v_~n1~0_22 |v_thread1Thread1of1ForFork2_#t~post1#1_1|)) InVars {~n1~0=v_~n1~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_1|, ~n1~0=v_~n1~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, ~n1~0][121], [Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 90#true, Black: 159#true, 48#L91-3true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 162#(<= (+ ~n3~0 1) ~n1~0), Black: 120#(<= ~n3~0 ~n2~0), 80#L82true, Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 64#L46-1true, 129#true, Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:12,935 INFO L286 olderBase$Statistics]: this new event has 45 ancestors and is not cut-off event [2025-04-13 20:13:12,935 INFO L289 olderBase$Statistics]: existing Event has 45 ancestors and is not cut-off event [2025-04-13 20:13:12,935 INFO L289 olderBase$Statistics]: existing Event has 46 ancestors and is not cut-off event [2025-04-13 20:13:12,935 INFO L289 olderBase$Statistics]: existing Event has 46 ancestors and is not cut-off event [2025-04-13 20:13:12,948 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([658] L82-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset][117], [Black: 132#(= ~i1~0 0), 161#(<= ~n3~0 ~n1~0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), 63#thread2EXITtrue, Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 90#true, Black: 159#true, 21#L45-3true, 48#L91-3true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true]) [2025-04-13 20:13:12,949 INFO L286 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2025-04-13 20:13:12,949 INFO L289 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2025-04-13 20:13:12,949 INFO L289 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2025-04-13 20:13:12,949 INFO L289 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2025-04-13 20:13:12,993 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([664] L91-3-->L93-1: Formula: (and (= |v_thread3Thread1of1ForFork1_~tmp2~1#1_3| v_~n2~0_125) (< v_~n3~0_115 |v_thread3Thread1of1ForFork1_~tmp2~1#1_3|)) InVars {~n2~0=v_~n2~0_125, ~n3~0=v_~n3~0_115} OutVars{~n2~0=v_~n2~0_125, thread3Thread1of1ForFork1_~tmp2~1#1=|v_thread3Thread1of1ForFork1_~tmp2~1#1_3|, ~n3~0=v_~n3~0_115} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~tmp2~1#1][59], [Black: 132#(= ~i1~0 0), 161#(<= ~n3~0 ~n1~0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), 90#true, Black: 159#true, 21#L45-3true, 121#(<= (+ ~n3~0 1) ~n2~0), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 73#L132true, 80#L82true, Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 118#true, 76#L93-1true, 129#true]) [2025-04-13 20:13:12,993 INFO L286 olderBase$Statistics]: this new event has 46 ancestors and is not cut-off event [2025-04-13 20:13:12,993 INFO L289 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2025-04-13 20:13:12,993 INFO L289 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2025-04-13 20:13:12,993 INFO L289 olderBase$Statistics]: existing Event has 46 ancestors and is not cut-off event [2025-04-13 20:13:12,993 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([635] L45-3-->L46-1: Formula: (and (= v_~n1~0_21 (+ |v_thread1Thread1of1ForFork2_#t~post1#1_1| 1)) (= v_~n1~0_22 |v_thread1Thread1of1ForFork2_#t~post1#1_1|)) InVars {~n1~0=v_~n1~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_1|, ~n1~0=v_~n1~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, ~n1~0][121], [Black: 132#(= ~i1~0 0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 90#true, Black: 159#true, 48#L91-3true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 162#(<= (+ ~n3~0 1) ~n1~0), Black: 120#(<= ~n3~0 ~n2~0), 73#L132true, 80#L82true, Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 64#L46-1true, 129#true, Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:12,993 INFO L286 olderBase$Statistics]: this new event has 46 ancestors and is not cut-off event [2025-04-13 20:13:12,993 INFO L289 olderBase$Statistics]: existing Event has 46 ancestors and is not cut-off event [2025-04-13 20:13:12,993 INFO L289 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2025-04-13 20:13:12,993 INFO L289 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2025-04-13 20:13:13,195 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([633] L43-3-->L45-3: Formula: (and (= |v_thread1Thread1of1ForFork2_~tmp3~0#1_5| v_~n3~0_113) (<= |v_thread1Thread1of1ForFork2_~tmp3~0#1_5| v_~n1~0_137)) InVars {~n3~0=v_~n3~0_113, ~n1~0=v_~n1~0_137} OutVars{thread1Thread1of1ForFork2_~tmp3~0#1=|v_thread1Thread1of1ForFork2_~tmp3~0#1_5|, ~n3~0=v_~n3~0_113, ~n1~0=v_~n1~0_137} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~tmp3~0#1][84], [18#L106true, Black: 132#(= ~i1~0 0), 33#L131-4true, 161#(<= ~n3~0 ~n1~0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), 69#L71-1true, Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 159#true, Black: 127#(= ~e3~0 1), 21#L45-3true, 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true]) [2025-04-13 20:13:13,195 INFO L286 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2025-04-13 20:13:13,195 INFO L289 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2025-04-13 20:13:13,195 INFO L289 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2025-04-13 20:13:13,195 INFO L289 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2025-04-13 20:13:13,224 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([667] L93-3-->L94-1: Formula: (and (= v_~n3~0_19 (+ |v_thread3Thread1of1ForFork1_#t~post3#1_1| 1)) (= |v_thread3Thread1of1ForFork1_#t~post3#1_1| v_~n3~0_20)) InVars {~n3~0=v_~n3~0_20} OutVars{thread3Thread1of1ForFork1_#t~post3#1=|v_thread3Thread1of1ForFork1_#t~post3#1_1|, ~n3~0=v_~n3~0_19} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post3#1, ~n3~0][68], [Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), 166#true, Black: 92#(= ~i~0 0), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), 69#L71-1true, Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 90#true, 12#L94-1true, 68#L58true, 142#(and (= ~i1~0 0) (= ~i~0 1)), Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:13,224 INFO L286 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2025-04-13 20:13:13,224 INFO L289 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2025-04-13 20:13:13,224 INFO L289 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2025-04-13 20:13:13,224 INFO L289 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2025-04-13 20:13:13,260 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([633] L43-3-->L45-3: Formula: (and (= |v_thread1Thread1of1ForFork2_~tmp3~0#1_5| v_~n3~0_113) (<= |v_thread1Thread1of1ForFork2_~tmp3~0#1_5| v_~n1~0_137)) InVars {~n3~0=v_~n3~0_113, ~n1~0=v_~n1~0_137} OutVars{thread1Thread1of1ForFork2_~tmp3~0#1=|v_thread1Thread1of1ForFork2_~tmp3~0#1_5|, ~n3~0=v_~n3~0_113, ~n1~0=v_~n1~0_137} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~tmp3~0#1][84], [18#L106true, Black: 132#(= ~i1~0 0), 161#(<= ~n3~0 ~n1~0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, 118#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), 69#L71-1true, Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 159#true, 21#L45-3true, Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 73#L132true, Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true]) [2025-04-13 20:13:13,260 INFO L286 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2025-04-13 20:13:13,261 INFO L289 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2025-04-13 20:13:13,261 INFO L289 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2025-04-13 20:13:13,261 INFO L289 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2025-04-13 20:13:13,265 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([633] L43-3-->L45-3: Formula: (and (= |v_thread1Thread1of1ForFork2_~tmp3~0#1_5| v_~n3~0_113) (<= |v_thread1Thread1of1ForFork2_~tmp3~0#1_5| v_~n1~0_137)) InVars {~n3~0=v_~n3~0_113, ~n1~0=v_~n1~0_137} OutVars{thread1Thread1of1ForFork2_~tmp3~0#1=|v_thread1Thread1of1ForFork2_~tmp3~0#1_5|, ~n3~0=v_~n3~0_113, ~n1~0=v_~n1~0_137} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~tmp3~0#1][84], [18#L106true, Black: 132#(= ~i1~0 0), 33#L131-4true, 161#(<= ~n3~0 ~n1~0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 39#L80true, Black: 159#true, 21#L45-3true, Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true]) [2025-04-13 20:13:13,265 INFO L286 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2025-04-13 20:13:13,265 INFO L289 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2025-04-13 20:13:13,265 INFO L289 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2025-04-13 20:13:13,265 INFO L289 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2025-04-13 20:13:13,278 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([667] L93-3-->L94-1: Formula: (and (= v_~n3~0_19 (+ |v_thread3Thread1of1ForFork1_#t~post3#1_1| 1)) (= |v_thread3Thread1of1ForFork1_#t~post3#1_1| v_~n3~0_20)) InVars {~n3~0=v_~n3~0_20} OutVars{thread3Thread1of1ForFork1_#t~post3#1=|v_thread3Thread1of1ForFork1_#t~post3#1_1|, ~n3~0=v_~n3~0_19} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post3#1, ~n3~0][68], [Black: 132#(= ~i1~0 0), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 73#L132true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), 166#true, Black: 92#(= ~i~0 0), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), 69#L71-1true, Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 90#true, 12#L94-1true, 68#L58true, 142#(and (= ~i1~0 0) (= ~i~0 1)), Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:13,279 INFO L286 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2025-04-13 20:13:13,279 INFO L289 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2025-04-13 20:13:13,279 INFO L289 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2025-04-13 20:13:13,279 INFO L289 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2025-04-13 20:13:13,339 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([633] L43-3-->L45-3: Formula: (and (= |v_thread1Thread1of1ForFork2_~tmp3~0#1_5| v_~n3~0_113) (<= |v_thread1Thread1of1ForFork2_~tmp3~0#1_5| v_~n1~0_137)) InVars {~n3~0=v_~n3~0_113, ~n1~0=v_~n1~0_137} OutVars{thread1Thread1of1ForFork2_~tmp3~0#1=|v_thread1Thread1of1ForFork2_~tmp3~0#1_5|, ~n3~0=v_~n3~0_113, ~n1~0=v_~n1~0_137} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~tmp3~0#1][84], [18#L106true, Black: 132#(= ~i1~0 0), 161#(<= ~n3~0 ~n1~0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 39#L80true, Black: 159#true, 21#L45-3true, Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true]) [2025-04-13 20:13:13,339 INFO L286 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2025-04-13 20:13:13,339 INFO L289 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2025-04-13 20:13:13,339 INFO L289 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2025-04-13 20:13:13,339 INFO L289 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2025-04-13 20:13:13,506 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][133], [24#thread3EXITtrue, 42#L45-1true, Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), 69#L71-1true, Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true, Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:13,506 INFO L286 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2025-04-13 20:13:13,506 INFO L289 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2025-04-13 20:13:13,506 INFO L289 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2025-04-13 20:13:13,506 INFO L289 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2025-04-13 20:13:13,566 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][133], [24#thread3EXITtrue, 42#L45-1true, Black: 132#(= ~i1~0 0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), 69#L71-1true, Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 73#L132true, Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true, Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:13,566 INFO L286 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2025-04-13 20:13:13,566 INFO L289 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2025-04-13 20:13:13,566 INFO L289 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2025-04-13 20:13:13,566 INFO L289 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2025-04-13 20:13:13,631 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][171], [18#L106true, Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 21#L45-3true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 80#L82true, Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true, 93#(= ~i3~0 0), Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:13,631 INFO L286 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2025-04-13 20:13:13,631 INFO L289 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2025-04-13 20:13:13,631 INFO L289 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2025-04-13 20:13:13,632 INFO L289 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2025-04-13 20:13:13,702 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][171], [18#L106true, Black: 132#(= ~i1~0 0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 21#L45-3true, Black: 127#(= ~e3~0 1), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), 80#L82true, Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), 129#true, 93#(= ~i3~0 0), Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:13,703 INFO L286 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2025-04-13 20:13:13,703 INFO L289 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2025-04-13 20:13:13,703 INFO L289 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2025-04-13 20:13:13,703 INFO L289 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2025-04-13 20:13:13,792 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][133], [24#thread3EXITtrue, 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 120#(<= ~n3~0 ~n2~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), Black: 92#(= ~i~0 0), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 159#true, 118#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 39#L80true, Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), 129#true, 19#L56true, Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:13,792 INFO L286 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2025-04-13 20:13:13,793 INFO L289 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2025-04-13 20:13:13,793 INFO L289 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2025-04-13 20:13:13,793 INFO L289 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2025-04-13 20:13:13,870 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][133], [24#thread3EXITtrue, 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 132#(= ~i1~0 0), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 120#(<= ~n3~0 ~n2~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), Black: 92#(= ~i~0 0), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 159#true, 118#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 39#L80true, Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), 129#true, 19#L56true, Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:13,870 INFO L286 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2025-04-13 20:13:13,870 INFO L289 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2025-04-13 20:13:13,871 INFO L289 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2025-04-13 20:13:13,871 INFO L289 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2025-04-13 20:13:13,883 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][190], [18#L106true, Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 39#L80true, Black: 127#(= ~e3~0 1), 68#L58true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true, Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:13,883 INFO L286 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2025-04-13 20:13:13,883 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:13,883 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:13,883 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:13,959 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][190], [18#L106true, Black: 132#(= ~i1~0 0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 39#L80true, Black: 127#(= ~e3~0 1), 68#L58true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:13,960 INFO L286 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2025-04-13 20:13:13,960 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:13,960 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:13,960 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:13,971 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][190], [18#L106true, Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 68#L58true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 6#L80-1true, Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:13,971 INFO L286 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2025-04-13 20:13:13,971 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:13,971 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:13,971 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:13,971 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][173], [18#L106true, Black: 132#(= ~i1~0 0), 33#L131-4true, 20#L56-1true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, 109#(and (= ~i3~0 0) (= ~i1~0 1)), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 80#L82true, Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:13,972 INFO L286 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2025-04-13 20:13:13,972 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:13,972 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:13,972 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:13,980 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([664] L91-3-->L93-1: Formula: (and (= |v_thread3Thread1of1ForFork1_~tmp2~1#1_3| v_~n2~0_125) (< v_~n3~0_115 |v_thread3Thread1of1ForFork1_~tmp2~1#1_3|)) InVars {~n2~0=v_~n2~0_125, ~n3~0=v_~n3~0_115} OutVars{~n2~0=v_~n2~0_125, thread3Thread1of1ForFork1_~tmp2~1#1=|v_thread3Thread1of1ForFork1_~tmp2~1#1_3|, ~n3~0=v_~n3~0_115} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~tmp2~1#1][59], [75#L132-1true, Black: 132#(= ~i1~0 0), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), 80#L82true, Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 92#(= ~i~0 0), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), 90#true, Black: 118#true, 76#L93-1true, 129#true, 121#(<= (+ ~n3~0 1) ~n2~0), Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:13,980 INFO L286 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2025-04-13 20:13:13,980 INFO L289 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2025-04-13 20:13:13,980 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:13,980 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:14,034 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][190], [18#L106true, Black: 132#(= ~i1~0 0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 68#L58true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), 6#L80-1true, Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:14,034 INFO L286 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2025-04-13 20:13:14,035 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:14,035 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:14,035 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:14,035 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][173], [18#L106true, Black: 132#(= ~i1~0 0), 20#L56-1true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, 109#(and (= ~i3~0 0) (= ~i1~0 1)), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), 80#L82true, Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:14,035 INFO L286 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2025-04-13 20:13:14,035 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:14,035 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:14,035 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:14,044 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][190], [Black: 132#(= ~i1~0 0), 18#L106true, 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 68#L58true, 37#L81true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 93#(= ~i3~0 0), 129#true, Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:14,044 INFO L286 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2025-04-13 20:13:14,044 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:14,044 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:14,044 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:14,044 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][173], [18#L106true, Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, 109#(and (= ~i3~0 0) (= ~i1~0 1)), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 80#L82true, Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 38#L57true, Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true, Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:14,044 INFO L286 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2025-04-13 20:13:14,044 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:14,044 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:14,044 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:14,044 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][190], [18#L106true, Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 68#L58true, 37#L81true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:14,044 INFO L286 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2025-04-13 20:13:14,044 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:14,044 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:14,044 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:14,084 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][190], [18#L106true, Black: 132#(= ~i1~0 0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 68#L58true, 37#L81true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true, 93#(= ~i3~0 0), Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:14,084 INFO L286 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2025-04-13 20:13:14,085 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:14,085 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:14,085 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:14,085 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][173], [18#L106true, Black: 132#(= ~i1~0 0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, 109#(and (= ~i3~0 0) (= ~i1~0 1)), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), 80#L82true, Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 38#L57true, Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true, Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:14,085 INFO L286 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2025-04-13 20:13:14,085 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:14,085 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:14,085 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:14,085 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][190], [18#L106true, Black: 132#(= ~i1~0 0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 68#L58true, 37#L81true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true, Black: 161#(<= ~n3~0 ~n1~0)]) [2025-04-13 20:13:14,085 INFO L286 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2025-04-13 20:13:14,085 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:14,085 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:14,085 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:14,160 INFO L116 PetriNetUnfolderBase]: 15968/30191 cut-off events. [2025-04-13 20:13:14,160 INFO L117 PetriNetUnfolderBase]: For 33967/35619 co-relation queries the response was YES. [2025-04-13 20:13:14,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91630 conditions, 30191 events. 15968/30191 cut-off events. For 33967/35619 co-relation queries the response was YES. Maximal size of possible extension queue 1302. Compared 283051 event pairs, 5527 based on Foata normal form. 735/29538 useless extension candidates. Maximal degree in co-relation 85351. Up to 11407 conditions per place. [2025-04-13 20:13:14,517 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 104 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2025-04-13 20:13:14,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 222 transitions, 1578 flow [2025-04-13 20:13:14,517 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:13:14,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:13:14,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2025-04-13 20:13:14,518 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6827309236947792 [2025-04-13 20:13:14,518 INFO L175 Difference]: Start difference. First operand has 121 places, 186 transitions, 1158 flow. Second operand 3 states and 170 transitions. [2025-04-13 20:13:14,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 222 transitions, 1578 flow [2025-04-13 20:13:14,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 222 transitions, 1578 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 20:13:14,741 INFO L231 Difference]: Finished difference. Result has 124 places, 186 transitions, 1168 flow [2025-04-13 20:13:14,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=1158, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1168, PETRI_PLACES=124, PETRI_TRANSITIONS=186} [2025-04-13 20:13:14,742 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 41 predicate places. [2025-04-13 20:13:14,742 INFO L485 AbstractCegarLoop]: Abstraction has has 124 places, 186 transitions, 1168 flow [2025-04-13 20:13:14,742 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-04-13 20:13:14,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:14,742 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:14,742 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 20:13:14,742 INFO L403 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-04-13 20:13:14,743 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:14,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1013861722, now seen corresponding path program 8 times [2025-04-13 20:13:14,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:14,743 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477585037] [2025-04-13 20:13:14,743 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:13:14,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:14,749 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 1 equivalence classes. [2025-04-13 20:13:14,757 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 20:13:14,757 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:13:14,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:14,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:13:14,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:14,822 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477585037] [2025-04-13 20:13:14,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477585037] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:13:14,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:13:14,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:13:14,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220571930] [2025-04-13 20:13:14,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:13:14,823 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:13:14,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:14,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:13:14,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:13:14,830 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-04-13 20:13:14,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 186 transitions, 1168 flow. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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-04-13 20:13:14,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:14,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-04-13 20:13:14,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:16,025 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][182], [24#thread3EXITtrue, Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 14#L69-3true, Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 64#L46-1true, 129#true, 176#(= ~e2~0 1), Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:16,026 INFO L286 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2025-04-13 20:13:16,026 INFO L289 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2025-04-13 20:13:16,026 INFO L289 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2025-04-13 20:13:16,026 INFO L289 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2025-04-13 20:13:16,047 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][182], [24#thread3EXITtrue, Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, 118#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 21#L45-3true, Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 4#L70-1true, 129#true, 176#(= ~e2~0 1), Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:16,047 INFO L286 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2025-04-13 20:13:16,047 INFO L289 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2025-04-13 20:13:16,047 INFO L289 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2025-04-13 20:13:16,047 INFO L289 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2025-04-13 20:13:16,102 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][182], [24#thread3EXITtrue, Black: 132#(= ~i1~0 0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, 14#L69-3true, Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 64#L46-1true, 129#true, 176#(= ~e2~0 1), Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:16,103 INFO L286 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2025-04-13 20:13:16,103 INFO L289 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2025-04-13 20:13:16,103 INFO L289 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2025-04-13 20:13:16,103 INFO L289 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2025-04-13 20:13:16,124 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][182], [24#thread3EXITtrue, Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 4#L70-1true, 64#L46-1true, 129#true, 176#(= ~e2~0 1), Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:16,124 INFO L286 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2025-04-13 20:13:16,124 INFO L289 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2025-04-13 20:13:16,124 INFO L289 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2025-04-13 20:13:16,124 INFO L289 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2025-04-13 20:13:16,136 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][182], [24#thread3EXITtrue, Black: 132#(= ~i1~0 0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 21#L45-3true, 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 4#L70-1true, 129#true, 176#(= ~e2~0 1), Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:16,136 INFO L286 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2025-04-13 20:13:16,136 INFO L289 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2025-04-13 20:13:16,136 INFO L289 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2025-04-13 20:13:16,136 INFO L289 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2025-04-13 20:13:16,193 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][182], [24#thread3EXITtrue, Black: 132#(= ~i1~0 0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 4#L70-1true, 64#L46-1true, 129#true, 176#(= ~e2~0 1), Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:16,193 INFO L286 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2025-04-13 20:13:16,193 INFO L289 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2025-04-13 20:13:16,193 INFO L289 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2025-04-13 20:13:16,193 INFO L289 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2025-04-13 20:13:16,294 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][182], [24#thread3EXITtrue, Black: 132#(= ~i1~0 0), 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), 69#L71-1true, Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), 19#L56true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:16,294 INFO L286 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2025-04-13 20:13:16,294 INFO L289 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2025-04-13 20:13:16,294 INFO L289 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2025-04-13 20:13:16,294 INFO L289 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2025-04-13 20:13:16,298 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][182], [24#thread3EXITtrue, Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 39#L80true, Black: 127#(= ~e3~0 1), 21#L45-3true, 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:16,298 INFO L286 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2025-04-13 20:13:16,298 INFO L289 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2025-04-13 20:13:16,298 INFO L289 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2025-04-13 20:13:16,298 INFO L289 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2025-04-13 20:13:16,344 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][182], [24#thread3EXITtrue, Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 39#L80true, 21#L45-3true, Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:16,344 INFO L286 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2025-04-13 20:13:16,344 INFO L289 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2025-04-13 20:13:16,344 INFO L289 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2025-04-13 20:13:16,344 INFO L289 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2025-04-13 20:13:16,344 INFO L289 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2025-04-13 20:13:16,369 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][182], [24#thread3EXITtrue, Black: 132#(= ~i1~0 0), 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), 69#L71-1true, Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), 19#L56true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:16,369 INFO L286 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2025-04-13 20:13:16,369 INFO L289 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2025-04-13 20:13:16,369 INFO L289 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2025-04-13 20:13:16,369 INFO L289 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2025-04-13 20:13:16,373 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][182], [24#thread3EXITtrue, Black: 132#(= ~i1~0 0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 39#L80true, 21#L45-3true, Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:16,373 INFO L286 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2025-04-13 20:13:16,373 INFO L289 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2025-04-13 20:13:16,373 INFO L289 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2025-04-13 20:13:16,373 INFO L289 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2025-04-13 20:13:16,392 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][182], [24#thread3EXITtrue, Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), 69#L71-1true, Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), 19#L56true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:16,392 INFO L286 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2025-04-13 20:13:16,392 INFO L289 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2025-04-13 20:13:16,392 INFO L289 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2025-04-13 20:13:16,393 INFO L289 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2025-04-13 20:13:16,425 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][182], [24#thread3EXITtrue, Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 39#L80true, Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), 19#L56true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:16,425 INFO L286 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2025-04-13 20:13:16,425 INFO L289 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2025-04-13 20:13:16,425 INFO L289 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2025-04-13 20:13:16,426 INFO L289 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2025-04-13 20:13:16,432 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][207], [18#L106true, Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 21#L45-3true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 80#L82true, Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 93#(= ~i3~0 0), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:16,432 INFO L286 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2025-04-13 20:13:16,432 INFO L289 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2025-04-13 20:13:16,432 INFO L289 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2025-04-13 20:13:16,432 INFO L289 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2025-04-13 20:13:16,440 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][182], [24#thread3EXITtrue, Black: 132#(= ~i1~0 0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 39#L80true, Black: 127#(= ~e3~0 1), 21#L45-3true, 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 73#L132true, Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:16,440 INFO L286 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2025-04-13 20:13:16,440 INFO L289 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2025-04-13 20:13:16,440 INFO L289 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2025-04-13 20:13:16,440 INFO L289 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2025-04-13 20:13:16,440 INFO L289 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2025-04-13 20:13:16,448 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][207], [Black: 132#(= ~i1~0 0), 18#L106true, 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 21#L45-3true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 80#L82true, Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 129#true, 93#(= ~i3~0 0), Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:16,448 INFO L286 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2025-04-13 20:13:16,448 INFO L289 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2025-04-13 20:13:16,448 INFO L289 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2025-04-13 20:13:16,448 INFO L289 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2025-04-13 20:13:16,448 INFO L289 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2025-04-13 20:13:16,471 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][182], [24#thread3EXITtrue, Black: 132#(= ~i1~0 0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), 69#L71-1true, Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), 19#L56true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:16,472 INFO L286 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2025-04-13 20:13:16,472 INFO L289 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2025-04-13 20:13:16,472 INFO L289 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2025-04-13 20:13:16,472 INFO L289 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2025-04-13 20:13:16,508 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][182], [24#thread3EXITtrue, Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 39#L80true, Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 64#L46-1true, 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:16,508 INFO L286 olderBase$Statistics]: this new event has 52 ancestors and is not cut-off event [2025-04-13 20:13:16,508 INFO L289 olderBase$Statistics]: existing Event has 52 ancestors and is not cut-off event [2025-04-13 20:13:16,508 INFO L289 olderBase$Statistics]: existing Event has 52 ancestors and is not cut-off event [2025-04-13 20:13:16,508 INFO L289 olderBase$Statistics]: existing Event has 52 ancestors and is not cut-off event [2025-04-13 20:13:16,508 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][182], [24#thread3EXITtrue, Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 39#L80true, Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), 19#L56true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:16,508 INFO L286 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2025-04-13 20:13:16,508 INFO L289 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2025-04-13 20:13:16,508 INFO L289 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2025-04-13 20:13:16,508 INFO L289 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2025-04-13 20:13:16,508 INFO L289 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2025-04-13 20:13:16,533 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][182], [24#thread3EXITtrue, Black: 132#(= ~i1~0 0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 39#L80true, Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), 19#L56true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 73#L132true, Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:16,533 INFO L286 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2025-04-13 20:13:16,533 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:16,533 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:16,533 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:16,539 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][207], [18#L106true, Black: 132#(= ~i1~0 0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 21#L45-3true, Black: 127#(= ~e3~0 1), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), 80#L82true, Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 93#(= ~i3~0 0), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:16,539 INFO L286 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2025-04-13 20:13:16,539 INFO L289 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2025-04-13 20:13:16,539 INFO L289 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2025-04-13 20:13:16,539 INFO L289 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2025-04-13 20:13:16,545 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][207], [Black: 132#(= ~i1~0 0), 18#L106true, 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 80#L82true, Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 64#L46-1true, 93#(= ~i3~0 0), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:16,545 INFO L286 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2025-04-13 20:13:16,545 INFO L289 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2025-04-13 20:13:16,545 INFO L289 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2025-04-13 20:13:16,545 INFO L289 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2025-04-13 20:13:16,545 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][207], [Black: 132#(= ~i1~0 0), 18#L106true, 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 19#L56true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 80#L82true, Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 93#(= ~i3~0 0), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:16,546 INFO L286 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2025-04-13 20:13:16,546 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:16,546 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:16,546 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:16,561 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][207], [18#L106true, Black: 132#(= ~i1~0 0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, 118#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 21#L45-3true, Black: 127#(= ~e3~0 1), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 73#L132true, 80#L82true, Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 93#(= ~i3~0 0), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:16,561 INFO L286 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2025-04-13 20:13:16,561 INFO L289 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2025-04-13 20:13:16,561 INFO L289 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2025-04-13 20:13:16,561 INFO L289 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2025-04-13 20:13:16,561 INFO L289 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2025-04-13 20:13:16,591 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][182], [24#thread3EXITtrue, Black: 132#(= ~i1~0 0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 39#L80true, Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 64#L46-1true, 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:16,592 INFO L286 olderBase$Statistics]: this new event has 53 ancestors and is not cut-off event [2025-04-13 20:13:16,592 INFO L289 olderBase$Statistics]: existing Event has 53 ancestors and is not cut-off event [2025-04-13 20:13:16,592 INFO L289 olderBase$Statistics]: existing Event has 53 ancestors and is not cut-off event [2025-04-13 20:13:16,592 INFO L289 olderBase$Statistics]: existing Event has 53 ancestors and is not cut-off event [2025-04-13 20:13:16,592 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][182], [24#thread3EXITtrue, Black: 132#(= ~i1~0 0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 39#L80true, Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), 19#L56true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:16,592 INFO L286 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2025-04-13 20:13:16,592 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:16,592 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:16,592 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:16,592 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:16,659 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][207], [Black: 132#(= ~i1~0 0), 18#L106true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, 118#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), 80#L82true, Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 64#L46-1true, 93#(= ~i3~0 0), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:16,659 INFO L286 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2025-04-13 20:13:16,659 INFO L289 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2025-04-13 20:13:16,659 INFO L289 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2025-04-13 20:13:16,659 INFO L289 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2025-04-13 20:13:16,659 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][207], [Black: 132#(= ~i1~0 0), 18#L106true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 19#L56true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), 80#L82true, Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 93#(= ~i3~0 0), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:16,659 INFO L286 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2025-04-13 20:13:16,659 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:16,659 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:16,659 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:16,684 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][234], [Black: 132#(= ~i1~0 0), 18#L106true, 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), 69#L71-1true, Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 68#L58true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:16,684 INFO L286 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2025-04-13 20:13:16,684 INFO L289 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2025-04-13 20:13:16,684 INFO L289 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2025-04-13 20:13:16,684 INFO L289 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2025-04-13 20:13:16,827 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][234], [Black: 132#(= ~i1~0 0), 18#L106true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), 69#L71-1true, Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 68#L58true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:16,827 INFO L286 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2025-04-13 20:13:16,827 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:16,827 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:16,827 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:16,845 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][210], [18#L106true, Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), 69#L71-1true, Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 68#L58true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:16,845 INFO L286 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2025-04-13 20:13:16,845 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:16,845 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:16,845 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:16,874 INFO L284 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][182], [24#thread3EXITtrue, Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 39#L80true, Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), 19#L56true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:16,874 INFO L286 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2025-04-13 20:13:16,874 INFO L289 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2025-04-13 20:13:16,874 INFO L289 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2025-04-13 20:13:16,874 INFO L289 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2025-04-13 20:13:16,874 INFO L289 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2025-04-13 20:13:16,874 INFO L289 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2025-04-13 20:13:17,194 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][207], [Black: 132#(= ~i1~0 0), 18#L106true, 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 19#L56true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 80#L82true, Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true, 93#(= ~i3~0 0), Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,194 INFO L286 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2025-04-13 20:13:17,194 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:17,194 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:17,194 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:17,194 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:17,208 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][210], [18#L106true, Black: 132#(= ~i1~0 0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), 69#L71-1true, Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 68#L58true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 73#L132true, Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,208 INFO L286 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2025-04-13 20:13:17,208 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:17,208 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:17,208 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:17,221 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][210], [Black: 132#(= ~i1~0 0), 18#L106true, 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 39#L80true, Black: 127#(= ~e3~0 1), 68#L58true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,221 INFO L286 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2025-04-13 20:13:17,221 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:17,221 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:17,221 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:17,226 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][210], [18#L106true, Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 39#L80true, Black: 127#(= ~e3~0 1), 68#L58true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,226 INFO L286 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2025-04-13 20:13:17,226 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:17,226 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:17,226 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:17,226 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:17,236 INFO L284 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][182], [24#thread3EXITtrue, Black: 132#(= ~i1~0 0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 39#L80true, Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), 19#L56true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 73#L132true, Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,236 INFO L286 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2025-04-13 20:13:17,236 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:17,237 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:17,237 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:17,237 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:17,237 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:17,245 INFO L284 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][207], [Black: 132#(= ~i1~0 0), 18#L106true, 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 19#L56true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 80#L82true, Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true, 93#(= ~i3~0 0), Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,245 INFO L286 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2025-04-13 20:13:17,245 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:17,245 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:17,245 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:17,245 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:17,245 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:17,245 INFO L284 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][210], [Black: 132#(= ~i1~0 0), 18#L106true, 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 39#L80true, Black: 127#(= ~e3~0 1), 68#L58true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,245 INFO L286 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2025-04-13 20:13:17,245 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:17,245 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:17,245 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:17,245 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:17,245 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:17,287 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][207], [Black: 132#(= ~i1~0 0), 18#L106true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 19#L56true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), 80#L82true, Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 93#(= ~i3~0 0), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,287 INFO L286 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,287 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,287 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,287 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,287 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,338 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][210], [Black: 132#(= ~i1~0 0), 18#L106true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 39#L80true, Black: 127#(= ~e3~0 1), 68#L58true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,339 INFO L286 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,339 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,339 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,339 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,344 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][210], [Black: 132#(= ~i1~0 0), 18#L106true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 39#L80true, Black: 127#(= ~e3~0 1), 68#L58true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,344 INFO L286 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,344 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,344 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,344 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,344 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,355 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][210], [Black: 132#(= ~i1~0 0), 18#L106true, 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 68#L58true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 6#L80-1true, Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,355 INFO L286 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,355 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,355 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,356 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,356 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][207], [Black: 132#(= ~i1~0 0), 18#L106true, 20#L56-1true, 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, 109#(and (= ~i3~0 0) (= ~i1~0 1)), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 80#L82true, Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,356 INFO L286 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,356 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,356 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,356 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,361 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][210], [18#L106true, Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 68#L58true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 6#L80-1true, Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,361 INFO L286 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,361 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,361 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,361 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,361 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,362 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][207], [18#L106true, Black: 132#(= ~i1~0 0), 20#L56-1true, 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, 109#(and (= ~i3~0 0) (= ~i1~0 1)), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 80#L82true, Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,362 INFO L286 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,362 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,362 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,362 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,362 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,372 INFO L284 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][207], [Black: 132#(= ~i1~0 0), 18#L106true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 19#L56true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 73#L132true, 80#L82true, Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), 93#(= ~i3~0 0), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,372 INFO L286 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,372 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,372 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,372 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,372 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,372 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,372 INFO L284 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][210], [Black: 132#(= ~i1~0 0), 18#L106true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 39#L80true, Black: 127#(= ~e3~0 1), 68#L58true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 73#L132true, Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,372 INFO L286 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,372 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,373 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,373 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,373 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,373 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,382 INFO L284 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][210], [Black: 132#(= ~i1~0 0), 18#L106true, 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 68#L58true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 6#L80-1true, Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,382 INFO L286 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,382 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,382 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,382 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,382 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,382 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,382 INFO L284 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][207], [Black: 132#(= ~i1~0 0), 18#L106true, 20#L56-1true, 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, 109#(and (= ~i3~0 0) (= ~i1~0 1)), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 80#L82true, Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,382 INFO L286 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,382 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,382 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,382 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,382 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,382 INFO L289 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-04-13 20:13:17,468 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][210], [Black: 132#(= ~i1~0 0), 18#L106true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 68#L58true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), 6#L80-1true, Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,468 INFO L286 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,468 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,468 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,468 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,468 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][207], [Black: 132#(= ~i1~0 0), 18#L106true, 20#L56-1true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, 109#(and (= ~i3~0 0) (= ~i1~0 1)), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), 80#L82true, Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,468 INFO L286 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,468 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,468 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,468 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,474 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][210], [Black: 132#(= ~i1~0 0), 18#L106true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 68#L58true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), 6#L80-1true, Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,474 INFO L286 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,474 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,474 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,474 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,474 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,474 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][207], [Black: 132#(= ~i1~0 0), 18#L106true, 20#L56-1true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, 109#(and (= ~i3~0 0) (= ~i1~0 1)), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), 80#L82true, Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,474 INFO L286 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,474 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,474 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,474 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,474 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,484 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][210], [Black: 132#(= ~i1~0 0), 18#L106true, 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 68#L58true, 37#L81true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), 93#(= ~i3~0 0), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,484 INFO L286 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,484 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,484 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,484 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,485 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][207], [Black: 132#(= ~i1~0 0), 18#L106true, 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, 109#(and (= ~i3~0 0) (= ~i1~0 1)), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 80#L82true, Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, 38#L57true, Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,485 INFO L286 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,485 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,485 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,485 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,485 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][210], [Black: 132#(= ~i1~0 0), 18#L106true, 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 68#L58true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 37#L81true, Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,485 INFO L286 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,485 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,485 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,485 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,488 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][210], [Black: 132#(= ~i1~0 0), 18#L106true, 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 68#L58true, 37#L81true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), 93#(= ~i3~0 0), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,489 INFO L286 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,489 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,489 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,489 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,489 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,489 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][207], [18#L106true, Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, 109#(and (= ~i3~0 0) (= ~i1~0 1)), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 80#L82true, Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, 38#L57true, Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,489 INFO L286 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,489 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,489 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,489 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,489 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,489 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][210], [18#L106true, Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 68#L58true, 37#L81true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,489 INFO L286 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,489 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,489 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,489 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,489 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,497 INFO L284 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][210], [18#L106true, Black: 132#(= ~i1~0 0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 68#L58true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 73#L132true, 6#L80-1true, Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,497 INFO L286 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,497 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,497 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,497 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,497 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,497 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,497 INFO L284 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][207], [Black: 132#(= ~i1~0 0), 18#L106true, 20#L56-1true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, 109#(and (= ~i3~0 0) (= ~i1~0 1)), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 73#L132true, 80#L82true, Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,497 INFO L286 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,497 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,497 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,497 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,497 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,497 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,508 INFO L284 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][210], [18#L106true, Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 68#L58true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 37#L81true, Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), 129#true, 93#(= ~i3~0 0), Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,508 INFO L286 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,508 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,508 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,508 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,508 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,508 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,508 INFO L284 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][207], [Black: 132#(= ~i1~0 0), 18#L106true, 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, 109#(and (= ~i3~0 0) (= ~i1~0 1)), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 80#L82true, Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 38#L57true, Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,508 INFO L286 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,508 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,508 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,508 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,509 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,509 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,509 INFO L284 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][210], [Black: 132#(= ~i1~0 0), 18#L106true, 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 68#L58true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 37#L81true, Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,509 INFO L286 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,509 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,509 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,509 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,509 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,509 INFO L289 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-04-13 20:13:17,570 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][210], [Black: 132#(= ~i1~0 0), 18#L106true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 68#L58true, 37#L81true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), 93#(= ~i3~0 0), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,570 INFO L286 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,570 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,570 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,570 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,571 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][207], [Black: 132#(= ~i1~0 0), 18#L106true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, 109#(and (= ~i3~0 0) (= ~i1~0 1)), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), 80#L82true, Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, 38#L57true, Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,571 INFO L286 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,571 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,571 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,571 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,571 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][210], [Black: 132#(= ~i1~0 0), 18#L106true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 68#L58true, 37#L81true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,571 INFO L286 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,571 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,571 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,571 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,574 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][210], [18#L106true, Black: 132#(= ~i1~0 0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 68#L58true, 37#L81true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 129#true, 93#(= ~i3~0 0), Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,575 INFO L286 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,575 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,575 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,575 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,575 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,575 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][207], [Black: 132#(= ~i1~0 0), 18#L106true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, 109#(and (= ~i3~0 0) (= ~i1~0 1)), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), 80#L82true, Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, 38#L57true, Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,575 INFO L286 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,575 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,575 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,575 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,575 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,575 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][210], [Black: 132#(= ~i1~0 0), 18#L106true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 68#L58true, 37#L81true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,575 INFO L286 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,575 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,575 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,575 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,575 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,586 INFO L284 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][210], [18#L106true, Black: 132#(= ~i1~0 0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 68#L58true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 37#L81true, Black: 120#(<= ~n3~0 ~n2~0), 73#L132true, Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), 129#true, 93#(= ~i3~0 0), Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,586 INFO L286 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,586 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,586 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,586 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,586 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,586 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,586 INFO L284 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([657] L81-->L82: Formula: (= v_~n2~0_4 0) InVars {} OutVars{~n2~0=v_~n2~0_4} AuxVars[] AssignedVars[~n2~0][207], [Black: 132#(= ~i1~0 0), 18#L106true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, 109#(and (= ~i3~0 0) (= ~i1~0 1)), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, 174#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 73#L132true, 80#L82true, Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 38#L57true, Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,586 INFO L286 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,587 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,587 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,587 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,587 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,587 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,587 INFO L284 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([641] L57-->L58: Formula: (= v_~n1~0_11 0) InVars {} OutVars{~n1~0=v_~n1~0_11} AuxVars[] AssignedVars[~n1~0][210], [18#L106true, Black: 132#(= ~i1~0 0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), 174#true, Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 68#L58true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 37#L81true, Black: 120#(<= ~n3~0 ~n2~0), 73#L132true, Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:17,587 INFO L286 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,587 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,587 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,587 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,587 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,587 INFO L289 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2025-04-13 20:13:17,906 INFO L116 PetriNetUnfolderBase]: 22694/41521 cut-off events. [2025-04-13 20:13:17,906 INFO L117 PetriNetUnfolderBase]: For 68524/70102 co-relation queries the response was YES. [2025-04-13 20:13:18,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138134 conditions, 41521 events. 22694/41521 cut-off events. For 68524/70102 co-relation queries the response was YES. Maximal size of possible extension queue 1932. Compared 391929 event pairs, 4432 based on Foata normal form. 248/39475 useless extension candidates. Maximal degree in co-relation 125269. Up to 22992 conditions per place. [2025-04-13 20:13:18,156 INFO L140 encePairwiseOnDemand]: 70/83 looper letters, 152 selfloop transitions, 33 changer transitions 0/270 dead transitions. [2025-04-13 20:13:18,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 270 transitions, 1967 flow [2025-04-13 20:13:18,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:13:18,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:13:18,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2025-04-13 20:13:18,157 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6867469879518072 [2025-04-13 20:13:18,157 INFO L175 Difference]: Start difference. First operand has 124 places, 186 transitions, 1168 flow. Second operand 4 states and 228 transitions. [2025-04-13 20:13:18,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 270 transitions, 1967 flow [2025-04-13 20:13:18,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 270 transitions, 1963 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:13:18,689 INFO L231 Difference]: Finished difference. Result has 128 places, 209 transitions, 1484 flow [2025-04-13 20:13:18,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1484, PETRI_PLACES=128, PETRI_TRANSITIONS=209} [2025-04-13 20:13:18,690 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 45 predicate places. [2025-04-13 20:13:18,690 INFO L485 AbstractCegarLoop]: Abstraction has has 128 places, 209 transitions, 1484 flow [2025-04-13 20:13:18,690 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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-04-13 20:13:18,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:18,690 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:18,691 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 20:13:18,691 INFO L403 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-04-13 20:13:18,691 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:18,691 INFO L85 PathProgramCache]: Analyzing trace with hash 372318658, now seen corresponding path program 9 times [2025-04-13 20:13:18,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:18,691 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088916235] [2025-04-13 20:13:18,691 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:13:18,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:18,697 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 1 equivalence classes. [2025-04-13 20:13:18,701 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 20:13:18,701 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:13:18,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:18,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:13:18,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:18,738 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088916235] [2025-04-13 20:13:18,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088916235] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:13:18,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:13:18,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:13:18,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11987101] [2025-04-13 20:13:18,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:13:18,740 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:13:18,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:18,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:13:18,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:13:18,742 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2025-04-13 20:13:18,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 209 transitions, 1484 flow. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-04-13 20:13:18,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:18,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2025-04-13 20:13:18,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:19,851 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][154], [24#thread3EXITtrue, Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, 187#(= ~e1~0 1), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 180#(<= ~n2~0 ~n1~0), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 181#(<= (+ ~n2~0 1) ~n1~0), 4#L70-1true, 64#L46-1true, 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:19,851 INFO L286 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2025-04-13 20:13:19,851 INFO L289 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2025-04-13 20:13:19,851 INFO L289 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2025-04-13 20:13:19,851 INFO L289 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2025-04-13 20:13:19,965 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][154], [24#thread3EXITtrue, Black: 132#(= ~i1~0 0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, 187#(= ~e1~0 1), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 180#(<= ~n2~0 ~n1~0), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 73#L132true, Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 181#(<= (+ ~n2~0 1) ~n1~0), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 4#L70-1true, 64#L46-1true, 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:19,966 INFO L286 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2025-04-13 20:13:19,966 INFO L289 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2025-04-13 20:13:19,966 INFO L289 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2025-04-13 20:13:19,966 INFO L289 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2025-04-13 20:13:21,549 INFO L116 PetriNetUnfolderBase]: 18374/35721 cut-off events. [2025-04-13 20:13:21,550 INFO L117 PetriNetUnfolderBase]: For 67582/69294 co-relation queries the response was YES. [2025-04-13 20:13:21,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118642 conditions, 35721 events. 18374/35721 cut-off events. For 67582/69294 co-relation queries the response was YES. Maximal size of possible extension queue 1670. Compared 350626 event pairs, 6529 based on Foata normal form. 928/35164 useless extension candidates. Maximal degree in co-relation 109485. Up to 12645 conditions per place. [2025-04-13 20:13:21,959 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 113 selfloop transitions, 2 changer transitions 0/244 dead transitions. [2025-04-13 20:13:21,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 244 transitions, 1927 flow [2025-04-13 20:13:21,959 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:13:21,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:13:21,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2025-04-13 20:13:21,960 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6867469879518072 [2025-04-13 20:13:21,960 INFO L175 Difference]: Start difference. First operand has 128 places, 209 transitions, 1484 flow. Second operand 3 states and 171 transitions. [2025-04-13 20:13:21,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 244 transitions, 1927 flow [2025-04-13 20:13:22,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 244 transitions, 1925 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-04-13 20:13:22,315 INFO L231 Difference]: Finished difference. Result has 131 places, 206 transitions, 1467 flow [2025-04-13 20:13:22,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=1457, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1467, PETRI_PLACES=131, PETRI_TRANSITIONS=206} [2025-04-13 20:13:22,316 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 48 predicate places. [2025-04-13 20:13:22,316 INFO L485 AbstractCegarLoop]: Abstraction has has 131 places, 206 transitions, 1467 flow [2025-04-13 20:13:22,316 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-04-13 20:13:22,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:22,316 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:22,316 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 20:13:22,317 INFO L403 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-04-13 20:13:22,317 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:22,317 INFO L85 PathProgramCache]: Analyzing trace with hash 2028926538, now seen corresponding path program 10 times [2025-04-13 20:13:22,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:22,317 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067332665] [2025-04-13 20:13:22,317 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:13:22,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:22,322 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 67 statements into 2 equivalence classes. [2025-04-13 20:13:22,329 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 20:13:22,329 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:13:22,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:22,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:13:22,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:22,422 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067332665] [2025-04-13 20:13:22,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067332665] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:13:22,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:13:22,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:13:22,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353890400] [2025-04-13 20:13:22,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:13:22,422 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:13:22,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:22,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:13:22,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:13:22,437 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-04-13 20:13:22,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 206 transitions, 1467 flow. Second operand has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 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-04-13 20:13:22,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:22,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-04-13 20:13:22,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:23,369 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][182], [24#thread3EXITtrue, 189#true, Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, 187#(= ~e1~0 1), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 180#(<= ~n2~0 ~n1~0), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 21#L45-3true, Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 181#(<= (+ ~n2~0 1) ~n1~0), 4#L70-1true, 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:23,369 INFO L286 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2025-04-13 20:13:23,369 INFO L289 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2025-04-13 20:13:23,369 INFO L289 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2025-04-13 20:13:23,369 INFO L289 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2025-04-13 20:13:23,445 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][182], [24#thread3EXITtrue, Black: 132#(= ~i1~0 0), 189#true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, 187#(= ~e1~0 1), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 180#(<= ~n2~0 ~n1~0), Black: 121#(<= (+ ~n3~0 1) ~n2~0), 21#L45-3true, Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 73#L132true, Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 181#(<= (+ ~n2~0 1) ~n1~0), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 4#L70-1true, 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:23,445 INFO L286 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2025-04-13 20:13:23,445 INFO L289 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2025-04-13 20:13:23,445 INFO L289 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2025-04-13 20:13:23,445 INFO L289 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2025-04-13 20:13:23,449 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][182], [24#thread3EXITtrue, 189#true, Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, 187#(= ~e1~0 1), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 180#(<= ~n2~0 ~n1~0), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 14#L69-3true, Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 181#(<= (+ ~n2~0 1) ~n1~0), 64#L46-1true, 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:23,449 INFO L286 olderBase$Statistics]: this new event has 48 ancestors and is not cut-off event [2025-04-13 20:13:23,449 INFO L289 olderBase$Statistics]: existing Event has 49 ancestors and is not cut-off event [2025-04-13 20:13:23,449 INFO L289 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2025-04-13 20:13:23,449 INFO L289 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2025-04-13 20:13:23,530 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][182], [24#thread3EXITtrue, Black: 132#(= ~i1~0 0), 189#true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, 187#(= ~e1~0 1), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 180#(<= ~n2~0 ~n1~0), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, 14#L69-3true, Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 181#(<= (+ ~n2~0 1) ~n1~0), 64#L46-1true, 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:23,530 INFO L286 olderBase$Statistics]: this new event has 49 ancestors and is not cut-off event [2025-04-13 20:13:23,530 INFO L289 olderBase$Statistics]: existing Event has 49 ancestors and is not cut-off event [2025-04-13 20:13:23,530 INFO L289 olderBase$Statistics]: existing Event has 50 ancestors and is not cut-off event [2025-04-13 20:13:23,530 INFO L289 olderBase$Statistics]: existing Event has 49 ancestors and is not cut-off event [2025-04-13 20:13:23,537 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][182], [24#thread3EXITtrue, 189#true, Black: 132#(= ~i1~0 0), 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, 187#(= ~e1~0 1), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 180#(<= ~n2~0 ~n1~0), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 181#(<= (+ ~n2~0 1) ~n1~0), 4#L70-1true, 64#L46-1true, 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:23,537 INFO L286 olderBase$Statistics]: this new event has 49 ancestors and is not cut-off event [2025-04-13 20:13:23,537 INFO L289 olderBase$Statistics]: existing Event has 49 ancestors and is not cut-off event [2025-04-13 20:13:23,537 INFO L289 olderBase$Statistics]: existing Event has 50 ancestors and is not cut-off event [2025-04-13 20:13:23,537 INFO L289 olderBase$Statistics]: existing Event has 49 ancestors and is not cut-off event [2025-04-13 20:13:23,615 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([674] L106-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][182], [24#thread3EXITtrue, Black: 132#(= ~i1~0 0), 189#true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, 187#(= ~e1~0 1), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 180#(<= ~n2~0 ~n1~0), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 181#(<= (+ ~n2~0 1) ~n1~0), 4#L70-1true, 64#L46-1true, 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:23,616 INFO L286 olderBase$Statistics]: this new event has 50 ancestors and is not cut-off event [2025-04-13 20:13:23,616 INFO L289 olderBase$Statistics]: existing Event has 51 ancestors and is not cut-off event [2025-04-13 20:13:23,616 INFO L289 olderBase$Statistics]: existing Event has 50 ancestors and is not cut-off event [2025-04-13 20:13:23,616 INFO L289 olderBase$Statistics]: existing Event has 50 ancestors and is not cut-off event [2025-04-13 20:13:25,072 INFO L116 PetriNetUnfolderBase]: 19537/36015 cut-off events. [2025-04-13 20:13:25,072 INFO L117 PetriNetUnfolderBase]: For 89180/90891 co-relation queries the response was YES. [2025-04-13 20:13:25,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128425 conditions, 36015 events. 19537/36015 cut-off events. For 89180/90891 co-relation queries the response was YES. Maximal size of possible extension queue 1469. Compared 331623 event pairs, 4922 based on Foata normal form. 266/34369 useless extension candidates. Maximal degree in co-relation 117712. Up to 22664 conditions per place. [2025-04-13 20:13:25,398 INFO L140 encePairwiseOnDemand]: 73/83 looper letters, 167 selfloop transitions, 23 changer transitions 0/275 dead transitions. [2025-04-13 20:13:25,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 275 transitions, 2210 flow [2025-04-13 20:13:25,399 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:13:25,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:13:25,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 257 transitions. [2025-04-13 20:13:25,400 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.619277108433735 [2025-04-13 20:13:25,400 INFO L175 Difference]: Start difference. First operand has 131 places, 206 transitions, 1467 flow. Second operand 5 states and 257 transitions. [2025-04-13 20:13:25,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 275 transitions, 2210 flow [2025-04-13 20:13:25,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 275 transitions, 2206 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:13:25,904 INFO L231 Difference]: Finished difference. Result has 135 places, 214 transitions, 1630 flow [2025-04-13 20:13:25,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=1439, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1630, PETRI_PLACES=135, PETRI_TRANSITIONS=214} [2025-04-13 20:13:25,905 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 52 predicate places. [2025-04-13 20:13:25,905 INFO L485 AbstractCegarLoop]: Abstraction has has 135 places, 214 transitions, 1630 flow [2025-04-13 20:13:25,905 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 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-04-13 20:13:25,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:25,905 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:25,905 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 20:13:25,905 INFO L403 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-04-13 20:13:25,906 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:25,906 INFO L85 PathProgramCache]: Analyzing trace with hash -868195658, now seen corresponding path program 11 times [2025-04-13 20:13:25,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:25,906 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83373847] [2025-04-13 20:13:25,906 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:13:25,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:25,911 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 67 statements into 1 equivalence classes. [2025-04-13 20:13:25,915 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 20:13:25,915 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:13:25,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:26,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:13:26,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:26,003 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83373847] [2025-04-13 20:13:26,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83373847] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:13:26,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:13:26,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:13:26,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023430100] [2025-04-13 20:13:26,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:13:26,003 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:13:26,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:26,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:13:26,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:13:26,030 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 83 [2025-04-13 20:13:26,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 214 transitions, 1630 flow. Second operand has 9 states, 9 states have (on average 32.44444444444444) internal successors, (292), 9 states have internal predecessors, (292), 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-04-13 20:13:26,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:26,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 83 [2025-04-13 20:13:26,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:27,494 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([651] L69-3-->L70-1: Formula: (and (= v_~n2~0_19 (+ |v_thread2Thread1of1ForFork0_#t~post2#1_1| 1)) (= v_~n2~0_20 |v_thread2Thread1of1ForFork0_#t~post2#1_1|)) InVars {~n2~0=v_~n2~0_20} OutVars{~n2~0=v_~n2~0_19, thread2Thread1of1ForFork0_#t~post2#1=|v_thread2Thread1of1ForFork0_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork0_#t~post2#1][206], [24#thread3EXITtrue, Black: 132#(= ~i1~0 0), 189#true, 33#L131-4true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 180#(<= ~n2~0 ~n1~0), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 193#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 127#(= ~e3~0 1), 21#L45-3true, 103#(and (= ~i3~0 0) (= ~i~0 1)), 196#true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), 159#true, Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 181#(<= (+ ~n2~0 1) ~n1~0), 4#L70-1true, Black: 192#(and (<= 1 ~n1~0) (= (+ ~n2~0 1) ~n1~0)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:27,494 INFO L286 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2025-04-13 20:13:27,494 INFO L289 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2025-04-13 20:13:27,494 INFO L289 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2025-04-13 20:13:27,494 INFO L289 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2025-04-13 20:13:27,623 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([651] L69-3-->L70-1: Formula: (and (= v_~n2~0_19 (+ |v_thread2Thread1of1ForFork0_#t~post2#1_1| 1)) (= v_~n2~0_20 |v_thread2Thread1of1ForFork0_#t~post2#1_1|)) InVars {~n2~0=v_~n2~0_20} OutVars{~n2~0=v_~n2~0_19, thread2Thread1of1ForFork0_#t~post2#1=|v_thread2Thread1of1ForFork0_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork0_#t~post2#1][206], [24#thread3EXITtrue, Black: 132#(= ~i1~0 0), 189#true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 142#(and (= ~i1~0 0) (= ~i~0 1)), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 180#(<= ~n2~0 ~n1~0), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 193#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 21#L45-3true, Black: 127#(= ~e3~0 1), 103#(and (= ~i3~0 0) (= ~i~0 1)), 196#true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), 73#L132true, Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), 159#true, Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 181#(<= (+ ~n2~0 1) ~n1~0), 4#L70-1true, Black: 192#(and (<= 1 ~n1~0) (= (+ ~n2~0 1) ~n1~0)), 129#true, Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:27,623 INFO L286 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2025-04-13 20:13:27,623 INFO L289 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2025-04-13 20:13:27,623 INFO L289 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2025-04-13 20:13:27,623 INFO L289 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2025-04-13 20:13:30,356 INFO L116 PetriNetUnfolderBase]: 31448/53391 cut-off events. [2025-04-13 20:13:30,356 INFO L117 PetriNetUnfolderBase]: For 120374/121949 co-relation queries the response was YES. [2025-04-13 20:13:30,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189735 conditions, 53391 events. 31448/53391 cut-off events. For 120374/121949 co-relation queries the response was YES. Maximal size of possible extension queue 1682. Compared 465832 event pairs, 8309 based on Foata normal form. 425/52865 useless extension candidates. Maximal degree in co-relation 176582. Up to 15979 conditions per place. [2025-04-13 20:13:30,790 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 276 selfloop transitions, 34 changer transitions 11/413 dead transitions. [2025-04-13 20:13:30,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 413 transitions, 3320 flow [2025-04-13 20:13:30,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 20:13:30,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 20:13:30,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 518 transitions. [2025-04-13 20:13:30,792 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5673603504928806 [2025-04-13 20:13:30,792 INFO L175 Difference]: Start difference. First operand has 135 places, 214 transitions, 1630 flow. Second operand 11 states and 518 transitions. [2025-04-13 20:13:30,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 413 transitions, 3320 flow [2025-04-13 20:13:32,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 413 transitions, 3273 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-04-13 20:13:32,263 INFO L231 Difference]: Finished difference. Result has 147 places, 221 transitions, 1739 flow [2025-04-13 20:13:32,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=1589, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1739, PETRI_PLACES=147, PETRI_TRANSITIONS=221} [2025-04-13 20:13:32,264 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 64 predicate places. [2025-04-13 20:13:32,264 INFO L485 AbstractCegarLoop]: Abstraction has has 147 places, 221 transitions, 1739 flow [2025-04-13 20:13:32,264 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 32.44444444444444) internal successors, (292), 9 states have internal predecessors, (292), 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-04-13 20:13:32,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:32,264 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:32,264 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 20:13:32,264 INFO L403 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-04-13 20:13:32,265 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:32,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1284090172, now seen corresponding path program 12 times [2025-04-13 20:13:32,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:32,265 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671775612] [2025-04-13 20:13:32,265 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:13:32,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:32,269 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 67 statements into 1 equivalence classes. [2025-04-13 20:13:32,273 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 20:13:32,273 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:13:32,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:32,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:13:32,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:32,357 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671775612] [2025-04-13 20:13:32,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671775612] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:13:32,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:13:32,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:13:32,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925370660] [2025-04-13 20:13:32,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:13:32,357 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:13:32,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:32,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:13:32,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:13:32,365 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-04-13 20:13:32,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 221 transitions, 1739 flow. Second operand has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 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-04-13 20:13:32,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:32,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-04-13 20:13:32,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:35,396 INFO L116 PetriNetUnfolderBase]: 20992/39011 cut-off events. [2025-04-13 20:13:35,397 INFO L117 PetriNetUnfolderBase]: For 107557/109351 co-relation queries the response was YES. [2025-04-13 20:13:35,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144408 conditions, 39011 events. 20992/39011 cut-off events. For 107557/109351 co-relation queries the response was YES. Maximal size of possible extension queue 1456. Compared 363440 event pairs, 5721 based on Foata normal form. 252/37531 useless extension candidates. Maximal degree in co-relation 143300. Up to 25290 conditions per place. [2025-04-13 20:13:35,996 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 173 selfloop transitions, 27 changer transitions 2/298 dead transitions. [2025-04-13 20:13:35,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 298 transitions, 2636 flow [2025-04-13 20:13:36,000 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:13:36,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:13:36,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 253 transitions. [2025-04-13 20:13:36,000 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6096385542168675 [2025-04-13 20:13:36,000 INFO L175 Difference]: Start difference. First operand has 147 places, 221 transitions, 1739 flow. Second operand 5 states and 253 transitions. [2025-04-13 20:13:36,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 298 transitions, 2636 flow [2025-04-13 20:13:36,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 298 transitions, 2589 flow, removed 14 selfloop flow, removed 3 redundant places. [2025-04-13 20:13:36,598 INFO L231 Difference]: Finished difference. Result has 151 places, 241 transitions, 2021 flow [2025-04-13 20:13:36,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=1692, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2021, PETRI_PLACES=151, PETRI_TRANSITIONS=241} [2025-04-13 20:13:36,599 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 68 predicate places. [2025-04-13 20:13:36,599 INFO L485 AbstractCegarLoop]: Abstraction has has 151 places, 241 transitions, 2021 flow [2025-04-13 20:13:36,599 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 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-04-13 20:13:36,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:36,599 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:36,599 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 20:13:36,599 INFO L403 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-04-13 20:13:36,600 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:36,600 INFO L85 PathProgramCache]: Analyzing trace with hash 73741620, now seen corresponding path program 13 times [2025-04-13 20:13:36,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:36,600 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172941349] [2025-04-13 20:13:36,600 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:13:36,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:36,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-13 20:13:36,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 20:13:36,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:13:36,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:36,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:13:36,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:36,682 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172941349] [2025-04-13 20:13:36,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172941349] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:13:36,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:13:36,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:13:36,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219877912] [2025-04-13 20:13:36,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:13:36,682 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:13:36,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:36,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:13:36,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:13:36,689 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-04-13 20:13:36,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 241 transitions, 2021 flow. Second operand has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 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-04-13 20:13:36,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:36,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-04-13 20:13:36,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:39,799 INFO L116 PetriNetUnfolderBase]: 21993/41017 cut-off events. [2025-04-13 20:13:39,799 INFO L117 PetriNetUnfolderBase]: For 123295/125371 co-relation queries the response was YES. [2025-04-13 20:13:40,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154584 conditions, 41017 events. 21993/41017 cut-off events. For 123295/125371 co-relation queries the response was YES. Maximal size of possible extension queue 1523. Compared 386629 event pairs, 5810 based on Foata normal form. 320/39438 useless extension candidates. Maximal degree in co-relation 153581. Up to 26874 conditions per place. [2025-04-13 20:13:40,169 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 181 selfloop transitions, 27 changer transitions 3/307 dead transitions. [2025-04-13 20:13:40,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 307 transitions, 2855 flow [2025-04-13 20:13:40,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:13:40,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:13:40,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 251 transitions. [2025-04-13 20:13:40,170 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6048192771084338 [2025-04-13 20:13:40,170 INFO L175 Difference]: Start difference. First operand has 151 places, 241 transitions, 2021 flow. Second operand 5 states and 251 transitions. [2025-04-13 20:13:40,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 307 transitions, 2855 flow [2025-04-13 20:13:41,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 307 transitions, 2834 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:13:41,181 INFO L231 Difference]: Finished difference. Result has 156 places, 254 transitions, 2218 flow [2025-04-13 20:13:41,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=2000, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2218, PETRI_PLACES=156, PETRI_TRANSITIONS=254} [2025-04-13 20:13:41,182 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 73 predicate places. [2025-04-13 20:13:41,182 INFO L485 AbstractCegarLoop]: Abstraction has has 156 places, 254 transitions, 2218 flow [2025-04-13 20:13:41,182 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 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-04-13 20:13:41,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:41,182 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:41,182 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 20:13:41,182 INFO L403 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-04-13 20:13:41,183 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:41,183 INFO L85 PathProgramCache]: Analyzing trace with hash -408557036, now seen corresponding path program 14 times [2025-04-13 20:13:41,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:41,183 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258509282] [2025-04-13 20:13:41,183 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:13:41,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:41,188 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 1 equivalence classes. [2025-04-13 20:13:41,192 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 20:13:41,193 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:13:41,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:41,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:13:41,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:41,284 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258509282] [2025-04-13 20:13:41,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258509282] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:13:41,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:13:41,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:13:41,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345585645] [2025-04-13 20:13:41,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:13:41,284 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:13:41,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:41,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:13:41,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:13:41,291 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-04-13 20:13:41,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 254 transitions, 2218 flow. Second operand has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 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-04-13 20:13:41,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:41,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-04-13 20:13:41,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:44,066 INFO L116 PetriNetUnfolderBase]: 17488/32629 cut-off events. [2025-04-13 20:13:44,066 INFO L117 PetriNetUnfolderBase]: For 102201/104751 co-relation queries the response was YES. [2025-04-13 20:13:44,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121949 conditions, 32629 events. 17488/32629 cut-off events. For 102201/104751 co-relation queries the response was YES. Maximal size of possible extension queue 1240. Compared 299301 event pairs, 4966 based on Foata normal form. 315/31237 useless extension candidates. Maximal degree in co-relation 121092. Up to 22112 conditions per place. [2025-04-13 20:13:44,286 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 180 selfloop transitions, 34 changer transitions 4/318 dead transitions. [2025-04-13 20:13:44,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 318 transitions, 3050 flow [2025-04-13 20:13:44,287 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:13:44,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:13:44,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 254 transitions. [2025-04-13 20:13:44,287 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6120481927710844 [2025-04-13 20:13:44,287 INFO L175 Difference]: Start difference. First operand has 156 places, 254 transitions, 2218 flow. Second operand 5 states and 254 transitions. [2025-04-13 20:13:44,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 318 transitions, 3050 flow [2025-04-13 20:13:44,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 318 transitions, 2996 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-04-13 20:13:44,821 INFO L231 Difference]: Finished difference. Result has 161 places, 263 transitions, 2430 flow [2025-04-13 20:13:44,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=2023, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2430, PETRI_PLACES=161, PETRI_TRANSITIONS=263} [2025-04-13 20:13:44,822 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 78 predicate places. [2025-04-13 20:13:44,822 INFO L485 AbstractCegarLoop]: Abstraction has has 161 places, 263 transitions, 2430 flow [2025-04-13 20:13:44,822 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 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-04-13 20:13:44,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:44,822 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:44,822 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 20:13:44,822 INFO L403 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-04-13 20:13:44,823 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:44,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1999680690, now seen corresponding path program 15 times [2025-04-13 20:13:44,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:44,823 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032185133] [2025-04-13 20:13:44,823 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:13:44,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:44,827 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 1 equivalence classes. [2025-04-13 20:13:44,830 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 20:13:44,830 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:13:44,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:44,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:13:44,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:44,898 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032185133] [2025-04-13 20:13:44,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032185133] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:13:44,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:13:44,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:13:44,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858630572] [2025-04-13 20:13:44,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:13:44,898 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:13:44,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:44,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:13:44,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:13:44,914 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-04-13 20:13:44,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 263 transitions, 2430 flow. Second operand has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 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-04-13 20:13:44,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:44,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-04-13 20:13:44,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:47,593 INFO L116 PetriNetUnfolderBase]: 16367/30580 cut-off events. [2025-04-13 20:13:47,593 INFO L117 PetriNetUnfolderBase]: For 96047/98422 co-relation queries the response was YES. [2025-04-13 20:13:47,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113317 conditions, 30580 events. 16367/30580 cut-off events. For 96047/98422 co-relation queries the response was YES. Maximal size of possible extension queue 1107. Compared 276450 event pairs, 4700 based on Foata normal form. 324/29469 useless extension candidates. Maximal degree in co-relation 112613. Up to 21133 conditions per place. [2025-04-13 20:13:47,815 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 186 selfloop transitions, 28 changer transitions 3/317 dead transitions. [2025-04-13 20:13:47,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 317 transitions, 3164 flow [2025-04-13 20:13:47,815 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:13:47,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:13:47,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 249 transitions. [2025-04-13 20:13:47,816 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-04-13 20:13:47,816 INFO L175 Difference]: Start difference. First operand has 161 places, 263 transitions, 2430 flow. Second operand 5 states and 249 transitions. [2025-04-13 20:13:47,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 317 transitions, 3164 flow [2025-04-13 20:13:48,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 317 transitions, 3137 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:13:48,202 INFO L231 Difference]: Finished difference. Result has 166 places, 270 transitions, 2562 flow [2025-04-13 20:13:48,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=2355, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2562, PETRI_PLACES=166, PETRI_TRANSITIONS=270} [2025-04-13 20:13:48,202 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 83 predicate places. [2025-04-13 20:13:48,202 INFO L485 AbstractCegarLoop]: Abstraction has has 166 places, 270 transitions, 2562 flow [2025-04-13 20:13:48,202 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 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-04-13 20:13:48,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:48,202 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:48,203 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 20:13:48,203 INFO L403 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-04-13 20:13:48,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:48,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1918863288, now seen corresponding path program 16 times [2025-04-13 20:13:48,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:48,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54472881] [2025-04-13 20:13:48,203 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:13:48,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:48,207 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 67 statements into 2 equivalence classes. [2025-04-13 20:13:48,212 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 20:13:48,212 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:13:48,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:48,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:13:48,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:48,295 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54472881] [2025-04-13 20:13:48,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54472881] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:13:48,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:13:48,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:13:48,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296438003] [2025-04-13 20:13:48,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:13:48,295 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:13:48,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:48,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:13:48,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:13:48,317 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 83 [2025-04-13 20:13:48,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 270 transitions, 2562 flow. Second operand has 9 states, 9 states have (on average 32.44444444444444) internal successors, (292), 9 states have internal predecessors, (292), 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-04-13 20:13:48,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:48,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 83 [2025-04-13 20:13:48,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:51,514 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([658] L82-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset][289], [Black: 213#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i3~0 1)), Black: 132#(= ~i1~0 0), 247#true, Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 227#(and (<= 1 ~n2~0) (= (+ ~n3~0 1) ~n2~0)), 63#thread2EXITtrue, 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), Black: 235#(and (= (+ ~n2~0 1) ~n3~0) (<= 0 ~n2~0)), 209#(and (= ~i1~0 0) (= ~i~0 1)), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 176#(= ~e2~0 1), Black: 180#(<= ~n2~0 ~n1~0), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 193#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 228#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 90#true, 257#(= ~i2~0 0), Black: 241#(and (<= 0 ~n1~0) (= ~n1~0 ~n3~0)), Black: 243#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0)), 48#L91-3true, Black: 219#(and (= ~i1~0 0) (= 3 ~i~0) (= ~i3~0 1) (= 2 ~i2~0)), Black: 187#(= ~e1~0 1), 142#(and (= ~i1~0 0) (= ~i~0 1)), 75#L132-1true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 242#(and (<= 1 ~n1~0) (= (+ ~n3~0 1) ~n1~0)), 159#true, Black: 251#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0)), Black: 250#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n3~0)), Black: 181#(<= (+ ~n2~0 1) ~n1~0), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 192#(and (<= 1 ~n1~0) (= (+ ~n2~0 1) ~n1~0)), Black: 215#(and (= ~i1~0 0) (= ~i3~0 1)), Black: 236#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 226#(and (= ~n2~0 ~n3~0) (<= 0 ~n2~0)), Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:51,514 INFO L286 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2025-04-13 20:13:51,514 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:51,514 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:51,514 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:51,517 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([664] L91-3-->L93-1: Formula: (and (= |v_thread3Thread1of1ForFork1_~tmp2~1#1_3| v_~n2~0_125) (< v_~n3~0_115 |v_thread3Thread1of1ForFork1_~tmp2~1#1_3|)) InVars {~n2~0=v_~n2~0_125, ~n3~0=v_~n3~0_115} OutVars{~n2~0=v_~n2~0_125, thread3Thread1of1ForFork1_~tmp2~1#1=|v_thread3Thread1of1ForFork1_~tmp2~1#1_3|, ~n3~0=v_~n3~0_115} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~tmp2~1#1][362], [Black: 213#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i3~0 1)), Black: 132#(= ~i1~0 0), 247#true, Black: 227#(and (<= 1 ~n2~0) (= (+ ~n3~0 1) ~n2~0)), Black: 162#(<= (+ ~n3~0 1) ~n1~0), 166#true, Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 131#(= ~i~0 0), Black: 235#(and (= (+ ~n2~0 1) ~n3~0) (<= 0 ~n2~0)), 209#(and (= ~i1~0 0) (= ~i~0 1)), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 180#(<= ~n2~0 ~n1~0), Black: 176#(= ~e2~0 1), Black: 193#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 228#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 90#true, 257#(= ~i2~0 0), Black: 241#(and (<= 0 ~n1~0) (= ~n1~0 ~n3~0)), Black: 243#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0)), Black: 219#(and (= ~i1~0 0) (= 3 ~i~0) (= ~i3~0 1) (= 2 ~i2~0)), Black: 187#(= ~e1~0 1), 142#(and (= ~i1~0 0) (= ~i~0 1)), 121#(<= (+ ~n3~0 1) ~n2~0), 75#L132-1true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 80#L82true, Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 251#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0)), Black: 242#(and (<= 1 ~n1~0) (= (+ ~n3~0 1) ~n1~0)), 159#true, Black: 250#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n3~0)), Black: 181#(<= (+ ~n2~0 1) ~n1~0), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 192#(and (<= 1 ~n1~0) (= (+ ~n2~0 1) ~n1~0)), Black: 215#(and (= ~i1~0 0) (= ~i3~0 1)), 76#L93-1true, Black: 118#true, Black: 236#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 226#(and (= ~n2~0 ~n3~0) (<= 0 ~n2~0)), Black: 161#(<= ~n3~0 ~n1~0), 178#true]) [2025-04-13 20:13:51,517 INFO L286 olderBase$Statistics]: this new event has 56 ancestors and is not cut-off event [2025-04-13 20:13:51,517 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is not cut-off event [2025-04-13 20:13:51,517 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is not cut-off event [2025-04-13 20:13:51,517 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is not cut-off event [2025-04-13 20:13:52,956 INFO L116 PetriNetUnfolderBase]: 26128/45710 cut-off events. [2025-04-13 20:13:52,957 INFO L117 PetriNetUnfolderBase]: For 145474/147517 co-relation queries the response was YES. [2025-04-13 20:13:53,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171206 conditions, 45710 events. 26128/45710 cut-off events. For 145474/147517 co-relation queries the response was YES. Maximal size of possible extension queue 1516. Compared 404858 event pairs, 7405 based on Foata normal form. 531/45102 useless extension candidates. Maximal degree in co-relation 170329. Up to 14603 conditions per place. [2025-04-13 20:13:53,318 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 299 selfloop transitions, 43 changer transitions 18/483 dead transitions. [2025-04-13 20:13:53,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 483 transitions, 4480 flow [2025-04-13 20:13:53,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 20:13:53,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 20:13:53,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 519 transitions. [2025-04-13 20:13:53,320 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5684556407447974 [2025-04-13 20:13:53,320 INFO L175 Difference]: Start difference. First operand has 166 places, 270 transitions, 2562 flow. Second operand 11 states and 519 transitions. [2025-04-13 20:13:53,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 483 transitions, 4480 flow [2025-04-13 20:13:54,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 483 transitions, 4430 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-04-13 20:13:54,539 INFO L231 Difference]: Finished difference. Result has 180 places, 289 transitions, 2804 flow [2025-04-13 20:13:54,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=2512, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2804, PETRI_PLACES=180, PETRI_TRANSITIONS=289} [2025-04-13 20:13:54,540 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 97 predicate places. [2025-04-13 20:13:54,540 INFO L485 AbstractCegarLoop]: Abstraction has has 180 places, 289 transitions, 2804 flow [2025-04-13 20:13:54,540 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 32.44444444444444) internal successors, (292), 9 states have internal predecessors, (292), 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-04-13 20:13:54,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:54,540 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:54,540 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 20:13:54,540 INFO L403 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-04-13 20:13:54,540 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:54,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1380008922, now seen corresponding path program 17 times [2025-04-13 20:13:54,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:54,541 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418862820] [2025-04-13 20:13:54,541 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:13:54,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:54,544 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 67 statements into 1 equivalence classes. [2025-04-13 20:13:54,547 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 20:13:54,548 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:13:54,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:54,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:13:54,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:54,627 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418862820] [2025-04-13 20:13:54,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418862820] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:13:54,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:13:54,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:13:54,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100807466] [2025-04-13 20:13:54,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:13:54,627 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:13:54,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:54,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:13:54,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:13:54,655 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 83 [2025-04-13 20:13:54,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 289 transitions, 2804 flow. Second operand has 9 states, 9 states have (on average 32.44444444444444) internal successors, (292), 9 states have internal predecessors, (292), 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-04-13 20:13:54,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:54,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 83 [2025-04-13 20:13:54,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:57,871 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([658] L82-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset][286], [Black: 271#(and (= 2 ~i~0) (= ~i1~0 1) (= ~i2~0 0)), Black: 132#(= ~i1~0 0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 256#(= ~i~0 0), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), Black: 235#(and (= (+ ~n2~0 1) ~n3~0) (<= 0 ~n2~0)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 228#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 90#true, Black: 241#(and (<= 0 ~n1~0) (= ~n1~0 ~n3~0)), Black: 243#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0)), 48#L91-3true, Black: 219#(and (= ~i1~0 0) (= 3 ~i~0) (= ~i3~0 1) (= 2 ~i2~0)), 142#(and (= ~i1~0 0) (= ~i~0 1)), Black: 187#(= ~e1~0 1), Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 242#(and (<= 1 ~n1~0) (= (+ ~n3~0 1) ~n1~0)), Black: 250#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n3~0)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 181#(<= (+ ~n2~0 1) ~n1~0), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 267#(and (= ~i2~0 0) (= ~i~0 1)), Black: 215#(and (= ~i1~0 0) (= ~i3~0 1)), Black: 236#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 226#(and (= ~n2~0 ~n3~0) (<= 0 ~n2~0)), Black: 161#(<= ~n3~0 ~n1~0), Black: 213#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i3~0 1)), Black: 227#(and (<= 1 ~n2~0) (= (+ ~n3~0 1) ~n2~0)), 63#thread2EXITtrue, 166#true, 209#(and (= ~i1~0 0) (= ~i~0 1)), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 180#(<= ~n2~0 ~n1~0), Black: 193#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 257#(= ~i2~0 0), 287#(= ~i2~0 0), Black: 269#(and (= ~i1~0 1) (= ~i2~0 0) (= ~i~0 1)), 75#L132-1true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 251#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0)), 159#true, Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 192#(and (<= 1 ~n1~0) (= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (= 2 ~i3~0) (= 3 ~i~0) (= ~i1~0 1) (= ~i2~0 0)), 178#true]) [2025-04-13 20:13:57,872 INFO L286 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2025-04-13 20:13:57,872 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:57,872 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:13:57,872 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:13:57,875 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([664] L91-3-->L93-1: Formula: (and (= |v_thread3Thread1of1ForFork1_~tmp2~1#1_3| v_~n2~0_125) (< v_~n3~0_115 |v_thread3Thread1of1ForFork1_~tmp2~1#1_3|)) InVars {~n2~0=v_~n2~0_125, ~n3~0=v_~n3~0_115} OutVars{~n2~0=v_~n2~0_125, thread3Thread1of1ForFork1_~tmp2~1#1=|v_thread3Thread1of1ForFork1_~tmp2~1#1_3|, ~n3~0=v_~n3~0_115} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~tmp2~1#1][357], [Black: 271#(and (= 2 ~i~0) (= ~i1~0 1) (= ~i2~0 0)), Black: 132#(= ~i1~0 0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 256#(= ~i~0 0), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 131#(= ~i~0 0), Black: 235#(and (= (+ ~n2~0 1) ~n3~0) (<= 0 ~n2~0)), Black: 176#(= ~e2~0 1), Black: 228#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 90#true, Black: 241#(and (<= 0 ~n1~0) (= ~n1~0 ~n3~0)), Black: 243#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0)), Black: 219#(and (= ~i1~0 0) (= 3 ~i~0) (= ~i3~0 1) (= 2 ~i2~0)), 121#(<= (+ ~n3~0 1) ~n2~0), 142#(and (= ~i1~0 0) (= ~i~0 1)), Black: 187#(= ~e1~0 1), 80#L82true, Black: 92#(= ~i~0 0), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 242#(and (<= 1 ~n1~0) (= (+ ~n3~0 1) ~n1~0)), Black: 250#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n3~0)), Black: 181#(<= (+ ~n2~0 1) ~n1~0), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 267#(and (= ~i2~0 0) (= ~i~0 1)), Black: 215#(and (= ~i1~0 0) (= ~i3~0 1)), 76#L93-1true, Black: 118#true, Black: 236#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 226#(and (= ~n2~0 ~n3~0) (<= 0 ~n2~0)), Black: 161#(<= ~n3~0 ~n1~0), Black: 213#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i3~0 1)), Black: 227#(and (<= 1 ~n2~0) (= (+ ~n3~0 1) ~n2~0)), 166#true, 209#(and (= ~i1~0 0) (= ~i~0 1)), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 180#(<= ~n2~0 ~n1~0), Black: 193#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 257#(= ~i2~0 0), 287#(= ~i2~0 0), Black: 269#(and (= ~i1~0 1) (= ~i2~0 0) (= ~i~0 1)), 75#L132-1true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 251#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0)), 159#true, Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), Black: 192#(and (<= 1 ~n1~0) (= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (= 2 ~i3~0) (= 3 ~i~0) (= ~i1~0 1) (= ~i2~0 0)), 178#true]) [2025-04-13 20:13:57,875 INFO L286 olderBase$Statistics]: this new event has 56 ancestors and is not cut-off event [2025-04-13 20:13:57,875 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is not cut-off event [2025-04-13 20:13:57,875 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is not cut-off event [2025-04-13 20:13:57,875 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is not cut-off event [2025-04-13 20:13:59,490 INFO L116 PetriNetUnfolderBase]: 26080/45630 cut-off events. [2025-04-13 20:13:59,490 INFO L117 PetriNetUnfolderBase]: For 160918/162835 co-relation queries the response was YES. [2025-04-13 20:13:59,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178408 conditions, 45630 events. 26080/45630 cut-off events. For 160918/162835 co-relation queries the response was YES. Maximal size of possible extension queue 1512. Compared 404025 event pairs, 7419 based on Foata normal form. 487/44958 useless extension candidates. Maximal degree in co-relation 177506. Up to 14603 conditions per place. [2025-04-13 20:14:00,140 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 298 selfloop transitions, 45 changer transitions 13/479 dead transitions. [2025-04-13 20:14:00,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 479 transitions, 4631 flow [2025-04-13 20:14:00,141 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 20:14:00,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 20:14:00,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 515 transitions. [2025-04-13 20:14:00,142 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5640744797371303 [2025-04-13 20:14:00,142 INFO L175 Difference]: Start difference. First operand has 180 places, 289 transitions, 2804 flow. Second operand 11 states and 515 transitions. [2025-04-13 20:14:00,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 479 transitions, 4631 flow [2025-04-13 20:14:01,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 479 transitions, 4580 flow, removed 22 selfloop flow, removed 1 redundant places. [2025-04-13 20:14:01,922 INFO L231 Difference]: Finished difference. Result has 191 places, 292 transitions, 2893 flow [2025-04-13 20:14:01,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=2759, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2893, PETRI_PLACES=191, PETRI_TRANSITIONS=292} [2025-04-13 20:14:01,922 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 108 predicate places. [2025-04-13 20:14:01,923 INFO L485 AbstractCegarLoop]: Abstraction has has 191 places, 292 transitions, 2893 flow [2025-04-13 20:14:01,923 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 32.44444444444444) internal successors, (292), 9 states have internal predecessors, (292), 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-04-13 20:14:01,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:14:01,923 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:14:01,923 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 20:14:01,923 INFO L403 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-04-13 20:14:01,923 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:14:01,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1212845192, now seen corresponding path program 18 times [2025-04-13 20:14:01,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:14:01,923 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857887824] [2025-04-13 20:14:01,924 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:14:01,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:14:01,929 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 67 statements into 1 equivalence classes. [2025-04-13 20:14:01,933 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 20:14:01,933 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:14:01,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:02,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:14:02,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:14:02,003 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857887824] [2025-04-13 20:14:02,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857887824] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:14:02,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:14:02,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:14:02,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752633910] [2025-04-13 20:14:02,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:14:02,004 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:14:02,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:14:02,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:14:02,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:14:02,041 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 83 [2025-04-13 20:14:02,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 292 transitions, 2893 flow. Second operand has 9 states, 9 states have (on average 32.44444444444444) internal successors, (292), 9 states have internal predecessors, (292), 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-04-13 20:14:02,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:14:02,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 83 [2025-04-13 20:14:02,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:14:05,435 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([658] L82-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset][98], [Black: 271#(and (= 2 ~i~0) (= ~i1~0 1) (= ~i2~0 0)), Black: 132#(= ~i1~0 0), Black: 256#(= ~i~0 0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#true, Black: 131#(= ~i~0 0), Black: 235#(and (= (+ ~n2~0 1) ~n3~0) (<= 0 ~n2~0)), Black: 176#(= ~e2~0 1), Black: 121#(<= (+ ~n3~0 1) ~n2~0), Black: 228#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 90#true, Black: 241#(and (<= 0 ~n1~0) (= ~n1~0 ~n3~0)), Black: 243#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0)), 48#L91-3true, Black: 219#(and (= ~i1~0 0) (= 3 ~i~0) (= ~i3~0 1) (= 2 ~i2~0)), 142#(and (= ~i1~0 0) (= ~i~0 1)), Black: 187#(= ~e1~0 1), Black: 92#(= ~i~0 0), Black: 242#(and (<= 1 ~n1~0) (= (+ ~n3~0 1) ~n1~0)), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 250#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n3~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 181#(<= (+ ~n2~0 1) ~n1~0), Black: 267#(and (= ~i2~0 0) (= ~i~0 1)), Black: 215#(and (= ~i1~0 0) (= ~i3~0 1)), Black: 236#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 226#(and (= ~n2~0 ~n3~0) (<= 0 ~n2~0)), Black: 161#(<= ~n3~0 ~n1~0), Black: 213#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i3~0 1)), Black: 301#(and (= 2 ~i~0) (= ~i2~0 0) (= ~i3~0 1)), Black: 227#(and (<= 1 ~n2~0) (= (+ ~n3~0 1) ~n2~0)), 63#thread2EXITtrue, 166#true, 209#(and (= ~i1~0 0) (= ~i~0 1)), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 180#(<= ~n2~0 ~n1~0), Black: 193#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 257#(= ~i2~0 0), 287#(= ~i2~0 0), Black: 269#(and (= ~i1~0 1) (= ~i2~0 0) (= ~i~0 1)), 75#L132-1true, Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), 159#true, Black: 251#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0)), Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 310#true, Black: 192#(and (<= 1 ~n1~0) (= (+ ~n2~0 1) ~n1~0)), Black: 307#(and (= 3 ~i~0) (= ~i2~0 0) (= 2 ~i1~0) (= ~i3~0 1)), Black: 277#(and (= 2 ~i3~0) (= 3 ~i~0) (= ~i1~0 1) (= ~i2~0 0)), 178#true]) [2025-04-13 20:14:05,435 INFO L286 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2025-04-13 20:14:05,435 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:14:05,435 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-04-13 20:14:05,435 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-04-13 20:14:05,437 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([664] L91-3-->L93-1: Formula: (and (= |v_thread3Thread1of1ForFork1_~tmp2~1#1_3| v_~n2~0_125) (< v_~n3~0_115 |v_thread3Thread1of1ForFork1_~tmp2~1#1_3|)) InVars {~n2~0=v_~n2~0_125, ~n3~0=v_~n3~0_115} OutVars{~n2~0=v_~n2~0_125, thread3Thread1of1ForFork1_~tmp2~1#1=|v_thread3Thread1of1ForFork1_~tmp2~1#1_3|, ~n3~0=v_~n3~0_115} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~tmp2~1#1][159], [Black: 271#(and (= 2 ~i~0) (= ~i1~0 1) (= ~i2~0 0)), Black: 132#(= ~i1~0 0), Black: 162#(<= (+ ~n3~0 1) ~n1~0), Black: 256#(= ~i~0 0), Black: 146#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 131#(= ~i~0 0), Black: 235#(and (= (+ ~n2~0 1) ~n3~0) (<= 0 ~n2~0)), Black: 176#(= ~e2~0 1), Black: 228#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 90#true, Black: 241#(and (<= 0 ~n1~0) (= ~n1~0 ~n3~0)), Black: 243#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0)), Black: 219#(and (= ~i1~0 0) (= 3 ~i~0) (= ~i3~0 1) (= 2 ~i2~0)), 142#(and (= ~i1~0 0) (= ~i~0 1)), 121#(<= (+ ~n3~0 1) ~n2~0), Black: 187#(= ~e1~0 1), 80#L82true, Black: 92#(= ~i~0 0), Black: 242#(and (<= 1 ~n1~0) (= (+ ~n3~0 1) ~n1~0)), Black: 168#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0)), Black: 250#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n3~0)), Black: 103#(and (= ~i3~0 0) (= ~i~0 1)), Black: 170#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), Black: 181#(<= (+ ~n2~0 1) ~n1~0), Black: 267#(and (= ~i2~0 0) (= ~i~0 1)), Black: 215#(and (= ~i1~0 0) (= ~i3~0 1)), Black: 118#true, 76#L93-1true, Black: 236#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 226#(and (= ~n2~0 ~n3~0) (<= 0 ~n2~0)), Black: 161#(<= ~n3~0 ~n1~0), Black: 213#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i3~0 1)), Black: 301#(and (= 2 ~i~0) (= ~i2~0 0) (= ~i3~0 1)), Black: 227#(and (<= 1 ~n2~0) (= (+ ~n3~0 1) ~n2~0)), 166#true, 209#(and (= ~i1~0 0) (= ~i~0 1)), Black: 150#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 180#(<= ~n2~0 ~n1~0), Black: 193#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0)), 257#(= ~i2~0 0), 287#(= ~i2~0 0), 75#L132-1true, Black: 269#(and (= ~i1~0 1) (= ~i2~0 0) (= ~i~0 1)), Black: 169#(and (<= 0 ~n1~0) (= (+ ~n1~0 1) ~n2~0)), Black: 120#(<= ~n3~0 ~n2~0), Black: 251#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0)), 159#true, Black: 107#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i1~0 1)), 310#true, Black: 192#(and (<= 1 ~n1~0) (= (+ ~n2~0 1) ~n1~0)), Black: 307#(and (= 3 ~i~0) (= ~i2~0 0) (= 2 ~i1~0) (= ~i3~0 1)), Black: 277#(and (= 2 ~i3~0) (= 3 ~i~0) (= ~i1~0 1) (= ~i2~0 0)), 178#true]) [2025-04-13 20:14:05,437 INFO L286 olderBase$Statistics]: this new event has 56 ancestors and is not cut-off event [2025-04-13 20:14:05,437 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is not cut-off event [2025-04-13 20:14:05,437 INFO L289 olderBase$Statistics]: existing Event has 57 ancestors and is not cut-off event [2025-04-13 20:14:05,438 INFO L289 olderBase$Statistics]: existing Event has 56 ancestors and is not cut-off event [2025-04-13 20:14:06,910 INFO L116 PetriNetUnfolderBase]: 26192/45929 cut-off events. [2025-04-13 20:14:06,910 INFO L117 PetriNetUnfolderBase]: For 166359/168170 co-relation queries the response was YES. [2025-04-13 20:14:07,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179504 conditions, 45929 events. 26192/45929 cut-off events. For 166359/168170 co-relation queries the response was YES. Maximal size of possible extension queue 1520. Compared 407797 event pairs, 7678 based on Foata normal form. 452/45247 useless extension candidates. Maximal degree in co-relation 178583. Up to 16194 conditions per place. [2025-04-13 20:14:07,354 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 289 selfloop transitions, 41 changer transitions 15/468 dead transitions. [2025-04-13 20:14:07,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 468 transitions, 4662 flow [2025-04-13 20:14:07,355 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 20:14:07,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 20:14:07,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 508 transitions. [2025-04-13 20:14:07,356 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.556407447973713 [2025-04-13 20:14:07,356 INFO L175 Difference]: Start difference. First operand has 191 places, 292 transitions, 2893 flow. Second operand 11 states and 508 transitions. [2025-04-13 20:14:07,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 468 transitions, 4662 flow [2025-04-13 20:14:09,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 468 transitions, 4567 flow, removed 21 selfloop flow, removed 7 redundant places. [2025-04-13 20:14:09,704 INFO L231 Difference]: Finished difference. Result has 195 places, 294 transitions, 2902 flow [2025-04-13 20:14:09,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=2800, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2902, PETRI_PLACES=195, PETRI_TRANSITIONS=294} [2025-04-13 20:14:09,705 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 112 predicate places. [2025-04-13 20:14:09,705 INFO L485 AbstractCegarLoop]: Abstraction has has 195 places, 294 transitions, 2902 flow [2025-04-13 20:14:09,705 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 32.44444444444444) internal successors, (292), 9 states have internal predecessors, (292), 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-04-13 20:14:09,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:14:09,705 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:14:09,705 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 20:14:09,705 INFO L403 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-04-13 20:14:09,705 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:14:09,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1573323293, now seen corresponding path program 1 times [2025-04-13 20:14:09,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:14:09,706 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197487977] [2025-04-13 20:14:09,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:14:09,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:14:09,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-13 20:14:09,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 20:14:09,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:14:09,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:09,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:14:09,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:14:09,775 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197487977] [2025-04-13 20:14:09,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197487977] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:14:09,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:14:09,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:14:09,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702825948] [2025-04-13 20:14:09,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:14:09,776 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:14:09,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:14:09,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:14:09,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:14:09,786 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-04-13 20:14:09,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 294 transitions, 2902 flow. Second operand has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 7 states have internal predecessors, (247), 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-04-13 20:14:09,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:14:09,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-04-13 20:14:09,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:14:13,267 INFO L116 PetriNetUnfolderBase]: 19123/36318 cut-off events. [2025-04-13 20:14:13,268 INFO L117 PetriNetUnfolderBase]: For 137937/140368 co-relation queries the response was YES. [2025-04-13 20:14:13,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141960 conditions, 36318 events. 19123/36318 cut-off events. For 137937/140368 co-relation queries the response was YES. Maximal size of possible extension queue 1328. Compared 343079 event pairs, 7489 based on Foata normal form. 268/35307 useless extension candidates. Maximal degree in co-relation 141052. Up to 15762 conditions per place. [2025-04-13 20:14:13,534 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 212 selfloop transitions, 67 changer transitions 20/424 dead transitions. [2025-04-13 20:14:13,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 424 transitions, 4417 flow [2025-04-13 20:14:13,534 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:14:13,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:14:13,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 343 transitions. [2025-04-13 20:14:13,535 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5903614457831325 [2025-04-13 20:14:13,535 INFO L175 Difference]: Start difference. First operand has 195 places, 294 transitions, 2902 flow. Second operand 7 states and 343 transitions. [2025-04-13 20:14:13,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 424 transitions, 4417 flow [2025-04-13 20:14:14,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 424 transitions, 4188 flow, removed 20 selfloop flow, removed 16 redundant places. [2025-04-13 20:14:14,257 INFO L231 Difference]: Finished difference. Result has 190 places, 305 transitions, 3024 flow [2025-04-13 20:14:14,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=2673, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3024, PETRI_PLACES=190, PETRI_TRANSITIONS=305} [2025-04-13 20:14:14,258 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 107 predicate places. [2025-04-13 20:14:14,258 INFO L485 AbstractCegarLoop]: Abstraction has has 190 places, 305 transitions, 3024 flow [2025-04-13 20:14:14,258 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 7 states have internal predecessors, (247), 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-04-13 20:14:14,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:14:14,258 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:14:14,258 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 20:14:14,258 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:14:14,259 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:14:14,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1521359494, now seen corresponding path program 1 times [2025-04-13 20:14:14,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:14:14,259 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249397316] [2025-04-13 20:14:14,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:14:14,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:14:14,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-13 20:14:14,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 20:14:14,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:14:14,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:14,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:14:14,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:14:14,359 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249397316] [2025-04-13 20:14:14,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249397316] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:14:14,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:14:14,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:14:14,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137771976] [2025-04-13 20:14:14,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:14:14,359 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:14:14,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:14:14,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:14:14,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:14:14,379 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 83 [2025-04-13 20:14:14,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 305 transitions, 3024 flow. Second operand has 8 states, 8 states have (on average 30.75) internal successors, (246), 8 states have internal predecessors, (246), 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-04-13 20:14:14,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:14:14,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 83 [2025-04-13 20:14:14,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:14:18,460 INFO L116 PetriNetUnfolderBase]: 22475/39894 cut-off events. [2025-04-13 20:14:18,461 INFO L117 PetriNetUnfolderBase]: For 206201/209028 co-relation queries the response was YES. [2025-04-13 20:14:18,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165091 conditions, 39894 events. 22475/39894 cut-off events. For 206201/209028 co-relation queries the response was YES. Maximal size of possible extension queue 1475. Compared 353787 event pairs, 6792 based on Foata normal form. 288/38791 useless extension candidates. Maximal degree in co-relation 164067. Up to 28672 conditions per place. [2025-04-13 20:14:18,790 INFO L140 encePairwiseOnDemand]: 62/83 looper letters, 299 selfloop transitions, 100 changer transitions 27/519 dead transitions. [2025-04-13 20:14:18,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 519 transitions, 5427 flow [2025-04-13 20:14:18,790 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 20:14:18,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-13 20:14:18,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 719 transitions. [2025-04-13 20:14:18,792 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48125836680053546 [2025-04-13 20:14:18,792 INFO L175 Difference]: Start difference. First operand has 190 places, 305 transitions, 3024 flow. Second operand 18 states and 719 transitions. [2025-04-13 20:14:18,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 519 transitions, 5427 flow [2025-04-13 20:14:19,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 519 transitions, 5391 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-04-13 20:14:19,403 INFO L231 Difference]: Finished difference. Result has 221 places, 376 transitions, 4267 flow [2025-04-13 20:14:19,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=2958, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4267, PETRI_PLACES=221, PETRI_TRANSITIONS=376} [2025-04-13 20:14:19,403 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 138 predicate places. [2025-04-13 20:14:19,404 INFO L485 AbstractCegarLoop]: Abstraction has has 221 places, 376 transitions, 4267 flow [2025-04-13 20:14:19,404 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.75) internal successors, (246), 8 states have internal predecessors, (246), 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-04-13 20:14:19,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:14:19,404 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:14:19,404 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 20:14:19,404 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:14:19,404 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:14:19,404 INFO L85 PathProgramCache]: Analyzing trace with hash 401711832, now seen corresponding path program 2 times [2025-04-13 20:14:19,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:14:19,405 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732708237] [2025-04-13 20:14:19,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:14:19,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:14:19,408 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 1 equivalence classes. [2025-04-13 20:14:19,411 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 20:14:19,412 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:14:19,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:19,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:14:19,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:14:19,501 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732708237] [2025-04-13 20:14:19,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732708237] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:14:19,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:14:19,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:14:19,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878733243] [2025-04-13 20:14:19,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:14:19,501 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:14:19,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:14:19,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:14:19,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:14:19,517 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 83 [2025-04-13 20:14:19,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 376 transitions, 4267 flow. Second operand has 8 states, 8 states have (on average 30.75) internal successors, (246), 8 states have internal predecessors, (246), 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-04-13 20:14:19,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:14:19,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 83 [2025-04-13 20:14:19,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:14:24,108 INFO L116 PetriNetUnfolderBase]: 23018/41131 cut-off events. [2025-04-13 20:14:24,109 INFO L117 PetriNetUnfolderBase]: For 283785/287587 co-relation queries the response was YES. [2025-04-13 20:14:24,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184618 conditions, 41131 events. 23018/41131 cut-off events. For 283785/287587 co-relation queries the response was YES. Maximal size of possible extension queue 1488. Compared 369074 event pairs, 6989 based on Foata normal form. 346/40121 useless extension candidates. Maximal degree in co-relation 183108. Up to 28424 conditions per place. [2025-04-13 20:14:24,577 INFO L140 encePairwiseOnDemand]: 63/83 looper letters, 294 selfloop transitions, 102 changer transitions 22/511 dead transitions. [2025-04-13 20:14:24,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 511 transitions, 5879 flow [2025-04-13 20:14:24,578 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:14:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:14:24,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 617 transitions. [2025-04-13 20:14:24,579 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4955823293172691 [2025-04-13 20:14:24,579 INFO L175 Difference]: Start difference. First operand has 221 places, 376 transitions, 4267 flow. Second operand 15 states and 617 transitions. [2025-04-13 20:14:24,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 511 transitions, 5879 flow [2025-04-13 20:14:25,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 511 transitions, 5675 flow, removed 102 selfloop flow, removed 3 redundant places. [2025-04-13 20:14:25,718 INFO L231 Difference]: Finished difference. Result has 236 places, 379 transitions, 4421 flow [2025-04-13 20:14:25,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=4059, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4421, PETRI_PLACES=236, PETRI_TRANSITIONS=379} [2025-04-13 20:14:25,719 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 153 predicate places. [2025-04-13 20:14:25,719 INFO L485 AbstractCegarLoop]: Abstraction has has 236 places, 379 transitions, 4421 flow [2025-04-13 20:14:25,719 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.75) internal successors, (246), 8 states have internal predecessors, (246), 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-04-13 20:14:25,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:14:25,719 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:14:25,719 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 20:14:25,719 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:14:25,720 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:14:25,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1718275987, now seen corresponding path program 1 times [2025-04-13 20:14:25,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:14:25,720 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785007479] [2025-04-13 20:14:25,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:14:25,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:14:25,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-13 20:14:25,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 20:14:25,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:14:25,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:25,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:14:25,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:14:25,785 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785007479] [2025-04-13 20:14:25,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785007479] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:14:25,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:14:25,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:14:25,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144285047] [2025-04-13 20:14:25,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:14:25,786 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:14:25,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:14:25,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:14:25,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:14:25,794 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-04-13 20:14:25,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 379 transitions, 4421 flow. Second operand has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 7 states have internal predecessors, (247), 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-04-13 20:14:25,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:14:25,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-04-13 20:14:25,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:14:30,447 INFO L116 PetriNetUnfolderBase]: 21959/41425 cut-off events. [2025-04-13 20:14:30,447 INFO L117 PetriNetUnfolderBase]: For 309628/313542 co-relation queries the response was YES. [2025-04-13 20:14:30,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187643 conditions, 41425 events. 21959/41425 cut-off events. For 309628/313542 co-relation queries the response was YES. Maximal size of possible extension queue 1527. Compared 397656 event pairs, 9319 based on Foata normal form. 520/40532 useless extension candidates. Maximal degree in co-relation 186099. Up to 19210 conditions per place. [2025-04-13 20:14:31,040 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 281 selfloop transitions, 91 changer transitions 27/529 dead transitions. [2025-04-13 20:14:31,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 529 transitions, 6602 flow [2025-04-13 20:14:31,041 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:14:31,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:14:31,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 346 transitions. [2025-04-13 20:14:31,042 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5955249569707401 [2025-04-13 20:14:31,042 INFO L175 Difference]: Start difference. First operand has 236 places, 379 transitions, 4421 flow. Second operand 7 states and 346 transitions. [2025-04-13 20:14:31,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 529 transitions, 6602 flow [2025-04-13 20:14:32,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 529 transitions, 6463 flow, removed 28 selfloop flow, removed 10 redundant places. [2025-04-13 20:14:32,394 INFO L231 Difference]: Finished difference. Result has 233 places, 401 transitions, 4877 flow [2025-04-13 20:14:32,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=4296, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4877, PETRI_PLACES=233, PETRI_TRANSITIONS=401} [2025-04-13 20:14:32,394 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 150 predicate places. [2025-04-13 20:14:32,395 INFO L485 AbstractCegarLoop]: Abstraction has has 233 places, 401 transitions, 4877 flow [2025-04-13 20:14:32,395 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 7 states have internal predecessors, (247), 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-04-13 20:14:32,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:14:32,395 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:14:32,395 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 20:14:32,395 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:14:32,395 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:14:32,395 INFO L85 PathProgramCache]: Analyzing trace with hash 286506074, now seen corresponding path program 3 times [2025-04-13 20:14:32,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:14:32,395 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183851760] [2025-04-13 20:14:32,396 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:14:32,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:14:32,399 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 1 equivalence classes. [2025-04-13 20:14:32,401 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 20:14:32,401 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:14:32,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:32,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:14:32,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:14:32,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183851760] [2025-04-13 20:14:32,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183851760] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:14:32,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:14:32,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:14:32,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875362746] [2025-04-13 20:14:32,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:14:32,430 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:14:32,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:14:32,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:14:32,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:14:32,437 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-04-13 20:14:32,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 401 transitions, 4877 flow. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 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-04-13 20:14:32,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:14:32,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-04-13 20:14:32,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:14:37,232 INFO L116 PetriNetUnfolderBase]: 21675/41167 cut-off events. [2025-04-13 20:14:37,233 INFO L117 PetriNetUnfolderBase]: For 350743/355178 co-relation queries the response was YES. [2025-04-13 20:14:37,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189792 conditions, 41167 events. 21675/41167 cut-off events. For 350743/355178 co-relation queries the response was YES. Maximal size of possible extension queue 1601. Compared 397668 event pairs, 7878 based on Foata normal form. 597/40106 useless extension candidates. Maximal degree in co-relation 188105. Up to 13752 conditions per place. [2025-04-13 20:14:37,611 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 249 selfloop transitions, 81 changer transitions 13/503 dead transitions. [2025-04-13 20:14:37,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 503 transitions, 6607 flow [2025-04-13 20:14:37,612 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:14:37,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:14:37,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 234 transitions. [2025-04-13 20:14:37,612 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7048192771084337 [2025-04-13 20:14:37,612 INFO L175 Difference]: Start difference. First operand has 233 places, 401 transitions, 4877 flow. Second operand 4 states and 234 transitions. [2025-04-13 20:14:37,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 503 transitions, 6607 flow [2025-04-13 20:14:38,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 503 transitions, 6485 flow, removed 54 selfloop flow, removed 1 redundant places. [2025-04-13 20:14:38,758 INFO L231 Difference]: Finished difference. Result has 236 places, 407 transitions, 5152 flow [2025-04-13 20:14:38,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=4634, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=5152, PETRI_PLACES=236, PETRI_TRANSITIONS=407} [2025-04-13 20:14:38,759 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 153 predicate places. [2025-04-13 20:14:38,759 INFO L485 AbstractCegarLoop]: Abstraction has has 236 places, 407 transitions, 5152 flow [2025-04-13 20:14:38,759 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 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-04-13 20:14:38,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:14:38,759 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:14:38,759 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 20:14:38,759 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:14:38,760 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:14:38,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1165957152, now seen corresponding path program 4 times [2025-04-13 20:14:38,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:14:38,760 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825296578] [2025-04-13 20:14:38,760 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:14:38,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:14:38,764 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 68 statements into 2 equivalence classes. [2025-04-13 20:14:38,768 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 20:14:38,769 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:14:38,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:38,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:14:38,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:14:38,841 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825296578] [2025-04-13 20:14:38,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825296578] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:14:38,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:14:38,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:14:38,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27022185] [2025-04-13 20:14:38,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:14:38,841 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:14:38,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:14:38,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:14:38,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:14:38,855 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 83 [2025-04-13 20:14:38,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 407 transitions, 5152 flow. Second operand has 8 states, 8 states have (on average 30.75) internal successors, (246), 8 states have internal predecessors, (246), 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-04-13 20:14:38,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:14:38,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 83 [2025-04-13 20:14:38,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:14:46,628 INFO L116 PetriNetUnfolderBase]: 33413/61736 cut-off events. [2025-04-13 20:14:46,628 INFO L117 PetriNetUnfolderBase]: For 695536/701226 co-relation queries the response was YES. [2025-04-13 20:14:47,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309571 conditions, 61736 events. 33413/61736 cut-off events. For 695536/701226 co-relation queries the response was YES. Maximal size of possible extension queue 2438. Compared 608279 event pairs, 10539 based on Foata normal form. 879/60823 useless extension candidates. Maximal degree in co-relation 305745. Up to 25325 conditions per place. [2025-04-13 20:14:47,314 INFO L140 encePairwiseOnDemand]: 60/83 looper letters, 493 selfloop transitions, 176 changer transitions 49/811 dead transitions. [2025-04-13 20:14:47,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 811 transitions, 11362 flow [2025-04-13 20:14:47,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:14:47,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:14:47,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 606 transitions. [2025-04-13 20:14:47,316 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.561631139944393 [2025-04-13 20:14:47,316 INFO L175 Difference]: Start difference. First operand has 236 places, 407 transitions, 5152 flow. Second operand 13 states and 606 transitions. [2025-04-13 20:14:47,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 811 transitions, 11362 flow [2025-04-13 20:14:49,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 811 transitions, 11261 flow, removed 11 selfloop flow, removed 1 redundant places. [2025-04-13 20:14:49,505 INFO L231 Difference]: Finished difference. Result has 259 places, 476 transitions, 6957 flow [2025-04-13 20:14:49,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=4979, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=6957, PETRI_PLACES=259, PETRI_TRANSITIONS=476} [2025-04-13 20:14:49,505 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 176 predicate places. [2025-04-13 20:14:49,506 INFO L485 AbstractCegarLoop]: Abstraction has has 259 places, 476 transitions, 6957 flow [2025-04-13 20:14:49,506 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.75) internal successors, (246), 8 states have internal predecessors, (246), 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-04-13 20:14:49,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:14:49,506 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:14:49,506 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 20:14:49,506 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:14:49,506 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:14:49,506 INFO L85 PathProgramCache]: Analyzing trace with hash -86101934, now seen corresponding path program 1 times [2025-04-13 20:14:49,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:14:49,506 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413560947] [2025-04-13 20:14:49,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:14:49,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:14:49,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-13 20:14:49,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 20:14:49,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:14:49,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:49,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:14:49,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:14:49,597 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413560947] [2025-04-13 20:14:49,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413560947] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:14:49,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:14:49,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:14:49,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146390921] [2025-04-13 20:14:49,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:14:49,597 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:14:49,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:14:49,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:14:49,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:14:49,614 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 83 [2025-04-13 20:14:49,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 476 transitions, 6957 flow. Second operand has 8 states, 8 states have (on average 30.75) internal successors, (246), 8 states have internal predecessors, (246), 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-04-13 20:14:49,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:14:49,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 83 [2025-04-13 20:14:49,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:14:58,607 INFO L116 PetriNetUnfolderBase]: 33563/62108 cut-off events. [2025-04-13 20:14:58,607 INFO L117 PetriNetUnfolderBase]: For 1005508/1015160 co-relation queries the response was YES. [2025-04-13 20:14:59,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347398 conditions, 62108 events. 33563/62108 cut-off events. For 1005508/1015160 co-relation queries the response was YES. Maximal size of possible extension queue 2417. Compared 613658 event pairs, 10704 based on Foata normal form. 1055/61454 useless extension candidates. Maximal degree in co-relation 343072. Up to 43985 conditions per place. [2025-04-13 20:14:59,304 INFO L140 encePairwiseOnDemand]: 61/83 looper letters, 483 selfloop transitions, 148 changer transitions 30/754 dead transitions. [2025-04-13 20:14:59,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 754 transitions, 11190 flow [2025-04-13 20:14:59,304 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 20:14:59,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 20:14:59,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 682 transitions. [2025-04-13 20:14:59,306 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5135542168674698 [2025-04-13 20:14:59,306 INFO L175 Difference]: Start difference. First operand has 259 places, 476 transitions, 6957 flow. Second operand 16 states and 682 transitions. [2025-04-13 20:14:59,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 754 transitions, 11190 flow [2025-04-13 20:15:04,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 754 transitions, 10914 flow, removed 138 selfloop flow, removed 0 redundant places. [2025-04-13 20:15:04,342 INFO L231 Difference]: Finished difference. Result has 287 places, 575 transitions, 8908 flow [2025-04-13 20:15:04,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=6709, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=8908, PETRI_PLACES=287, PETRI_TRANSITIONS=575} [2025-04-13 20:15:04,343 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 204 predicate places. [2025-04-13 20:15:04,343 INFO L485 AbstractCegarLoop]: Abstraction has has 287 places, 575 transitions, 8908 flow [2025-04-13 20:15:04,343 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.75) internal successors, (246), 8 states have internal predecessors, (246), 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-04-13 20:15:04,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:15:04,343 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:15:04,343 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 20:15:04,343 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:15:04,344 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:15:04,344 INFO L85 PathProgramCache]: Analyzing trace with hash 882554848, now seen corresponding path program 2 times [2025-04-13 20:15:04,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:15:04,344 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046828681] [2025-04-13 20:15:04,344 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:15:04,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:15:04,349 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 1 equivalence classes. [2025-04-13 20:15:04,353 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 20:15:04,353 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:15:04,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:04,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:15:04,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:15:04,463 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046828681] [2025-04-13 20:15:04,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046828681] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:15:04,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:15:04,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:15:04,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635909503] [2025-04-13 20:15:04,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:15:04,464 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:15:04,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:15:04,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:15:04,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:15:04,486 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 83 [2025-04-13 20:15:04,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 575 transitions, 8908 flow. Second operand has 8 states, 8 states have (on average 30.75) internal successors, (246), 8 states have internal predecessors, (246), 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-04-13 20:15:04,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:15:04,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 83 [2025-04-13 20:15:04,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:15:14,589 INFO L116 PetriNetUnfolderBase]: 34132/63450 cut-off events. [2025-04-13 20:15:14,590 INFO L117 PetriNetUnfolderBase]: For 1040861/1051072 co-relation queries the response was YES. [2025-04-13 20:15:15,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359588 conditions, 63450 events. 34132/63450 cut-off events. For 1040861/1051072 co-relation queries the response was YES. Maximal size of possible extension queue 2499. Compared 631666 event pairs, 10787 based on Foata normal form. 1449/63247 useless extension candidates. Maximal degree in co-relation 356861. Up to 43286 conditions per place. [2025-04-13 20:15:15,685 INFO L140 encePairwiseOnDemand]: 60/83 looper letters, 502 selfloop transitions, 158 changer transitions 28/781 dead transitions. [2025-04-13 20:15:15,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 781 transitions, 12127 flow [2025-04-13 20:15:15,686 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 20:15:15,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-13 20:15:15,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 775 transitions. [2025-04-13 20:15:15,687 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4914394419784401 [2025-04-13 20:15:15,687 INFO L175 Difference]: Start difference. First operand has 287 places, 575 transitions, 8908 flow. Second operand 19 states and 775 transitions. [2025-04-13 20:15:15,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 781 transitions, 12127 flow [2025-04-13 20:15:21,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 781 transitions, 11873 flow, removed 127 selfloop flow, removed 2 redundant places. [2025-04-13 20:15:21,132 INFO L231 Difference]: Finished difference. Result has 312 places, 589 transitions, 9428 flow [2025-04-13 20:15:21,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=8666, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=9428, PETRI_PLACES=312, PETRI_TRANSITIONS=589} [2025-04-13 20:15:21,133 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 229 predicate places. [2025-04-13 20:15:21,133 INFO L485 AbstractCegarLoop]: Abstraction has has 312 places, 589 transitions, 9428 flow [2025-04-13 20:15:21,133 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.75) internal successors, (246), 8 states have internal predecessors, (246), 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-04-13 20:15:21,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:15:21,133 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:15:21,133 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 20:15:21,133 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:15:21,134 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:15:21,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1278940472, now seen corresponding path program 3 times [2025-04-13 20:15:21,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:15:21,134 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429555664] [2025-04-13 20:15:21,134 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:15:21,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:15:21,137 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 1 equivalence classes. [2025-04-13 20:15:21,140 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 20:15:21,140 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:15:21,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:21,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:15:21,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:15:21,197 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429555664] [2025-04-13 20:15:21,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429555664] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:15:21,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:15:21,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:15:21,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839805559] [2025-04-13 20:15:21,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:15:21,197 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:15:21,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:15:21,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:15:21,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:15:21,208 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-04-13 20:15:21,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 589 transitions, 9428 flow. Second operand has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 7 states have internal predecessors, (247), 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-04-13 20:15:21,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:15:21,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-04-13 20:15:21,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:15:30,597 INFO L116 PetriNetUnfolderBase]: 28836/56555 cut-off events. [2025-04-13 20:15:30,597 INFO L117 PetriNetUnfolderBase]: For 989955/995647 co-relation queries the response was YES. [2025-04-13 20:15:31,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323520 conditions, 56555 events. 28836/56555 cut-off events. For 989955/995647 co-relation queries the response was YES. Maximal size of possible extension queue 2399. Compared 589200 event pairs, 13178 based on Foata normal form. 660/55307 useless extension candidates. Maximal degree in co-relation 321505. Up to 29331 conditions per place. [2025-04-13 20:15:31,384 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 399 selfloop transitions, 140 changer transitions 18/765 dead transitions. [2025-04-13 20:15:31,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 765 transitions, 12996 flow [2025-04-13 20:15:31,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:15:31,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:15:31,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 348 transitions. [2025-04-13 20:15:31,389 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5989672977624785 [2025-04-13 20:15:31,389 INFO L175 Difference]: Start difference. First operand has 312 places, 589 transitions, 9428 flow. Second operand 7 states and 348 transitions. [2025-04-13 20:15:31,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 765 transitions, 12996 flow [2025-04-13 20:15:36,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 765 transitions, 12679 flow, removed 85 selfloop flow, removed 8 redundant places. [2025-04-13 20:15:36,035 INFO L231 Difference]: Finished difference. Result has 311 places, 606 transitions, 9775 flow [2025-04-13 20:15:36,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=8976, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9775, PETRI_PLACES=311, PETRI_TRANSITIONS=606} [2025-04-13 20:15:36,036 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 228 predicate places. [2025-04-13 20:15:36,036 INFO L485 AbstractCegarLoop]: Abstraction has has 311 places, 606 transitions, 9775 flow [2025-04-13 20:15:36,036 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 7 states have internal predecessors, (247), 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-04-13 20:15:36,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:15:36,036 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:15:36,036 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 20:15:36,036 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:15:36,037 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:15:36,037 INFO L85 PathProgramCache]: Analyzing trace with hash -188340368, now seen corresponding path program 4 times [2025-04-13 20:15:36,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:15:36,037 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298816046] [2025-04-13 20:15:36,037 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:15:36,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:15:36,041 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 68 statements into 2 equivalence classes. [2025-04-13 20:15:36,043 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 20:15:36,043 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:15:36,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:36,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:15:36,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:15:36,066 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298816046] [2025-04-13 20:15:36,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298816046] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:15:36,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:15:36,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:15:36,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304633761] [2025-04-13 20:15:36,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:15:36,066 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:15:36,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:15:36,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:15:36,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:15:36,076 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-04-13 20:15:36,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 606 transitions, 9775 flow. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 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-04-13 20:15:36,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:15:36,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-04-13 20:15:36,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:15:45,653 INFO L116 PetriNetUnfolderBase]: 28562/56305 cut-off events. [2025-04-13 20:15:45,654 INFO L117 PetriNetUnfolderBase]: For 1005849/1010990 co-relation queries the response was YES. [2025-04-13 20:15:46,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318855 conditions, 56305 events. 28562/56305 cut-off events. For 1005849/1010990 co-relation queries the response was YES. Maximal size of possible extension queue 2370. Compared 586045 event pairs, 8515 based on Foata normal form. 840/55359 useless extension candidates. Maximal degree in co-relation 316691. Up to 19073 conditions per place. [2025-04-13 20:15:46,742 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 324 selfloop transitions, 157 changer transitions 13/696 dead transitions. [2025-04-13 20:15:46,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 696 transitions, 11993 flow [2025-04-13 20:15:46,742 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:15:46,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:15:46,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 269 transitions. [2025-04-13 20:15:46,744 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6481927710843374 [2025-04-13 20:15:46,744 INFO L175 Difference]: Start difference. First operand has 311 places, 606 transitions, 9775 flow. Second operand 5 states and 269 transitions. [2025-04-13 20:15:46,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 696 transitions, 11993 flow [2025-04-13 20:15:51,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 696 transitions, 11767 flow, removed 110 selfloop flow, removed 1 redundant places. [2025-04-13 20:15:51,627 INFO L231 Difference]: Finished difference. Result has 315 places, 612 transitions, 10370 flow [2025-04-13 20:15:51,627 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=9117, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=10370, PETRI_PLACES=315, PETRI_TRANSITIONS=612} [2025-04-13 20:15:51,628 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 232 predicate places. [2025-04-13 20:15:51,628 INFO L485 AbstractCegarLoop]: Abstraction has has 315 places, 612 transitions, 10370 flow [2025-04-13 20:15:51,628 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 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-04-13 20:15:51,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:15:51,628 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:15:51,628 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 20:15:51,628 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:15:51,629 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:15:51,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1942386117, now seen corresponding path program 1 times [2025-04-13 20:15:51,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:15:51,629 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099569986] [2025-04-13 20:15:51,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:15:51,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:15:51,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-13 20:15:51,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 20:15:51,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:15:51,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:51,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:15:51,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:15:51,694 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099569986] [2025-04-13 20:15:51,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099569986] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:15:51,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:15:51,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:15:51,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432045902] [2025-04-13 20:15:51,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:15:51,694 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:15:51,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:15:51,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:15:51,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:15:51,702 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-04-13 20:15:51,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 612 transitions, 10370 flow. Second operand has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 7 states have internal predecessors, (247), 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-04-13 20:15:51,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:15:51,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-04-13 20:15:51,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:15:59,895 INFO L116 PetriNetUnfolderBase]: 24384/48032 cut-off events. [2025-04-13 20:15:59,895 INFO L117 PetriNetUnfolderBase]: For 898134/901889 co-relation queries the response was YES. [2025-04-13 20:16:00,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271344 conditions, 48032 events. 24384/48032 cut-off events. For 898134/901889 co-relation queries the response was YES. Maximal size of possible extension queue 1928. Compared 485600 event pairs, 12285 based on Foata normal form. 750/47120 useless extension candidates. Maximal degree in co-relation 269782. Up to 24719 conditions per place. [2025-04-13 20:16:00,581 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 352 selfloop transitions, 140 changer transitions 58/730 dead transitions. [2025-04-13 20:16:00,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 730 transitions, 12873 flow [2025-04-13 20:16:00,581 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:16:00,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:16:00,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 340 transitions. [2025-04-13 20:16:00,582 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5851979345955249 [2025-04-13 20:16:00,582 INFO L175 Difference]: Start difference. First operand has 315 places, 612 transitions, 10370 flow. Second operand 7 states and 340 transitions. [2025-04-13 20:16:00,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 730 transitions, 12873 flow [2025-04-13 20:16:04,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 730 transitions, 12745 flow, removed 38 selfloop flow, removed 1 redundant places. [2025-04-13 20:16:04,528 INFO L231 Difference]: Finished difference. Result has 324 places, 593 transitions, 10038 flow [2025-04-13 20:16:04,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=10031, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10038, PETRI_PLACES=324, PETRI_TRANSITIONS=593} [2025-04-13 20:16:04,529 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 241 predicate places. [2025-04-13 20:16:04,529 INFO L485 AbstractCegarLoop]: Abstraction has has 324 places, 593 transitions, 10038 flow [2025-04-13 20:16:04,529 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 7 states have internal predecessors, (247), 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-04-13 20:16:04,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:04,529 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:04,529 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 20:16:04,529 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:16:04,530 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:04,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1999002093, now seen corresponding path program 2 times [2025-04-13 20:16:04,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:04,530 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095160871] [2025-04-13 20:16:04,530 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:16:04,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:04,534 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 1 equivalence classes. [2025-04-13 20:16:04,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 20:16:04,537 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:16:04,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:04,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:04,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:04,581 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095160871] [2025-04-13 20:16:04,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095160871] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:04,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:04,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:16:04,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318952142] [2025-04-13 20:16:04,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:04,581 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:16:04,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:04,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:16:04,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:16:04,590 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-04-13 20:16:04,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 593 transitions, 10038 flow. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 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-04-13 20:16:04,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:04,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-04-13 20:16:04,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:12,985 INFO L116 PetriNetUnfolderBase]: 23720/46606 cut-off events. [2025-04-13 20:16:12,985 INFO L117 PetriNetUnfolderBase]: For 880235/883836 co-relation queries the response was YES. [2025-04-13 20:16:13,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266674 conditions, 46606 events. 23720/46606 cut-off events. For 880235/883836 co-relation queries the response was YES. Maximal size of possible extension queue 1884. Compared 468130 event pairs, 9039 based on Foata normal form. 575/45439 useless extension candidates. Maximal degree in co-relation 265048. Up to 15674 conditions per place. [2025-04-13 20:16:13,553 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 393 selfloop transitions, 103 changer transitions 6/678 dead transitions. [2025-04-13 20:16:13,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 678 transitions, 12058 flow [2025-04-13 20:16:13,554 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:16:13,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:16:13,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 231 transitions. [2025-04-13 20:16:13,554 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6957831325301205 [2025-04-13 20:16:13,554 INFO L175 Difference]: Start difference. First operand has 324 places, 593 transitions, 10038 flow. Second operand 4 states and 231 transitions. [2025-04-13 20:16:13,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 678 transitions, 12058 flow [2025-04-13 20:16:16,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 678 transitions, 11494 flow, removed 70 selfloop flow, removed 11 redundant places. [2025-04-13 20:16:16,792 INFO L231 Difference]: Finished difference. Result has 315 places, 596 transitions, 9899 flow [2025-04-13 20:16:16,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=9354, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=485, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=9899, PETRI_PLACES=315, PETRI_TRANSITIONS=596} [2025-04-13 20:16:16,793 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 232 predicate places. [2025-04-13 20:16:16,793 INFO L485 AbstractCegarLoop]: Abstraction has has 315 places, 596 transitions, 9899 flow [2025-04-13 20:16:16,793 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 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-04-13 20:16:16,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:16,793 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:16,793 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 20:16:16,793 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:16:16,794 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:16,794 INFO L85 PathProgramCache]: Analyzing trace with hash 830246999, now seen corresponding path program 2 times [2025-04-13 20:16:16,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:16,794 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693885935] [2025-04-13 20:16:16,794 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:16:16,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:16,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 1 equivalence classes. [2025-04-13 20:16:16,802 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 20:16:16,802 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:16:16,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:16,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:16,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:16,829 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693885935] [2025-04-13 20:16:16,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693885935] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:16,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:16,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:16:16,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497959816] [2025-04-13 20:16:16,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:16,829 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:16:16,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:16,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:16:16,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:16:16,840 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-04-13 20:16:16,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 596 transitions, 9899 flow. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 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-04-13 20:16:16,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:16,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-04-13 20:16:16,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:24,978 INFO L116 PetriNetUnfolderBase]: 24633/48907 cut-off events. [2025-04-13 20:16:24,979 INFO L117 PetriNetUnfolderBase]: For 873447/877356 co-relation queries the response was YES. [2025-04-13 20:16:25,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267437 conditions, 48907 events. 24633/48907 cut-off events. For 873447/877356 co-relation queries the response was YES. Maximal size of possible extension queue 1874. Compared 497729 event pairs, 9948 based on Foata normal form. 608/47971 useless extension candidates. Maximal degree in co-relation 265540. Up to 15610 conditions per place. [2025-04-13 20:16:25,617 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 296 selfloop transitions, 138 changer transitions 9/651 dead transitions. [2025-04-13 20:16:25,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 651 transitions, 11313 flow [2025-04-13 20:16:25,618 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:16:25,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:16:25,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 225 transitions. [2025-04-13 20:16:25,618 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.677710843373494 [2025-04-13 20:16:25,618 INFO L175 Difference]: Start difference. First operand has 315 places, 596 transitions, 9899 flow. Second operand 4 states and 225 transitions. [2025-04-13 20:16:25,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 651 transitions, 11313 flow [2025-04-13 20:16:29,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 651 transitions, 11227 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-04-13 20:16:29,315 INFO L231 Difference]: Finished difference. Result has 318 places, 584 transitions, 10063 flow [2025-04-13 20:16:29,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=9568, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=10063, PETRI_PLACES=318, PETRI_TRANSITIONS=584} [2025-04-13 20:16:29,316 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 235 predicate places. [2025-04-13 20:16:29,316 INFO L485 AbstractCegarLoop]: Abstraction has has 318 places, 584 transitions, 10063 flow [2025-04-13 20:16:29,316 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 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-04-13 20:16:29,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:29,316 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:29,316 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-13 20:16:29,316 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:16:29,317 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:29,317 INFO L85 PathProgramCache]: Analyzing trace with hash -692828017, now seen corresponding path program 3 times [2025-04-13 20:16:29,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:29,317 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745364522] [2025-04-13 20:16:29,317 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:16:29,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:29,320 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 1 equivalence classes. [2025-04-13 20:16:29,323 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 20:16:29,323 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:16:29,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:29,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:29,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:29,370 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745364522] [2025-04-13 20:16:29,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745364522] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:29,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:29,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:16:29,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783474373] [2025-04-13 20:16:29,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:29,370 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:16:29,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:29,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:16:29,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:16:29,382 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 83 [2025-04-13 20:16:29,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 584 transitions, 10063 flow. Second operand has 7 states, 7 states have (on average 31.571428571428573) internal successors, (221), 7 states have internal predecessors, (221), 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-04-13 20:16:29,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:29,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 83 [2025-04-13 20:16:29,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:39,784 INFO L116 PetriNetUnfolderBase]: 30615/58956 cut-off events. [2025-04-13 20:16:39,784 INFO L117 PetriNetUnfolderBase]: For 1277339/1285785 co-relation queries the response was YES. [2025-04-13 20:16:40,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342957 conditions, 58956 events. 30615/58956 cut-off events. For 1277339/1285785 co-relation queries the response was YES. Maximal size of possible extension queue 2320. Compared 595707 event pairs, 10750 based on Foata normal form. 606/58534 useless extension candidates. Maximal degree in co-relation 340984. Up to 40317 conditions per place. [2025-04-13 20:16:40,539 INFO L140 encePairwiseOnDemand]: 60/83 looper letters, 562 selfloop transitions, 173 changer transitions 18/846 dead transitions. [2025-04-13 20:16:40,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 846 transitions, 15344 flow [2025-04-13 20:16:40,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 20:16:40,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 20:16:40,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 598 transitions. [2025-04-13 20:16:40,540 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5146299483648882 [2025-04-13 20:16:40,540 INFO L175 Difference]: Start difference. First operand has 318 places, 584 transitions, 10063 flow. Second operand 14 states and 598 transitions. [2025-04-13 20:16:40,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 846 transitions, 15344 flow [2025-04-13 20:16:45,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 846 transitions, 15123 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-04-13 20:16:45,817 INFO L231 Difference]: Finished difference. Result has 341 places, 672 transitions, 12384 flow [2025-04-13 20:16:45,817 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=9659, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=12384, PETRI_PLACES=341, PETRI_TRANSITIONS=672} [2025-04-13 20:16:45,818 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 258 predicate places. [2025-04-13 20:16:45,818 INFO L485 AbstractCegarLoop]: Abstraction has has 341 places, 672 transitions, 12384 flow [2025-04-13 20:16:45,818 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 31.571428571428573) internal successors, (221), 7 states have internal predecessors, (221), 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-04-13 20:16:45,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:45,818 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:45,818 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-13 20:16:45,818 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:16:45,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:45,819 INFO L85 PathProgramCache]: Analyzing trace with hash -358470800, now seen corresponding path program 1 times [2025-04-13 20:16:45,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:45,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693841694] [2025-04-13 20:16:45,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:45,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:45,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-13 20:16:45,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 20:16:45,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:45,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:45,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:45,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:45,899 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693841694] [2025-04-13 20:16:45,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693841694] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:45,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:45,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:16:45,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766811547] [2025-04-13 20:16:45,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:45,899 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:16:45,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:45,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:16:45,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:16:45,920 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 83 [2025-04-13 20:16:45,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 672 transitions, 12384 flow. Second operand has 8 states, 8 states have (on average 30.75) internal successors, (246), 8 states have internal predecessors, (246), 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-04-13 20:16:45,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:45,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 83 [2025-04-13 20:16:45,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:57,140 INFO L116 PetriNetUnfolderBase]: 28750/55178 cut-off events. [2025-04-13 20:16:57,140 INFO L117 PetriNetUnfolderBase]: For 1280509/1288273 co-relation queries the response was YES. [2025-04-13 20:16:57,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328426 conditions, 55178 events. 28750/55178 cut-off events. For 1280509/1288273 co-relation queries the response was YES. Maximal size of possible extension queue 2092. Compared 550321 event pairs, 10997 based on Foata normal form. 888/54861 useless extension candidates. Maximal degree in co-relation 326130. Up to 40537 conditions per place. [2025-04-13 20:16:57,969 INFO L140 encePairwiseOnDemand]: 63/83 looper letters, 565 selfloop transitions, 133 changer transitions 38/829 dead transitions. [2025-04-13 20:16:57,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 829 transitions, 15328 flow [2025-04-13 20:16:57,970 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 20:16:57,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 20:16:57,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 644 transitions. [2025-04-13 20:16:57,971 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48493975903614456 [2025-04-13 20:16:57,971 INFO L175 Difference]: Start difference. First operand has 341 places, 672 transitions, 12384 flow. Second operand 16 states and 644 transitions. [2025-04-13 20:16:57,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 829 transitions, 15328 flow [2025-04-13 20:17:03,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 829 transitions, 14906 flow, removed 151 selfloop flow, removed 2 redundant places. [2025-04-13 20:17:03,776 INFO L231 Difference]: Finished difference. Result has 366 places, 683 transitions, 12623 flow [2025-04-13 20:17:03,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=11451, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=648, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=12623, PETRI_PLACES=366, PETRI_TRANSITIONS=683} [2025-04-13 20:17:03,776 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 283 predicate places. [2025-04-13 20:17:03,777 INFO L485 AbstractCegarLoop]: Abstraction has has 366 places, 683 transitions, 12623 flow [2025-04-13 20:17:03,777 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.75) internal successors, (246), 8 states have internal predecessors, (246), 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-04-13 20:17:03,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:17:03,777 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:17:03,777 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-13 20:17:03,777 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:17:03,778 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:17:03,778 INFO L85 PathProgramCache]: Analyzing trace with hash 176155628, now seen corresponding path program 2 times [2025-04-13 20:17:03,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:17:03,778 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064137721] [2025-04-13 20:17:03,778 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:17:03,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:17:03,783 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 1 equivalence classes. [2025-04-13 20:17:03,787 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 20:17:03,787 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:17:03,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:17:03,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:17:03,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:17:03,884 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064137721] [2025-04-13 20:17:03,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064137721] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:17:03,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:17:03,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:17:03,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054935037] [2025-04-13 20:17:03,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:17:03,884 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:17:03,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:17:03,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:17:03,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:17:03,896 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 83 [2025-04-13 20:17:03,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 683 transitions, 12623 flow. Second operand has 8 states, 8 states have (on average 30.75) internal successors, (246), 8 states have internal predecessors, (246), 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-04-13 20:17:03,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:17:03,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 83 [2025-04-13 20:17:03,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:17:14,599 INFO L116 PetriNetUnfolderBase]: 27720/53238 cut-off events. [2025-04-13 20:17:14,600 INFO L117 PetriNetUnfolderBase]: For 1224595/1232057 co-relation queries the response was YES. [2025-04-13 20:17:15,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315521 conditions, 53238 events. 27720/53238 cut-off events. For 1224595/1232057 co-relation queries the response was YES. Maximal size of possible extension queue 1986. Compared 527959 event pairs, 10652 based on Foata normal form. 768/52886 useless extension candidates. Maximal degree in co-relation 315389. Up to 39285 conditions per place. [2025-04-13 20:17:15,406 INFO L140 encePairwiseOnDemand]: 65/83 looper letters, 546 selfloop transitions, 122 changer transitions 18/779 dead transitions. [2025-04-13 20:17:15,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 779 transitions, 14488 flow [2025-04-13 20:17:15,406 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:17:15,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:17:15,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 581 transitions. [2025-04-13 20:17:15,407 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-04-13 20:17:15,407 INFO L175 Difference]: Start difference. First operand has 366 places, 683 transitions, 12623 flow. Second operand 15 states and 581 transitions. [2025-04-13 20:17:15,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 779 transitions, 14488 flow [2025-04-13 20:17:20,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 779 transitions, 14174 flow, removed 157 selfloop flow, removed 1 redundant places. [2025-04-13 20:17:20,954 INFO L231 Difference]: Finished difference. Result has 379 places, 672 transitions, 12278 flow [2025-04-13 20:17:20,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=12157, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=677, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=12278, PETRI_PLACES=379, PETRI_TRANSITIONS=672} [2025-04-13 20:17:20,955 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 296 predicate places. [2025-04-13 20:17:20,955 INFO L485 AbstractCegarLoop]: Abstraction has has 379 places, 672 transitions, 12278 flow [2025-04-13 20:17:20,955 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.75) internal successors, (246), 8 states have internal predecessors, (246), 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-04-13 20:17:20,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:17:20,955 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:17:20,955 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-13 20:17:20,955 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:17:20,956 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:17:20,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1305081151, now seen corresponding path program 2 times [2025-04-13 20:17:20,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:17:20,956 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516922873] [2025-04-13 20:17:20,956 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:17:20,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:17:20,960 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 1 equivalence classes. [2025-04-13 20:17:20,962 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 20:17:20,962 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:17:20,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:17:21,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:17:21,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:17:21,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516922873] [2025-04-13 20:17:21,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516922873] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:17:21,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:17:21,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:17:21,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113932417] [2025-04-13 20:17:21,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:17:21,005 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:17:21,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:17:21,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:17:21,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:17:21,023 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 83 [2025-04-13 20:17:21,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 672 transitions, 12278 flow. Second operand has 7 states, 7 states have (on average 31.571428571428573) internal successors, (221), 7 states have internal predecessors, (221), 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-04-13 20:17:21,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:17:21,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 83 [2025-04-13 20:17:21,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:17:32,332 INFO L116 PetriNetUnfolderBase]: 29167/56707 cut-off events. [2025-04-13 20:17:32,332 INFO L117 PetriNetUnfolderBase]: For 1270739/1278904 co-relation queries the response was YES. [2025-04-13 20:17:33,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332349 conditions, 56707 events. 29167/56707 cut-off events. For 1270739/1278904 co-relation queries the response was YES. Maximal size of possible extension queue 2227. Compared 573888 event pairs, 11522 based on Foata normal form. 402/56199 useless extension candidates. Maximal degree in co-relation 332214. Up to 43209 conditions per place. [2025-04-13 20:17:33,294 INFO L140 encePairwiseOnDemand]: 62/83 looper letters, 664 selfloop transitions, 150 changer transitions 19/926 dead transitions. [2025-04-13 20:17:33,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 926 transitions, 17414 flow [2025-04-13 20:17:33,295 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 20:17:33,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 20:17:33,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 673 transitions. [2025-04-13 20:17:33,295 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5067771084337349 [2025-04-13 20:17:33,295 INFO L175 Difference]: Start difference. First operand has 379 places, 672 transitions, 12278 flow. Second operand 16 states and 673 transitions. [2025-04-13 20:17:33,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 926 transitions, 17414 flow [2025-04-13 20:17:39,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 926 transitions, 17081 flow, removed 52 selfloop flow, removed 12 redundant places. [2025-04-13 20:17:39,173 INFO L231 Difference]: Finished difference. Result has 390 places, 760 transitions, 14470 flow [2025-04-13 20:17:39,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=11966, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=14470, PETRI_PLACES=390, PETRI_TRANSITIONS=760} [2025-04-13 20:17:39,173 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 307 predicate places. [2025-04-13 20:17:39,174 INFO L485 AbstractCegarLoop]: Abstraction has has 390 places, 760 transitions, 14470 flow [2025-04-13 20:17:39,174 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 31.571428571428573) internal successors, (221), 7 states have internal predecessors, (221), 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-04-13 20:17:39,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:17:39,174 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:17:39,174 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-13 20:17:39,174 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:17:39,174 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:17:39,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1954699313, now seen corresponding path program 4 times [2025-04-13 20:17:39,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:17:39,175 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994051281] [2025-04-13 20:17:39,175 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:17:39,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:17:39,178 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 68 statements into 2 equivalence classes. [2025-04-13 20:17:39,183 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 20:17:39,183 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:17:39,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:17:39,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:17:39,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:17:39,260 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994051281] [2025-04-13 20:17:39,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994051281] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:17:39,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:17:39,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:17:39,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234771019] [2025-04-13 20:17:39,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:17:39,260 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:17:39,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:17:39,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:17:39,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:17:39,280 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 83 [2025-04-13 20:17:39,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 760 transitions, 14470 flow. Second operand has 8 states, 8 states have (on average 30.75) internal successors, (246), 8 states have internal predecessors, (246), 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-04-13 20:17:39,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:17:39,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 83 [2025-04-13 20:17:39,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:17:52,318 INFO L116 PetriNetUnfolderBase]: 29120/56524 cut-off events. [2025-04-13 20:17:52,319 INFO L117 PetriNetUnfolderBase]: For 1330452/1338925 co-relation queries the response was YES. [2025-04-13 20:17:53,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336918 conditions, 56524 events. 29120/56524 cut-off events. For 1330452/1338925 co-relation queries the response was YES. Maximal size of possible extension queue 2192. Compared 571021 event pairs, 12203 based on Foata normal form. 316/55884 useless extension candidates. Maximal degree in co-relation 336775. Up to 45796 conditions per place. [2025-04-13 20:17:53,512 INFO L140 encePairwiseOnDemand]: 65/83 looper letters, 660 selfloop transitions, 83 changer transitions 8/844 dead transitions. [2025-04-13 20:17:53,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 844 transitions, 16671 flow [2025-04-13 20:17:53,513 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:17:53,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:17:53,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 563 transitions. [2025-04-13 20:17:53,513 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45220883534136547 [2025-04-13 20:17:53,513 INFO L175 Difference]: Start difference. First operand has 390 places, 760 transitions, 14470 flow. Second operand 15 states and 563 transitions. [2025-04-13 20:17:53,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 844 transitions, 16671 flow [2025-04-13 20:18:00,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 844 transitions, 16217 flow, removed 227 selfloop flow, removed 0 redundant places. [2025-04-13 20:18:00,809 INFO L231 Difference]: Finished difference. Result has 406 places, 763 transitions, 14333 flow [2025-04-13 20:18:00,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=13956, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=756, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=14333, PETRI_PLACES=406, PETRI_TRANSITIONS=763} [2025-04-13 20:18:00,810 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 323 predicate places. [2025-04-13 20:18:00,810 INFO L485 AbstractCegarLoop]: Abstraction has has 406 places, 763 transitions, 14333 flow [2025-04-13 20:18:00,810 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.75) internal successors, (246), 8 states have internal predecessors, (246), 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-04-13 20:18:00,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:18:00,810 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:18:00,810 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-13 20:18:00,810 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:18:00,811 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:18:00,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1409120774, now seen corresponding path program 3 times [2025-04-13 20:18:00,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:18:00,811 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13643625] [2025-04-13 20:18:00,811 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:18:00,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:18:00,817 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 1 equivalence classes. [2025-04-13 20:18:00,821 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 20:18:00,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:18:00,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:00,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:18:00,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:18:00,893 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13643625] [2025-04-13 20:18:00,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13643625] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:18:00,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:18:00,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:18:00,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780596672] [2025-04-13 20:18:00,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:18:00,893 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:18:00,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:18:00,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:18:00,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:18:00,898 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-04-13 20:18:00,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 763 transitions, 14333 flow. Second operand has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 7 states have internal predecessors, (247), 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-04-13 20:18:00,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:18:00,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-04-13 20:18:00,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:18:10,601 INFO L116 PetriNetUnfolderBase]: 21067/43832 cut-off events. [2025-04-13 20:18:10,602 INFO L117 PetriNetUnfolderBase]: For 988036/991973 co-relation queries the response was YES. [2025-04-13 20:18:11,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253921 conditions, 43832 events. 21067/43832 cut-off events. For 988036/991973 co-relation queries the response was YES. Maximal size of possible extension queue 1979. Compared 458484 event pairs, 11339 based on Foata normal form. 349/42934 useless extension candidates. Maximal degree in co-relation 253775. Up to 22762 conditions per place. [2025-04-13 20:18:11,292 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 458 selfloop transitions, 148 changer transitions 10/864 dead transitions. [2025-04-13 20:18:11,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 864 transitions, 16706 flow [2025-04-13 20:18:11,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:18:11,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:18:11,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 343 transitions. [2025-04-13 20:18:11,293 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5903614457831325 [2025-04-13 20:18:11,293 INFO L175 Difference]: Start difference. First operand has 406 places, 763 transitions, 14333 flow. Second operand 7 states and 343 transitions. [2025-04-13 20:18:11,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 864 transitions, 16706 flow [2025-04-13 20:18:15,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 864 transitions, 16556 flow, removed 32 selfloop flow, removed 6 redundant places. [2025-04-13 20:18:15,099 INFO L231 Difference]: Finished difference. Result has 408 places, 761 transitions, 14336 flow [2025-04-13 20:18:15,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=13509, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=14336, PETRI_PLACES=408, PETRI_TRANSITIONS=761} [2025-04-13 20:18:15,100 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 325 predicate places. [2025-04-13 20:18:15,100 INFO L485 AbstractCegarLoop]: Abstraction has has 408 places, 761 transitions, 14336 flow [2025-04-13 20:18:15,101 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 7 states have internal predecessors, (247), 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-04-13 20:18:15,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:18:15,101 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:18:15,101 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-13 20:18:15,101 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:18:15,101 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:18:15,102 INFO L85 PathProgramCache]: Analyzing trace with hash 296013213, now seen corresponding path program 5 times [2025-04-13 20:18:15,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:18:15,102 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942729704] [2025-04-13 20:18:15,102 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:18:15,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:18:15,105 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 68 statements into 1 equivalence classes. [2025-04-13 20:18:15,108 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 20:18:15,108 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:18:15,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:15,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:18:15,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:18:15,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942729704] [2025-04-13 20:18:15,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942729704] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:18:15,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:18:15,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:18:15,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797652351] [2025-04-13 20:18:15,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:18:15,179 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:18:15,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:18:15,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:18:15,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:18:15,196 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 83 [2025-04-13 20:18:15,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 761 transitions, 14336 flow. Second operand has 8 states, 8 states have (on average 30.75) internal successors, (246), 8 states have internal predecessors, (246), 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-04-13 20:18:15,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:18:15,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 83 [2025-04-13 20:18:15,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:18:25,408 INFO L116 PetriNetUnfolderBase]: 23492/46538 cut-off events. [2025-04-13 20:18:25,408 INFO L117 PetriNetUnfolderBase]: For 1147641/1154103 co-relation queries the response was YES. [2025-04-13 20:18:26,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277314 conditions, 46538 events. 23492/46538 cut-off events. For 1147641/1154103 co-relation queries the response was YES. Maximal size of possible extension queue 1952. Compared 465566 event pairs, 9926 based on Foata normal form. 210/46010 useless extension candidates. Maximal degree in co-relation 277166. Up to 37193 conditions per place. [2025-04-13 20:18:26,179 INFO L140 encePairwiseOnDemand]: 65/83 looper letters, 649 selfloop transitions, 80 changer transitions 10/832 dead transitions. [2025-04-13 20:18:26,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 832 transitions, 16328 flow [2025-04-13 20:18:26,179 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:18:26,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:18:26,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 497 transitions. [2025-04-13 20:18:26,180 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4606116774791474 [2025-04-13 20:18:26,180 INFO L175 Difference]: Start difference. First operand has 408 places, 761 transitions, 14336 flow. Second operand 13 states and 497 transitions. [2025-04-13 20:18:26,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 832 transitions, 16328 flow