./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/popl20-proofs-counter-add-4-semi-Q67.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/popl20-proofs-counter-add-4-semi-Q67.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 01:07:58,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:07:58,711 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 01:07:58,717 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:07:58,717 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:07:58,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:07:58,760 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:07:58,760 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:07:58,761 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:07:58,765 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:07:58,765 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:07:58,765 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:07:58,766 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:07:58,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:07:58,768 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:07:58,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:07:58,768 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:07:58,769 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:07:58,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 01:07:58,769 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:07:58,769 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:07:58,770 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:07:58,770 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:07:58,770 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:07:58,771 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:07:58,771 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:07:58,771 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:07:58,771 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:07:58,772 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:07:58,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:07:58,773 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:07:58,773 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:07:58,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:07:58,774 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:07:58,774 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:07:58,774 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:07:58,774 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 01:07:58,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 01:07:58,775 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:07:58,775 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:07:58,775 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:07:58,775 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:07:58,776 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:07:58,776 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-28 01:07:59,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:07:59,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:07:59,055 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:07:59,056 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:07:59,057 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:07:59,058 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2024-06-28 01:08:00,269 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:08:00,448 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:08:00,448 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2024-06-28 01:08:00,455 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1b873939/146540fd46114da4a275d73266e586f3/FLAGc5a1ca4e4 [2024-06-28 01:08:00,467 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1b873939/146540fd46114da4a275d73266e586f3 [2024-06-28 01:08:00,469 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:08:00,470 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:08:00,470 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/popl20-proofs-counter-add-4-semi-Q67.wvr.yml/witness.yml [2024-06-28 01:08:00,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:08:00,631 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:08:00,632 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:08:00,632 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:08:00,636 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:08:00,637 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:08:00" (1/2) ... [2024-06-28 01:08:00,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aea64f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:08:00, skipping insertion in model container [2024-06-28 01:08:00,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:08:00" (1/2) ... [2024-06-28 01:08:00,639 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@21e4ed2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:08:00, skipping insertion in model container [2024-06-28 01:08:00,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:08:00" (2/2) ... [2024-06-28 01:08:00,640 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aea64f1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:08:00, skipping insertion in model container [2024-06-28 01:08:00,640 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:08:00" (2/2) ... [2024-06-28 01:08:00,640 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:08:00,670 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:08:00,674 INFO L97 edCorrectnessWitness]: Location invariant before [L99-L99] ((((! multithreaded || 0 <= i2) && (! multithreaded || 0 <= i1)) && (! multithreaded || 0 <= j2)) && (! multithreaded || 0 <= j1)) && (! multithreaded || (((0 <= i1 && 0 <= i2) && 0 <= j1) && 0 <= j2)) [2024-06-28 01:08:00,675 INFO L97 edCorrectnessWitness]: Location invariant before [L96-L96] ((((! multithreaded || 0 <= i2) && (! multithreaded || 0 <= i1)) && (! multithreaded || 0 <= j2)) && (! multithreaded || 0 <= j1)) && (! multithreaded || (((0 <= i1 && 0 <= i2) && 0 <= j1) && 0 <= j2)) [2024-06-28 01:08:00,675 INFO L97 edCorrectnessWitness]: Location invariant before [L97-L97] ((((! multithreaded || 0 <= i2) && (! multithreaded || 0 <= i1)) && (! multithreaded || 0 <= j2)) && (! multithreaded || 0 <= j1)) && (! multithreaded || (((0 <= i1 && 0 <= i2) && 0 <= j1) && 0 <= j2)) [2024-06-28 01:08:00,675 INFO L97 edCorrectnessWitness]: Location invariant before [L98-L98] ((((! multithreaded || 0 <= i2) && (! multithreaded || 0 <= i1)) && (! multithreaded || 0 <= j2)) && (! multithreaded || 0 <= j1)) && (! multithreaded || (((0 <= i1 && 0 <= i2) && 0 <= j1) && 0 <= j2)) [2024-06-28 01:08:00,675 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:08:00,676 INFO L106 edCorrectnessWitness]: ghost_update [L95-L95] multithreaded = 1; [2024-06-28 01:08:00,693 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:08:00,838 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c[2663,2676] [2024-06-28 01:08:00,842 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:08:00,849 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:08:00,903 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c[2663,2676] [2024-06-28 01:08:00,905 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:08:00,919 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:08:00,920 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:08:00 WrapperNode [2024-06-28 01:08:00,920 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:08:00,921 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:08:00,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:08:00,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:08:00,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:08:00" (1/1) ... [2024-06-28 01:08:00,933 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:08:00" (1/1) ... [2024-06-28 01:08:00,954 INFO L138 Inliner]: procedures = 21, calls = 22, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 121 [2024-06-28 01:08:00,955 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:08:00,956 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:08:00,956 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:08:00,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:08:00,978 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:08:00" (1/1) ... [2024-06-28 01:08:00,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:08:00" (1/1) ... [2024-06-28 01:08:00,992 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:08:00" (1/1) ... [2024-06-28 01:08:01,006 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]. [2024-06-28 01:08:01,020 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:08:00" (1/1) ... [2024-06-28 01:08:01,020 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:08:00" (1/1) ... [2024-06-28 01:08:01,042 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:08:00" (1/1) ... [2024-06-28 01:08:01,046 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:08:00" (1/1) ... [2024-06-28 01:08:01,047 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:08:00" (1/1) ... [2024-06-28 01:08:01,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:08:00" (1/1) ... [2024-06-28 01:08:01,050 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:08:01,051 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:08:01,051 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:08:01,051 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:08:01,052 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:08:00" (1/1) ... [2024-06-28 01:08:01,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:08:01,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:08:01,093 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) [2024-06-28 01:08:01,112 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 [2024-06-28 01:08:01,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:08:01,134 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-28 01:08:01,134 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-28 01:08:01,135 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-28 01:08:01,135 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-28 01:08:01,135 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-28 01:08:01,135 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-28 01:08:01,135 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-06-28 01:08:01,136 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-06-28 01:08:01,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 01:08:01,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:08:01,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:08:01,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:08:01,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:08:01,141 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 01:08:01,264 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:08:01,266 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:08:01,534 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:08:01,534 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:08:01,692 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:08:01,692 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-06-28 01:08:01,693 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:08:01 BoogieIcfgContainer [2024-06-28 01:08:01,693 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:08:01,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:08:01,697 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:08:01,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:08:01,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:08:00" (1/4) ... [2024-06-28 01:08:01,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d494b12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:08:01, skipping insertion in model container [2024-06-28 01:08:01,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:08:00" (2/4) ... [2024-06-28 01:08:01,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d494b12 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:08:01, skipping insertion in model container [2024-06-28 01:08:01,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:08:00" (3/4) ... [2024-06-28 01:08:01,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d494b12 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:08:01, skipping insertion in model container [2024-06-28 01:08:01,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:08:01" (4/4) ... [2024-06-28 01:08:01,708 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-proofs-counter-add-4-semi-Q67.wvr.c [2024-06-28 01:08:01,725 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:08:01,725 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-28 01:08:01,726 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:08:01,805 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-06-28 01:08:01,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 45 transitions, 118 flow [2024-06-28 01:08:01,881 INFO L124 PetriNetUnfolderBase]: 4/41 cut-off events. [2024-06-28 01:08:01,882 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-28 01:08:01,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 41 events. 4/41 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-06-28 01:08:01,887 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 45 transitions, 118 flow [2024-06-28 01:08:01,890 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 40 transitions, 104 flow [2024-06-28 01:08:01,899 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:08:01,906 INFO L357 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, mHoare=false, 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;@415a2cf1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:08:01,906 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-28 01:08:01,910 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:08:01,910 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 01:08:01,910 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:08:01,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:08:01,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:08:01,911 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:08:01,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:08:01,916 INFO L85 PathProgramCache]: Analyzing trace with hash 381206755, now seen corresponding path program 1 times [2024-06-28 01:08:01,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:08:01,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962274280] [2024-06-28 01:08:01,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:08:01,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:08:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:08:02,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:08:02,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:08:02,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962274280] [2024-06-28 01:08:02,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962274280] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:08:02,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:08:02,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:08:02,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702200824] [2024-06-28 01:08:02,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:08:02,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:08:02,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:08:02,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:08:02,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:08:02,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-06-28 01:08:02,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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) [2024-06-28 01:08:02,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:08:02,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-06-28 01:08:02,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:08:02,914 INFO L124 PetriNetUnfolderBase]: 2119/2916 cut-off events. [2024-06-28 01:08:02,914 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2024-06-28 01:08:02,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5740 conditions, 2916 events. 2119/2916 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 12642 event pairs, 248 based on Foata normal form. 24/2858 useless extension candidates. Maximal degree in co-relation 5135. Up to 2291 conditions per place. [2024-06-28 01:08:02,946 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 48 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2024-06-28 01:08:02,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 63 transitions, 275 flow [2024-06-28 01:08:02,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:08:02,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:08:02,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2024-06-28 01:08:02,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7481481481481481 [2024-06-28 01:08:02,960 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 104 flow. Second operand 3 states and 101 transitions. [2024-06-28 01:08:02,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 63 transitions, 275 flow [2024-06-28 01:08:02,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 63 transitions, 245 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-28 01:08:02,972 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 120 flow [2024-06-28 01:08:02,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2024-06-28 01:08:02,980 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2024-06-28 01:08:02,980 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 120 flow [2024-06-28 01:08:02,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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) [2024-06-28 01:08:02,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:08:02,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:08:02,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 01:08:02,982 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:08:02,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:08:02,983 INFO L85 PathProgramCache]: Analyzing trace with hash 676089073, now seen corresponding path program 1 times [2024-06-28 01:08:02,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:08:02,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821287378] [2024-06-28 01:08:02,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:08:02,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:08:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:08:03,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:08:03,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:08:03,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821287378] [2024-06-28 01:08:03,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821287378] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:08:03,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:08:03,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:08:03,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564888748] [2024-06-28 01:08:03,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:08:03,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:08:03,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:08:03,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:08:03,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:08:03,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-06-28 01:08:03,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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) [2024-06-28 01:08:03,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:08:03,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-06-28 01:08:03,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:08:03,579 INFO L124 PetriNetUnfolderBase]: 2249/3110 cut-off events. [2024-06-28 01:08:03,580 INFO L125 PetriNetUnfolderBase]: For 591/591 co-relation queries the response was YES. [2024-06-28 01:08:03,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7089 conditions, 3110 events. 2249/3110 cut-off events. For 591/591 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 14090 event pairs, 228 based on Foata normal form. 42/3103 useless extension candidates. Maximal degree in co-relation 1457. Up to 2009 conditions per place. [2024-06-28 01:08:03,606 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 65 selfloop transitions, 6 changer transitions 0/82 dead transitions. [2024-06-28 01:08:03,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 82 transitions, 357 flow [2024-06-28 01:08:03,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:08:03,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:08:03,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2024-06-28 01:08:03,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-06-28 01:08:03,611 INFO L175 Difference]: Start difference. First operand has 44 places, 43 transitions, 120 flow. Second operand 4 states and 135 transitions. [2024-06-28 01:08:03,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 82 transitions, 357 flow [2024-06-28 01:08:03,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 82 transitions, 353 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:08:03,615 INFO L231 Difference]: Finished difference. Result has 46 places, 44 transitions, 145 flow [2024-06-28 01:08:03,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=42, 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=4, PETRI_FLOW=145, PETRI_PLACES=46, PETRI_TRANSITIONS=44} [2024-06-28 01:08:03,617 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-06-28 01:08:03,619 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 44 transitions, 145 flow [2024-06-28 01:08:03,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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) [2024-06-28 01:08:03,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:08:03,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:08:03,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 01:08:03,620 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:08:03,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:08:03,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1320767074, now seen corresponding path program 1 times [2024-06-28 01:08:03,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:08:03,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945242874] [2024-06-28 01:08:03,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:08:03,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:08:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:08:03,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:08:03,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:08:03,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945242874] [2024-06-28 01:08:03,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945242874] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:08:03,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:08:03,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:08:03,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684039368] [2024-06-28 01:08:03,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:08:03,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:08:03,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:08:03,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:08:03,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:08:03,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2024-06-28 01:08:03,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 44 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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) [2024-06-28 01:08:03,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:08:03,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2024-06-28 01:08:03,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:08:03,892 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([383] L52-->L56: Formula: (and (= v_~i2~0_96 (+ v_~i2~0_97 1)) (= (+ v_~counter~0_141 1) v_~counter~0_142) (not (= (ite (< 0 v_~counter~0_142) 1 0) 0))) InVars {~counter~0=v_~counter~0_142, ~i2~0=v_~i2~0_97} OutVars{~counter~0=v_~counter~0_141, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_96} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][41], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 27#L67true, 8#L56true, 4#thread4EXITtrue, 42#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 61#true, 29#L44true, 66#true, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:03,893 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-06-28 01:08:03,893 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-28 01:08:03,893 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-28 01:08:03,893 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-28 01:08:03,907 INFO L124 PetriNetUnfolderBase]: 1899/2764 cut-off events. [2024-06-28 01:08:03,907 INFO L125 PetriNetUnfolderBase]: For 1854/1895 co-relation queries the response was YES. [2024-06-28 01:08:03,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6773 conditions, 2764 events. 1899/2764 cut-off events. For 1854/1895 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 12992 event pairs, 261 based on Foata normal form. 52/2740 useless extension candidates. Maximal degree in co-relation 1897. Up to 2234 conditions per place. [2024-06-28 01:08:03,927 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 45 selfloop transitions, 3 changer transitions 2/64 dead transitions. [2024-06-28 01:08:03,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 64 transitions, 297 flow [2024-06-28 01:08:03,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:08:03,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:08:03,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2024-06-28 01:08:03,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2024-06-28 01:08:03,929 INFO L175 Difference]: Start difference. First operand has 46 places, 44 transitions, 145 flow. Second operand 3 states and 105 transitions. [2024-06-28 01:08:03,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 64 transitions, 297 flow [2024-06-28 01:08:03,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 64 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:08:03,931 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 163 flow [2024-06-28 01:08:03,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=163, PETRI_PLACES=47, PETRI_TRANSITIONS=46} [2024-06-28 01:08:03,932 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2024-06-28 01:08:03,932 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 46 transitions, 163 flow [2024-06-28 01:08:03,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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) [2024-06-28 01:08:03,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:08:03,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:08:03,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 01:08:03,933 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:08:03,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:08:03,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1092652132, now seen corresponding path program 1 times [2024-06-28 01:08:03,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:08:03,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953605352] [2024-06-28 01:08:03,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:08:03,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:08:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:08:04,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:08:04,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:08:04,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953605352] [2024-06-28 01:08:04,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953605352] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:08:04,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:08:04,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:08:04,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882940033] [2024-06-28 01:08:04,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:08:04,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:08:04,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:08:04,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:08:04,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:08:04,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-06-28 01:08:04,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 46 transitions, 163 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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) [2024-06-28 01:08:04,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:08:04,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-06-28 01:08:04,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:08:04,485 INFO L124 PetriNetUnfolderBase]: 2274/3260 cut-off events. [2024-06-28 01:08:04,485 INFO L125 PetriNetUnfolderBase]: For 2060/2060 co-relation queries the response was YES. [2024-06-28 01:08:04,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8314 conditions, 3260 events. 2274/3260 cut-off events. For 2060/2060 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 15592 event pairs, 325 based on Foata normal form. 40/3255 useless extension candidates. Maximal degree in co-relation 2397. Up to 1481 conditions per place. [2024-06-28 01:08:04,510 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 81 selfloop transitions, 8 changer transitions 0/100 dead transitions. [2024-06-28 01:08:04,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 100 transitions, 487 flow [2024-06-28 01:08:04,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:08:04,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:08:04,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2024-06-28 01:08:04,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2024-06-28 01:08:04,513 INFO L175 Difference]: Start difference. First operand has 47 places, 46 transitions, 163 flow. Second operand 5 states and 165 transitions. [2024-06-28 01:08:04,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 100 transitions, 487 flow [2024-06-28 01:08:04,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 100 transitions, 484 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:08:04,517 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 184 flow [2024-06-28 01:08:04,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=184, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2024-06-28 01:08:04,518 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 1 predicate places. [2024-06-28 01:08:04,518 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 184 flow [2024-06-28 01:08:04,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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) [2024-06-28 01:08:04,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:08:04,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:08:04,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 01:08:04,519 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:08:04,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:08:04,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1041824233, now seen corresponding path program 1 times [2024-06-28 01:08:04,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:08:04,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451535596] [2024-06-28 01:08:04,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:08:04,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:08:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:08:04,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:08:04,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:08:04,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451535596] [2024-06-28 01:08:04,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451535596] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:08:04,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:08:04,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:08:04,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697978154] [2024-06-28 01:08:04,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:08:04,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:08:04,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:08:04,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:08:04,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:08:04,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-06-28 01:08:04,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 184 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) [2024-06-28 01:08:04,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:08:04,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-06-28 01:08:04,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:08:05,057 INFO L124 PetriNetUnfolderBase]: 2360/3362 cut-off events. [2024-06-28 01:08:05,059 INFO L125 PetriNetUnfolderBase]: For 3536/3536 co-relation queries the response was YES. [2024-06-28 01:08:05,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9023 conditions, 3362 events. 2360/3362 cut-off events. For 3536/3536 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 15878 event pairs, 389 based on Foata normal form. 24/3350 useless extension candidates. Maximal degree in co-relation 5130. Up to 2353 conditions per place. [2024-06-28 01:08:05,083 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 74 selfloop transitions, 8 changer transitions 2/95 dead transitions. [2024-06-28 01:08:05,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 95 transitions, 487 flow [2024-06-28 01:08:05,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:08:05,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:08:05,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2024-06-28 01:08:05,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7022222222222222 [2024-06-28 01:08:05,090 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 184 flow. Second operand 5 states and 158 transitions. [2024-06-28 01:08:05,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 95 transitions, 487 flow [2024-06-28 01:08:05,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 95 transitions, 473 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-28 01:08:05,099 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 209 flow [2024-06-28 01:08:05,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=209, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2024-06-28 01:08:05,102 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2024-06-28 01:08:05,102 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 209 flow [2024-06-28 01:08:05,102 INFO L496 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) [2024-06-28 01:08:05,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:08:05,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:08:05,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 01:08:05,103 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:08:05,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:08:05,104 INFO L85 PathProgramCache]: Analyzing trace with hash -122883996, now seen corresponding path program 1 times [2024-06-28 01:08:05,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:08:05,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822328820] [2024-06-28 01:08:05,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:08:05,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:08:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:08:05,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:08:05,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:08:05,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822328820] [2024-06-28 01:08:05,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822328820] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:08:05,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:08:05,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:08:05,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285852170] [2024-06-28 01:08:05,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:08:05,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:08:05,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:08:05,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:08:05,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:08:05,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-06-28 01:08:05,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 209 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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) [2024-06-28 01:08:05,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:08:05,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-06-28 01:08:05,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:08:05,609 INFO L124 PetriNetUnfolderBase]: 2522/3640 cut-off events. [2024-06-28 01:08:05,609 INFO L125 PetriNetUnfolderBase]: For 4726/4726 co-relation queries the response was YES. [2024-06-28 01:08:05,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10176 conditions, 3640 events. 2522/3640 cut-off events. For 4726/4726 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 17866 event pairs, 364 based on Foata normal form. 24/3619 useless extension candidates. Maximal degree in co-relation 5760. Up to 2037 conditions per place. [2024-06-28 01:08:05,633 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 81 selfloop transitions, 8 changer transitions 0/100 dead transitions. [2024-06-28 01:08:05,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 100 transitions, 540 flow [2024-06-28 01:08:05,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:08:05,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:08:05,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2024-06-28 01:08:05,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2024-06-28 01:08:05,635 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 209 flow. Second operand 5 states and 160 transitions. [2024-06-28 01:08:05,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 100 transitions, 540 flow [2024-06-28 01:08:05,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 100 transitions, 524 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-28 01:08:05,647 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 221 flow [2024-06-28 01:08:05,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2024-06-28 01:08:05,648 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2024-06-28 01:08:05,649 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 221 flow [2024-06-28 01:08:05,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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) [2024-06-28 01:08:05,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:08:05,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:08:05,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 01:08:05,650 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:08:05,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:08:05,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1550478385, now seen corresponding path program 1 times [2024-06-28 01:08:05,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:08:05,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696935320] [2024-06-28 01:08:05,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:08:05,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:08:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:08:05,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:08:05,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:08:05,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696935320] [2024-06-28 01:08:05,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696935320] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:08:05,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:08:05,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:08:05,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435045725] [2024-06-28 01:08:05,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:08:05,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:08:05,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:08:05,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:08:05,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:08:05,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-06-28 01:08:05,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 221 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 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) [2024-06-28 01:08:05,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:08:05,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-06-28 01:08:05,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:08:06,224 INFO L124 PetriNetUnfolderBase]: 2508/3613 cut-off events. [2024-06-28 01:08:06,225 INFO L125 PetriNetUnfolderBase]: For 5469/5469 co-relation queries the response was YES. [2024-06-28 01:08:06,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10418 conditions, 3613 events. 2508/3613 cut-off events. For 5469/5469 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 17599 event pairs, 413 based on Foata normal form. 24/3594 useless extension candidates. Maximal degree in co-relation 7351. Up to 2271 conditions per place. [2024-06-28 01:08:06,248 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 90 selfloop transitions, 9 changer transitions 2/112 dead transitions. [2024-06-28 01:08:06,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 112 transitions, 599 flow [2024-06-28 01:08:06,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:08:06,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:08:06,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 189 transitions. [2024-06-28 01:08:06,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-06-28 01:08:06,250 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 221 flow. Second operand 6 states and 189 transitions. [2024-06-28 01:08:06,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 112 transitions, 599 flow [2024-06-28 01:08:06,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 112 transitions, 585 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-28 01:08:06,271 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 231 flow [2024-06-28 01:08:06,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2024-06-28 01:08:06,273 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2024-06-28 01:08:06,273 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 231 flow [2024-06-28 01:08:06,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 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) [2024-06-28 01:08:06,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:08:06,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:08:06,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 01:08:06,274 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:08:06,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:08:06,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1193336532, now seen corresponding path program 1 times [2024-06-28 01:08:06,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:08:06,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448796965] [2024-06-28 01:08:06,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:08:06,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:08:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:08:06,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:08:06,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:08:06,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448796965] [2024-06-28 01:08:06,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448796965] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:08:06,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:08:06,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:08:06,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334979448] [2024-06-28 01:08:06,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:08:06,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:08:06,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:08:06,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:08:06,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:08:06,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-06-28 01:08:06,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 231 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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) [2024-06-28 01:08:06,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:08:06,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-06-28 01:08:06,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:08:06,766 INFO L124 PetriNetUnfolderBase]: 2586/3733 cut-off events. [2024-06-28 01:08:06,767 INFO L125 PetriNetUnfolderBase]: For 6534/6534 co-relation queries the response was YES. [2024-06-28 01:08:06,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10966 conditions, 3733 events. 2586/3733 cut-off events. For 6534/6534 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 18356 event pairs, 525 based on Foata normal form. 16/3719 useless extension candidates. Maximal degree in co-relation 8179. Up to 2770 conditions per place. [2024-06-28 01:08:06,791 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 74 selfloop transitions, 8 changer transitions 2/95 dead transitions. [2024-06-28 01:08:06,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 95 transitions, 535 flow [2024-06-28 01:08:06,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:08:06,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:08:06,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2024-06-28 01:08:06,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.68 [2024-06-28 01:08:06,793 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 231 flow. Second operand 5 states and 153 transitions. [2024-06-28 01:08:06,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 95 transitions, 535 flow [2024-06-28 01:08:06,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 95 transitions, 517 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-28 01:08:06,817 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 252 flow [2024-06-28 01:08:06,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=252, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2024-06-28 01:08:06,818 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 8 predicate places. [2024-06-28 01:08:06,819 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 252 flow [2024-06-28 01:08:06,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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) [2024-06-28 01:08:06,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:08:06,819 INFO L208 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] [2024-06-28 01:08:06,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 01:08:06,820 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:08:06,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:08:06,820 INFO L85 PathProgramCache]: Analyzing trace with hash -269748198, now seen corresponding path program 1 times [2024-06-28 01:08:06,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:08:06,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926496287] [2024-06-28 01:08:06,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:08:06,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:08:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:08:06,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:08:06,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:08:06,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926496287] [2024-06-28 01:08:06,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926496287] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:08:06,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:08:06,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:08:06,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617316189] [2024-06-28 01:08:06,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:08:06,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:08:06,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:08:06,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:08:06,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:08:06,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2024-06-28 01:08:06,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 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) [2024-06-28 01:08:06,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:08:06,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2024-06-28 01:08:06,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:08:07,561 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([383] L52-->L56: Formula: (and (= v_~i2~0_96 (+ v_~i2~0_97 1)) (= (+ v_~counter~0_141 1) v_~counter~0_142) (not (= (ite (< 0 v_~counter~0_142) 1 0) 0))) InVars {~counter~0=v_~counter~0_142, ~i2~0=v_~i2~0_97} OutVars{~counter~0=v_~counter~0_141, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_96} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][55], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 42#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 8#L56true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 68#(= ~counter~0 0), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 95#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 27#L67true, 25#L79true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 12#thread1EXITtrue, 103#(= ~counter~0 0), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-28 01:08:07,562 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-28 01:08:07,562 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-28 01:08:07,562 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:07,562 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:07,580 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L41-->L44: Formula: (and (= v_~i1~0_24 (+ v_~i1~0_25 1)) (= (+ v_~counter~0_22 1) v_~counter~0_21)) InVars {~counter~0=v_~counter~0_22, ~i1~0=v_~i1~0_25} OutVars{~counter~0=v_~counter~0_21, ~i1~0=v_~i1~0_24, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][29], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 42#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 8#L56true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 68#(= ~counter~0 0), 29#L44true, Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 95#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 27#L67true, 4#thread4EXITtrue, 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-28 01:08:07,581 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-28 01:08:07,581 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:07,581 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:07,581 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:07,583 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([383] L52-->L56: Formula: (and (= v_~i2~0_96 (+ v_~i2~0_97 1)) (= (+ v_~counter~0_141 1) v_~counter~0_142) (not (= (ite (< 0 v_~counter~0_142) 1 0) 0))) InVars {~counter~0=v_~counter~0_142, ~i2~0=v_~i2~0_97} OutVars{~counter~0=v_~counter~0_141, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_96} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][55], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 8#L56true, 42#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 68#(= ~counter~0 0), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 36#thread3EXITtrue, 95#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 25#L79true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 12#thread1EXITtrue, 103#(= ~counter~0 0), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-28 01:08:07,583 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-28 01:08:07,583 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-28 01:08:07,583 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 01:08:07,583 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-28 01:08:07,584 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([383] L52-->L56: Formula: (and (= v_~i2~0_96 (+ v_~i2~0_97 1)) (= (+ v_~counter~0_141 1) v_~counter~0_142) (not (= (ite (< 0 v_~counter~0_142) 1 0) 0))) InVars {~counter~0=v_~counter~0_142, ~i2~0=v_~i2~0_97} OutVars{~counter~0=v_~counter~0_141, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_96} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][55], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 42#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 8#L56true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 68#(= ~counter~0 0), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 95#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 4#thread4EXITtrue, 27#L67true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 12#thread1EXITtrue, 103#(= ~counter~0 0), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-28 01:08:07,585 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-28 01:08:07,585 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-28 01:08:07,585 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 01:08:07,586 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-28 01:08:07,587 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([383] L52-->L56: Formula: (and (= v_~i2~0_96 (+ v_~i2~0_97 1)) (= (+ v_~counter~0_141 1) v_~counter~0_142) (not (= (ite (< 0 v_~counter~0_142) 1 0) 0))) InVars {~counter~0=v_~counter~0_142, ~i2~0=v_~i2~0_97} OutVars{~counter~0=v_~counter~0_141, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_96} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][62], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 42#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 8#L56true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 68#(= ~counter~0 0), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 95#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 4#thread4EXITtrue, 27#L67true, 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 12#thread1EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-28 01:08:07,587 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-28 01:08:07,587 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-28 01:08:07,587 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:07,588 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:07,596 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L41-->L44: Formula: (and (= v_~i1~0_24 (+ v_~i1~0_25 1)) (= (+ v_~counter~0_22 1) v_~counter~0_21)) InVars {~counter~0=v_~counter~0_22, ~i1~0=v_~i1~0_25} OutVars{~counter~0=v_~counter~0_21, ~i1~0=v_~i1~0_24, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][42], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 42#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 8#L56true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 68#(= ~counter~0 0), 29#L44true, 104#(<= ~counter~0 1), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 95#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 4#thread4EXITtrue, 27#L67true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-28 01:08:07,596 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-28 01:08:07,596 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:07,596 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:07,596 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:07,597 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L41-->L44: Formula: (and (= v_~i1~0_24 (+ v_~i1~0_25 1)) (= (+ v_~counter~0_22 1) v_~counter~0_21)) InVars {~counter~0=v_~counter~0_22, ~i1~0=v_~i1~0_25} OutVars{~counter~0=v_~counter~0_21, ~i1~0=v_~i1~0_24, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][29], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 42#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 68#(= ~counter~0 0), 29#L44true, Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 36#thread3EXITtrue, 95#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 4#thread4EXITtrue, 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-28 01:08:07,597 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-28 01:08:07,597 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:07,597 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:07,597 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:07,598 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L41-->L44: Formula: (and (= v_~i1~0_24 (+ v_~i1~0_25 1)) (= (+ v_~counter~0_22 1) v_~counter~0_21)) InVars {~counter~0=v_~counter~0_22, ~i1~0=v_~i1~0_25} OutVars{~counter~0=v_~counter~0_21, ~i1~0=v_~i1~0_24, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][29], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 42#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 8#L56true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 68#(= ~counter~0 0), 29#L44true, Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 36#thread3EXITtrue, 95#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 4#thread4EXITtrue, 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-28 01:08:07,598 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-28 01:08:07,598 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:07,598 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-28 01:08:07,598 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:07,600 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([383] L52-->L56: Formula: (and (= v_~i2~0_96 (+ v_~i2~0_97 1)) (= (+ v_~counter~0_141 1) v_~counter~0_142) (not (= (ite (< 0 v_~counter~0_142) 1 0) 0))) InVars {~counter~0=v_~counter~0_142, ~i2~0=v_~i2~0_97} OutVars{~counter~0=v_~counter~0_141, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_96} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][62], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 42#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 8#L56true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 68#(= ~counter~0 0), 36#thread3EXITtrue, Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 95#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 4#thread4EXITtrue, 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 12#thread1EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-28 01:08:07,600 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-28 01:08:07,600 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:07,600 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:07,601 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-28 01:08:07,602 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([383] L52-->L56: Formula: (and (= v_~i2~0_96 (+ v_~i2~0_97 1)) (= (+ v_~counter~0_141 1) v_~counter~0_142) (not (= (ite (< 0 v_~counter~0_142) 1 0) 0))) InVars {~counter~0=v_~counter~0_142, ~i2~0=v_~i2~0_97} OutVars{~counter~0=v_~counter~0_141, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_96} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][55], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 42#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 8#L56true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 68#(= ~counter~0 0), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 36#thread3EXITtrue, 95#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 4#thread4EXITtrue, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 12#thread1EXITtrue, 103#(= ~counter~0 0), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-28 01:08:07,602 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-28 01:08:07,602 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-28 01:08:07,603 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:07,603 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-28 01:08:07,608 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L41-->L44: Formula: (and (= v_~i1~0_24 (+ v_~i1~0_25 1)) (= (+ v_~counter~0_22 1) v_~counter~0_21)) InVars {~counter~0=v_~counter~0_22, ~i1~0=v_~i1~0_25} OutVars{~counter~0=v_~counter~0_21, ~i1~0=v_~i1~0_24, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][42], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 42#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 68#(= ~counter~0 0), 29#L44true, 104#(<= ~counter~0 1), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 95#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 4#thread4EXITtrue, 27#L67true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-28 01:08:07,609 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-06-28 01:08:07,609 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:07,609 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:07,609 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:07,609 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L41-->L44: Formula: (and (= v_~i1~0_24 (+ v_~i1~0_25 1)) (= (+ v_~counter~0_22 1) v_~counter~0_21)) InVars {~counter~0=v_~counter~0_22, ~i1~0=v_~i1~0_25} OutVars{~counter~0=v_~counter~0_21, ~i1~0=v_~i1~0_24, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][42], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 42#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 8#L56true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 68#(= ~counter~0 0), 29#L44true, 104#(<= ~counter~0 1), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 36#thread3EXITtrue, 95#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 4#thread4EXITtrue, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-28 01:08:07,610 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-06-28 01:08:07,610 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:07,610 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:07,610 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:07,613 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L41-->L44: Formula: (and (= v_~i1~0_24 (+ v_~i1~0_25 1)) (= (+ v_~counter~0_22 1) v_~counter~0_21)) InVars {~counter~0=v_~counter~0_22, ~i1~0=v_~i1~0_25} OutVars{~counter~0=v_~counter~0_21, ~i1~0=v_~i1~0_24, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][42], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 42#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 68#(= ~counter~0 0), 29#L44true, 104#(<= ~counter~0 1), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 36#thread3EXITtrue, 95#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 4#thread4EXITtrue, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-28 01:08:07,614 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-06-28 01:08:07,614 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:07,614 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:07,614 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:07,616 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L41-->L44: Formula: (and (= v_~i1~0_24 (+ v_~i1~0_25 1)) (= (+ v_~counter~0_22 1) v_~counter~0_21)) InVars {~counter~0=v_~counter~0_22, ~i1~0=v_~i1~0_25} OutVars{~counter~0=v_~counter~0_21, ~i1~0=v_~i1~0_24, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][18], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 42#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 8#L56true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 68#(= ~counter~0 0), 29#L44true, Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 95#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 4#thread4EXITtrue, 27#L67true, 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-28 01:08:07,616 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-06-28 01:08:07,616 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:07,616 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:07,617 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:07,619 INFO L124 PetriNetUnfolderBase]: 5958/8837 cut-off events. [2024-06-28 01:08:07,619 INFO L125 PetriNetUnfolderBase]: For 20023/20249 co-relation queries the response was YES. [2024-06-28 01:08:07,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25869 conditions, 8837 events. 5958/8837 cut-off events. For 20023/20249 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 53047 event pairs, 1085 based on Foata normal form. 390/9095 useless extension candidates. Maximal degree in co-relation 18926. Up to 3666 conditions per place. [2024-06-28 01:08:07,667 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 71 selfloop transitions, 23 changer transitions 2/108 dead transitions. [2024-06-28 01:08:07,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 108 transitions, 704 flow [2024-06-28 01:08:07,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:08:07,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:08:07,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2024-06-28 01:08:07,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667 [2024-06-28 01:08:07,669 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 252 flow. Second operand 4 states and 147 transitions. [2024-06-28 01:08:07,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 108 transitions, 704 flow [2024-06-28 01:08:07,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 108 transitions, 679 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-28 01:08:07,709 INFO L231 Difference]: Finished difference. Result has 59 places, 71 transitions, 531 flow [2024-06-28 01:08:07,709 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=531, PETRI_PLACES=59, PETRI_TRANSITIONS=71} [2024-06-28 01:08:07,710 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2024-06-28 01:08:07,710 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 71 transitions, 531 flow [2024-06-28 01:08:07,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 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) [2024-06-28 01:08:07,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:08:07,711 INFO L208 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] [2024-06-28 01:08:07,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 01:08:07,711 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:08:07,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:08:07,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1101355712, now seen corresponding path program 1 times [2024-06-28 01:08:07,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:08:07,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042701212] [2024-06-28 01:08:07,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:08:07,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:08:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:08:07,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:08:07,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:08:07,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042701212] [2024-06-28 01:08:07,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042701212] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:08:07,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:08:07,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:08:07,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156104625] [2024-06-28 01:08:07,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:08:07,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:08:07,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:08:07,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:08:07,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:08:07,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-06-28 01:08:07,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 71 transitions, 531 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 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) [2024-06-28 01:08:07,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:08:07,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-06-28 01:08:07,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:08:08,779 INFO L124 PetriNetUnfolderBase]: 6226/9119 cut-off events. [2024-06-28 01:08:08,779 INFO L125 PetriNetUnfolderBase]: For 29847/29847 co-relation queries the response was YES. [2024-06-28 01:08:08,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31858 conditions, 9119 events. 6226/9119 cut-off events. For 29847/29847 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 53582 event pairs, 1244 based on Foata normal form. 48/9142 useless extension candidates. Maximal degree in co-relation 22735. Up to 6609 conditions per place. [2024-06-28 01:08:08,835 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 110 selfloop transitions, 16 changer transitions 2/139 dead transitions. [2024-06-28 01:08:08,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 139 transitions, 1101 flow [2024-06-28 01:08:08,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:08:08,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:08:08,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 182 transitions. [2024-06-28 01:08:08,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.674074074074074 [2024-06-28 01:08:08,837 INFO L175 Difference]: Start difference. First operand has 59 places, 71 transitions, 531 flow. Second operand 6 states and 182 transitions. [2024-06-28 01:08:08,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 139 transitions, 1101 flow [2024-06-28 01:08:08,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 139 transitions, 1101 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-28 01:08:08,882 INFO L231 Difference]: Finished difference. Result has 65 places, 73 transitions, 602 flow [2024-06-28 01:08:08,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=602, PETRI_PLACES=65, PETRI_TRANSITIONS=73} [2024-06-28 01:08:08,883 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 16 predicate places. [2024-06-28 01:08:08,883 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 73 transitions, 602 flow [2024-06-28 01:08:08,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 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) [2024-06-28 01:08:08,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:08:08,884 INFO L208 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] [2024-06-28 01:08:08,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 01:08:08,884 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:08:08,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:08:08,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1649471048, now seen corresponding path program 2 times [2024-06-28 01:08:08,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:08:08,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375121956] [2024-06-28 01:08:08,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:08:08,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:08:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:08:09,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:08:09,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:08:09,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375121956] [2024-06-28 01:08:09,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375121956] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:08:09,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742458795] [2024-06-28 01:08:09,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-28 01:08:09,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:08:09,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:08:09,139 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) [2024-06-28 01:08:09,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-06-28 01:08:09,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-28 01:08:09,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:08:09,235 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-28 01:08:09,244 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:08:09,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:08:09,546 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-28 01:08:09,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742458795] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:08:09,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-28 01:08:09,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-06-28 01:08:09,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992962141] [2024-06-28 01:08:09,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:08:09,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:08:09,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:08:09,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:08:09,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:08:09,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-06-28 01:08:09,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 73 transitions, 602 flow. Second operand has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 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) [2024-06-28 01:08:09,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:08:09,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-06-28 01:08:09,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:08:11,330 INFO L124 PetriNetUnfolderBase]: 11344/16924 cut-off events. [2024-06-28 01:08:11,331 INFO L125 PetriNetUnfolderBase]: For 69672/69672 co-relation queries the response was YES. [2024-06-28 01:08:11,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58999 conditions, 16924 events. 11344/16924 cut-off events. For 69672/69672 co-relation queries the response was YES. Maximal size of possible extension queue 872. Compared 111121 event pairs, 2443 based on Foata normal form. 312/17159 useless extension candidates. Maximal degree in co-relation 41768. Up to 4385 conditions per place. [2024-06-28 01:08:11,477 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 150 selfloop transitions, 29 changer transitions 0/190 dead transitions. [2024-06-28 01:08:11,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 190 transitions, 1764 flow [2024-06-28 01:08:11,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:08:11,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:08:11,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 215 transitions. [2024-06-28 01:08:11,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6825396825396826 [2024-06-28 01:08:11,480 INFO L175 Difference]: Start difference. First operand has 65 places, 73 transitions, 602 flow. Second operand 7 states and 215 transitions. [2024-06-28 01:08:11,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 190 transitions, 1764 flow [2024-06-28 01:08:11,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 190 transitions, 1727 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-28 01:08:11,595 INFO L231 Difference]: Finished difference. Result has 70 places, 91 transitions, 944 flow [2024-06-28 01:08:11,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=944, PETRI_PLACES=70, PETRI_TRANSITIONS=91} [2024-06-28 01:08:11,595 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 21 predicate places. [2024-06-28 01:08:11,596 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 91 transitions, 944 flow [2024-06-28 01:08:11,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 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) [2024-06-28 01:08:11,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:08:11,596 INFO L208 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] [2024-06-28 01:08:11,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-06-28 01:08:11,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-06-28 01:08:11,820 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:08:11,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:08:11,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1290852357, now seen corresponding path program 1 times [2024-06-28 01:08:11,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:08:11,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945943690] [2024-06-28 01:08:11,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:08:11,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:08:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:08:11,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:08:11,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:08:11,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945943690] [2024-06-28 01:08:11,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945943690] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:08:11,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:08:11,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:08:11,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700576159] [2024-06-28 01:08:11,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:08:11,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:08:11,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:08:11,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:08:11,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:08:11,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-06-28 01:08:11,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 91 transitions, 944 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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) [2024-06-28 01:08:11,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:08:11,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-06-28 01:08:11,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:08:14,474 INFO L124 PetriNetUnfolderBase]: 23908/33315 cut-off events. [2024-06-28 01:08:14,474 INFO L125 PetriNetUnfolderBase]: For 147568/148912 co-relation queries the response was YES. [2024-06-28 01:08:14,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118480 conditions, 33315 events. 23908/33315 cut-off events. For 147568/148912 co-relation queries the response was YES. Maximal size of possible extension queue 1639. Compared 214319 event pairs, 6710 based on Foata normal form. 138/28831 useless extension candidates. Maximal degree in co-relation 82749. Up to 29156 conditions per place. [2024-06-28 01:08:14,710 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 118 selfloop transitions, 23 changer transitions 0/150 dead transitions. [2024-06-28 01:08:14,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 150 transitions, 1598 flow [2024-06-28 01:08:14,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:08:14,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:08:14,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2024-06-28 01:08:14,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2024-06-28 01:08:14,712 INFO L175 Difference]: Start difference. First operand has 70 places, 91 transitions, 944 flow. Second operand 4 states and 140 transitions. [2024-06-28 01:08:14,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 150 transitions, 1598 flow [2024-06-28 01:08:14,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 150 transitions, 1597 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:08:14,978 INFO L231 Difference]: Finished difference. Result has 74 places, 103 transitions, 1165 flow [2024-06-28 01:08:14,978 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=943, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1165, PETRI_PLACES=74, PETRI_TRANSITIONS=103} [2024-06-28 01:08:14,978 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 25 predicate places. [2024-06-28 01:08:14,979 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 103 transitions, 1165 flow [2024-06-28 01:08:14,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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) [2024-06-28 01:08:14,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:08:14,979 INFO L208 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] [2024-06-28 01:08:14,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 01:08:14,980 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:08:14,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:08:14,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1213704645, now seen corresponding path program 2 times [2024-06-28 01:08:14,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:08:14,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350437767] [2024-06-28 01:08:14,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:08:14,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:08:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:08:15,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:08:15,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:08:15,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350437767] [2024-06-28 01:08:15,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350437767] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:08:15,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:08:15,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:08:15,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614545351] [2024-06-28 01:08:15,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:08:15,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:08:15,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:08:15,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:08:15,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:08:15,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-06-28 01:08:15,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 103 transitions, 1165 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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) [2024-06-28 01:08:15,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:08:15,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-06-28 01:08:15,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:08:17,697 INFO L124 PetriNetUnfolderBase]: 22182/31221 cut-off events. [2024-06-28 01:08:17,697 INFO L125 PetriNetUnfolderBase]: For 162290/162482 co-relation queries the response was YES. [2024-06-28 01:08:17,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121458 conditions, 31221 events. 22182/31221 cut-off events. For 162290/162482 co-relation queries the response was YES. Maximal size of possible extension queue 1475. Compared 202797 event pairs, 7233 based on Foata normal form. 24/28419 useless extension candidates. Maximal degree in co-relation 84609. Up to 29179 conditions per place. [2024-06-28 01:08:17,902 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 127 selfloop transitions, 6 changer transitions 2/144 dead transitions. [2024-06-28 01:08:17,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 144 transitions, 1557 flow [2024-06-28 01:08:17,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:08:17,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:08:17,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2024-06-28 01:08:17,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-06-28 01:08:17,903 INFO L175 Difference]: Start difference. First operand has 74 places, 103 transitions, 1165 flow. Second operand 4 states and 135 transitions. [2024-06-28 01:08:17,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 144 transitions, 1557 flow [2024-06-28 01:08:18,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 144 transitions, 1536 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:08:18,299 INFO L231 Difference]: Finished difference. Result has 78 places, 105 transitions, 1176 flow [2024-06-28 01:08:18,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1176, PETRI_PLACES=78, PETRI_TRANSITIONS=105} [2024-06-28 01:08:18,300 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 29 predicate places. [2024-06-28 01:08:18,300 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 105 transitions, 1176 flow [2024-06-28 01:08:18,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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) [2024-06-28 01:08:18,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:08:18,300 INFO L208 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] [2024-06-28 01:08:18,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 01:08:18,301 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:08:18,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:08:18,301 INFO L85 PathProgramCache]: Analyzing trace with hash -971161541, now seen corresponding path program 1 times [2024-06-28 01:08:18,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:08:18,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830532017] [2024-06-28 01:08:18,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:08:18,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:08:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:08:18,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:08:18,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:08:18,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830532017] [2024-06-28 01:08:18,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830532017] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:08:18,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:08:18,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:08:18,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250457827] [2024-06-28 01:08:18,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:08:18,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:08:18,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:08:18,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:08:18,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:08:18,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-06-28 01:08:18,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 105 transitions, 1176 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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) [2024-06-28 01:08:18,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:08:18,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-06-28 01:08:18,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:08:20,976 INFO L124 PetriNetUnfolderBase]: 21978/30607 cut-off events. [2024-06-28 01:08:20,976 INFO L125 PetriNetUnfolderBase]: For 180378/180876 co-relation queries the response was YES. [2024-06-28 01:08:21,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127813 conditions, 30607 events. 21978/30607 cut-off events. For 180378/180876 co-relation queries the response was YES. Maximal size of possible extension queue 1428. Compared 192178 event pairs, 4817 based on Foata normal form. 261/30831 useless extension candidates. Maximal degree in co-relation 89414. Up to 16755 conditions per place. [2024-06-28 01:08:21,204 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 174 selfloop transitions, 41 changer transitions 6/230 dead transitions. [2024-06-28 01:08:21,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 230 transitions, 2937 flow [2024-06-28 01:08:21,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:08:21,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:08:21,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2024-06-28 01:08:21,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7555555555555555 [2024-06-28 01:08:21,208 INFO L175 Difference]: Start difference. First operand has 78 places, 105 transitions, 1176 flow. Second operand 5 states and 170 transitions. [2024-06-28 01:08:21,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 230 transitions, 2937 flow [2024-06-28 01:08:21,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 230 transitions, 2923 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:08:21,690 INFO L231 Difference]: Finished difference. Result has 82 places, 127 transitions, 1627 flow [2024-06-28 01:08:21,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1168, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1627, PETRI_PLACES=82, PETRI_TRANSITIONS=127} [2024-06-28 01:08:21,691 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 33 predicate places. [2024-06-28 01:08:21,691 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 127 transitions, 1627 flow [2024-06-28 01:08:21,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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) [2024-06-28 01:08:21,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:08:21,692 INFO L208 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] [2024-06-28 01:08:21,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 01:08:21,692 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:08:21,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:08:21,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1253767607, now seen corresponding path program 2 times [2024-06-28 01:08:21,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:08:21,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639437824] [2024-06-28 01:08:21,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:08:21,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:08:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:08:21,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:08:21,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:08:21,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639437824] [2024-06-28 01:08:21,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639437824] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:08:21,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:08:21,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:08:21,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600574438] [2024-06-28 01:08:21,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:08:21,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:08:21,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:08:21,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:08:21,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:08:21,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-06-28 01:08:21,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 127 transitions, 1627 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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) [2024-06-28 01:08:21,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:08:21,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-06-28 01:08:21,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:08:25,072 INFO L124 PetriNetUnfolderBase]: 26786/37673 cut-off events. [2024-06-28 01:08:25,072 INFO L125 PetriNetUnfolderBase]: For 237908/237927 co-relation queries the response was YES. [2024-06-28 01:08:25,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169360 conditions, 37673 events. 26786/37673 cut-off events. For 237908/237927 co-relation queries the response was YES. Maximal size of possible extension queue 1806. Compared 245900 event pairs, 5687 based on Foata normal form. 0/35255 useless extension candidates. Maximal degree in co-relation 123828. Up to 18614 conditions per place. [2024-06-28 01:08:25,388 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 162 selfloop transitions, 18 changer transitions 4/194 dead transitions. [2024-06-28 01:08:25,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 194 transitions, 2641 flow [2024-06-28 01:08:25,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:08:25,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:08:25,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2024-06-28 01:08:25,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2024-06-28 01:08:25,390 INFO L175 Difference]: Start difference. First operand has 82 places, 127 transitions, 1627 flow. Second operand 4 states and 128 transitions. [2024-06-28 01:08:25,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 194 transitions, 2641 flow [2024-06-28 01:08:25,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 194 transitions, 2594 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-28 01:08:25,798 INFO L231 Difference]: Finished difference. Result has 86 places, 130 transitions, 1669 flow [2024-06-28 01:08:25,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1588, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1669, PETRI_PLACES=86, PETRI_TRANSITIONS=130} [2024-06-28 01:08:25,798 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 37 predicate places. [2024-06-28 01:08:25,799 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 130 transitions, 1669 flow [2024-06-28 01:08:25,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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) [2024-06-28 01:08:25,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:08:25,799 INFO L208 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] [2024-06-28 01:08:25,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 01:08:25,799 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:08:25,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:08:25,800 INFO L85 PathProgramCache]: Analyzing trace with hash 139226839, now seen corresponding path program 3 times [2024-06-28 01:08:25,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:08:25,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323839208] [2024-06-28 01:08:25,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:08:25,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:08:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:08:25,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:08:25,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:08:25,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323839208] [2024-06-28 01:08:25,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323839208] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:08:25,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:08:25,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:08:25,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838287579] [2024-06-28 01:08:25,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:08:25,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:08:25,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:08:25,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:08:25,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:08:25,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-06-28 01:08:25,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 130 transitions, 1669 flow. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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) [2024-06-28 01:08:25,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:08:25,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-06-28 01:08:25,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:08:30,091 INFO L124 PetriNetUnfolderBase]: 30449/42863 cut-off events. [2024-06-28 01:08:30,092 INFO L125 PetriNetUnfolderBase]: For 268604/278721 co-relation queries the response was YES. [2024-06-28 01:08:30,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194569 conditions, 42863 events. 30449/42863 cut-off events. For 268604/278721 co-relation queries the response was YES. Maximal size of possible extension queue 1924. Compared 283774 event pairs, 7589 based on Foata normal form. 1231/42677 useless extension candidates. Maximal degree in co-relation 131744. Up to 30542 conditions per place. [2024-06-28 01:08:30,400 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 149 selfloop transitions, 35 changer transitions 0/197 dead transitions. [2024-06-28 01:08:30,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 197 transitions, 2300 flow [2024-06-28 01:08:30,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:08:30,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:08:30,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 174 transitions. [2024-06-28 01:08:30,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7733333333333333 [2024-06-28 01:08:30,401 INFO L175 Difference]: Start difference. First operand has 86 places, 130 transitions, 1669 flow. Second operand 5 states and 174 transitions. [2024-06-28 01:08:30,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 197 transitions, 2300 flow [2024-06-28 01:08:30,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 197 transitions, 2283 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:08:30,772 INFO L231 Difference]: Finished difference. Result has 92 places, 121 transitions, 1560 flow [2024-06-28 01:08:30,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1414, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1560, PETRI_PLACES=92, PETRI_TRANSITIONS=121} [2024-06-28 01:08:30,773 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 43 predicate places. [2024-06-28 01:08:30,773 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 121 transitions, 1560 flow [2024-06-28 01:08:30,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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) [2024-06-28 01:08:30,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:08:30,773 INFO L208 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] [2024-06-28 01:08:30,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-28 01:08:30,774 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:08:30,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:08:30,774 INFO L85 PathProgramCache]: Analyzing trace with hash -309664739, now seen corresponding path program 3 times [2024-06-28 01:08:30,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:08:30,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722891555] [2024-06-28 01:08:30,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:08:30,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:08:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:08:30,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:08:30,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:08:30,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722891555] [2024-06-28 01:08:30,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722891555] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:08:30,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:08:30,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:08:30,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978811126] [2024-06-28 01:08:30,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:08:30,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:08:30,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:08:30,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:08:30,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:08:30,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-06-28 01:08:30,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 121 transitions, 1560 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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) [2024-06-28 01:08:30,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:08:30,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-06-28 01:08:30,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:08:32,854 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][41], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 8#L56true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 40#L98-5true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:32,855 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-06-28 01:08:32,855 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-28 01:08:32,855 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-28 01:08:32,855 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-28 01:08:33,170 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][41], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 40#L98-5true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:33,170 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-28 01:08:33,170 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 01:08:33,171 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 01:08:33,171 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-28 01:08:33,173 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][41], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), 8#L56true, Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:33,173 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-28 01:08:33,173 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-28 01:08:33,173 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 01:08:33,173 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 01:08:33,175 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 8#L56true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), 40#L98-5true, 25#L79true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:33,175 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-28 01:08:33,175 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 01:08:33,175 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-28 01:08:33,175 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 01:08:33,176 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), 8#L56true, Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), 40#L98-5true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 25#L79true, Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:33,176 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-28 01:08:33,176 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 01:08:33,176 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-28 01:08:33,176 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 01:08:33,195 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 9#L52true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 40#L98-5true, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 25#L79true, Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:33,195 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-06-28 01:08:33,195 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:33,195 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:33,195 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-28 01:08:33,501 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][41], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:33,502 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-28 01:08:33,502 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:33,502 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-28 01:08:33,502 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:33,503 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 40#L98-5true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 25#L79true, Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:33,503 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-28 01:08:33,503 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-28 01:08:33,503 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:33,503 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:33,505 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), 8#L56true, Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 25#L79true, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:33,506 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-28 01:08:33,506 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:33,506 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-28 01:08:33,506 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:33,506 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 8#L56true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 25#L79true, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:33,506 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-28 01:08:33,507 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-28 01:08:33,507 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:33,507 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:33,509 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 8#L56true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), 40#L98-5true, 4#thread4EXITtrue, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:33,509 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-28 01:08:33,509 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:33,509 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:33,509 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-28 01:08:33,510 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), 8#L56true, Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), 40#L98-5true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:33,510 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-28 01:08:33,510 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:33,510 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-28 01:08:33,510 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:33,510 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), 8#L56true, Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 40#L98-5true, 4#thread4EXITtrue, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:33,511 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-28 01:08:33,511 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:33,511 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:33,511 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-28 01:08:33,511 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 8#L56true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), 40#L98-5true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:33,511 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-28 01:08:33,511 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:33,512 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:33,512 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-28 01:08:33,512 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), 40#L98-5true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 25#L79true, Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:33,512 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-28 01:08:33,512 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-28 01:08:33,512 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:33,512 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:33,525 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 9#L52true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 40#L98-5true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 25#L79true, Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:33,525 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-28 01:08:33,525 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:33,525 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:33,525 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-28 01:08:33,525 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:33,530 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), 9#L52true, Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 25#L79true, Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:33,530 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-28 01:08:33,530 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 01:08:33,530 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:33,530 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:33,533 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), 9#L52true, Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), 40#L98-5true, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 4#thread4EXITtrue, Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:33,533 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-28 01:08:33,533 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:33,533 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 01:08:33,533 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:33,534 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), 9#L52true, Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 40#L98-5true, 17#L75true, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:33,534 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-28 01:08:33,534 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:33,534 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:33,534 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 01:08:34,119 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 25#L79true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:34,119 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-28 01:08:34,119 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:34,119 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 01:08:34,119 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:34,120 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 40#L98-5true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 4#thread4EXITtrue, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:34,120 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-28 01:08:34,120 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:34,120 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 01:08:34,121 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:34,121 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 40#L98-5true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:34,121 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-28 01:08:34,121 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:34,122 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:34,122 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 01:08:34,129 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 8#L56true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 4#thread4EXITtrue, Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:34,129 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-28 01:08:34,129 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 01:08:34,129 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:34,129 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:34,130 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 8#L56true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:34,130 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-28 01:08:34,130 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:34,130 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 01:08:34,130 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:34,131 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 8#L56true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 4#thread4EXITtrue, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:34,131 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-28 01:08:34,131 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:34,131 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 01:08:34,132 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:34,132 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), 8#L56true, Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 17#L75true, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:34,132 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-28 01:08:34,133 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:34,133 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 01:08:34,133 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:34,134 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 25#L79true, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:34,134 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-28 01:08:34,134 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 01:08:34,134 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:34,134 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:34,135 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 40#L98-5true, 4#thread4EXITtrue, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:34,135 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-28 01:08:34,135 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:34,136 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:34,136 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 01:08:34,136 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), 40#L98-5true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:34,137 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-28 01:08:34,137 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 01:08:34,137 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:34,137 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:34,151 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][41], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 103#(= ~counter~0 0), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 8#L56true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), 17#L75true, 40#L98-5true, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:34,151 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-28 01:08:34,151 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-28 01:08:34,151 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:34,151 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-28 01:08:34,154 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 9#L52true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 25#L79true, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:34,155 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-28 01:08:34,155 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 01:08:34,155 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:34,155 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:34,155 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:34,156 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 9#L52true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 40#L98-5true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 4#thread4EXITtrue, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:34,156 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-28 01:08:34,156 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:34,156 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:34,156 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 01:08:34,157 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:34,157 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 9#L52true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 17#L75true, 40#L98-5true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:34,157 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-28 01:08:34,158 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:34,158 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:34,158 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 01:08:34,158 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:34,163 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), 9#L52true, Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 4#thread4EXITtrue, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:34,163 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-28 01:08:34,164 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:34,164 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:34,164 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:34,164 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 9#L52true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 17#L75true, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:34,165 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-28 01:08:34,165 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:34,165 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:34,165 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:34,324 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 4#thread4EXITtrue, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:34,324 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-28 01:08:34,324 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:34,324 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:34,324 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:34,325 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:34,325 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-28 01:08:34,325 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:34,325 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:34,325 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:34,332 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 4#thread4EXITtrue, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:34,332 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-28 01:08:34,332 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:34,332 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:34,332 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:34,333 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 17#L75true, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:34,333 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-28 01:08:34,333 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:34,333 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:34,333 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:34,339 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][41], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 103#(= ~counter~0 0), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), 17#L75true, 40#L98-5true, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:34,339 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-28 01:08:34,340 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-28 01:08:34,340 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 01:08:34,340 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 01:08:34,341 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][41], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 103#(= ~counter~0 0), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 8#L56true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), 17#L75true, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:34,341 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-28 01:08:34,341 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 01:08:34,341 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-28 01:08:34,341 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 01:08:34,343 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 9#L52true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 4#thread4EXITtrue, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:34,343 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-28 01:08:34,343 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:34,343 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:34,344 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:34,344 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:34,344 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 9#L52true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:34,344 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-28 01:08:34,344 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:34,344 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:34,344 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:34,344 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:34,454 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][41], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 103#(= ~counter~0 0), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), 17#L75true, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:34,454 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-28 01:08:34,454 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-28 01:08:34,454 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:34,454 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:34,621 INFO L124 PetriNetUnfolderBase]: 27902/38705 cut-off events. [2024-06-28 01:08:34,621 INFO L125 PetriNetUnfolderBase]: For 317288/321929 co-relation queries the response was YES. [2024-06-28 01:08:34,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196811 conditions, 38705 events. 27902/38705 cut-off events. For 317288/321929 co-relation queries the response was YES. Maximal size of possible extension queue 1757. Compared 248808 event pairs, 7107 based on Foata normal form. 351/37761 useless extension candidates. Maximal degree in co-relation 149257. Up to 20065 conditions per place. [2024-06-28 01:08:34,948 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 150 selfloop transitions, 33 changer transitions 5/201 dead transitions. [2024-06-28 01:08:34,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 201 transitions, 2829 flow [2024-06-28 01:08:34,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:08:34,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:08:34,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2024-06-28 01:08:34,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-06-28 01:08:34,950 INFO L175 Difference]: Start difference. First operand has 92 places, 121 transitions, 1560 flow. Second operand 4 states and 126 transitions. [2024-06-28 01:08:34,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 201 transitions, 2829 flow [2024-06-28 01:08:35,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 201 transitions, 2775 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:08:35,385 INFO L231 Difference]: Finished difference. Result has 95 places, 138 transitions, 1858 flow [2024-06-28 01:08:35,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1517, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1858, PETRI_PLACES=95, PETRI_TRANSITIONS=138} [2024-06-28 01:08:35,385 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 46 predicate places. [2024-06-28 01:08:35,386 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 138 transitions, 1858 flow [2024-06-28 01:08:35,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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) [2024-06-28 01:08:35,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:08:35,386 INFO L208 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, 1] [2024-06-28 01:08:35,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-28 01:08:35,386 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:08:35,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:08:35,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1526405031, now seen corresponding path program 1 times [2024-06-28 01:08:35,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:08:35,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521508604] [2024-06-28 01:08:35,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:08:35,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:08:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:08:35,450 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:08:35,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:08:35,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521508604] [2024-06-28 01:08:35,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521508604] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:08:35,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310590683] [2024-06-28 01:08:35,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:08:35,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:08:35,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:08:35,453 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) [2024-06-28 01:08:35,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-06-28 01:08:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:08:35,856 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-28 01:08:35,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:08:35,972 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:08:35,972 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-28 01:08:35,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310590683] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:08:35,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-28 01:08:35,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2024-06-28 01:08:35,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248525279] [2024-06-28 01:08:35,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:08:35,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:08:35,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:08:35,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:08:35,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:08:35,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2024-06-28 01:08:35,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 138 transitions, 1858 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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) [2024-06-28 01:08:35,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:08:35,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2024-06-28 01:08:35,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:08:36,598 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][52], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 103#(= ~counter~0 0), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 92#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 8#L56true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, 14#L99true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 360#(and (<= 1 ~j1~0) (= ~M1~0 ~N1~0) (<= 2 ~N1~0) (<= ~i1~0 0)), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:36,599 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-06-28 01:08:36,599 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-28 01:08:36,599 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-28 01:08:36,599 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-28 01:08:36,746 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][52], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 103#(= ~counter~0 0), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 92#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, 14#L99true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 360#(and (<= 1 ~j1~0) (= ~M1~0 ~N1~0) (<= 2 ~N1~0) (<= ~i1~0 0)), 13#thread2EXITtrue, Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:36,746 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-06-28 01:08:36,746 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-28 01:08:36,746 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-28 01:08:36,746 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-28 01:08:37,773 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][87], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), 104#(<= ~counter~0 1), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 8#L56true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), 253#true, 40#L98-5true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:37,774 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-06-28 01:08:37,774 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:37,774 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:37,774 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:37,973 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][87], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), 104#(<= ~counter~0 1), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), 253#true, 40#L98-5true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:37,973 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-28 01:08:37,974 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:37,974 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:37,974 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:37,976 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][87], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), 104#(<= ~counter~0 1), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 8#L56true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, 14#L99true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), 253#true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0)))]) [2024-06-28 01:08:37,976 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-28 01:08:37,976 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:37,976 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:37,976 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:38,033 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][87], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 68#(= ~counter~0 0), 104#(<= ~counter~0 1), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), 253#true, 17#L75true, 40#L98-5true, 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:38,033 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-28 01:08:38,033 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:38,033 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-28 01:08:38,033 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:38,141 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][87], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 8#L56true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 253#true, 40#L98-5true, 17#L75true, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:38,141 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-28 01:08:38,141 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:38,141 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:38,141 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:38,507 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][87], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 103#(= ~counter~0 0), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), 8#L56true, Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 253#true, 40#L98-5true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:38,507 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-28 01:08:38,507 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:38,508 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-28 01:08:38,508 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:38,519 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][87], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), 104#(<= ~counter~0 1), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, 14#L99true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), 253#true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:38,520 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-28 01:08:38,520 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:38,520 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:38,520 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:38,579 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][87], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 253#true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0)))]) [2024-06-28 01:08:38,579 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-28 01:08:38,579 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:38,579 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:38,579 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:38,588 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][87], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 68#(= ~counter~0 0), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), 104#(<= ~counter~0 1), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), 253#true, 17#L75true, 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0)))]) [2024-06-28 01:08:38,588 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-28 01:08:38,588 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-28 01:08:38,588 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-28 01:08:38,588 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:38,673 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][87], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 253#true, 40#L98-5true, 17#L75true, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:38,673 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-28 01:08:38,673 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-28 01:08:38,673 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:38,673 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:38,675 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][87], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 8#L56true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, 14#L99true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 253#true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0)))]) [2024-06-28 01:08:38,675 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-28 01:08:38,675 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:38,675 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 01:08:38,675 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-28 01:08:38,690 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][87], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 103#(= ~counter~0 0), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 253#true, 40#L98-5true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:38,690 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-28 01:08:38,690 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-28 01:08:38,690 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 01:08:38,690 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-28 01:08:38,691 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][87], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 103#(= ~counter~0 0), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 8#L56true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, 14#L99true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 253#true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:38,691 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-28 01:08:38,691 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 01:08:38,691 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-28 01:08:38,691 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-28 01:08:38,804 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][87], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, 14#L99true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 253#true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0))]) [2024-06-28 01:08:38,804 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-28 01:08:38,804 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-28 01:08:38,804 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:38,804 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 01:08:38,814 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][87], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 103#(= ~counter~0 0), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, 14#L99true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 253#true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-28 01:08:38,814 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-28 01:08:38,814 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-28 01:08:38,814 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-28 01:08:38,814 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-28 01:08:39,024 INFO L124 PetriNetUnfolderBase]: 21156/30254 cut-off events. [2024-06-28 01:08:39,025 INFO L125 PetriNetUnfolderBase]: For 294119/296449 co-relation queries the response was YES. [2024-06-28 01:08:39,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168275 conditions, 30254 events. 21156/30254 cut-off events. For 294119/296449 co-relation queries the response was YES. Maximal size of possible extension queue 1441. Compared 198259 event pairs, 6033 based on Foata normal form. 442/29234 useless extension candidates. Maximal degree in co-relation 113451. Up to 24393 conditions per place. [2024-06-28 01:08:39,331 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 128 selfloop transitions, 32 changer transitions 24/199 dead transitions. [2024-06-28 01:08:39,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 199 transitions, 2675 flow [2024-06-28 01:08:39,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:08:39,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:08:39,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2024-06-28 01:08:39,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7377777777777778 [2024-06-28 01:08:39,333 INFO L175 Difference]: Start difference. First operand has 95 places, 138 transitions, 1858 flow. Second operand 5 states and 166 transitions. [2024-06-28 01:08:39,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 199 transitions, 2675 flow [2024-06-28 01:08:39,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 199 transitions, 2645 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:08:39,609 INFO L231 Difference]: Finished difference. Result has 100 places, 135 transitions, 1945 flow [2024-06-28 01:08:39,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1783, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1945, PETRI_PLACES=100, PETRI_TRANSITIONS=135} [2024-06-28 01:08:39,609 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 51 predicate places. [2024-06-28 01:08:39,609 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 135 transitions, 1945 flow [2024-06-28 01:08:39,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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) [2024-06-28 01:08:39,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:08:39,610 INFO L208 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, 1] [2024-06-28 01:08:39,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-06-28 01:08:39,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-06-28 01:08:39,811 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:08:39,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:08:39,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1188094007, now seen corresponding path program 1 times [2024-06-28 01:08:39,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:08:39,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899497649] [2024-06-28 01:08:39,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:08:39,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:08:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:08:39,896 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:08:39,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:08:39,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899497649] [2024-06-28 01:08:39,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899497649] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:08:39,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680922298] [2024-06-28 01:08:39,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:08:39,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:08:39,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:08:39,899 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) [2024-06-28 01:08:39,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-06-28 01:08:39,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:08:39,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 7 conjunts are in the unsatisfiable core [2024-06-28 01:08:39,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:08:40,122 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:08:40,123 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:08:40,246 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:08:40,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680922298] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:08:40,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 01:08:40,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 12 [2024-06-28 01:08:40,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183937582] [2024-06-28 01:08:40,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 01:08:40,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-28 01:08:40,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:08:40,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-28 01:08:40,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-06-28 01:08:40,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-06-28 01:08:40,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 135 transitions, 1945 flow. Second operand has 13 states, 13 states have (on average 21.23076923076923) internal successors, (276), 13 states have internal predecessors, (276), 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) [2024-06-28 01:08:40,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:08:40,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-06-28 01:08:40,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:08:49,618 INFO L124 PetriNetUnfolderBase]: 57577/78927 cut-off events. [2024-06-28 01:08:49,618 INFO L125 PetriNetUnfolderBase]: For 712978/714214 co-relation queries the response was YES. [2024-06-28 01:08:49,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422013 conditions, 78927 events. 57577/78927 cut-off events. For 712978/714214 co-relation queries the response was YES. Maximal size of possible extension queue 3195. Compared 520695 event pairs, 3826 based on Foata normal form. 5945/83119 useless extension candidates. Maximal degree in co-relation 288673. Up to 17988 conditions per place. [2024-06-28 01:08:50,662 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 754 selfloop transitions, 236 changer transitions 25/1024 dead transitions. [2024-06-28 01:08:50,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 1024 transitions, 13669 flow [2024-06-28 01:08:50,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-06-28 01:08:50,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2024-06-28 01:08:50,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 1136 transitions. [2024-06-28 01:08:50,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6822822822822823 [2024-06-28 01:08:50,670 INFO L175 Difference]: Start difference. First operand has 100 places, 135 transitions, 1945 flow. Second operand 37 states and 1136 transitions. [2024-06-28 01:08:50,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 1024 transitions, 13669 flow [2024-06-28 01:08:52,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 1024 transitions, 13328 flow, removed 89 selfloop flow, removed 6 redundant places. [2024-06-28 01:08:52,253 INFO L231 Difference]: Finished difference. Result has 155 places, 337 transitions, 5288 flow [2024-06-28 01:08:52,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1833, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=5288, PETRI_PLACES=155, PETRI_TRANSITIONS=337} [2024-06-28 01:08:52,254 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 106 predicate places. [2024-06-28 01:08:52,254 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 337 transitions, 5288 flow [2024-06-28 01:08:52,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 21.23076923076923) internal successors, (276), 13 states have internal predecessors, (276), 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) [2024-06-28 01:08:52,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:08:52,254 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:08:52,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-06-28 01:08:52,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:08:52,456 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:08:52,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:08:52,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1698766839, now seen corresponding path program 1 times [2024-06-28 01:08:52,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:08:52,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801993865] [2024-06-28 01:08:52,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:08:52,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:08:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:08:52,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:08:52,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:08:52,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801993865] [2024-06-28 01:08:52,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801993865] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:08:52,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963584508] [2024-06-28 01:08:52,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:08:52,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:08:52,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:08:52,568 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-28 01:08:52,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-06-28 01:08:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:08:52,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-28 01:08:52,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:08:52,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:08:52,714 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:08:52,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:08:52,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963584508] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:08:52,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 01:08:52,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 7 [2024-06-28 01:08:52,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439740367] [2024-06-28 01:08:52,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 01:08:52,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:08:52,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:08:52,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:08:52,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:08:52,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2024-06-28 01:08:52,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 337 transitions, 5288 flow. Second operand has 8 states, 8 states have (on average 24.625) internal successors, (197), 8 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) [2024-06-28 01:08:52,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:08:52,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2024-06-28 01:08:52,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand