./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 34bb015d05a3d6b765805bee36bd4c1bc3f74929c05e61a51973bc9a4fc2cfc0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:26:48,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:26:48,091 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:26:48,096 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:26:48,096 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:26:48,121 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:26:48,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:26:48,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:26:48,122 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:26:48,122 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:26:48,123 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:26:48,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:26:48,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:26:48,124 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:26:48,124 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:26:48,124 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:26:48,124 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:26:48,124 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:26:48,125 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:26:48,125 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:26:48,125 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:26:48,125 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:26:48,125 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:26:48,125 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:26:48,125 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:26:48,125 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:26:48,125 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:26:48,125 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:26:48,125 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:26:48,125 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:26:48,126 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:26:48,126 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:26:48,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:26:48,126 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:26:48,126 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:26:48,126 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:26:48,126 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:26:48,126 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:26:48,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:26:48,126 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:26:48,127 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:26:48,127 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:26:48,127 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:26:48,127 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 34bb015d05a3d6b765805bee36bd4c1bc3f74929c05e61a51973bc9a4fc2cfc0 [2025-03-04 02:26:48,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:26:48,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:26:48,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:26:48,384 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:26:48,384 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:26:48,385 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2025-03-04 02:26:49,539 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af1ed1ef6/41018c901bb84d858c4f5208b98c765a/FLAG8dd59307d [2025-03-04 02:26:49,753 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:26:49,768 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2025-03-04 02:26:49,781 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af1ed1ef6/41018c901bb84d858c4f5208b98c765a/FLAG8dd59307d [2025-03-04 02:26:49,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af1ed1ef6/41018c901bb84d858c4f5208b98c765a [2025-03-04 02:26:49,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:26:49,799 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:26:49,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:26:49,800 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:26:49,803 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:26:49,804 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:26:49" (1/1) ... [2025-03-04 02:26:49,804 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3773ebaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:26:49, skipping insertion in model container [2025-03-04 02:26:49,804 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:26:49" (1/1) ... [2025-03-04 02:26:49,816 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:26:49,932 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c[2663,2676] [2025-03-04 02:26:49,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:26:49,946 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:26:49,960 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c[2663,2676] [2025-03-04 02:26:49,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:26:49,972 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:26:49,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:26:49 WrapperNode [2025-03-04 02:26:49,973 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:26:49,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:26:49,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:26:49,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:26:49,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:26:49" (1/1) ... [2025-03-04 02:26:49,984 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:26:49" (1/1) ... [2025-03-04 02:26:49,995 INFO L138 Inliner]: procedures = 21, calls = 22, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 108 [2025-03-04 02:26:49,996 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:26:49,996 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:26:49,997 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:26:49,997 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:26:50,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:26:49" (1/1) ... [2025-03-04 02:26:50,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:26:49" (1/1) ... [2025-03-04 02:26:50,004 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:26:49" (1/1) ... [2025-03-04 02:26:50,015 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-03-04 02:26:50,016 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:26:49" (1/1) ... [2025-03-04 02:26:50,016 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:26:49" (1/1) ... [2025-03-04 02:26:50,019 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:26:49" (1/1) ... [2025-03-04 02:26:50,019 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:26:49" (1/1) ... [2025-03-04 02:26:50,020 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:26:49" (1/1) ... [2025-03-04 02:26:50,023 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:26:49" (1/1) ... [2025-03-04 02:26:50,026 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:26:50,027 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:26:50,027 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:26:50,027 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:26:50,027 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:26:49" (1/1) ... [2025-03-04 02:26:50,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:26:50,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:26:50,056 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:26:50,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:26:50,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:26:50,075 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:26:50,075 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:26:50,075 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:26:50,075 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:26:50,076 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 02:26:50,076 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 02:26:50,076 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-04 02:26:50,076 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-04 02:26:50,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:26:50,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:26:50,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:26:50,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:26:50,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:26:50,077 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:26:50,147 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:26:50,148 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:26:50,292 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:26:50,292 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:26:50,417 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:26:50,417 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:26:50,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:26:50 BoogieIcfgContainer [2025-03-04 02:26:50,417 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:26:50,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:26:50,419 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:26:50,422 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:26:50,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:26:49" (1/3) ... [2025-03-04 02:26:50,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@764b6e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:26:50, skipping insertion in model container [2025-03-04 02:26:50,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:26:49" (2/3) ... [2025-03-04 02:26:50,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@764b6e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:26:50, skipping insertion in model container [2025-03-04 02:26:50,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:26:50" (3/3) ... [2025-03-04 02:26:50,424 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-proofs-counter-add-4-semi-Q67.wvr.c [2025-03-04 02:26:50,437 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:26:50,438 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-proofs-counter-add-4-semi-Q67.wvr.c that has 5 procedures, 33 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-04 02:26:50,438 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:26:50,476 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 02:26:50,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 100 flow [2025-03-04 02:26:50,533 INFO L124 PetriNetUnfolderBase]: 4/32 cut-off events. [2025-03-04 02:26:50,535 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 02:26:50,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 32 events. 4/32 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2025-03-04 02:26:50,538 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 36 transitions, 100 flow [2025-03-04 02:26:50,542 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 31 transitions, 86 flow [2025-03-04 02:26:50,553 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:26:50,561 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@77b7259b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:26:50,561 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-04 02:26:50,575 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:26:50,576 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-03-04 02:26:50,576 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 02:26:50,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:50,576 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] [2025-03-04 02:26:50,577 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:26:50,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:50,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1430780975, now seen corresponding path program 1 times [2025-03-04 02:26:50,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:50,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380632060] [2025-03-04 02:26:50,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:26:50,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:50,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:26:50,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:26:50,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:26:50,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:50,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:50,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:50,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380632060] [2025-03-04 02:26:50,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380632060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:50,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:50,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:26:50,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084477984] [2025-03-04 02:26:50,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:50,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:26:50,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:50,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:26:50,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:26:50,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2025-03-04 02:26:50,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:50,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:50,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2025-03-04 02:26:50,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:51,137 INFO L124 PetriNetUnfolderBase]: 1184/1704 cut-off events. [2025-03-04 02:26:51,138 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2025-03-04 02:26:51,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3368 conditions, 1704 events. 1184/1704 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7312 event pairs, 182 based on Foata normal form. 46/1737 useless extension candidates. Maximal degree in co-relation 2858. Up to 1334 conditions per place. [2025-03-04 02:26:51,156 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 34 selfloop transitions, 3 changer transitions 2/48 dead transitions. [2025-03-04 02:26:51,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 219 flow [2025-03-04 02:26:51,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:26:51,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:26:51,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2025-03-04 02:26:51,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-03-04 02:26:51,170 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 86 flow. Second operand 3 states and 81 transitions. [2025-03-04 02:26:51,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 219 flow [2025-03-04 02:26:51,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 48 transitions, 189 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 02:26:51,178 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 93 flow [2025-03-04 02:26:51,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2025-03-04 02:26:51,185 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -5 predicate places. [2025-03-04 02:26:51,185 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 93 flow [2025-03-04 02:26:51,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:51,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:51,185 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] [2025-03-04 02:26:51,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:26:51,186 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:26:51,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:51,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1652025257, now seen corresponding path program 1 times [2025-03-04 02:26:51,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:51,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535373027] [2025-03-04 02:26:51,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:26:51,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:51,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:26:51,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:26:51,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:26:51,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:51,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:51,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:51,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535373027] [2025-03-04 02:26:51,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535373027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:51,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:51,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:26:51,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841413301] [2025-03-04 02:26:51,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:51,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:26:51,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:51,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:26:51,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:26:51,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2025-03-04 02:26:51,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:51,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:51,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2025-03-04 02:26:51,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:51,705 INFO L124 PetriNetUnfolderBase]: 1979/2810 cut-off events. [2025-03-04 02:26:51,705 INFO L125 PetriNetUnfolderBase]: For 688/724 co-relation queries the response was YES. [2025-03-04 02:26:51,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6485 conditions, 2810 events. 1979/2810 cut-off events. For 688/724 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 12979 event pairs, 328 based on Foata normal form. 8/2648 useless extension candidates. Maximal degree in co-relation 1246. Up to 1661 conditions per place. [2025-03-04 02:26:51,723 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 68 selfloop transitions, 9 changer transitions 0/85 dead transitions. [2025-03-04 02:26:51,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 85 transitions, 398 flow [2025-03-04 02:26:51,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:26:51,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:26:51,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2025-03-04 02:26:51,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7444444444444445 [2025-03-04 02:26:51,726 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 93 flow. Second operand 5 states and 134 transitions. [2025-03-04 02:26:51,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 85 transitions, 398 flow [2025-03-04 02:26:51,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 85 transitions, 393 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:26:51,729 INFO L231 Difference]: Finished difference. Result has 40 places, 40 transitions, 155 flow [2025-03-04 02:26:51,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=40, PETRI_TRANSITIONS=40} [2025-03-04 02:26:51,730 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2025-03-04 02:26:51,730 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 40 transitions, 155 flow [2025-03-04 02:26:51,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:51,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:51,731 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] [2025-03-04 02:26:51,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:26:51,731 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:26:51,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:51,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1353812865, now seen corresponding path program 2 times [2025-03-04 02:26:51,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:51,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621170352] [2025-03-04 02:26:51,732 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:26:51,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:51,738 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:26:51,750 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:26:51,752 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:26:51,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:51,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:51,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:51,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621170352] [2025-03-04 02:26:51,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621170352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:51,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:51,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:26:51,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095008296] [2025-03-04 02:26:51,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:51,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:26:51,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:51,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:26:51,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:26:51,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2025-03-04 02:26:51,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 40 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:51,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:51,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2025-03-04 02:26:51,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:52,125 INFO L124 PetriNetUnfolderBase]: 2749/3837 cut-off events. [2025-03-04 02:26:52,126 INFO L125 PetriNetUnfolderBase]: For 2912/2912 co-relation queries the response was YES. [2025-03-04 02:26:52,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10664 conditions, 3837 events. 2749/3837 cut-off events. For 2912/2912 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 18267 event pairs, 552 based on Foata normal form. 0/3539 useless extension candidates. Maximal degree in co-relation 2233. Up to 3206 conditions per place. [2025-03-04 02:26:52,148 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 60 selfloop transitions, 6 changer transitions 2/75 dead transitions. [2025-03-04 02:26:52,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 75 transitions, 401 flow [2025-03-04 02:26:52,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:26:52,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:26:52,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2025-03-04 02:26:52,151 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2025-03-04 02:26:52,151 INFO L175 Difference]: Start difference. First operand has 40 places, 40 transitions, 155 flow. Second operand 4 states and 102 transitions. [2025-03-04 02:26:52,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 75 transitions, 401 flow [2025-03-04 02:26:52,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 75 transitions, 401 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:26:52,155 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 187 flow [2025-03-04 02:26:52,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=187, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2025-03-04 02:26:52,156 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2025-03-04 02:26:52,156 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 187 flow [2025-03-04 02:26:52,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:52,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:52,157 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] [2025-03-04 02:26:52,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:26:52,157 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:26:52,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:52,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1792849905, now seen corresponding path program 3 times [2025-03-04 02:26:52,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:52,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590192376] [2025-03-04 02:26:52,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:26:52,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:52,167 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:26:52,173 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:26:52,173 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:26:52,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:52,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:52,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:52,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590192376] [2025-03-04 02:26:52,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590192376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:52,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:52,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:26:52,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478240019] [2025-03-04 02:26:52,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:52,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:26:52,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:52,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:26:52,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:26:52,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2025-03-04 02:26:52,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 187 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:52,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:52,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2025-03-04 02:26:52,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:52,381 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([304] L40-->L41: Formula: (< v_~i1~0_3 v_~N1~0_1) InVars {~i1~0=v_~i1~0_3, ~N1~0=v_~N1~0_1} OutVars{~i1~0=v_~i1~0_3, ~N1~0=v_~N1~0_1} AuxVars[] AssignedVars[][16], [60#true, 25#thread2EXITtrue, Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 50#(= ~counter~0 0), 18#L97-1true, Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 7#L41true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 52#true, 68#true]) [2025-03-04 02:26:52,381 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2025-03-04 02:26:52,381 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2025-03-04 02:26:52,381 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2025-03-04 02:26:52,381 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2025-03-04 02:26:52,396 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([304] L40-->L41: Formula: (< v_~i1~0_3 v_~N1~0_1) InVars {~i1~0=v_~i1~0_3, ~N1~0=v_~N1~0_1} OutVars{~i1~0=v_~i1~0_3, ~N1~0=v_~N1~0_1} AuxVars[] AssignedVars[][16], [60#true, 34#L51true, Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 18#L97-1true, Black: 50#(= ~counter~0 0), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 7#L41true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 52#true, 68#true]) [2025-03-04 02:26:52,397 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2025-03-04 02:26:52,397 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2025-03-04 02:26:52,397 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-03-04 02:26:52,397 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2025-03-04 02:26:52,511 INFO L124 PetriNetUnfolderBase]: 2615/3643 cut-off events. [2025-03-04 02:26:52,511 INFO L125 PetriNetUnfolderBase]: For 3957/3998 co-relation queries the response was YES. [2025-03-04 02:26:52,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11043 conditions, 3643 events. 2615/3643 cut-off events. For 3957/3998 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 17121 event pairs, 583 based on Foata normal form. 16/3587 useless extension candidates. Maximal degree in co-relation 2970. Up to 2714 conditions per place. [2025-03-04 02:26:52,536 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 65 selfloop transitions, 7 changer transitions 7/88 dead transitions. [2025-03-04 02:26:52,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 88 transitions, 508 flow [2025-03-04 02:26:52,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:26:52,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:26:52,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2025-03-04 02:26:52,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2025-03-04 02:26:52,538 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 187 flow. Second operand 5 states and 128 transitions. [2025-03-04 02:26:52,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 88 transitions, 508 flow [2025-03-04 02:26:52,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 88 transitions, 498 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:26:52,544 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 225 flow [2025-03-04 02:26:52,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=225, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2025-03-04 02:26:52,545 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2025-03-04 02:26:52,545 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 225 flow [2025-03-04 02:26:52,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:52,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:52,545 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] [2025-03-04 02:26:52,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:26:52,545 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:26:52,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:52,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1788895247, now seen corresponding path program 4 times [2025-03-04 02:26:52,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:52,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944606871] [2025-03-04 02:26:52,546 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:26:52,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:52,556 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:26:52,561 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:26:52,562 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:26:52,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:52,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:52,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:52,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944606871] [2025-03-04 02:26:52,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944606871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:52,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:52,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:26:52,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540397617] [2025-03-04 02:26:52,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:52,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:26:52,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:52,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:26:52,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:26:52,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2025-03-04 02:26:52,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 225 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:52,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:52,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2025-03-04 02:26:52,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:52,961 INFO L124 PetriNetUnfolderBase]: 3765/5039 cut-off events. [2025-03-04 02:26:52,962 INFO L125 PetriNetUnfolderBase]: For 6135/6217 co-relation queries the response was YES. [2025-03-04 02:26:52,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15862 conditions, 5039 events. 3765/5039 cut-off events. For 6135/6217 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 23422 event pairs, 521 based on Foata normal form. 120/5040 useless extension candidates. Maximal degree in co-relation 5690. Up to 1923 conditions per place. [2025-03-04 02:26:52,991 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 78 selfloop transitions, 10 changer transitions 0/96 dead transitions. [2025-03-04 02:26:52,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 96 transitions, 602 flow [2025-03-04 02:26:52,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:26:52,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:26:52,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2025-03-04 02:26:52,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2025-03-04 02:26:52,995 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 225 flow. Second operand 5 states and 128 transitions. [2025-03-04 02:26:52,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 96 transitions, 602 flow [2025-03-04 02:26:52,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 96 transitions, 589 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 02:26:52,999 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 277 flow [2025-03-04 02:26:52,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=277, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2025-03-04 02:26:52,999 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places. [2025-03-04 02:26:52,999 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 277 flow [2025-03-04 02:26:52,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:52,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:52,999 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] [2025-03-04 02:26:53,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:26:53,000 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:26:53,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:53,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1407181511, now seen corresponding path program 1 times [2025-03-04 02:26:53,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:53,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500158067] [2025-03-04 02:26:53,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:26:53,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:53,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:26:53,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:26:53,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:26:53,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:53,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:53,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:53,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500158067] [2025-03-04 02:26:53,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500158067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:53,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:53,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:26:53,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935708948] [2025-03-04 02:26:53,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:53,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:26:53,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:53,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:26:53,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:26:53,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2025-03-04 02:26:53,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 277 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:53,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:53,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2025-03-04 02:26:53,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:53,302 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][42], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 6#L74true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, 17#L98-1true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 7#L41true, 76#true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0))]) [2025-03-04 02:26:53,302 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,303 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,303 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,303 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,305 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][42], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 6#L74true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 25#thread2EXITtrue, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 76#true, 7#L41true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0))]) [2025-03-04 02:26:53,305 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,305 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,305 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,305 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,319 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][42], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 6#L74true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 25#thread2EXITtrue, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 7#L41true, 76#true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0))]) [2025-03-04 02:26:53,319 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-04 02:26:53,319 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,319 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,319 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,319 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,321 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([310] L52-->L51: Formula: (and (= v_~counter~0_102 (+ v_~counter~0_101 1)) (= (+ v_~i2~0_51 1) v_~i2~0_50) (not (= (ite (< 0 v_~counter~0_102) 1 0) 0))) InVars {~counter~0=v_~counter~0_102, ~i2~0=v_~i2~0_51} OutVars{~counter~0=v_~counter~0_101, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~i2~0=v_~i2~0_50, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][34], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 6#L74true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 76#true, 7#L41true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0))]) [2025-03-04 02:26:53,321 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,321 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,321 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,321 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,331 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([310] L52-->L51: Formula: (and (= v_~counter~0_102 (+ v_~counter~0_101 1)) (= (+ v_~i2~0_51 1) v_~i2~0_50) (not (= (ite (< 0 v_~counter~0_102) 1 0) 0))) InVars {~counter~0=v_~counter~0_102, ~i2~0=v_~i2~0_51} OutVars{~counter~0=v_~counter~0_101, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~i2~0=v_~i2~0_50, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][34], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 8#L99true, Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 6#L74true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0))]) [2025-03-04 02:26:53,332 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-04 02:26:53,332 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,332 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,332 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,332 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([310] L52-->L51: Formula: (and (= v_~counter~0_102 (+ v_~counter~0_101 1)) (= (+ v_~i2~0_51 1) v_~i2~0_50) (not (= (ite (< 0 v_~counter~0_102) 1 0) 0))) InVars {~counter~0=v_~counter~0_102, ~i2~0=v_~i2~0_51} OutVars{~counter~0=v_~counter~0_101, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~i2~0=v_~i2~0_50, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][34], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 6#L74true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 7#L41true, 76#true, 31#L63true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0))]) [2025-03-04 02:26:53,332 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-04 02:26:53,332 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,332 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,333 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,339 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([310] L52-->L51: Formula: (and (= v_~counter~0_102 (+ v_~counter~0_101 1)) (= (+ v_~i2~0_51 1) v_~i2~0_50) (not (= (ite (< 0 v_~counter~0_102) 1 0) 0))) InVars {~counter~0=v_~counter~0_102, ~i2~0=v_~i2~0_51} OutVars{~counter~0=v_~counter~0_101, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~i2~0=v_~i2~0_50, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][34], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 8#L99true, Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 6#L74true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 76#true, 31#L63true, 7#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0))]) [2025-03-04 02:26:53,340 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-03-04 02:26:53,340 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,340 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,340 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,340 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([310] L52-->L51: Formula: (and (= v_~counter~0_102 (+ v_~counter~0_101 1)) (= (+ v_~i2~0_51 1) v_~i2~0_50) (not (= (ite (< 0 v_~counter~0_102) 1 0) 0))) InVars {~counter~0=v_~counter~0_102, ~i2~0=v_~i2~0_51} OutVars{~counter~0=v_~counter~0_101, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~i2~0=v_~i2~0_50, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][34], [24#thread3EXITtrue, Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 6#L74true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0))]) [2025-03-04 02:26:53,340 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-03-04 02:26:53,340 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,340 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,341 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,341 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([310] L52-->L51: Formula: (and (= v_~counter~0_102 (+ v_~counter~0_101 1)) (= (+ v_~i2~0_51 1) v_~i2~0_50) (not (= (ite (< 0 v_~counter~0_102) 1 0) 0))) InVars {~counter~0=v_~counter~0_102, ~i2~0=v_~i2~0_51} OutVars{~counter~0=v_~counter~0_101, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~i2~0=v_~i2~0_50, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][34], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 32#thread4EXITtrue, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 7#L41true, 76#true, 31#L63true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0))]) [2025-03-04 02:26:53,341 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-03-04 02:26:53,341 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,341 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,341 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,343 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([310] L52-->L51: Formula: (and (= v_~counter~0_102 (+ v_~counter~0_101 1)) (= (+ v_~i2~0_51 1) v_~i2~0_50) (not (= (ite (< 0 v_~counter~0_102) 1 0) 0))) InVars {~counter~0=v_~counter~0_102, ~i2~0=v_~i2~0_51} OutVars{~counter~0=v_~counter~0_101, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~i2~0=v_~i2~0_50, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][34], [24#thread3EXITtrue, Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 8#L99true, Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 6#L74true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0))]) [2025-03-04 02:26:53,343 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-03-04 02:26:53,344 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:53,344 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:53,344 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,344 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([310] L52-->L51: Formula: (and (= v_~counter~0_102 (+ v_~counter~0_101 1)) (= (+ v_~i2~0_51 1) v_~i2~0_50) (not (= (ite (< 0 v_~counter~0_102) 1 0) 0))) InVars {~counter~0=v_~counter~0_102, ~i2~0=v_~i2~0_51} OutVars{~counter~0=v_~counter~0_101, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~i2~0=v_~i2~0_50, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][34], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 8#L99true, Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 32#thread4EXITtrue, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 31#L63true, 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0))]) [2025-03-04 02:26:53,344 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-03-04 02:26:53,344 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:53,344 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,344 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,344 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([310] L52-->L51: Formula: (and (= v_~counter~0_102 (+ v_~counter~0_101 1)) (= (+ v_~i2~0_51 1) v_~i2~0_50) (not (= (ite (< 0 v_~counter~0_102) 1 0) 0))) InVars {~counter~0=v_~counter~0_102, ~i2~0=v_~i2~0_51} OutVars{~counter~0=v_~counter~0_101, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~i2~0=v_~i2~0_50, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][34], [24#thread3EXITtrue, Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 32#thread4EXITtrue, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 76#true, 7#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0))]) [2025-03-04 02:26:53,344 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-03-04 02:26:53,344 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-04 02:26:53,344 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,345 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:53,347 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([310] L52-->L51: Formula: (and (= v_~counter~0_102 (+ v_~counter~0_101 1)) (= (+ v_~i2~0_51 1) v_~i2~0_50) (not (= (ite (< 0 v_~counter~0_102) 1 0) 0))) InVars {~counter~0=v_~counter~0_102, ~i2~0=v_~i2~0_51} OutVars{~counter~0=v_~counter~0_101, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~i2~0=v_~i2~0_50, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][34], [24#thread3EXITtrue, Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 8#L99true, Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 32#thread4EXITtrue, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0))]) [2025-03-04 02:26:53,347 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-03-04 02:26:53,347 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,347 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-03-04 02:26:53,348 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,348 INFO L124 PetriNetUnfolderBase]: 3200/4455 cut-off events. [2025-03-04 02:26:53,348 INFO L125 PetriNetUnfolderBase]: For 8658/9009 co-relation queries the response was YES. [2025-03-04 02:26:53,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16202 conditions, 4455 events. 3200/4455 cut-off events. For 8658/9009 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 21882 event pairs, 672 based on Foata normal form. 42/4352 useless extension candidates. Maximal degree in co-relation 10121. Up to 3922 conditions per place. [2025-03-04 02:26:53,376 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 47 selfloop transitions, 6 changer transitions 7/73 dead transitions. [2025-03-04 02:26:53,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 73 transitions, 471 flow [2025-03-04 02:26:53,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:26:53,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:26:53,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2025-03-04 02:26:53,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2025-03-04 02:26:53,377 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 277 flow. Second operand 4 states and 100 transitions. [2025-03-04 02:26:53,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 73 transitions, 471 flow [2025-03-04 02:26:53,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 73 transitions, 467 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-04 02:26:53,385 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 290 flow [2025-03-04 02:26:53,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=290, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2025-03-04 02:26:53,386 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2025-03-04 02:26:53,387 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 290 flow [2025-03-04 02:26:53,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:53,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:53,387 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] [2025-03-04 02:26:53,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:26:53,387 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:26:53,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:53,389 INFO L85 PathProgramCache]: Analyzing trace with hash 111058249, now seen corresponding path program 2 times [2025-03-04 02:26:53,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:53,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710045704] [2025-03-04 02:26:53,389 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:26:53,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:53,394 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:26:53,398 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:26:53,398 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:26:53,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:53,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:53,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:53,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710045704] [2025-03-04 02:26:53,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710045704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:53,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:53,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:26:53,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317592076] [2025-03-04 02:26:53,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:53,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:26:53,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:53,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:26:53,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:26:53,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2025-03-04 02:26:53,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 290 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:53,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:53,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2025-03-04 02:26:53,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:53,667 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 28#L75true, 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 92#true]) [2025-03-04 02:26:53,667 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,667 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,667 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-04 02:26:53,667 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-04 02:26:53,667 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 32#thread4EXITtrue, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 92#true]) [2025-03-04 02:26:53,667 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,667 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-04 02:26:53,667 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,667 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-04 02:26:53,672 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 32#thread4EXITtrue, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 76#true, 7#L41true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:53,672 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,672 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-04 02:26:53,673 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,673 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,673 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-04 02:26:53,673 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 28#L75true, 7#L41true, 76#true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:53,673 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,673 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,673 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,673 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-04 02:26:53,673 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-04 02:26:53,679 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 6#L74true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 7#L41true, 76#true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:53,679 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,679 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,679 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,679 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,702 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 25#thread2EXITtrue, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 28#L75true, 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:53,702 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,702 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,702 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,702 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,702 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 32#thread4EXITtrue, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 25#thread2EXITtrue, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:53,702 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,702 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,702 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,703 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,703 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [8#L99true, Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 28#L75true, 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 92#true]) [2025-03-04 02:26:53,703 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,703 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,703 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,703 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,703 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [8#L99true, Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 32#thread4EXITtrue, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 92#true]) [2025-03-04 02:26:53,703 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,704 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,704 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,704 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,707 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 32#thread4EXITtrue, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 25#thread2EXITtrue, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 76#true, 7#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 92#true]) [2025-03-04 02:26:53,707 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,707 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,707 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,707 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,708 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,708 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 25#thread2EXITtrue, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 28#L75true, 76#true, 7#L41true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 92#true]) [2025-03-04 02:26:53,708 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,708 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,708 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,708 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,708 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,709 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [8#L99true, Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 32#thread4EXITtrue, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 7#L41true, 76#true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:53,710 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,710 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,710 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,710 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,710 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,710 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [8#L99true, Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 28#L75true, 76#true, 7#L41true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:53,710 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,710 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,710 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,711 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,711 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,713 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 6#L74true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:53,713 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,713 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,713 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,713 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,713 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,716 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [8#L99true, Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 6#L74true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 76#true, 7#L41true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:53,717 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,717 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,717 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,717 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,763 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 6#L74true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 25#thread2EXITtrue, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 92#true]) [2025-03-04 02:26:53,764 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2025-03-04 02:26:53,764 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2025-03-04 02:26:53,764 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2025-03-04 02:26:53,764 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2025-03-04 02:26:53,765 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [8#L99true, Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 25#thread2EXITtrue, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 28#L75true, 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:53,765 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-04 02:26:53,765 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:53,765 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,765 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,766 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [8#L99true, Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 32#thread4EXITtrue, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 25#thread2EXITtrue, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:53,766 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-04 02:26:53,766 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,766 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,766 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:53,770 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [8#L99true, Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 32#thread4EXITtrue, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 25#thread2EXITtrue, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 7#L41true, 76#true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 92#true]) [2025-03-04 02:26:53,770 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-04 02:26:53,770 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,770 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,770 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:53,770 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:53,771 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [8#L99true, Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 25#thread2EXITtrue, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 28#L75true, 7#L41true, 76#true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 92#true]) [2025-03-04 02:26:53,771 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-04 02:26:53,771 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:53,771 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,771 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:53,771 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,772 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 6#L74true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 25#thread2EXITtrue, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 76#true, 7#L41true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 92#true]) [2025-03-04 02:26:53,772 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-04 02:26:53,773 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,773 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,773 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,773 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,775 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [8#L99true, Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 6#L74true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 76#true, 7#L41true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:53,775 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-04 02:26:53,775 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,775 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,775 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,775 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,779 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([310] L52-->L51: Formula: (and (= v_~counter~0_102 (+ v_~counter~0_101 1)) (= (+ v_~i2~0_51 1) v_~i2~0_50) (not (= (ite (< 0 v_~counter~0_102) 1 0) 0))) InVars {~counter~0=v_~counter~0_102, ~i2~0=v_~i2~0_51} OutVars{~counter~0=v_~counter~0_101, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~i2~0=v_~i2~0_50, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][70], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 6#L74true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, 17#L98-1true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 76#true, 7#L41true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 92#true]) [2025-03-04 02:26:53,779 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,779 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,779 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,779 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,794 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [8#L99true, Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 6#L74true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 25#thread2EXITtrue, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 92#true]) [2025-03-04 02:26:53,794 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2025-03-04 02:26:53,794 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2025-03-04 02:26:53,794 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2025-03-04 02:26:53,794 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2025-03-04 02:26:53,797 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [8#L99true, Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 6#L74true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 25#thread2EXITtrue, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 7#L41true, 76#true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 92#true]) [2025-03-04 02:26:53,797 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-03-04 02:26:53,797 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,797 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,797 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,798 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,799 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([310] L52-->L51: Formula: (and (= v_~counter~0_102 (+ v_~counter~0_101 1)) (= (+ v_~i2~0_51 1) v_~i2~0_50) (not (= (ite (< 0 v_~counter~0_102) 1 0) 0))) InVars {~counter~0=v_~counter~0_102, ~i2~0=v_~i2~0_51} OutVars{~counter~0=v_~counter~0_101, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~i2~0=v_~i2~0_50, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][70], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 8#L99true, Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 6#L74true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 76#true, 7#L41true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 92#true]) [2025-03-04 02:26:53,799 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-04 02:26:53,799 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,799 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,799 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,799 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([310] L52-->L51: Formula: (and (= v_~counter~0_102 (+ v_~counter~0_101 1)) (= (+ v_~i2~0_51 1) v_~i2~0_50) (not (= (ite (< 0 v_~counter~0_102) 1 0) 0))) InVars {~counter~0=v_~counter~0_102, ~i2~0=v_~i2~0_51} OutVars{~counter~0=v_~counter~0_101, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~i2~0=v_~i2~0_50, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][70], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 6#L74true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 31#L63true, 76#true, 7#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:53,799 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-04 02:26:53,799 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,799 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,799 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,810 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([310] L52-->L51: Formula: (and (= v_~counter~0_102 (+ v_~counter~0_101 1)) (= (+ v_~i2~0_51 1) v_~i2~0_50) (not (= (ite (< 0 v_~counter~0_102) 1 0) 0))) InVars {~counter~0=v_~counter~0_102, ~i2~0=v_~i2~0_51} OutVars{~counter~0=v_~counter~0_101, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~i2~0=v_~i2~0_50, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][70], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 8#L99true, Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 6#L74true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 76#true, 31#L63true, 7#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 92#true]) [2025-03-04 02:26:53,810 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-03-04 02:26:53,811 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,811 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,811 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,811 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([310] L52-->L51: Formula: (and (= v_~counter~0_102 (+ v_~counter~0_101 1)) (= (+ v_~i2~0_51 1) v_~i2~0_50) (not (= (ite (< 0 v_~counter~0_102) 1 0) 0))) InVars {~counter~0=v_~counter~0_102, ~i2~0=v_~i2~0_51} OutVars{~counter~0=v_~counter~0_101, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~i2~0=v_~i2~0_50, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][70], [24#thread3EXITtrue, Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 6#L74true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 76#true, 7#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:53,811 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-03-04 02:26:53,811 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,811 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:53,811 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:53,817 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([310] L52-->L51: Formula: (and (= v_~counter~0_102 (+ v_~counter~0_101 1)) (= (+ v_~i2~0_51 1) v_~i2~0_50) (not (= (ite (< 0 v_~counter~0_102) 1 0) 0))) InVars {~counter~0=v_~counter~0_102, ~i2~0=v_~i2~0_51} OutVars{~counter~0=v_~counter~0_101, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~i2~0=v_~i2~0_50, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][70], [24#thread3EXITtrue, Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 8#L99true, Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 6#L74true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 85#true, 76#true, 7#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 92#true]) [2025-03-04 02:26:53,817 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-03-04 02:26:53,817 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:53,818 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:53,818 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:53,822 INFO L124 PetriNetUnfolderBase]: 4873/6556 cut-off events. [2025-03-04 02:26:53,823 INFO L125 PetriNetUnfolderBase]: For 13549/13945 co-relation queries the response was YES. [2025-03-04 02:26:53,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24038 conditions, 6556 events. 4873/6556 cut-off events. For 13549/13945 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 32031 event pairs, 909 based on Foata normal form. 34/5811 useless extension candidates. Maximal degree in co-relation 14623. Up to 4883 conditions per place. [2025-03-04 02:26:53,861 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 68 selfloop transitions, 8 changer transitions 2/90 dead transitions. [2025-03-04 02:26:53,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 90 transitions, 673 flow [2025-03-04 02:26:53,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:26:53,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:26:53,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2025-03-04 02:26:53,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2025-03-04 02:26:53,862 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 290 flow. Second operand 4 states and 100 transitions. [2025-03-04 02:26:53,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 90 transitions, 673 flow [2025-03-04 02:26:53,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 90 transitions, 655 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 02:26:53,869 INFO L231 Difference]: Finished difference. Result has 60 places, 54 transitions, 339 flow [2025-03-04 02:26:53,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=339, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2025-03-04 02:26:53,869 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2025-03-04 02:26:53,869 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 339 flow [2025-03-04 02:26:53,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:53,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:53,870 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] [2025-03-04 02:26:53,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:26:53,870 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:26:53,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:53,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1637682681, now seen corresponding path program 3 times [2025-03-04 02:26:53,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:53,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734963336] [2025-03-04 02:26:53,871 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:26:53,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:53,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:26:53,880 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:26:53,881 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:26:53,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:53,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:53,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734963336] [2025-03-04 02:26:53,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734963336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:53,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:53,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:26:53,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74767188] [2025-03-04 02:26:53,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:53,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:26:53,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:53,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:26:53,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:26:53,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2025-03-04 02:26:53,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 339 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:53,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:53,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2025-03-04 02:26:53,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:54,132 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, 7#L41true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:54,133 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,133 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,133 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-04 02:26:54,133 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,207 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 25#thread2EXITtrue, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, 7#L41true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:54,207 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,207 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,207 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,207 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,209 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 8#L99true, Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, 7#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:54,209 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,209 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,209 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,209 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,215 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, 7#L41true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:54,215 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,215 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,215 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-04 02:26:54,215 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,215 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,217 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 8#L99true, Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 25#thread2EXITtrue, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, 7#L41true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 92#true]) [2025-03-04 02:26:54,217 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,217 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,217 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,217 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,219 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, 7#L41true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:54,219 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is not cut-off event [2025-03-04 02:26:54,219 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2025-03-04 02:26:54,219 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2025-03-04 02:26:54,219 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2025-03-04 02:26:54,219 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2025-03-04 02:26:54,219 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2025-03-04 02:26:54,219 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 25#thread2EXITtrue, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, 7#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 92#true]) [2025-03-04 02:26:54,219 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,219 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,219 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,219 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,219 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,220 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:54,220 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,220 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,220 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,220 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-04 02:26:54,220 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-04 02:26:54,220 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,220 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,221 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [8#L99true, Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, 7#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 92#true]) [2025-03-04 02:26:54,221 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,221 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,221 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,221 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,221 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,222 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [30#thread2ENTRYtrue, Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 17#L98-1true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), 28#L75true, 7#L41true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 92#true]) [2025-03-04 02:26:54,222 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,222 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-03-04 02:26:54,222 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,222 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-03-04 02:26:54,246 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, 13#thread1EXITtrue, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:54,246 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,246 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,246 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,246 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-04 02:26:54,250 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 8#L99true, Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 32#thread4EXITtrue, 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:54,250 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,250 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,250 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,250 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,252 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 6#L74true, 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 7#L41true, 76#true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:54,252 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,252 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,252 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,252 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,253 INFO L292 olderBase$Statistics]: inserting event number 8 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:54,253 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,253 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,253 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,253 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-04 02:26:54,253 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-04 02:26:54,253 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,253 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,253 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,253 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 33#L40true, 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:54,253 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,253 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,253 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,253 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,256 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 25#thread2EXITtrue, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, 7#L41true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:54,256 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,256 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,256 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,256 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,256 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,256 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,258 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [8#L99true, Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, 7#L41true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 92#true]) [2025-03-04 02:26:54,259 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is not cut-off event [2025-03-04 02:26:54,259 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2025-03-04 02:26:54,259 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2025-03-04 02:26:54,259 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2025-03-04 02:26:54,259 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2025-03-04 02:26:54,259 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2025-03-04 02:26:54,259 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [8#L99true, Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 25#thread2EXITtrue, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, 7#L41true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:54,259 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,259 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,259 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,259 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,259 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,260 INFO L292 olderBase$Statistics]: inserting event number 9 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, 7#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:54,260 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,261 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,261 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,261 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-04 02:26:54,261 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,261 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-04 02:26:54,261 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,261 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,261 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,262 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 25#thread2EXITtrue, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:54,262 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,262 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,262 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,262 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,262 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,262 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,262 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,262 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [8#L99true, Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 25#thread2EXITtrue, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, 7#L41true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:54,263 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,263 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,263 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,263 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,263 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,263 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,263 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [30#thread2ENTRYtrue, Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 8#L99true, Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), Black: 79#(<= (+ ~i2~0 1) ~N2~0), 28#L75true, 7#L41true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 92#true]) [2025-03-04 02:26:54,263 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,263 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-04 02:26:54,263 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-04 02:26:54,263 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-04 02:26:54,288 INFO L292 olderBase$Statistics]: inserting event number 8 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#thread2EXITtrue, Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:54,288 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,288 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,289 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,289 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,289 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,289 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,289 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,289 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,291 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 25#thread2EXITtrue, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, 11#L64true, 13#thread1EXITtrue, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:54,291 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,291 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,292 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,292 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,295 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 8#L99true, Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 32#thread4EXITtrue, 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#thread2EXITtrue, Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:54,295 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,295 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,295 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,295 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,296 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 8#L99true, Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 6#L74true, 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:54,296 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,296 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,296 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,296 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,296 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 8#L99true, Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 33#L40true, 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:54,296 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,296 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,296 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,296 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,296 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 8#L99true, Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:54,296 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-03-04 02:26:54,296 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,296 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,296 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,296 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,296 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,296 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,297 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 6#L74true, 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 25#thread2EXITtrue, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 92#true]) [2025-03-04 02:26:54,297 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,297 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,297 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,297 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,297 INFO L292 olderBase$Statistics]: inserting event number 9 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 25#thread2EXITtrue, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 7#L41true, 76#true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 92#true]) [2025-03-04 02:26:54,297 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-03-04 02:26:54,297 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,297 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,297 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,297 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,297 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,297 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,297 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,297 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,297 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 33#L40true, 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 25#thread2EXITtrue, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 92#true]) [2025-03-04 02:26:54,297 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,297 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,297 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,297 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,307 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([310] L52-->L51: Formula: (and (= v_~counter~0_102 (+ v_~counter~0_101 1)) (= (+ v_~i2~0_51 1) v_~i2~0_50) (not (= (ite (< 0 v_~counter~0_102) 1 0) 0))) InVars {~counter~0=v_~counter~0_102, ~i2~0=v_~i2~0_51} OutVars{~counter~0=v_~counter~0_101, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~i2~0=v_~i2~0_50, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][72], [Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 6#L74true, 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:54,307 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,307 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,307 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,307 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,319 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 8#L99true, Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 6#L74true, 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 25#thread2EXITtrue, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:54,319 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-03-04 02:26:54,319 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,319 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,319 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,319 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 8#L99true, Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 33#L40true, 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#thread2EXITtrue, Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:54,319 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-03-04 02:26:54,319 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,319 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,319 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,319 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][36], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 8#L99true, Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 25#thread2EXITtrue, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:54,320 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-03-04 02:26:54,320 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,320 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,320 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,320 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,320 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,320 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,325 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([310] L52-->L51: Formula: (and (= v_~counter~0_102 (+ v_~counter~0_101 1)) (= (+ v_~i2~0_51 1) v_~i2~0_50) (not (= (ite (< 0 v_~counter~0_102) 1 0) 0))) InVars {~counter~0=v_~counter~0_102, ~i2~0=v_~i2~0_51} OutVars{~counter~0=v_~counter~0_101, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~i2~0=v_~i2~0_50, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][72], [Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 8#L99true, Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 31#L63true, 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:54,326 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,326 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,326 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,326 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,326 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([310] L52-->L51: Formula: (and (= v_~counter~0_102 (+ v_~counter~0_101 1)) (= (+ v_~i2~0_51 1) v_~i2~0_50) (not (= (ite (< 0 v_~counter~0_102) 1 0) 0))) InVars {~counter~0=v_~counter~0_102, ~i2~0=v_~i2~0_51} OutVars{~counter~0=v_~counter~0_101, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~i2~0=v_~i2~0_50, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][72], [Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 8#L99true, Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 6#L74true, 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 76#true, 7#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 92#true]) [2025-03-04 02:26:54,326 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,326 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,326 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,326 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,326 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([310] L52-->L51: Formula: (and (= v_~counter~0_102 (+ v_~counter~0_101 1)) (= (+ v_~i2~0_51 1) v_~i2~0_50) (not (= (ite (< 0 v_~counter~0_102) 1 0) 0))) InVars {~counter~0=v_~counter~0_102, ~i2~0=v_~i2~0_51} OutVars{~counter~0=v_~counter~0_101, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~i2~0=v_~i2~0_50, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][72], [Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 6#L74true, 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 31#L63true, 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:54,327 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,327 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,327 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,327 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,336 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([310] L52-->L51: Formula: (and (= v_~counter~0_102 (+ v_~counter~0_101 1)) (= (+ v_~i2~0_51 1) v_~i2~0_50) (not (= (ite (< 0 v_~counter~0_102) 1 0) 0))) InVars {~counter~0=v_~counter~0_102, ~i2~0=v_~i2~0_51} OutVars{~counter~0=v_~counter~0_101, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~i2~0=v_~i2~0_50, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][72], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 8#L99true, 24#thread3EXITtrue, Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, 7#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 92#true]) [2025-03-04 02:26:54,336 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-03-04 02:26:54,336 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,336 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,336 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-03-04 02:26:54,337 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([310] L52-->L51: Formula: (and (= v_~counter~0_102 (+ v_~counter~0_101 1)) (= (+ v_~i2~0_51 1) v_~i2~0_50) (not (= (ite (< 0 v_~counter~0_102) 1 0) 0))) InVars {~counter~0=v_~counter~0_102, ~i2~0=v_~i2~0_51} OutVars{~counter~0=v_~counter~0_101, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~i2~0=v_~i2~0_50, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][72], [8#L99true, Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 6#L74true, 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 31#L63true, 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:54,337 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-03-04 02:26:54,337 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,337 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,337 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,337 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([310] L52-->L51: Formula: (and (= v_~counter~0_102 (+ v_~counter~0_101 1)) (= (+ v_~i2~0_51 1) v_~i2~0_50) (not (= (ite (< 0 v_~counter~0_102) 1 0) 0))) InVars {~counter~0=v_~counter~0_102, ~i2~0=v_~i2~0_51} OutVars{~counter~0=v_~counter~0_101, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~i2~0=v_~i2~0_50, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][72], [24#thread3EXITtrue, Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 6#L74true, 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 76#true, 7#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 92#true]) [2025-03-04 02:26:54,337 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-03-04 02:26:54,337 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,337 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,337 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,338 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([310] L52-->L51: Formula: (and (= v_~counter~0_102 (+ v_~counter~0_101 1)) (= (+ v_~i2~0_51 1) v_~i2~0_50) (not (= (ite (< 0 v_~counter~0_102) 1 0) 0))) InVars {~counter~0=v_~counter~0_102, ~i2~0=v_~i2~0_51} OutVars{~counter~0=v_~counter~0_101, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~i2~0=v_~i2~0_50, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][72], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 32#thread4EXITtrue, 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 31#L63true, 76#true, 7#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 92#true]) [2025-03-04 02:26:54,338 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-03-04 02:26:54,338 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,338 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,338 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,342 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([310] L52-->L51: Formula: (and (= v_~counter~0_102 (+ v_~counter~0_101 1)) (= (+ v_~i2~0_51 1) v_~i2~0_50) (not (= (ite (< 0 v_~counter~0_102) 1 0) 0))) InVars {~counter~0=v_~counter~0_102, ~i2~0=v_~i2~0_51} OutVars{~counter~0=v_~counter~0_101, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~i2~0=v_~i2~0_50, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][72], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 8#L99true, Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 24#thread3EXITtrue, Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 6#L74true, 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 76#true, 7#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 92#true]) [2025-03-04 02:26:54,342 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-03-04 02:26:54,342 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,342 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,342 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,342 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([310] L52-->L51: Formula: (and (= v_~counter~0_102 (+ v_~counter~0_101 1)) (= (+ v_~i2~0_51 1) v_~i2~0_50) (not (= (ite (< 0 v_~counter~0_102) 1 0) 0))) InVars {~counter~0=v_~counter~0_102, ~i2~0=v_~i2~0_51} OutVars{~counter~0=v_~counter~0_101, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~i2~0=v_~i2~0_50, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][72], [8#L99true, Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 32#thread4EXITtrue, 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 31#L63true, 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 92#true]) [2025-03-04 02:26:54,342 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-03-04 02:26:54,342 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,342 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,342 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,343 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([310] L52-->L51: Formula: (and (= v_~counter~0_102 (+ v_~counter~0_101 1)) (= (+ v_~i2~0_51 1) v_~i2~0_50) (not (= (ite (< 0 v_~counter~0_102) 1 0) 0))) InVars {~counter~0=v_~counter~0_102, ~i2~0=v_~i2~0_51} OutVars{~counter~0=v_~counter~0_101, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~i2~0=v_~i2~0_50, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][72], [Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 24#thread3EXITtrue, Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 32#thread4EXITtrue, 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:54,343 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-03-04 02:26:54,343 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,343 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,343 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,346 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([310] L52-->L51: Formula: (and (= v_~counter~0_102 (+ v_~counter~0_101 1)) (= (+ v_~i2~0_51 1) v_~i2~0_50) (not (= (ite (< 0 v_~counter~0_102) 1 0) 0))) InVars {~counter~0=v_~counter~0_102, ~i2~0=v_~i2~0_51} OutVars{~counter~0=v_~counter~0_101, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~i2~0=v_~i2~0_50, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][72], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 8#L99true, 24#thread3EXITtrue, Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 32#thread4EXITtrue, 100#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 92#true]) [2025-03-04 02:26:54,346 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-03-04 02:26:54,346 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,346 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,346 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,347 INFO L124 PetriNetUnfolderBase]: 4718/6489 cut-off events. [2025-03-04 02:26:54,347 INFO L125 PetriNetUnfolderBase]: For 16164/16745 co-relation queries the response was YES. [2025-03-04 02:26:54,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26442 conditions, 6489 events. 4718/6489 cut-off events. For 16164/16745 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 33578 event pairs, 823 based on Foata normal form. 119/6180 useless extension candidates. Maximal degree in co-relation 15617. Up to 5184 conditions per place. [2025-03-04 02:26:54,384 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 77 selfloop transitions, 12 changer transitions 6/109 dead transitions. [2025-03-04 02:26:54,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 109 transitions, 820 flow [2025-03-04 02:26:54,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:26:54,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:26:54,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-03-04 02:26:54,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2025-03-04 02:26:54,385 INFO L175 Difference]: Start difference. First operand has 60 places, 54 transitions, 339 flow. Second operand 5 states and 130 transitions. [2025-03-04 02:26:54,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 109 transitions, 820 flow [2025-03-04 02:26:54,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 109 transitions, 809 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:26:54,393 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 464 flow [2025-03-04 02:26:54,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=464, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2025-03-04 02:26:54,395 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 25 predicate places. [2025-03-04 02:26:54,396 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 464 flow [2025-03-04 02:26:54,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:54,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:54,396 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] [2025-03-04 02:26:54,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:26:54,396 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:26:54,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:54,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1492101991, now seen corresponding path program 4 times [2025-03-04 02:26:54,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:54,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141536333] [2025-03-04 02:26:54,397 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:26:54,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:54,402 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:26:54,406 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:26:54,406 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:26:54,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:54,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:54,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:54,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141536333] [2025-03-04 02:26:54,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141536333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:54,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:54,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:26:54,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698094696] [2025-03-04 02:26:54,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:54,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:26:54,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:54,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:26:54,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:26:54,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2025-03-04 02:26:54,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 464 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:54,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:54,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2025-03-04 02:26:54,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:54,716 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][77], [Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 33#L40true, Black: 102#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 100#true, Black: 105#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 108#true, 52#true, 34#L51true, 17#L98-1true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0))]) [2025-03-04 02:26:54,716 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,716 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,716 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,716 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-04 02:26:54,735 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][90], [111#(<= (+ ~i1~0 1) ~N1~0), Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 102#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 100#true, Black: 105#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, 17#L98-1true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 7#L41true, 76#true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0))]) [2025-03-04 02:26:54,735 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2025-03-04 02:26:54,735 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2025-03-04 02:26:54,735 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2025-03-04 02:26:54,735 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2025-03-04 02:26:54,741 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][77], [Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 102#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 100#true, Black: 105#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 108#true, 52#true, 34#L51true, 17#L98-1true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread1EXITtrue, 11#L64true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0))]) [2025-03-04 02:26:54,742 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,742 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,742 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,742 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,749 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][77], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 8#L99true, Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 33#L40true, 100#true, Black: 102#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 108#true, Black: 105#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0))]) [2025-03-04 02:26:54,749 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,749 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,749 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,749 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,750 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][77], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 33#L40true, 100#true, Black: 102#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 105#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), 108#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 25#thread2EXITtrue, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0))]) [2025-03-04 02:26:54,750 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,750 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,750 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,750 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-04 02:26:54,761 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][90], [111#(<= (+ ~i1~0 1) ~N1~0), Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 8#L99true, Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 102#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 100#true, Black: 105#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, 7#L41true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0))]) [2025-03-04 02:26:54,761 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2025-03-04 02:26:54,761 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2025-03-04 02:26:54,761 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2025-03-04 02:26:54,761 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2025-03-04 02:26:54,762 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][90], [111#(<= (+ ~i1~0 1) ~N1~0), Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 100#true, Black: 102#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 105#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 17#L98-1true, 25#thread2EXITtrue, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 7#L41true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0))]) [2025-03-04 02:26:54,762 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2025-03-04 02:26:54,762 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2025-03-04 02:26:54,763 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2025-03-04 02:26:54,763 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2025-03-04 02:26:54,766 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][77], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 8#L99true, Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 100#true, Black: 102#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 105#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), 108#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, 11#L64true, 13#thread1EXITtrue, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0))]) [2025-03-04 02:26:54,767 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-03-04 02:26:54,767 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,767 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,767 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,767 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][77], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 100#true, Black: 102#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 105#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 108#true, 52#true, 17#L98-1true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#thread2EXITtrue, Black: 50#(= ~counter~0 0), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread1EXITtrue, 11#L64true, Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0))]) [2025-03-04 02:26:54,767 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-03-04 02:26:54,768 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,768 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,768 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,771 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][77], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 8#L99true, Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 33#L40true, 100#true, Black: 102#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 105#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 108#true, 52#true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#thread2EXITtrue, Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0))]) [2025-03-04 02:26:54,772 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-03-04 02:26:54,772 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,772 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,772 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-04 02:26:54,777 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][90], [111#(<= (+ ~i1~0 1) ~N1~0), Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 8#L99true, Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 100#true, Black: 102#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 105#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 25#thread2EXITtrue, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, 7#L41true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0))]) [2025-03-04 02:26:54,777 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is not cut-off event [2025-03-04 02:26:54,777 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2025-03-04 02:26:54,777 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2025-03-04 02:26:54,777 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2025-03-04 02:26:54,779 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][77], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 8#L99true, Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 100#true, Black: 102#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 105#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 108#true, 52#true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#thread2EXITtrue, Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, 13#thread1EXITtrue, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L64true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0))]) [2025-03-04 02:26:54,779 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-03-04 02:26:54,779 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,779 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,779 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,780 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][77], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 29#L100true, 100#true, Black: 102#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 105#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), 108#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, 34#L51true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0))]) [2025-03-04 02:26:54,780 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-03-04 02:26:54,780 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,780 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,780 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-04 02:26:54,783 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][77], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 29#L100true, 100#true, Black: 102#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 105#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), 108#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#thread2EXITtrue, Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0))]) [2025-03-04 02:26:54,783 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-03-04 02:26:54,783 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-03-04 02:26:54,783 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-03-04 02:26:54,784 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-03-04 02:26:54,786 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][77], [Black: 65#(and (= ~i1~0 0) (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 97#(and (<= 1 ~M2~0) (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 62#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 94#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 100#true, Black: 102#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 105#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), 108#true, Black: 70#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 52#true, Black: 78#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 79#(<= (+ ~i2~0 1) ~N2~0), Black: 50#(= ~counter~0 0), Black: 81#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 28#L75true, 76#true, 21#L101true, 11#L64true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 90#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0))]) [2025-03-04 02:26:54,786 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-03-04 02:26:54,786 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-03-04 02:26:54,786 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-03-04 02:26:54,787 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-03-04 02:26:54,791 INFO L124 PetriNetUnfolderBase]: 4018/5479 cut-off events. [2025-03-04 02:26:54,794 INFO L125 PetriNetUnfolderBase]: For 19854/20407 co-relation queries the response was YES. [2025-03-04 02:26:54,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24591 conditions, 5479 events. 4018/5479 cut-off events. For 19854/20407 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 27273 event pairs, 748 based on Foata normal form. 284/5691 useless extension candidates. Maximal degree in co-relation 18064. Up to 2912 conditions per place. [2025-03-04 02:26:54,827 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 83 selfloop transitions, 12 changer transitions 13/118 dead transitions. [2025-03-04 02:26:54,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 118 transitions, 989 flow [2025-03-04 02:26:54,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:26:54,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:26:54,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2025-03-04 02:26:54,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7055555555555556 [2025-03-04 02:26:54,828 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 464 flow. Second operand 5 states and 127 transitions. [2025-03-04 02:26:54,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 118 transitions, 989 flow [2025-03-04 02:26:54,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 118 transitions, 966 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-03-04 02:26:54,840 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 440 flow [2025-03-04 02:26:54,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=440, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2025-03-04 02:26:54,841 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 29 predicate places. [2025-03-04 02:26:54,842 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 440 flow [2025-03-04 02:26:54,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:54,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:54,842 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] [2025-03-04 02:26:54,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:26:54,842 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:26:54,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:54,842 INFO L85 PathProgramCache]: Analyzing trace with hash -8908277, now seen corresponding path program 1 times [2025-03-04 02:26:54,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:54,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387839496] [2025-03-04 02:26:54,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:26:54,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:54,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:26:54,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:26:54,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:26:54,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:54,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:26:54,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:54,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387839496] [2025-03-04 02:26:54,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387839496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:54,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:54,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:26:54,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724053016] [2025-03-04 02:26:54,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:54,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:26:54,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:54,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:26:54,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:26:54,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2025-03-04 02:26:54,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 440 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:54,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:54,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2025-03-04 02:26:54,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:55,199 INFO L124 PetriNetUnfolderBase]: 3600/5082 cut-off events. [2025-03-04 02:26:55,199 INFO L125 PetriNetUnfolderBase]: For 24169/24832 co-relation queries the response was YES. [2025-03-04 02:26:55,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24321 conditions, 5082 events. 3600/5082 cut-off events. For 24169/24832 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 26378 event pairs, 1013 based on Foata normal form. 178/5078 useless extension candidates. Maximal degree in co-relation 20146. Up to 3993 conditions per place. [2025-03-04 02:26:55,270 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 64 selfloop transitions, 9 changer transitions 1/88 dead transitions. [2025-03-04 02:26:55,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 88 transitions, 810 flow [2025-03-04 02:26:55,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:26:55,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:26:55,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-03-04 02:26:55,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2025-03-04 02:26:55,271 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 440 flow. Second operand 4 states and 93 transitions. [2025-03-04 02:26:55,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 88 transitions, 810 flow [2025-03-04 02:26:55,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 88 transitions, 770 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-03-04 02:26:55,288 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 512 flow [2025-03-04 02:26:55,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=512, PETRI_PLACES=69, PETRI_TRANSITIONS=65} [2025-03-04 02:26:55,289 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 29 predicate places. [2025-03-04 02:26:55,290 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 512 flow [2025-03-04 02:26:55,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:55,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:55,290 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] [2025-03-04 02:26:55,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:26:55,290 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:26:55,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:55,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1181737993, now seen corresponding path program 2 times [2025-03-04 02:26:55,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:55,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248549355] [2025-03-04 02:26:55,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:26:55,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:55,297 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:26:55,302 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 27 statements. [2025-03-04 02:26:55,303 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:26:55,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:55,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:26:55,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:55,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248549355] [2025-03-04 02:26:55,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248549355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:55,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:55,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:26:55,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577303594] [2025-03-04 02:26:55,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:55,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:26:55,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:55,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:26:55,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:26:55,408 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2025-03-04 02:26:55,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 512 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:55,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:55,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2025-03-04 02:26:55,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:55,829 INFO L124 PetriNetUnfolderBase]: 4371/5938 cut-off events. [2025-03-04 02:26:55,830 INFO L125 PetriNetUnfolderBase]: For 29258/29604 co-relation queries the response was YES. [2025-03-04 02:26:55,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29435 conditions, 5938 events. 4371/5938 cut-off events. For 29258/29604 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 28863 event pairs, 479 based on Foata normal form. 240/6057 useless extension candidates. Maximal degree in co-relation 22898. Up to 3002 conditions per place. [2025-03-04 02:26:55,869 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 91 selfloop transitions, 13 changer transitions 4/120 dead transitions. [2025-03-04 02:26:55,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 120 transitions, 1103 flow [2025-03-04 02:26:55,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:26:55,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:26:55,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2025-03-04 02:26:55,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2025-03-04 02:26:55,871 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 512 flow. Second operand 5 states and 123 transitions. [2025-03-04 02:26:55,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 120 transitions, 1103 flow [2025-03-04 02:26:55,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 120 transitions, 1103 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:26:55,888 INFO L231 Difference]: Finished difference. Result has 75 places, 67 transitions, 572 flow [2025-03-04 02:26:55,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=572, PETRI_PLACES=75, PETRI_TRANSITIONS=67} [2025-03-04 02:26:55,890 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 35 predicate places. [2025-03-04 02:26:55,890 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 67 transitions, 572 flow [2025-03-04 02:26:55,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:55,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:55,890 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] [2025-03-04 02:26:55,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 02:26:55,890 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:26:55,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:55,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1261463143, now seen corresponding path program 1 times [2025-03-04 02:26:55,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:55,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496557387] [2025-03-04 02:26:55,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:26:55,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:55,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 02:26:55,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:26:55,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:26:55,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:55,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:26:55,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:55,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496557387] [2025-03-04 02:26:55,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496557387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:55,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:55,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:26:55,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735008393] [2025-03-04 02:26:55,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:55,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:26:55,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:55,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:26:55,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:26:55,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2025-03-04 02:26:55,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 67 transitions, 572 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:55,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:55,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2025-03-04 02:26:55,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:56,383 INFO L124 PetriNetUnfolderBase]: 3418/4680 cut-off events. [2025-03-04 02:26:56,383 INFO L125 PetriNetUnfolderBase]: For 27627/28227 co-relation queries the response was YES. [2025-03-04 02:26:56,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24758 conditions, 4680 events. 3418/4680 cut-off events. For 27627/28227 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 21949 event pairs, 557 based on Foata normal form. 237/4824 useless extension candidates. Maximal degree in co-relation 22564. Up to 3093 conditions per place. [2025-03-04 02:26:56,415 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 75 selfloop transitions, 13 changer transitions 0/100 dead transitions. [2025-03-04 02:26:56,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 100 transitions, 935 flow [2025-03-04 02:26:56,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:26:56,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:26:56,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2025-03-04 02:26:56,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2025-03-04 02:26:56,416 INFO L175 Difference]: Start difference. First operand has 75 places, 67 transitions, 572 flow. Second operand 5 states and 114 transitions. [2025-03-04 02:26:56,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 100 transitions, 935 flow [2025-03-04 02:26:56,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 100 transitions, 884 flow, removed 21 selfloop flow, removed 4 redundant places. [2025-03-04 02:26:56,445 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 548 flow [2025-03-04 02:26:56,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=548, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2025-03-04 02:26:56,446 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 32 predicate places. [2025-03-04 02:26:56,446 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 548 flow [2025-03-04 02:26:56,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:56,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:56,446 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] [2025-03-04 02:26:56,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 02:26:56,446 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:26:56,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:56,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1483091951, now seen corresponding path program 1 times [2025-03-04 02:26:56,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:56,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419855888] [2025-03-04 02:26:56,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:26:56,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:56,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:26:56,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:26:56,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:26:56,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:56,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:56,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:56,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419855888] [2025-03-04 02:26:56,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419855888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:56,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:56,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:26:56,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63928244] [2025-03-04 02:26:56,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:56,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:26:56,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:56,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:26:56,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:26:56,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2025-03-04 02:26:56,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 548 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:56,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:56,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2025-03-04 02:26:56,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:56,996 INFO L124 PetriNetUnfolderBase]: 5891/8818 cut-off events. [2025-03-04 02:26:56,997 INFO L125 PetriNetUnfolderBase]: For 51081/52906 co-relation queries the response was YES. [2025-03-04 02:26:57,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44966 conditions, 8818 events. 5891/8818 cut-off events. For 51081/52906 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 53001 event pairs, 1202 based on Foata normal form. 874/9289 useless extension candidates. Maximal degree in co-relation 29669. Up to 3927 conditions per place. [2025-03-04 02:26:57,054 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 70 selfloop transitions, 29 changer transitions 2/126 dead transitions. [2025-03-04 02:26:57,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 126 transitions, 1211 flow [2025-03-04 02:26:57,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:26:57,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:26:57,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-03-04 02:26:57,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7916666666666666 [2025-03-04 02:26:57,055 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 548 flow. Second operand 4 states and 114 transitions. [2025-03-04 02:26:57,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 126 transitions, 1211 flow [2025-03-04 02:26:57,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 126 transitions, 1183 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 02:26:57,078 INFO L231 Difference]: Finished difference. Result has 74 places, 91 transitions, 968 flow [2025-03-04 02:26:57,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=968, PETRI_PLACES=74, PETRI_TRANSITIONS=91} [2025-03-04 02:26:57,079 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 34 predicate places. [2025-03-04 02:26:57,079 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 91 transitions, 968 flow [2025-03-04 02:26:57,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:57,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:57,079 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] [2025-03-04 02:26:57,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 02:26:57,080 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:26:57,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:57,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1508887279, now seen corresponding path program 2 times [2025-03-04 02:26:57,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:57,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122408895] [2025-03-04 02:26:57,080 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:26:57,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:57,085 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:26:57,090 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:26:57,090 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:26:57,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:57,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:57,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:57,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122408895] [2025-03-04 02:26:57,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122408895] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:26:57,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648595790] [2025-03-04 02:26:57,180 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:26:57,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:57,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:26:57,183 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:26:57,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:26:57,224 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:26:57,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:26:57,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:26:57,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:57,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:26:57,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:26:57,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:57,319 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:26:57,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648595790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:57,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:26:57,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2025-03-04 02:26:57,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332482965] [2025-03-04 02:26:57,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:57,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:26:57,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:57,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:26:57,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:26:57,321 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2025-03-04 02:26:57,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 91 transitions, 968 flow. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:57,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:57,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2025-03-04 02:26:57,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:58,513 INFO L124 PetriNetUnfolderBase]: 11758/17490 cut-off events. [2025-03-04 02:26:58,513 INFO L125 PetriNetUnfolderBase]: For 156345/161295 co-relation queries the response was YES. [2025-03-04 02:26:58,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101011 conditions, 17490 events. 11758/17490 cut-off events. For 156345/161295 co-relation queries the response was YES. Maximal size of possible extension queue 1089. Compared 116441 event pairs, 2034 based on Foata normal form. 1432/18162 useless extension candidates. Maximal degree in co-relation 67714. Up to 7794 conditions per place. [2025-03-04 02:26:58,679 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 88 selfloop transitions, 71 changer transitions 2/186 dead transitions. [2025-03-04 02:26:58,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 186 transitions, 2119 flow [2025-03-04 02:26:58,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:26:58,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:26:58,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2025-03-04 02:26:58,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667 [2025-03-04 02:26:58,684 INFO L175 Difference]: Start difference. First operand has 74 places, 91 transitions, 968 flow. Second operand 5 states and 147 transitions. [2025-03-04 02:26:58,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 186 transitions, 2119 flow [2025-03-04 02:26:58,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 186 transitions, 2083 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-03-04 02:26:58,733 INFO L231 Difference]: Finished difference. Result has 80 places, 133 transitions, 1749 flow [2025-03-04 02:26:58,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1749, PETRI_PLACES=80, PETRI_TRANSITIONS=133} [2025-03-04 02:26:58,733 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 40 predicate places. [2025-03-04 02:26:58,734 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 133 transitions, 1749 flow [2025-03-04 02:26:58,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:58,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:58,734 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:58,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 02:26:58,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 02:26:58,935 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:26:58,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:58,935 INFO L85 PathProgramCache]: Analyzing trace with hash 78326617, now seen corresponding path program 3 times [2025-03-04 02:26:58,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:58,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349791633] [2025-03-04 02:26:58,935 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:26:58,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:58,943 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-03-04 02:26:58,949 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 02:26:58,949 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:26:58,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:59,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:26:59,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:59,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349791633] [2025-03-04 02:26:59,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349791633] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:26:59,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156780553] [2025-03-04 02:26:59,028 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:26:59,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:59,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:26:59,029 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:26:59,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:26:59,067 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-03-04 02:26:59,085 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 02:26:59,085 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:26:59,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:59,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:26:59,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:26:59,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:26:59,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:26:59,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:26:59,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156780553] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:26:59,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:26:59,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-04 02:26:59,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240398719] [2025-03-04 02:26:59,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:26:59,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 02:26:59,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:59,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 02:26:59,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:26:59,339 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2025-03-04 02:26:59,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 133 transitions, 1749 flow. Second operand has 14 states, 14 states have (on average 15.214285714285714) internal successors, (213), 14 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:59,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:59,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2025-03-04 02:26:59,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:06,128 INFO L124 PetriNetUnfolderBase]: 57782/79294 cut-off events. [2025-03-04 02:27:06,129 INFO L125 PetriNetUnfolderBase]: For 714923/717333 co-relation queries the response was YES. [2025-03-04 02:27:06,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460741 conditions, 79294 events. 57782/79294 cut-off events. For 714923/717333 co-relation queries the response was YES. Maximal size of possible extension queue 3339. Compared 524949 event pairs, 2185 based on Foata normal form. 6855/86147 useless extension candidates. Maximal degree in co-relation 203019. Up to 20923 conditions per place. [2025-03-04 02:27:06,819 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 881 selfloop transitions, 456 changer transitions 0/1345 dead transitions. [2025-03-04 02:27:06,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 1345 transitions, 19506 flow [2025-03-04 02:27:06,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-04 02:27:06,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2025-03-04 02:27:06,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 1057 transitions. [2025-03-04 02:27:06,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5992063492063492 [2025-03-04 02:27:06,822 INFO L175 Difference]: Start difference. First operand has 80 places, 133 transitions, 1749 flow. Second operand 49 states and 1057 transitions. [2025-03-04 02:27:06,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 1345 transitions, 19506 flow [2025-03-04 02:27:07,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 1345 transitions, 18312 flow, removed 597 selfloop flow, removed 0 redundant places. [2025-03-04 02:27:07,874 INFO L231 Difference]: Finished difference. Result has 168 places, 524 transitions, 8771 flow [2025-03-04 02:27:07,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1629, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=8771, PETRI_PLACES=168, PETRI_TRANSITIONS=524} [2025-03-04 02:27:07,875 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 128 predicate places. [2025-03-04 02:27:07,875 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 524 transitions, 8771 flow [2025-03-04 02:27:07,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.214285714285714) internal successors, (213), 14 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:07,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:07,875 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:07,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 02:27:08,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 02:27:08,076 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:27:08,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:08,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1794792591, now seen corresponding path program 4 times [2025-03-04 02:27:08,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:08,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683331705] [2025-03-04 02:27:08,077 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:27:08,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:08,082 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-04 02:27:08,090 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 02:27:08,090 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:27:08,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:08,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:27:08,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:08,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683331705] [2025-03-04 02:27:08,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683331705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:27:08,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:27:08,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:27:08,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132472272] [2025-03-04 02:27:08,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:08,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:27:08,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:08,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:27:08,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:27:08,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2025-03-04 02:27:08,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 524 transitions, 8771 flow. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:08,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:08,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2025-03-04 02:27:08,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:28,143 INFO L124 PetriNetUnfolderBase]: 94921/133882 cut-off events. [2025-03-04 02:27:28,143 INFO L125 PetriNetUnfolderBase]: For 6045516/6076445 co-relation queries the response was YES. [2025-03-04 02:27:29,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1395151 conditions, 133882 events. 94921/133882 cut-off events. For 6045516/6076445 co-relation queries the response was YES. Maximal size of possible extension queue 6152. Compared 997366 event pairs, 15794 based on Foata normal form. 4223/132578 useless extension candidates. Maximal degree in co-relation 1182776. Up to 44716 conditions per place. [2025-03-04 02:27:30,115 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 1026 selfloop transitions, 374 changer transitions 42/1466 dead transitions. [2025-03-04 02:27:30,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 1466 transitions, 27907 flow [2025-03-04 02:27:30,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:27:30,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:27:30,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions. [2025-03-04 02:27:30,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71875 [2025-03-04 02:27:30,116 INFO L175 Difference]: Start difference. First operand has 168 places, 524 transitions, 8771 flow. Second operand 8 states and 207 transitions. [2025-03-04 02:27:30,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 1466 transitions, 27907 flow [2025-03-04 02:27:51,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 1466 transitions, 23763 flow, removed 1917 selfloop flow, removed 6 redundant places. [2025-03-04 02:27:51,488 INFO L231 Difference]: Finished difference. Result has 175 places, 816 transitions, 14123 flow [2025-03-04 02:27:51,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=7376, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=14123, PETRI_PLACES=175, PETRI_TRANSITIONS=816} [2025-03-04 02:27:51,489 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 135 predicate places. [2025-03-04 02:27:51,489 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 816 transitions, 14123 flow [2025-03-04 02:27:51,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:51,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:51,489 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:51,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 02:27:51,490 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:27:51,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:51,490 INFO L85 PathProgramCache]: Analyzing trace with hash 2039230999, now seen corresponding path program 5 times [2025-03-04 02:27:51,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:51,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582677985] [2025-03-04 02:27:51,490 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:27:51,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:51,494 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-04 02:27:51,498 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 02:27:51,498 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:27:51,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:51,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:27:51,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:51,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582677985] [2025-03-04 02:27:51,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582677985] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:51,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368117040] [2025-03-04 02:27:51,546 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:27:51,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:51,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:51,548 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:27:51,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:27:51,586 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-04 02:27:51,601 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 02:27:51,602 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:27:51,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:51,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:27:51,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:51,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:27:51,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:51,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:27:51,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368117040] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:27:51,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:27:51,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 02:27:51,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323907594] [2025-03-04 02:27:51,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:27:51,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:27:51,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:51,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:27:51,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:27:51,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2025-03-04 02:27:51,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 816 transitions, 14123 flow. Second operand has 13 states, 13 states have (on average 15.153846153846153) internal successors, (197), 13 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:51,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:51,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2025-03-04 02:27:51,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand