./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.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/popl20-proofs-counter-add-4-semi-Q67.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 80b1b132 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.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/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-?-80b1b13-m [2024-01-31 17:17:04,000 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 17:17:04,034 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-31 17:17:04,037 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 17:17:04,037 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 17:17:04,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 17:17:04,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 17:17:04,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 17:17:04,052 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 17:17:04,055 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 17:17:04,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 17:17:04,056 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 17:17:04,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 17:17:04,058 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 17:17:04,058 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 17:17:04,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 17:17:04,058 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 17:17:04,059 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 17:17:04,059 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-31 17:17:04,059 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 17:17:04,059 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 17:17:04,060 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 17:17:04,060 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 17:17:04,060 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 17:17:04,060 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 17:17:04,060 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 17:17:04,061 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 17:17:04,061 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 17:17:04,062 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 17:17:04,062 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 17:17:04,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 17:17:04,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 17:17:04,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:17:04,063 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 17:17:04,063 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 17:17:04,064 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 17:17:04,064 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-31 17:17:04,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-31 17:17:04,064 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 17:17:04,064 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 17:17:04,064 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 17:17:04,065 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 17:17:04,065 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 17:17:04,065 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-01-31 17:17:04,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 17:17:04,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 17:17:04,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 17:17:04,313 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 17:17:04,314 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 17:17:04,314 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-01-31 17:17:05,443 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 17:17:05,616 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 17:17:05,617 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2024-01-31 17:17:05,624 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d58c06c02/072bc27281ac4fc6bd0eb89c2eca8af1/FLAG77c579a69 [2024-01-31 17:17:05,645 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d58c06c02/072bc27281ac4fc6bd0eb89c2eca8af1 [2024-01-31 17:17:05,649 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 17:17:05,650 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 17:17:05,650 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/popl20-proofs-counter-add-4-semi-Q67.wvr.yml/witness.yml [2024-01-31 17:17:05,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 17:17:05,797 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 17:17:05,798 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 17:17:05,798 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 17:17:05,802 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 17:17:05,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:17:05" (1/2) ... [2024-01-31 17:17:05,805 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@130fdce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:17:05, skipping insertion in model container [2024-01-31 17:17:05,805 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:17:05" (1/2) ... [2024-01-31 17:17:05,807 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@8bdbe06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:17:05, skipping insertion in model container [2024-01-31 17:17:05,807 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:17:05" (2/2) ... [2024-01-31 17:17:05,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@130fdce and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:17:05, skipping insertion in model container [2024-01-31 17:17:05,808 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:17:05" (2/2) ... [2024-01-31 17:17:05,808 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 17:17:05,842 INFO L93 nessWitnessExtractor]: Witness did not contain any usable entries. [2024-01-31 17:17:05,886 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 17:17:06,047 WARN L239 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-01-31 17:17:06,051 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:17:06,060 INFO L204 MainTranslator]: Completed pre-run [2024-01-31 17:17:06,075 WARN L239 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-01-31 17:17:06,078 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:17:06,089 INFO L208 MainTranslator]: Completed translation [2024-01-31 17:17:06,090 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:17:06 WrapperNode [2024-01-31 17:17:06,090 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 17:17:06,091 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 17:17:06,091 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 17:17:06,091 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 17:17:06,096 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 31.01 05:17:06" (1/1) ... [2024-01-31 17:17:06,102 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 31.01 05:17:06" (1/1) ... [2024-01-31 17:17:06,118 INFO L138 Inliner]: procedures = 22, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 138 [2024-01-31 17:17:06,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 17:17:06,119 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 17:17:06,119 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 17:17:06,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 17:17:06,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:17:06" (1/1) ... [2024-01-31 17:17:06,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:17:06" (1/1) ... [2024-01-31 17:17:06,131 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:17:06" (1/1) ... [2024-01-31 17:17:06,147 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-01-31 17:17:06,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:17:06" (1/1) ... [2024-01-31 17:17:06,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:17:06" (1/1) ... [2024-01-31 17:17:06,152 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:17:06" (1/1) ... [2024-01-31 17:17:06,154 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:17:06" (1/1) ... [2024-01-31 17:17:06,156 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:17:06" (1/1) ... [2024-01-31 17:17:06,157 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:17:06" (1/1) ... [2024-01-31 17:17:06,159 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 17:17:06,159 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 17:17:06,159 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 17:17:06,160 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 17:17:06,160 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:17:06" (1/1) ... [2024-01-31 17:17:06,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:17:06,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:17:06,202 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-01-31 17:17:06,240 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-01-31 17:17:06,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 17:17:06,273 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-31 17:17:06,273 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-31 17:17:06,273 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-31 17:17:06,273 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-31 17:17:06,273 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-31 17:17:06,273 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-31 17:17:06,273 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-01-31 17:17:06,274 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-01-31 17:17:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-31 17:17:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-31 17:17:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-31 17:17:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-31 17:17:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-31 17:17:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 17:17:06,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-31 17:17:06,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-31 17:17:06,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-31 17:17:06,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-31 17:17:06,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-31 17:17:06,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-31 17:17:06,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-31 17:17:06,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 17:17:06,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 17:17:06,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-31 17:17:06,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-31 17:17:06,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-31 17:17:06,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-31 17:17:06,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-31 17:17:06,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 17:17:06,278 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-31 17:17:06,368 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 17:17:06,370 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 17:17:06,559 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 17:17:06,560 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 17:17:06,792 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 17:17:06,793 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-31 17:17:06,794 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:17:06 BoogieIcfgContainer [2024-01-31 17:17:06,794 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 17:17:06,797 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 17:17:06,797 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 17:17:06,799 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 17:17:06,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 05:17:05" (1/4) ... [2024-01-31 17:17:06,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67246892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:17:06, skipping insertion in model container [2024-01-31 17:17:06,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:17:05" (2/4) ... [2024-01-31 17:17:06,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67246892 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 05:17:06, skipping insertion in model container [2024-01-31 17:17:06,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:17:06" (3/4) ... [2024-01-31 17:17:06,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67246892 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 05:17:06, skipping insertion in model container [2024-01-31 17:17:06,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:17:06" (4/4) ... [2024-01-31 17:17:06,802 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-proofs-counter-add-4-semi-Q67.wvr.c [2024-01-31 17:17:06,815 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 17:17:06,815 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-31 17:17:06,816 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 17:17:06,867 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-01-31 17:17:06,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 106 flow [2024-01-31 17:17:06,947 INFO L124 PetriNetUnfolderBase]: 4/35 cut-off events. [2024-01-31 17:17:06,951 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-01-31 17:17:06,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 35 events. 4/35 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2024-01-31 17:17:06,955 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 106 flow [2024-01-31 17:17:06,958 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 34 transitions, 92 flow [2024-01-31 17:17:06,969 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 17:17:06,975 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;@36d7f839, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 17:17:06,975 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-01-31 17:17:06,992 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 17:17:06,993 INFO L124 PetriNetUnfolderBase]: 4/33 cut-off events. [2024-01-31 17:17:06,993 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-01-31 17:17:06,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:17:06,994 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] [2024-01-31 17:17:06,994 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 17:17:06,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:17:06,998 INFO L85 PathProgramCache]: Analyzing trace with hash 855894444, now seen corresponding path program 1 times [2024-01-31 17:17:07,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:17:07,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573754653] [2024-01-31 17:17:07,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:17:07,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:17:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:17:07,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:17:07,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:17:07,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573754653] [2024-01-31 17:17:07,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573754653] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:17:07,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:17:07,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 17:17:07,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491376994] [2024-01-31 17:17:07,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:17:07,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:17:07,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:17:07,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:17:07,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:17:07,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-01-31 17:17:07,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-01-31 17:17:07,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:17:07,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-01-31 17:17:07,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:17:07,743 INFO L124 PetriNetUnfolderBase]: 1343/1928 cut-off events. [2024-01-31 17:17:07,743 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2024-01-31 17:17:07,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3804 conditions, 1928 events. 1343/1928 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 8367 event pairs, 215 based on Foata normal form. 57/1973 useless extension candidates. Maximal degree in co-relation 2858. Up to 1515 conditions per place. [2024-01-31 17:17:07,758 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 39 selfloop transitions, 3 changer transitions 3/54 dead transitions. [2024-01-31 17:17:07,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 54 transitions, 243 flow [2024-01-31 17:17:07,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:17:07,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:17:07,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-01-31 17:17:07,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7435897435897436 [2024-01-31 17:17:07,769 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 92 flow. Second operand 3 states and 87 transitions. [2024-01-31 17:17:07,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 54 transitions, 243 flow [2024-01-31 17:17:07,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 54 transitions, 213 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-01-31 17:17:07,777 INFO L231 Difference]: Finished difference. Result has 38 places, 36 transitions, 99 flow [2024-01-31 17:17:07,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=38, PETRI_TRANSITIONS=36} [2024-01-31 17:17:07,782 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -5 predicate places. [2024-01-31 17:17:07,782 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 36 transitions, 99 flow [2024-01-31 17:17:07,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-01-31 17:17:07,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:17:07,783 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] [2024-01-31 17:17:07,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-31 17:17:07,784 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 17:17:07,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:17:07,785 INFO L85 PathProgramCache]: Analyzing trace with hash -2127251182, now seen corresponding path program 1 times [2024-01-31 17:17:07,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:17:07,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407188222] [2024-01-31 17:17:07,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:17:07,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:17:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:17:08,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:17:08,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:17:08,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407188222] [2024-01-31 17:17:08,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407188222] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:17:08,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:17:08,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 17:17:08,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672641978] [2024-01-31 17:17:08,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:17:08,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 17:17:08,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:17:08,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 17:17:08,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 17:17:08,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-01-31 17:17:08,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-01-31 17:17:08,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:17:08,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-01-31 17:17:08,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:17:08,235 INFO L124 PetriNetUnfolderBase]: 1995/2834 cut-off events. [2024-01-31 17:17:08,235 INFO L125 PetriNetUnfolderBase]: For 734/736 co-relation queries the response was YES. [2024-01-31 17:17:08,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6542 conditions, 2834 events. 1995/2834 cut-off events. For 734/736 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 13053 event pairs, 187 based on Foata normal form. 0/2673 useless extension candidates. Maximal degree in co-relation 3540. Up to 1025 conditions per place. [2024-01-31 17:17:08,249 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 72 selfloop transitions, 6 changer transitions 0/86 dead transitions. [2024-01-31 17:17:08,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 86 transitions, 396 flow [2024-01-31 17:17:08,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 17:17:08,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 17:17:08,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2024-01-31 17:17:08,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2024-01-31 17:17:08,251 INFO L175 Difference]: Start difference. First operand has 38 places, 36 transitions, 99 flow. Second operand 5 states and 135 transitions. [2024-01-31 17:17:08,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 86 transitions, 396 flow [2024-01-31 17:17:08,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 86 transitions, 391 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 17:17:08,253 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 139 flow [2024-01-31 17:17:08,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2024-01-31 17:17:08,253 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2024-01-31 17:17:08,254 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 139 flow [2024-01-31 17:17:08,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-01-31 17:17:08,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:17:08,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] [2024-01-31 17:17:08,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-31 17:17:08,254 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 17:17:08,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:17:08,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1112123600, now seen corresponding path program 2 times [2024-01-31 17:17:08,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:17:08,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632336542] [2024-01-31 17:17:08,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:17:08,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:17:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:17:08,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:17:08,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:17:08,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632336542] [2024-01-31 17:17:08,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632336542] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:17:08,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:17:08,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 17:17:08,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965514895] [2024-01-31 17:17:08,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:17:08,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 17:17:08,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:17:08,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 17:17:08,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 17:17:08,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-01-31 17:17:08,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-01-31 17:17:08,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:17:08,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-01-31 17:17:08,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:17:08,614 INFO L124 PetriNetUnfolderBase]: 3391/4820 cut-off events. [2024-01-31 17:17:08,614 INFO L125 PetriNetUnfolderBase]: For 3562/3562 co-relation queries the response was YES. [2024-01-31 17:17:08,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13152 conditions, 4820 events. 3391/4820 cut-off events. For 3562/3562 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 24702 event pairs, 699 based on Foata normal form. 0/4620 useless extension candidates. Maximal degree in co-relation 2620. Up to 2469 conditions per place. [2024-01-31 17:17:08,637 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 73 selfloop transitions, 5 changer transitions 3/88 dead transitions. [2024-01-31 17:17:08,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 88 transitions, 461 flow [2024-01-31 17:17:08,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 17:17:08,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 17:17:08,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2024-01-31 17:17:08,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2024-01-31 17:17:08,638 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 139 flow. Second operand 4 states and 112 transitions. [2024-01-31 17:17:08,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 88 transitions, 461 flow [2024-01-31 17:17:08,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 88 transitions, 461 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-31 17:17:08,641 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 174 flow [2024-01-31 17:17:08,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2024-01-31 17:17:08,642 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 5 predicate places. [2024-01-31 17:17:08,642 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 174 flow [2024-01-31 17:17:08,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-01-31 17:17:08,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:17:08,643 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] [2024-01-31 17:17:08,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-31 17:17:08,643 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 17:17:08,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:17:08,643 INFO L85 PathProgramCache]: Analyzing trace with hash 686245268, now seen corresponding path program 1 times [2024-01-31 17:17:08,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:17:08,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537112410] [2024-01-31 17:17:08,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:17:08,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:17:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:17:08,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:17:08,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:17:08,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537112410] [2024-01-31 17:17:08,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537112410] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:17:08,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:17:08,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 17:17:08,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167481418] [2024-01-31 17:17:08,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:17:08,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 17:17:08,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:17:08,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 17:17:08,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 17:17:08,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-01-31 17:17:08,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-01-31 17:17:08,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:17:08,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-01-31 17:17:08,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:17:09,066 INFO L124 PetriNetUnfolderBase]: 3367/4735 cut-off events. [2024-01-31 17:17:09,066 INFO L125 PetriNetUnfolderBase]: For 5016/5161 co-relation queries the response was YES. [2024-01-31 17:17:09,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14365 conditions, 4735 events. 3367/4735 cut-off events. For 5016/5161 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 24026 event pairs, 567 based on Foata normal form. 35/4729 useless extension candidates. Maximal degree in co-relation 3715. Up to 3609 conditions per place. [2024-01-31 17:17:09,087 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 80 selfloop transitions, 10 changer transitions 10/107 dead transitions. [2024-01-31 17:17:09,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 107 transitions, 613 flow [2024-01-31 17:17:09,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 17:17:09,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 17:17:09,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2024-01-31 17:17:09,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7076923076923077 [2024-01-31 17:17:09,089 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 174 flow. Second operand 5 states and 138 transitions. [2024-01-31 17:17:09,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 107 transitions, 613 flow [2024-01-31 17:17:09,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 107 transitions, 609 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 17:17:09,093 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 253 flow [2024-01-31 17:17:09,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=253, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2024-01-31 17:17:09,094 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2024-01-31 17:17:09,094 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 253 flow [2024-01-31 17:17:09,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-01-31 17:17:09,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:17:09,094 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] [2024-01-31 17:17:09,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-31 17:17:09,094 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 17:17:09,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:17:09,095 INFO L85 PathProgramCache]: Analyzing trace with hash 248278060, now seen corresponding path program 2 times [2024-01-31 17:17:09,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:17:09,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334442848] [2024-01-31 17:17:09,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:17:09,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:17:09,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:17:09,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:17:09,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:17:09,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334442848] [2024-01-31 17:17:09,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334442848] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:17:09,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:17:09,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 17:17:09,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859957020] [2024-01-31 17:17:09,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:17:09,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 17:17:09,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:17:09,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 17:17:09,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 17:17:09,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-01-31 17:17:09,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 253 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-01-31 17:17:09,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:17:09,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-01-31 17:17:09,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:17:09,615 INFO L124 PetriNetUnfolderBase]: 5229/7196 cut-off events. [2024-01-31 17:17:09,615 INFO L125 PetriNetUnfolderBase]: For 11458/11585 co-relation queries the response was YES. [2024-01-31 17:17:09,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23582 conditions, 7196 events. 5229/7196 cut-off events. For 11458/11585 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 36893 event pairs, 741 based on Foata normal form. 41/6625 useless extension candidates. Maximal degree in co-relation 18117. Up to 3235 conditions per place. [2024-01-31 17:17:09,649 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 90 selfloop transitions, 5 changer transitions 3/107 dead transitions. [2024-01-31 17:17:09,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 107 transitions, 721 flow [2024-01-31 17:17:09,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 17:17:09,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 17:17:09,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-01-31 17:17:09,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6987179487179487 [2024-01-31 17:17:09,651 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 253 flow. Second operand 4 states and 109 transitions. [2024-01-31 17:17:09,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 107 transitions, 721 flow [2024-01-31 17:17:09,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 107 transitions, 714 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-01-31 17:17:09,659 INFO L231 Difference]: Finished difference. Result has 58 places, 55 transitions, 293 flow [2024-01-31 17:17:09,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=293, PETRI_PLACES=58, PETRI_TRANSITIONS=55} [2024-01-31 17:17:09,660 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 15 predicate places. [2024-01-31 17:17:09,660 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 293 flow [2024-01-31 17:17:09,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-01-31 17:17:09,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:17:09,660 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] [2024-01-31 17:17:09,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-31 17:17:09,661 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 17:17:09,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:17:09,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1306574500, now seen corresponding path program 3 times [2024-01-31 17:17:09,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:17:09,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560882781] [2024-01-31 17:17:09,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:17:09,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:17:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:17:09,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:17:09,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:17:09,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560882781] [2024-01-31 17:17:09,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560882781] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:17:09,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:17:09,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 17:17:09,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238499654] [2024-01-31 17:17:09,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:17:09,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 17:17:09,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:17:09,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 17:17:09,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 17:17:09,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-01-31 17:17:09,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 293 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-01-31 17:17:09,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:17:09,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-01-31 17:17:09,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:17:10,060 INFO L124 PetriNetUnfolderBase]: 2916/4300 cut-off events. [2024-01-31 17:17:10,061 INFO L125 PetriNetUnfolderBase]: For 8920/9109 co-relation queries the response was YES. [2024-01-31 17:17:10,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15449 conditions, 4300 events. 2916/4300 cut-off events. For 8920/9109 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 23042 event pairs, 646 based on Foata normal form. 35/4150 useless extension candidates. Maximal degree in co-relation 11863. Up to 1573 conditions per place. [2024-01-31 17:17:10,086 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 69 selfloop transitions, 13 changer transitions 8/102 dead transitions. [2024-01-31 17:17:10,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 102 transitions, 681 flow [2024-01-31 17:17:10,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 17:17:10,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 17:17:10,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2024-01-31 17:17:10,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6615384615384615 [2024-01-31 17:17:10,088 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 293 flow. Second operand 5 states and 129 transitions. [2024-01-31 17:17:10,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 102 transitions, 681 flow [2024-01-31 17:17:10,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 102 transitions, 664 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-01-31 17:17:10,098 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 310 flow [2024-01-31 17:17:10,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=310, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2024-01-31 17:17:10,099 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2024-01-31 17:17:10,099 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 310 flow [2024-01-31 17:17:10,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-01-31 17:17:10,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:17:10,100 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] [2024-01-31 17:17:10,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-31 17:17:10,100 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 17:17:10,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:17:10,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1269234062, now seen corresponding path program 3 times [2024-01-31 17:17:10,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:17:10,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846761164] [2024-01-31 17:17:10,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:17:10,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:17:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:17:10,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:17:10,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:17:10,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846761164] [2024-01-31 17:17:10,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846761164] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:17:10,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:17:10,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 17:17:10,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538301851] [2024-01-31 17:17:10,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:17:10,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 17:17:10,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:17:10,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 17:17:10,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 17:17:10,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-01-31 17:17:10,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 310 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-01-31 17:17:10,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:17:10,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-01-31 17:17:10,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:17:10,385 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][30], [20#L99-1true, 33#$Ultimate##0true, Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), 88#true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 76#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), Black: 53#(= ~counter~0 0), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 35#L75true, 13#L41true, 19#L64true, Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 93#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (<= ~N1~0 ~i1~0))]) [2024-01-31 17:17:10,385 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-01-31 17:17:10,385 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-01-31 17:17:10,385 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-01-31 17:17:10,385 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-01-31 17:17:10,481 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][30], [20#L99-1true, Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), 88#true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 76#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 53#(= ~counter~0 0), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 35#L75true, 7#L56true, 13#L41true, 19#L64true, Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), Black: 93#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (<= ~N1~0 ~i1~0)), 55#true]) [2024-01-31 17:17:10,481 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-01-31 17:17:10,481 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-01-31 17:17:10,482 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-01-31 17:17:10,482 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-01-31 17:17:10,512 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][30], [20#L99-1true, Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), 88#true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 76#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 53#(= ~counter~0 0), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 35#L75true, 13#L41true, 11#thread2EXITtrue, 19#L64true, Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 93#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0)) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:10,512 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-01-31 17:17:10,512 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-01-31 17:17:10,512 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-01-31 17:17:10,513 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-01-31 17:17:10,579 INFO L124 PetriNetUnfolderBase]: 3250/4652 cut-off events. [2024-01-31 17:17:10,579 INFO L125 PetriNetUnfolderBase]: For 10869/11077 co-relation queries the response was YES. [2024-01-31 17:17:10,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16740 conditions, 4652 events. 3250/4652 cut-off events. For 10869/11077 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 23999 event pairs, 541 based on Foata normal form. 61/4447 useless extension candidates. Maximal degree in co-relation 10381. Up to 1672 conditions per place. [2024-01-31 17:17:10,613 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 97 selfloop transitions, 5 changer transitions 10/122 dead transitions. [2024-01-31 17:17:10,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 122 transitions, 911 flow [2024-01-31 17:17:10,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 17:17:10,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 17:17:10,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2024-01-31 17:17:10,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6615384615384615 [2024-01-31 17:17:10,615 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 310 flow. Second operand 5 states and 129 transitions. [2024-01-31 17:17:10,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 122 transitions, 911 flow [2024-01-31 17:17:10,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 122 transitions, 893 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-01-31 17:17:10,622 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 334 flow [2024-01-31 17:17:10,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=334, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2024-01-31 17:17:10,624 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2024-01-31 17:17:10,624 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 334 flow [2024-01-31 17:17:10,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-01-31 17:17:10,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:17:10,624 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-01-31 17:17:10,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-31 17:17:10,625 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 17:17:10,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:17:10,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1499022882, now seen corresponding path program 1 times [2024-01-31 17:17:10,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:17:10,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774675345] [2024-01-31 17:17:10,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:17:10,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:17:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:17:10,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-31 17:17:10,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:17:10,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774675345] [2024-01-31 17:17:10,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774675345] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:17:10,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:17:10,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 17:17:10,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467830792] [2024-01-31 17:17:10,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:17:10,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 17:17:10,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:17:10,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 17:17:10,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 17:17:10,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-01-31 17:17:10,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 334 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:17:10,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:17:10,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-01-31 17:17:10,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:17:11,050 INFO L124 PetriNetUnfolderBase]: 3379/4696 cut-off events. [2024-01-31 17:17:11,051 INFO L125 PetriNetUnfolderBase]: For 12232/12425 co-relation queries the response was YES. [2024-01-31 17:17:11,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18402 conditions, 4696 events. 3379/4696 cut-off events. For 12232/12425 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 22677 event pairs, 979 based on Foata normal form. 70/4678 useless extension candidates. Maximal degree in co-relation 11919. Up to 4279 conditions per place. [2024-01-31 17:17:11,079 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 59 selfloop transitions, 6 changer transitions 12/85 dead transitions. [2024-01-31 17:17:11,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 85 transitions, 585 flow [2024-01-31 17:17:11,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 17:17:11,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 17:17:11,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-01-31 17:17:11,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-01-31 17:17:11,080 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 334 flow. Second operand 4 states and 104 transitions. [2024-01-31 17:17:11,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 85 transitions, 585 flow [2024-01-31 17:17:11,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 85 transitions, 576 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-01-31 17:17:11,086 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 309 flow [2024-01-31 17:17:11,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=309, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2024-01-31 17:17:11,087 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2024-01-31 17:17:11,087 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 309 flow [2024-01-31 17:17:11,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:17:11,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:17:11,088 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-01-31 17:17:11,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-31 17:17:11,088 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 17:17:11,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:17:11,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1834305992, now seen corresponding path program 2 times [2024-01-31 17:17:11,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:17:11,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33986526] [2024-01-31 17:17:11,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:17:11,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:17:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:17:11,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-31 17:17:11,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:17:11,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33986526] [2024-01-31 17:17:11,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33986526] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:17:11,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:17:11,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 17:17:11,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545601071] [2024-01-31 17:17:11,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:17:11,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 17:17:11,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:17:11,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 17:17:11,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 17:17:11,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-01-31 17:17:11,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 309 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-01-31 17:17:11,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:17:11,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-01-31 17:17:11,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:17:11,283 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][33], [33#$Ultimate##0true, 20#L99-1true, Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), 88#true, 109#true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 76#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 53#(= ~counter~0 0), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 35#L75true, 103#true, 13#L41true, 19#L64true, Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0))]) [2024-01-31 17:17:11,283 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-01-31 17:17:11,283 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-01-31 17:17:11,283 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-01-31 17:17:11,283 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-01-31 17:17:11,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][33], [20#L99-1true, Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), 88#true, 109#true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 76#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 53#(= ~counter~0 0), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 35#L75true, 7#L56true, 103#true, 13#L41true, 19#L64true, Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:11,361 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is not cut-off event [2024-01-31 17:17:11,361 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2024-01-31 17:17:11,361 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-01-31 17:17:11,361 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-01-31 17:17:11,363 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][33], [Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), 16#L98-4true, 88#true, 109#true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 76#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 53#(= ~counter~0 0), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 35#L75true, 7#L56true, 13#L41true, 103#true, 19#L64true, Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:11,363 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-01-31 17:17:11,363 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-01-31 17:17:11,363 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-01-31 17:17:11,363 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-01-31 17:17:11,378 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][33], [Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), 88#true, 16#L98-4true, 109#true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 76#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 53#(= ~counter~0 0), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 35#L75true, 11#thread2EXITtrue, 103#true, 13#L41true, 19#L64true, Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:11,379 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-01-31 17:17:11,379 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-01-31 17:17:11,379 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-01-31 17:17:11,379 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-01-31 17:17:11,388 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][33], [20#L99-1true, Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), 88#true, 109#true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 76#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 53#(= ~counter~0 0), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 35#L75true, 13#L41true, 103#true, 11#thread2EXITtrue, 19#L64true, Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:11,389 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-01-31 17:17:11,389 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-01-31 17:17:11,389 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-01-31 17:17:11,389 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-01-31 17:17:11,462 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][33], [Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), 16#L98-4true, 88#true, 109#true, 95#true, Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 76#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 53#(= ~counter~0 0), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 35#L75true, 13#L41true, 11#thread2EXITtrue, 103#true, 19#L64true, Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:11,462 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-01-31 17:17:11,462 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-01-31 17:17:11,463 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-01-31 17:17:11,463 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-01-31 17:17:11,487 INFO L124 PetriNetUnfolderBase]: 3354/4611 cut-off events. [2024-01-31 17:17:11,487 INFO L125 PetriNetUnfolderBase]: For 11883/12015 co-relation queries the response was YES. [2024-01-31 17:17:11,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17881 conditions, 4611 events. 3354/4611 cut-off events. For 11883/12015 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 21573 event pairs, 715 based on Foata normal form. 102/4455 useless extension candidates. Maximal degree in co-relation 11177. Up to 3828 conditions per place. [2024-01-31 17:17:11,512 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 67 selfloop transitions, 11 changer transitions 2/90 dead transitions. [2024-01-31 17:17:11,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 90 transitions, 646 flow [2024-01-31 17:17:11,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 17:17:11,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 17:17:11,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-01-31 17:17:11,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-01-31 17:17:11,514 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 309 flow. Second operand 4 states and 104 transitions. [2024-01-31 17:17:11,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 90 transitions, 646 flow [2024-01-31 17:17:11,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 90 transitions, 626 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-01-31 17:17:11,518 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 413 flow [2024-01-31 17:17:11,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=413, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2024-01-31 17:17:11,519 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2024-01-31 17:17:11,519 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 413 flow [2024-01-31 17:17:11,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-01-31 17:17:11,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:17:11,519 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-01-31 17:17:11,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-31 17:17:11,520 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 17:17:11,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:17:11,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1996113546, now seen corresponding path program 3 times [2024-01-31 17:17:11,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:17:11,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857803420] [2024-01-31 17:17:11,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:17:11,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:17:11,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:17:11,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-31 17:17:11,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:17:11,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857803420] [2024-01-31 17:17:11,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857803420] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:17:11,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:17:11,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 17:17:11,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458601451] [2024-01-31 17:17:11,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:17:11,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 17:17:11,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:17:11,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 17:17:11,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 17:17:11,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-01-31 17:17:11,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 413 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:17:11,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:17:11,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-01-31 17:17:11,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:17:11,818 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][36], [Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), 88#true, 16#L98-4true, 117#true, 109#true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 114#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 53#(= ~counter~0 0), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 35#L75true, 7#L56true, 13#L41true, 19#L64true, Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:11,818 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-01-31 17:17:11,818 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-01-31 17:17:11,818 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-01-31 17:17:11,818 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-01-31 17:17:11,854 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][36], [20#L99-1true, Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), 88#true, 109#true, 117#true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 114#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 53#(= ~counter~0 0), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 35#L75true, 7#L56true, 13#L41true, 19#L64true, Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:11,855 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-01-31 17:17:11,855 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-01-31 17:17:11,855 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-01-31 17:17:11,855 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-01-31 17:17:11,856 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][36], [8#L52true, Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), 88#true, 16#L98-4true, 109#true, 117#true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 114#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 53#(= ~counter~0 0), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 35#L75true, 13#L41true, 19#L64true, Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:11,856 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-01-31 17:17:11,856 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-01-31 17:17:11,856 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-01-31 17:17:11,857 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-01-31 17:17:11,857 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][36], [Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), 16#L98-4true, 88#true, 117#true, 109#true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 114#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 53#(= ~counter~0 0), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 35#L75true, 13#L41true, 11#thread2EXITtrue, 19#L64true, Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:11,857 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-01-31 17:17:11,857 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-01-31 17:17:11,858 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-01-31 17:17:11,858 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-01-31 17:17:11,894 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][36], [8#L52true, 20#L99-1true, Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), 88#true, 117#true, 109#true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 114#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 53#(= ~counter~0 0), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 35#L75true, 13#L41true, 19#L64true, Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:11,895 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-01-31 17:17:11,895 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-01-31 17:17:11,895 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-01-31 17:17:11,895 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-01-31 17:17:11,896 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][36], [20#L99-1true, Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), 88#true, 109#true, 117#true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 114#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 53#(= ~counter~0 0), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 35#L75true, 11#thread2EXITtrue, 13#L41true, 19#L64true, Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:11,896 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-01-31 17:17:11,896 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-01-31 17:17:11,896 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-01-31 17:17:11,896 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-01-31 17:17:12,074 INFO L124 PetriNetUnfolderBase]: 4735/6414 cut-off events. [2024-01-31 17:17:12,074 INFO L125 PetriNetUnfolderBase]: For 19106/19318 co-relation queries the response was YES. [2024-01-31 17:17:12,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25858 conditions, 6414 events. 4735/6414 cut-off events. For 19106/19318 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 30446 event pairs, 1170 based on Foata normal form. 105/6200 useless extension candidates. Maximal degree in co-relation 8707. Up to 5478 conditions per place. [2024-01-31 17:17:12,134 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 69 selfloop transitions, 11 changer transitions 5/94 dead transitions. [2024-01-31 17:17:12,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 94 transitions, 717 flow [2024-01-31 17:17:12,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 17:17:12,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 17:17:12,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-01-31 17:17:12,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6602564102564102 [2024-01-31 17:17:12,135 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 413 flow. Second operand 4 states and 103 transitions. [2024-01-31 17:17:12,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 94 transitions, 717 flow [2024-01-31 17:17:12,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 94 transitions, 717 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-31 17:17:12,142 INFO L231 Difference]: Finished difference. Result has 70 places, 62 transitions, 435 flow [2024-01-31 17:17:12,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=435, PETRI_PLACES=70, PETRI_TRANSITIONS=62} [2024-01-31 17:17:12,143 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2024-01-31 17:17:12,143 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 62 transitions, 435 flow [2024-01-31 17:17:12,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:17:12,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:17:12,144 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-01-31 17:17:12,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-31 17:17:12,144 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 17:17:12,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:17:12,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1994617308, now seen corresponding path program 4 times [2024-01-31 17:17:12,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:17:12,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851888691] [2024-01-31 17:17:12,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:17:12,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:17:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:17:12,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-31 17:17:12,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:17:12,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851888691] [2024-01-31 17:17:12,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851888691] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:17:12,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:17:12,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:17:12,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152431874] [2024-01-31 17:17:12,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:17:12,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:17:12,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:17:12,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:17:12,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:17:12,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-01-31 17:17:12,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 62 transitions, 435 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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-01-31 17:17:12,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:17:12,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-01-31 17:17:12,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:17:12,509 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][62], [Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), 88#true, 16#L98-4true, 117#true, 109#true, 95#true, Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), 124#true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 114#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 53#(= ~counter~0 0), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 35#L75true, 7#L56true, 13#L41true, 19#L64true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:12,509 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-01-31 17:17:12,509 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-01-31 17:17:12,509 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-01-31 17:17:12,509 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-01-31 17:17:12,530 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][62], [20#L99-1true, Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), 88#true, 117#true, 109#true, 95#true, Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), 124#true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 114#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 53#(= ~counter~0 0), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 35#L75true, 7#L56true, 13#L41true, 19#L64true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:12,531 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-01-31 17:17:12,531 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-01-31 17:17:12,531 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-01-31 17:17:12,531 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-01-31 17:17:12,531 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][62], [Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), 88#true, 16#L98-4true, 117#true, 109#true, 95#true, Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 124#true, Black: 114#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 53#(= ~counter~0 0), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 35#L75true, 11#thread2EXITtrue, 13#L41true, 19#L64true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:12,531 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-01-31 17:17:12,532 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-01-31 17:17:12,532 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-01-31 17:17:12,532 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-01-31 17:17:12,532 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][62], [8#L52true, Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), 88#true, 16#L98-4true, 117#true, 109#true, 95#true, Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), 124#true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 114#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 53#(= ~counter~0 0), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 35#L75true, 13#L41true, 19#L64true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:12,532 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-01-31 17:17:12,532 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-01-31 17:17:12,533 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-01-31 17:17:12,533 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-01-31 17:17:12,546 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][62], [20#L99-1true, Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), 88#true, 117#true, 109#true, 95#true, Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 124#true, Black: 114#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 53#(= ~counter~0 0), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 35#L75true, 11#thread2EXITtrue, 13#L41true, 19#L64true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:12,547 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-01-31 17:17:12,547 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-01-31 17:17:12,547 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-01-31 17:17:12,547 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-01-31 17:17:12,547 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][62], [8#L52true, 20#L99-1true, Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 88#true, 117#true, 109#true, 95#true, Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 124#true, Black: 114#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 53#(= ~counter~0 0), Black: 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 35#L75true, 13#L41true, 19#L64true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:12,547 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-01-31 17:17:12,548 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-01-31 17:17:12,548 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-01-31 17:17:12,548 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-01-31 17:17:12,568 INFO L124 PetriNetUnfolderBase]: 4245/5621 cut-off events. [2024-01-31 17:17:12,568 INFO L125 PetriNetUnfolderBase]: For 19206/19452 co-relation queries the response was YES. [2024-01-31 17:17:12,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24118 conditions, 5621 events. 4245/5621 cut-off events. For 19206/19452 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 24959 event pairs, 414 based on Foata normal form. 216/5565 useless extension candidates. Maximal degree in co-relation 8167. Up to 3727 conditions per place. [2024-01-31 17:17:12,611 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 80 selfloop transitions, 13 changer transitions 0/102 dead transitions. [2024-01-31 17:17:12,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 102 transitions, 812 flow [2024-01-31 17:17:12,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 17:17:12,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 17:17:12,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2024-01-31 17:17:12,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6410256410256411 [2024-01-31 17:17:12,613 INFO L175 Difference]: Start difference. First operand has 70 places, 62 transitions, 435 flow. Second operand 5 states and 125 transitions. [2024-01-31 17:17:12,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 102 transitions, 812 flow [2024-01-31 17:17:12,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 102 transitions, 776 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-01-31 17:17:12,676 INFO L231 Difference]: Finished difference. Result has 71 places, 60 transitions, 422 flow [2024-01-31 17:17:12,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=422, PETRI_PLACES=71, PETRI_TRANSITIONS=60} [2024-01-31 17:17:12,676 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2024-01-31 17:17:12,676 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 60 transitions, 422 flow [2024-01-31 17:17:12,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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-01-31 17:17:12,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:17:12,677 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] [2024-01-31 17:17:12,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-31 17:17:12,677 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 17:17:12,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:17:12,677 INFO L85 PathProgramCache]: Analyzing trace with hash -257729956, now seen corresponding path program 1 times [2024-01-31 17:17:12,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:17:12,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833006375] [2024-01-31 17:17:12,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:17:12,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:17:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:17:12,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-31 17:17:12,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:17:12,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833006375] [2024-01-31 17:17:12,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833006375] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:17:12,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:17:12,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 17:17:12,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779485008] [2024-01-31 17:17:12,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:17:12,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 17:17:12,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:17:12,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 17:17:12,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 17:17:12,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-01-31 17:17:12,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 60 transitions, 422 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:17:12,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:17:12,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-01-31 17:17:12,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:17:13,172 INFO L124 PetriNetUnfolderBase]: 4249/5779 cut-off events. [2024-01-31 17:17:13,172 INFO L125 PetriNetUnfolderBase]: For 19405/19997 co-relation queries the response was YES. [2024-01-31 17:17:13,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24273 conditions, 5779 events. 4249/5779 cut-off events. For 19405/19997 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 27449 event pairs, 1072 based on Foata normal form. 127/5605 useless extension candidates. Maximal degree in co-relation 10026. Up to 4579 conditions per place. [2024-01-31 17:17:13,222 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 80 selfloop transitions, 9 changer transitions 0/104 dead transitions. [2024-01-31 17:17:13,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 104 transitions, 842 flow [2024-01-31 17:17:13,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 17:17:13,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 17:17:13,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2024-01-31 17:17:13,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6730769230769231 [2024-01-31 17:17:13,223 INFO L175 Difference]: Start difference. First operand has 71 places, 60 transitions, 422 flow. Second operand 4 states and 105 transitions. [2024-01-31 17:17:13,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 104 transitions, 842 flow [2024-01-31 17:17:13,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 104 transitions, 806 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-01-31 17:17:13,234 INFO L231 Difference]: Finished difference. Result has 73 places, 67 transitions, 488 flow [2024-01-31 17:17:13,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=488, PETRI_PLACES=73, PETRI_TRANSITIONS=67} [2024-01-31 17:17:13,235 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places. [2024-01-31 17:17:13,235 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 67 transitions, 488 flow [2024-01-31 17:17:13,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:17:13,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:17:13,236 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] [2024-01-31 17:17:13,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-31 17:17:13,236 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 17:17:13,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:17:13,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1390799742, now seen corresponding path program 2 times [2024-01-31 17:17:13,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:17:13,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644754606] [2024-01-31 17:17:13,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:17:13,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:17:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:17:13,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:17:13,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:17:13,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644754606] [2024-01-31 17:17:13,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644754606] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 17:17:13,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451895026] [2024-01-31 17:17:13,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-31 17:17:13,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:17:13,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:17:13,305 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-01-31 17:17:13,334 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-01-31 17:17:13,404 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-31 17:17:13,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-31 17:17:13,406 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjunts are in the unsatisfiable core [2024-01-31 17:17:13,410 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 17:17:13,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-31 17:17:13,470 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-31 17:17:13,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451895026] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:17:13,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-31 17:17:13,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-01-31 17:17:13,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820379597] [2024-01-31 17:17:13,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:17:13,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 17:17:13,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:17:13,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 17:17:13,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-01-31 17:17:13,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-01-31 17:17:13,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 67 transitions, 488 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:17:13,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:17:13,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-01-31 17:17:13,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:17:14,259 INFO L124 PetriNetUnfolderBase]: 6675/10099 cut-off events. [2024-01-31 17:17:14,259 INFO L125 PetriNetUnfolderBase]: For 36332/37376 co-relation queries the response was YES. [2024-01-31 17:17:14,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42593 conditions, 10099 events. 6675/10099 cut-off events. For 36332/37376 co-relation queries the response was YES. Maximal size of possible extension queue 587. Compared 63216 event pairs, 1512 based on Foata normal form. 807/10325 useless extension candidates. Maximal degree in co-relation 12655. Up to 3911 conditions per place. [2024-01-31 17:17:14,347 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 87 selfloop transitions, 27 changer transitions 0/137 dead transitions. [2024-01-31 17:17:14,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 137 transitions, 1147 flow [2024-01-31 17:17:14,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 17:17:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 17:17:14,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2024-01-31 17:17:14,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7884615384615384 [2024-01-31 17:17:14,348 INFO L175 Difference]: Start difference. First operand has 73 places, 67 transitions, 488 flow. Second operand 4 states and 123 transitions. [2024-01-31 17:17:14,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 137 transitions, 1147 flow [2024-01-31 17:17:14,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 137 transitions, 1138 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 17:17:14,369 INFO L231 Difference]: Finished difference. Result has 77 places, 91 transitions, 860 flow [2024-01-31 17:17:14,369 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=860, PETRI_PLACES=77, PETRI_TRANSITIONS=91} [2024-01-31 17:17:14,370 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places. [2024-01-31 17:17:14,370 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 91 transitions, 860 flow [2024-01-31 17:17:14,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:17:14,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:17:14,370 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] [2024-01-31 17:17:14,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-01-31 17:17:14,581 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,SelfDestructingSolverStorable12 [2024-01-31 17:17:14,582 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 17:17:14,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:17:14,582 INFO L85 PathProgramCache]: Analyzing trace with hash -34982322, now seen corresponding path program 1 times [2024-01-31 17:17:14,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:17:14,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926060529] [2024-01-31 17:17:14,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:17:14,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:17:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:17:14,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:17:14,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:17:14,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926060529] [2024-01-31 17:17:14,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926060529] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 17:17:14,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886424868] [2024-01-31 17:17:14,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:17:14,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:17:14,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:17:14,711 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-01-31 17:17:14,738 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-01-31 17:17:14,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:17:14,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-31 17:17:14,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 17:17:14,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:17:14,841 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 17:17:14,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:17:14,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886424868] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 17:17:14,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 17:17:14,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 5 [2024-01-31 17:17:14,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614823108] [2024-01-31 17:17:14,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 17:17:14,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:17:14,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:17:14,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:17:14,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:17:14,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-01-31 17:17:14,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 91 transitions, 860 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-01-31 17:17:14,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:17:14,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-01-31 17:17:14,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:17:15,675 INFO L124 PetriNetUnfolderBase]: 6675/10097 cut-off events. [2024-01-31 17:17:15,675 INFO L125 PetriNetUnfolderBase]: For 54231/56472 co-relation queries the response was YES. [2024-01-31 17:17:15,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49431 conditions, 10097 events. 6675/10097 cut-off events. For 54231/56472 co-relation queries the response was YES. Maximal size of possible extension queue 587. Compared 63269 event pairs, 1512 based on Foata normal form. 259/9775 useless extension candidates. Maximal degree in co-relation 15042. Up to 3911 conditions per place. [2024-01-31 17:17:15,818 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 83 selfloop transitions, 27 changer transitions 3/136 dead transitions. [2024-01-31 17:17:15,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 136 transitions, 1288 flow [2024-01-31 17:17:15,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 17:17:15,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 17:17:15,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2024-01-31 17:17:15,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7756410256410257 [2024-01-31 17:17:15,820 INFO L175 Difference]: Start difference. First operand has 77 places, 91 transitions, 860 flow. Second operand 4 states and 121 transitions. [2024-01-31 17:17:15,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 136 transitions, 1288 flow [2024-01-31 17:17:15,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 136 transitions, 1254 flow, removed 17 selfloop flow, removed 0 redundant places. [2024-01-31 17:17:15,877 INFO L231 Difference]: Finished difference. Result has 81 places, 91 transitions, 902 flow [2024-01-31 17:17:15,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=902, PETRI_PLACES=81, PETRI_TRANSITIONS=91} [2024-01-31 17:17:15,877 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places. [2024-01-31 17:17:15,877 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 91 transitions, 902 flow [2024-01-31 17:17:15,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-01-31 17:17:15,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:17:15,878 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] [2024-01-31 17:17:15,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-01-31 17:17:16,088 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,SelfDestructingSolverStorable13 [2024-01-31 17:17:16,088 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 17:17:16,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:17:16,089 INFO L85 PathProgramCache]: Analyzing trace with hash -927048370, now seen corresponding path program 2 times [2024-01-31 17:17:16,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:17:16,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958954443] [2024-01-31 17:17:16,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:17:16,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:17:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:17:16,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-31 17:17:16,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:17:16,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958954443] [2024-01-31 17:17:16,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958954443] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 17:17:16,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536140899] [2024-01-31 17:17:16,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-31 17:17:16,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:17:16,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:17:16,177 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-01-31 17:17:16,208 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-01-31 17:17:16,269 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-31 17:17:16,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-31 17:17:16,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-31 17:17:16,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 17:17:16,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-31 17:17:16,321 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 17:17:16,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-31 17:17:16,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536140899] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 17:17:16,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 17:17:16,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 7 [2024-01-31 17:17:16,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944690469] [2024-01-31 17:17:16,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 17:17:16,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-31 17:17:16,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:17:16,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-31 17:17:16,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-01-31 17:17:16,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-01-31 17:17:16,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 91 transitions, 902 flow. Second operand has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 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-01-31 17:17:16,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:17:16,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-01-31 17:17:16,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:17:17,599 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][10], [451#(= ~counter~0 2), Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), 88#true, Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 109#true, 95#true, Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 242#true, 19#L64true, 23#L79true, 8#L52true, Black: 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 16#L98-4true, Black: 148#(<= ~counter~0 0), Black: 188#(<= ~counter~0 1), 140#true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 53#(= ~counter~0 0), 13#L41true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 244#(= ~counter~0 0), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:17,599 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-01-31 17:17:17,599 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-31 17:17:17,599 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-31 17:17:17,600 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-31 17:17:17,690 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][10], [451#(= ~counter~0 2), Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), 20#L99-1true, Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), 88#true, Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 109#true, 95#true, Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 242#true, 19#L64true, 23#L79true, 8#L52true, Black: 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 148#(<= ~counter~0 0), Black: 188#(<= ~counter~0 1), 140#true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 53#(= ~counter~0 0), 13#L41true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 244#(= ~counter~0 0), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:17,690 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-01-31 17:17:17,690 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-31 17:17:17,690 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-31 17:17:17,690 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-31 17:17:17,693 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][10], [451#(= ~counter~0 2), Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), 88#true, Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 109#true, Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 95#true, Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 242#true, 19#L64true, 8#L52true, Black: 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 16#L98-4true, 3#thread4EXITtrue, Black: 148#(<= ~counter~0 0), Black: 188#(<= ~counter~0 1), 140#true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 53#(= ~counter~0 0), 13#L41true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 244#(= ~counter~0 0), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:17,694 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-01-31 17:17:17,694 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-31 17:17:17,694 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-31 17:17:17,694 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-31 17:17:17,761 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][10], [451#(= ~counter~0 2), Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), 20#L99-1true, Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), 88#true, Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 109#true, Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 95#true, Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 242#true, 19#L64true, 8#L52true, Black: 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 3#thread4EXITtrue, Black: 148#(<= ~counter~0 0), Black: 188#(<= ~counter~0 1), 140#true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 53#(= ~counter~0 0), 13#L41true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 244#(= ~counter~0 0), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:17,761 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-01-31 17:17:17,761 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-31 17:17:17,761 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-31 17:17:17,761 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-31 17:17:17,877 INFO L124 PetriNetUnfolderBase]: 13432/20177 cut-off events. [2024-01-31 17:17:17,878 INFO L125 PetriNetUnfolderBase]: For 125319/128996 co-relation queries the response was YES. [2024-01-31 17:17:17,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98510 conditions, 20177 events. 13432/20177 cut-off events. For 125319/128996 co-relation queries the response was YES. Maximal size of possible extension queue 1149. Compared 138722 event pairs, 2533 based on Foata normal form. 1280/20387 useless extension candidates. Maximal degree in co-relation 30124. Up to 6299 conditions per place. [2024-01-31 17:17:18,079 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 106 selfloop transitions, 68 changer transitions 3/200 dead transitions. [2024-01-31 17:17:18,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 200 transitions, 2068 flow [2024-01-31 17:17:18,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 17:17:18,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 17:17:18,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 159 transitions. [2024-01-31 17:17:18,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8153846153846154 [2024-01-31 17:17:18,081 INFO L175 Difference]: Start difference. First operand has 81 places, 91 transitions, 902 flow. Second operand 5 states and 159 transitions. [2024-01-31 17:17:18,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 200 transitions, 2068 flow [2024-01-31 17:17:18,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 200 transitions, 2014 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-31 17:17:18,151 INFO L231 Difference]: Finished difference. Result has 83 places, 132 transitions, 1561 flow [2024-01-31 17:17:18,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1561, PETRI_PLACES=83, PETRI_TRANSITIONS=132} [2024-01-31 17:17:18,151 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 40 predicate places. [2024-01-31 17:17:18,152 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 132 transitions, 1561 flow [2024-01-31 17:17:18,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 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-01-31 17:17:18,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:17:18,152 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, 1, 1] [2024-01-31 17:17:18,163 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-01-31 17:17:18,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:17:18,363 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 17:17:18,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:17:18,364 INFO L85 PathProgramCache]: Analyzing trace with hash 940563624, now seen corresponding path program 3 times [2024-01-31 17:17:18,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:17:18,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206502690] [2024-01-31 17:17:18,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:17:18,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:17:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:17:18,441 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:17:18,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:17:18,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206502690] [2024-01-31 17:17:18,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206502690] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 17:17:18,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322308298] [2024-01-31 17:17:18,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-31 17:17:18,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:17:18,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:17:18,457 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-01-31 17:17:18,481 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-01-31 17:17:18,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-01-31 17:17:18,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-31 17:17:18,551 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-31 17:17:18,553 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 17:17:18,800 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:17:18,800 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 17:17:18,878 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:17:18,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322308298] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 17:17:18,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 17:17:18,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-01-31 17:17:18,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160967764] [2024-01-31 17:17:18,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 17:17:18,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-01-31 17:17:18,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:17:18,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-01-31 17:17:18,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-01-31 17:17:18,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-01-31 17:17:18,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 132 transitions, 1561 flow. Second operand has 13 states, 13 states have (on average 16.23076923076923) internal successors, (211), 13 states have internal predecessors, (211), 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-01-31 17:17:18,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:17:18,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-01-31 17:17:18,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:17:26,557 INFO L124 PetriNetUnfolderBase]: 54188/75643 cut-off events. [2024-01-31 17:17:26,558 INFO L125 PetriNetUnfolderBase]: For 521032/536592 co-relation queries the response was YES. [2024-01-31 17:17:26,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379721 conditions, 75643 events. 54188/75643 cut-off events. For 521032/536592 co-relation queries the response was YES. Maximal size of possible extension queue 3220. Compared 523158 event pairs, 8036 based on Foata normal form. 5726/77443 useless extension candidates. Maximal degree in co-relation 196621. Up to 20747 conditions per place. [2024-01-31 17:17:27,381 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 614 selfloop transitions, 111 changer transitions 8/748 dead transitions. [2024-01-31 17:17:27,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 748 transitions, 9291 flow [2024-01-31 17:17:27,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-01-31 17:17:27,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-01-31 17:17:27,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 459 transitions. [2024-01-31 17:17:27,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2024-01-31 17:17:27,386 INFO L175 Difference]: Start difference. First operand has 83 places, 132 transitions, 1561 flow. Second operand 17 states and 459 transitions. [2024-01-31 17:17:27,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 748 transitions, 9291 flow [2024-01-31 17:17:27,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 748 transitions, 7723 flow, removed 671 selfloop flow, removed 2 redundant places. [2024-01-31 17:17:27,783 INFO L231 Difference]: Finished difference. Result has 109 places, 203 transitions, 2428 flow [2024-01-31 17:17:27,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1289, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2428, PETRI_PLACES=109, PETRI_TRANSITIONS=203} [2024-01-31 17:17:27,784 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 66 predicate places. [2024-01-31 17:17:27,784 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 203 transitions, 2428 flow [2024-01-31 17:17:27,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 16.23076923076923) internal successors, (211), 13 states have internal predecessors, (211), 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-01-31 17:17:27,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:17:27,784 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, 1, 1] [2024-01-31 17:17:27,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-01-31 17:17:27,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-01-31 17:17:27,996 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 17:17:27,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:17:27,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1240654556, now seen corresponding path program 4 times [2024-01-31 17:17:27,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:17:27,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415022114] [2024-01-31 17:17:27,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:17:27,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:17:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:17:28,075 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:17:28,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:17:28,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415022114] [2024-01-31 17:17:28,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415022114] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 17:17:28,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811529622] [2024-01-31 17:17:28,076 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-31 17:17:28,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:17:28,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:17:28,077 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-31 17:17:28,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-01-31 17:17:28,170 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-31 17:17:28,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-31 17:17:28,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-31 17:17:28,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 17:17:28,262 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:17:28,262 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 17:17:28,435 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:17:28,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811529622] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 17:17:28,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 17:17:28,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-01-31 17:17:28,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26249073] [2024-01-31 17:17:28,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 17:17:28,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-01-31 17:17:28,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:17:28,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-01-31 17:17:28,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-01-31 17:17:28,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-01-31 17:17:28,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 203 transitions, 2428 flow. Second operand has 13 states, 13 states have (on average 16.076923076923077) internal successors, (209), 13 states have internal predecessors, (209), 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-01-31 17:17:28,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:17:28,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-01-31 17:17:28,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:17:31,745 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][53], [Black: 654#true, Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), 88#true, Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 805#(< (+ ~i2~0 1) ~N2~0), Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 109#true, Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 449#(= ~counter~0 0), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), 450#(= ~counter~0 1), 659#(<= (+ ~i2~0 1) ~N2~0), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 19#L64true, 188#(<= ~counter~0 1), 8#L52true, 16#L98-4true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 53#(= ~counter~0 0), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 35#L75true, 13#L41true, 920#(and (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~i1~0 0)), Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:31,745 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2024-01-31 17:17:31,745 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-01-31 17:17:31,745 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-01-31 17:17:31,745 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-01-31 17:17:31,886 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][124], [451#(= ~counter~0 2), Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 88#true, Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 109#true, Black: 805#(< (+ ~i2~0 1) ~N2~0), Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 449#(= ~counter~0 0), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 659#(<= (+ ~i2~0 1) ~N2~0), 19#L64true, 8#L52true, 16#L98-4true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 188#(<= ~counter~0 1), 25#L44true, 140#true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 53#(= ~counter~0 0), 35#L75true, 960#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:31,886 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-01-31 17:17:31,886 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-01-31 17:17:31,886 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-01-31 17:17:31,886 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-01-31 17:17:32,876 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][53], [Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), 20#L99-1true, Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), 88#true, Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 805#(< (+ ~i2~0 1) ~N2~0), 109#true, Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 449#(= ~counter~0 0), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), 450#(= ~counter~0 1), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 659#(<= (+ ~i2~0 1) ~N2~0), 19#L64true, 188#(<= ~counter~0 1), 8#L52true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 53#(= ~counter~0 0), 35#L75true, 13#L41true, 920#(and (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~i1~0 0)), Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:32,876 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is not cut-off event [2024-01-31 17:17:32,876 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-01-31 17:17:32,877 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-01-31 17:17:32,877 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-01-31 17:17:33,064 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][124], [451#(= ~counter~0 2), Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, 20#L99-1true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), 88#true, Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 805#(< (+ ~i2~0 1) ~N2~0), Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 109#true, Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 449#(= ~counter~0 0), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 659#(<= (+ ~i2~0 1) ~N2~0), 19#L64true, 8#L52true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 188#(<= ~counter~0 1), 25#L44true, 140#true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 53#(= ~counter~0 0), 35#L75true, 960#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:33,064 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-01-31 17:17:33,065 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-01-31 17:17:33,065 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-01-31 17:17:33,065 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-01-31 17:17:34,410 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][53], [451#(= ~counter~0 2), Black: 654#true, Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), 88#true, Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 805#(< (+ ~i2~0 1) ~N2~0), 109#true, Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 449#(= ~counter~0 0), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), 659#(<= (+ ~i2~0 1) ~N2~0), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 19#L64true, 8#L52true, 16#L98-4true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 188#(<= ~counter~0 1), Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 140#true, Black: 53#(= ~counter~0 0), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 35#L75true, 13#L41true, 920#(and (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~i1~0 0)), Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:34,410 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is not cut-off event [2024-01-31 17:17:34,417 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2024-01-31 17:17:34,418 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2024-01-31 17:17:34,418 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2024-01-31 17:17:34,424 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][124], [Black: 654#true, Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), 88#true, Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 805#(< (+ ~i2~0 1) ~N2~0), Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 109#true, Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 449#(= ~counter~0 0), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), 659#(<= (+ ~i2~0 1) ~N2~0), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 19#L64true, 8#L52true, 16#L98-4true, 447#true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 188#(<= ~counter~0 1), 25#L44true, 140#true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 53#(= ~counter~0 0), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 35#L75true, 960#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:34,424 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-01-31 17:17:34,424 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-01-31 17:17:34,424 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-01-31 17:17:34,424 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-01-31 17:17:35,716 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][53], [451#(= ~counter~0 2), Black: 654#true, Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), 20#L99-1true, Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), 88#true, Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 805#(< (+ ~i2~0 1) ~N2~0), 109#true, Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 449#(= ~counter~0 0), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), 659#(<= (+ ~i2~0 1) ~N2~0), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 19#L64true, 8#L52true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 188#(<= ~counter~0 1), Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 140#true, 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 53#(= ~counter~0 0), 35#L75true, 13#L41true, 920#(and (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (<= ~i1~0 0)), Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:35,716 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is not cut-off event [2024-01-31 17:17:35,716 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2024-01-31 17:17:35,716 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2024-01-31 17:17:35,716 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2024-01-31 17:17:35,722 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][124], [Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), 20#L99-1true, Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), 88#true, Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 805#(< (+ ~i2~0 1) ~N2~0), 109#true, Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 449#(= ~counter~0 0), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 659#(<= (+ ~i2~0 1) ~N2~0), 19#L64true, 8#L52true, 447#true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 188#(<= ~counter~0 1), 25#L44true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 140#true, 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 53#(= ~counter~0 0), 35#L75true, 960#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0)), Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:35,722 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-01-31 17:17:35,722 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-01-31 17:17:35,722 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-01-31 17:17:35,722 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-01-31 17:17:36,444 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][183], [Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 659#(<= (+ ~i2~0 1) ~N2~0), Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 91#(<= ~N1~0 ~i1~0), Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 805#(< (+ ~i2~0 1) ~N2~0), 109#true, Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 449#(= ~counter~0 0), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), 450#(= ~counter~0 1), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 19#L64true, 58#(<= ~N1~0 ~i1~0), 8#L52true, 911#true, 16#L98-4true, 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 10#thread1EXITtrue, Black: 188#(<= ~counter~0 1), Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 140#true, 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 53#(= ~counter~0 0), 35#L75true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-31 17:17:36,445 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is not cut-off event [2024-01-31 17:17:36,445 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2024-01-31 17:17:36,445 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2024-01-31 17:17:36,445 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2024-01-31 17:17:36,718 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][183], [Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 659#(<= (+ ~i2~0 1) ~N2~0), Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), 91#(<= ~N1~0 ~i1~0), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 109#true, Black: 805#(< (+ ~i2~0 1) ~N2~0), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 449#(= ~counter~0 0), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), 450#(= ~counter~0 1), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 19#L64true, 58#(<= ~N1~0 ~i1~0), 188#(<= ~counter~0 1), 8#L52true, 911#true, 16#L98-4true, 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 10#thread1EXITtrue, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 53#(= ~counter~0 0), 35#L75true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-31 17:17:36,719 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is not cut-off event [2024-01-31 17:17:36,719 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2024-01-31 17:17:36,719 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2024-01-31 17:17:36,719 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2024-01-31 17:17:36,723 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][183], [Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 659#(<= (+ ~i2~0 1) ~N2~0), Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 91#(<= ~N1~0 ~i1~0), Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 805#(< (+ ~i2~0 1) ~N2~0), 109#true, Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 449#(= ~counter~0 0), 95#true, Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), 450#(= ~counter~0 1), Black: 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 19#L64true, 58#(<= ~N1~0 ~i1~0), 188#(<= ~counter~0 1), 8#L52true, 911#true, Black: 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 16#L98-4true, 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 10#thread1EXITtrue, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 53#(= ~counter~0 0), 35#L75true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-31 17:17:36,723 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is not cut-off event [2024-01-31 17:17:36,723 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2024-01-31 17:17:36,723 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2024-01-31 17:17:36,723 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2024-01-31 17:17:36,751 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][117], [Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 88#true, Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 805#(< (+ ~i2~0 1) ~N2~0), 109#true, 1145#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (or (< (+ ~i1~0 1) ~N1~0) (< ~M1~0 (+ 2 ~j1~0)))), Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 449#(= ~counter~0 0), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), 450#(= ~counter~0 1), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 659#(<= (+ ~i2~0 1) ~N2~0), 19#L64true, 188#(<= ~counter~0 1), 8#L52true, 16#L98-4true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 53#(= ~counter~0 0), 35#L75true, 13#L41true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:36,751 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is not cut-off event [2024-01-31 17:17:36,751 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2024-01-31 17:17:36,751 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2024-01-31 17:17:36,751 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2024-01-31 17:17:37,155 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][117], [451#(= ~counter~0 2), Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 88#true, Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 109#true, Black: 805#(< (+ ~i2~0 1) ~N2~0), Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 1145#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (or (< (+ ~i1~0 1) ~N1~0) (< ~M1~0 (+ 2 ~j1~0)))), Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 449#(= ~counter~0 0), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 659#(<= (+ ~i2~0 1) ~N2~0), 19#L64true, 8#L52true, 16#L98-4true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 188#(<= ~counter~0 1), 25#L44true, 140#true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 53#(= ~counter~0 0), 35#L75true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:37,155 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-01-31 17:17:37,155 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-01-31 17:17:37,155 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-01-31 17:17:37,155 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-01-31 17:17:37,166 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][203], [451#(= ~counter~0 2), Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 88#true, Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 805#(< (+ ~i2~0 1) ~N2~0), 109#true, Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 449#(= ~counter~0 0), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 659#(<= (+ ~i2~0 1) ~N2~0), 1093#(or (< ~M1~0 (+ 2 ~j1~0)) (< ~i1~0 ~N1~0)), 19#L64true, 8#L52true, 16#L98-4true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 188#(<= ~counter~0 1), 25#L44true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 140#true, 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 53#(= ~counter~0 0), 35#L75true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:37,166 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-01-31 17:17:37,166 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-31 17:17:37,167 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-31 17:17:37,167 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-31 17:17:38,006 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][183], [Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), 20#L99-1true, Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 659#(<= (+ ~i2~0 1) ~N2~0), Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), 91#(<= ~N1~0 ~i1~0), Black: 805#(< (+ ~i2~0 1) ~N2~0), 109#true, Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 449#(= ~counter~0 0), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 450#(= ~counter~0 1), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 58#(<= ~N1~0 ~i1~0), 19#L64true, 8#L52true, 911#true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 10#thread1EXITtrue, Black: 188#(<= ~counter~0 1), Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 140#true, Black: 53#(= ~counter~0 0), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 35#L75true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-31 17:17:38,007 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is not cut-off event [2024-01-31 17:17:38,007 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-01-31 17:17:38,007 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-01-31 17:17:38,007 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-01-31 17:17:38,136 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][183], [Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), 20#L99-1true, Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 659#(<= (+ ~i2~0 1) ~N2~0), Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 91#(<= ~N1~0 ~i1~0), Black: 805#(< (+ ~i2~0 1) ~N2~0), Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 109#true, Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 449#(= ~counter~0 0), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 450#(= ~counter~0 1), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 19#L64true, 58#(<= ~N1~0 ~i1~0), 188#(<= ~counter~0 1), 8#L52true, 911#true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 10#thread1EXITtrue, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 53#(= ~counter~0 0), 35#L75true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-31 17:17:38,136 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is not cut-off event [2024-01-31 17:17:38,136 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-01-31 17:17:38,137 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-01-31 17:17:38,137 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-01-31 17:17:38,140 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][183], [Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), 20#L99-1true, Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 659#(<= (+ ~i2~0 1) ~N2~0), Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), 91#(<= ~N1~0 ~i1~0), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 805#(< (+ ~i2~0 1) ~N2~0), 109#true, Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 449#(= ~counter~0 0), 95#true, Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 450#(= ~counter~0 1), Black: 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 58#(<= ~N1~0 ~i1~0), 19#L64true, 188#(<= ~counter~0 1), 8#L52true, 911#true, Black: 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 10#thread1EXITtrue, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 53#(= ~counter~0 0), 35#L75true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-31 17:17:38,140 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is not cut-off event [2024-01-31 17:17:38,140 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-01-31 17:17:38,140 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-01-31 17:17:38,140 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-01-31 17:17:38,162 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][117], [Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), 20#L99-1true, Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), 88#true, Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 805#(< (+ ~i2~0 1) ~N2~0), 109#true, Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 1145#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (or (< (+ ~i1~0 1) ~N1~0) (< ~M1~0 (+ 2 ~j1~0)))), Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 449#(= ~counter~0 0), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 450#(= ~counter~0 1), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 659#(<= (+ ~i2~0 1) ~N2~0), 19#L64true, 188#(<= ~counter~0 1), 8#L52true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 53#(= ~counter~0 0), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 35#L75true, 13#L41true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:38,163 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is not cut-off event [2024-01-31 17:17:38,163 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-01-31 17:17:38,163 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-01-31 17:17:38,163 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-01-31 17:17:38,788 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][117], [451#(= ~counter~0 2), Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, 20#L99-1true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), 88#true, Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), 1145#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (or (< (+ ~i1~0 1) ~N1~0) (< ~M1~0 (+ 2 ~j1~0)))), Black: 805#(< (+ ~i2~0 1) ~N2~0), Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 109#true, Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 449#(= ~counter~0 0), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 659#(<= (+ ~i2~0 1) ~N2~0), 19#L64true, 8#L52true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 188#(<= ~counter~0 1), 25#L44true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 140#true, Black: 53#(= ~counter~0 0), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 35#L75true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:38,788 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-01-31 17:17:38,788 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-01-31 17:17:38,788 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-01-31 17:17:38,788 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-01-31 17:17:38,798 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][203], [451#(= ~counter~0 2), Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), 20#L99-1true, Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), 88#true, Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 805#(< (+ ~i2~0 1) ~N2~0), Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 109#true, Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 449#(= ~counter~0 0), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 659#(<= (+ ~i2~0 1) ~N2~0), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 1093#(or (< ~M1~0 (+ 2 ~j1~0)) (< ~i1~0 ~N1~0)), 19#L64true, 8#L52true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 188#(<= ~counter~0 1), 25#L44true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 140#true, Black: 53#(= ~counter~0 0), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 35#L75true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:38,798 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-01-31 17:17:38,798 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-31 17:17:38,798 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-31 17:17:38,798 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-31 17:17:38,892 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][117], [451#(= ~counter~0 2), Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), 88#true, Black: 659#(<= (+ ~i2~0 1) ~N2~0), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 805#(< (+ ~i2~0 1) ~N2~0), 1145#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (or (< (+ ~i1~0 1) ~N1~0) (< ~M1~0 (+ 2 ~j1~0)))), 109#true, Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), 95#true, Black: 449#(= ~counter~0 0), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), 19#L64true, 8#L52true, Black: 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 16#L98-4true, Black: 188#(<= ~counter~0 1), 25#L44true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 140#true, Black: 53#(= ~counter~0 0), 35#L75true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:38,892 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is not cut-off event [2024-01-31 17:17:38,892 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-01-31 17:17:38,892 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-01-31 17:17:38,892 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-01-31 17:17:39,096 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][117], [451#(= ~counter~0 2), Black: 654#true, Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), 88#true, Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 805#(< (+ ~i2~0 1) ~N2~0), Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 109#true, 1145#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (or (< (+ ~i1~0 1) ~N1~0) (< ~M1~0 (+ 2 ~j1~0)))), Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), 95#true, Black: 449#(= ~counter~0 0), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 659#(<= (+ ~i2~0 1) ~N2~0), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 19#L64true, 8#L52true, Black: 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 16#L98-4true, Black: 188#(<= ~counter~0 1), 25#L44true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 140#true, Black: 53#(= ~counter~0 0), 35#L75true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:39,097 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is not cut-off event [2024-01-31 17:17:39,097 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-01-31 17:17:39,097 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-01-31 17:17:39,097 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-01-31 17:17:39,334 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][183], [Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 659#(<= (+ ~i2~0 1) ~N2~0), Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), 91#(<= ~N1~0 ~i1~0), Black: 805#(< (+ ~i2~0 1) ~N2~0), 109#true, Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 449#(= ~counter~0 0), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 450#(= ~counter~0 1), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 19#L64true, 58#(<= ~N1~0 ~i1~0), 8#L52true, 911#true, 14#L99-2true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 188#(<= ~counter~0 1), 140#true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 53#(= ~counter~0 0), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 35#L75true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-31 17:17:39,334 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is not cut-off event [2024-01-31 17:17:39,335 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-01-31 17:17:39,335 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-01-31 17:17:39,335 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-01-31 17:17:39,736 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][183], [Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 659#(<= (+ ~i2~0 1) ~N2~0), Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 91#(<= ~N1~0 ~i1~0), 109#true, Black: 805#(< (+ ~i2~0 1) ~N2~0), Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 449#(= ~counter~0 0), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 450#(= ~counter~0 1), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 19#L64true, 58#(<= ~N1~0 ~i1~0), 188#(<= ~counter~0 1), 8#L52true, 911#true, 14#L99-2true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 53#(= ~counter~0 0), 35#L75true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-31 17:17:39,737 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is not cut-off event [2024-01-31 17:17:39,737 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-01-31 17:17:39,737 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-01-31 17:17:39,737 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-01-31 17:17:39,742 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][183], [Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 659#(<= (+ ~i2~0 1) ~N2~0), Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 91#(<= ~N1~0 ~i1~0), Black: 805#(< (+ ~i2~0 1) ~N2~0), Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 109#true, Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 449#(= ~counter~0 0), 95#true, Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 450#(= ~counter~0 1), Black: 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 58#(<= ~N1~0 ~i1~0), 19#L64true, 188#(<= ~counter~0 1), 8#L52true, 911#true, Black: 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 14#L99-2true, 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 53#(= ~counter~0 0), 35#L75true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-31 17:17:39,742 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is not cut-off event [2024-01-31 17:17:39,742 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-01-31 17:17:39,743 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-01-31 17:17:39,743 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-01-31 17:17:39,900 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][117], [451#(= ~counter~0 2), Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), 88#true, Black: 659#(<= (+ ~i2~0 1) ~N2~0), Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 805#(< (+ ~i2~0 1) ~N2~0), 109#true, 1145#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (or (< (+ ~i1~0 1) ~N1~0) (< ~M1~0 (+ 2 ~j1~0)))), Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 449#(= ~counter~0 0), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), 95#true, Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 19#L64true, 8#L52true, Black: 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 16#L98-4true, Black: 188#(<= ~counter~0 1), Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 140#true, Black: 53#(= ~counter~0 0), 35#L75true, 13#L41true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:39,901 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is not cut-off event [2024-01-31 17:17:39,901 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-01-31 17:17:39,901 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-01-31 17:17:39,901 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-01-31 17:17:39,936 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][183], [Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), 88#true, Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 805#(< (+ ~i2~0 1) ~N2~0), 109#true, Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 449#(= ~counter~0 0), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), 95#true, Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), 450#(= ~counter~0 1), Black: 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 659#(<= (+ ~i2~0 1) ~N2~0), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 19#L64true, 188#(<= ~counter~0 1), 8#L52true, 911#true, Black: 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 16#L98-4true, 25#L44true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 53#(= ~counter~0 0), 35#L75true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:39,936 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-01-31 17:17:39,936 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-31 17:17:39,937 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-01-31 17:17:39,937 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-01-31 17:17:40,070 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][117], [451#(= ~counter~0 2), Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), 20#L99-1true, Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), 88#true, Black: 659#(<= (+ ~i2~0 1) ~N2~0), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 805#(< (+ ~i2~0 1) ~N2~0), Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 109#true, 1145#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (or (< (+ ~i1~0 1) ~N1~0) (< ~M1~0 (+ 2 ~j1~0)))), Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 95#true, Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 449#(= ~counter~0 0), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), 19#L64true, 8#L52true, Black: 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 188#(<= ~counter~0 1), 25#L44true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 140#true, Black: 53#(= ~counter~0 0), 35#L75true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:40,070 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is not cut-off event [2024-01-31 17:17:40,071 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-01-31 17:17:40,071 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-01-31 17:17:40,071 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-01-31 17:17:40,262 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][117], [451#(= ~counter~0 2), Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), 20#L99-1true, Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), 88#true, Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 805#(< (+ ~i2~0 1) ~N2~0), Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 109#true, 1145#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (or (< (+ ~i1~0 1) ~N1~0) (< ~M1~0 (+ 2 ~j1~0)))), Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 449#(= ~counter~0 0), 95#true, Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 659#(<= (+ ~i2~0 1) ~N2~0), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 19#L64true, 8#L52true, Black: 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 188#(<= ~counter~0 1), 25#L44true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 140#true, Black: 53#(= ~counter~0 0), 35#L75true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:40,262 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is not cut-off event [2024-01-31 17:17:40,263 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-01-31 17:17:40,263 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-01-31 17:17:40,263 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-01-31 17:17:40,401 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][183], [Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 659#(<= (+ ~i2~0 1) ~N2~0), Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), 91#(<= ~N1~0 ~i1~0), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 109#true, Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 805#(< (+ ~i2~0 1) ~N2~0), Black: 449#(= ~counter~0 0), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 58#(<= ~N1~0 ~i1~0), 19#L64true, 8#L52true, 911#true, 14#L99-2true, 447#true, 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 188#(<= ~counter~0 1), 140#true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 53#(= ~counter~0 0), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 35#L75true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-31 17:17:40,402 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-01-31 17:17:40,402 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-31 17:17:40,402 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-31 17:17:40,402 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-31 17:17:40,462 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][183], [Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 659#(<= (+ ~i2~0 1) ~N2~0), Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), 91#(<= ~N1~0 ~i1~0), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), 109#true, Black: 805#(< (+ ~i2~0 1) ~N2~0), Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 449#(= ~counter~0 0), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 450#(= ~counter~0 1), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 58#(<= ~N1~0 ~i1~0), 19#L64true, 8#L52true, 911#true, 6#L100-1true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 188#(<= ~counter~0 1), 140#true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 53#(= ~counter~0 0), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 35#L75true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-31 17:17:40,462 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is not cut-off event [2024-01-31 17:17:40,462 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-01-31 17:17:40,462 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-01-31 17:17:40,462 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-01-31 17:17:40,472 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][183], [Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 659#(<= (+ ~i2~0 1) ~N2~0), Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 91#(<= ~N1~0 ~i1~0), Black: 805#(< (+ ~i2~0 1) ~N2~0), Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 109#true, Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 95#true, Black: 449#(= ~counter~0 0), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 19#L64true, 58#(<= ~N1~0 ~i1~0), 8#L52true, 911#true, Black: 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 14#L99-2true, 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 447#true, Black: 188#(<= ~counter~0 1), Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 140#true, Black: 53#(= ~counter~0 0), 35#L75true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-31 17:17:40,472 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-01-31 17:17:40,472 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-31 17:17:40,473 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-31 17:17:40,473 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-31 17:17:40,864 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][183], [Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 659#(<= (+ ~i2~0 1) ~N2~0), Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 91#(<= ~N1~0 ~i1~0), Black: 805#(< (+ ~i2~0 1) ~N2~0), Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 109#true, Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 449#(= ~counter~0 0), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 450#(= ~counter~0 1), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 19#L64true, 58#(<= ~N1~0 ~i1~0), 188#(<= ~counter~0 1), 8#L52true, 911#true, 6#L100-1true, 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 53#(= ~counter~0 0), 35#L75true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-31 17:17:40,864 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is not cut-off event [2024-01-31 17:17:40,865 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-01-31 17:17:40,865 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-01-31 17:17:40,865 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-01-31 17:17:40,875 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][183], [Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 659#(<= (+ ~i2~0 1) ~N2~0), Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), 91#(<= ~N1~0 ~i1~0), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 805#(< (+ ~i2~0 1) ~N2~0), Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 109#true, Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 449#(= ~counter~0 0), 95#true, Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 450#(= ~counter~0 1), Black: 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 58#(<= ~N1~0 ~i1~0), 19#L64true, 188#(<= ~counter~0 1), 8#L52true, 911#true, Black: 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 6#L100-1true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 53#(= ~counter~0 0), 35#L75true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-31 17:17:40,875 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is not cut-off event [2024-01-31 17:17:40,875 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-01-31 17:17:40,875 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-01-31 17:17:40,875 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-01-31 17:17:40,901 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][117], [451#(= ~counter~0 2), Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), 20#L99-1true, Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), 88#true, 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 659#(<= (+ ~i2~0 1) ~N2~0), Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 805#(< (+ ~i2~0 1) ~N2~0), 109#true, Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 1145#(and (<= ~i1~0 1) (<= 0 ~j1~0) (= ~M1~0 ~N1~0) (or (< (+ ~i1~0 1) ~N1~0) (< ~M1~0 (+ 2 ~j1~0)))), Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 449#(= ~counter~0 0), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), 95#true, Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 19#L64true, 8#L52true, Black: 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 188#(<= ~counter~0 1), 140#true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 53#(= ~counter~0 0), 35#L75true, 13#L41true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:40,902 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is not cut-off event [2024-01-31 17:17:40,902 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-01-31 17:17:40,902 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-01-31 17:17:40,902 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-01-31 17:17:41,001 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][183], [Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), 20#L99-1true, Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 88#true, Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 805#(< (+ ~i2~0 1) ~N2~0), 109#true, Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), 95#true, Black: 449#(= ~counter~0 0), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 450#(= ~counter~0 1), Black: 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 659#(<= (+ ~i2~0 1) ~N2~0), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 19#L64true, 188#(<= ~counter~0 1), 8#L52true, 911#true, Black: 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 25#L44true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 53#(= ~counter~0 0), 35#L75true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:41,002 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-01-31 17:17:41,002 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-01-31 17:17:41,002 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-31 17:17:41,002 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-01-31 17:17:41,051 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][203], [451#(= ~counter~0 2), Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), 88#true, Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 805#(< (+ ~i2~0 1) ~N2~0), 109#true, Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 449#(= ~counter~0 0), 95#true, Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 659#(<= (+ ~i2~0 1) ~N2~0), 1093#(or (< ~M1~0 (+ 2 ~j1~0)) (< ~i1~0 ~N1~0)), 19#L64true, 8#L52true, Black: 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 16#L98-4true, Black: 188#(<= ~counter~0 1), 25#L44true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 140#true, Black: 53#(= ~counter~0 0), 35#L75true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:41,051 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-01-31 17:17:41,051 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-31 17:17:41,051 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-31 17:17:41,052 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-31 17:17:41,459 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][183], [Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 659#(<= (+ ~i2~0 1) ~N2~0), Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 91#(<= ~N1~0 ~i1~0), Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 109#true, Black: 805#(< (+ ~i2~0 1) ~N2~0), Black: 449#(= ~counter~0 0), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 58#(<= ~N1~0 ~i1~0), 19#L64true, 8#L52true, 911#true, 447#true, 6#L100-1true, 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 188#(<= ~counter~0 1), 140#true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 53#(= ~counter~0 0), 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 35#L75true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-31 17:17:41,459 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-01-31 17:17:41,459 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-31 17:17:41,459 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-31 17:17:41,460 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-31 17:17:41,460 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][183], [Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 659#(<= (+ ~i2~0 1) ~N2~0), Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 91#(<= ~N1~0 ~i1~0), Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 805#(< (+ ~i2~0 1) ~N2~0), 109#true, Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 449#(= ~counter~0 0), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), 95#true, Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 19#L64true, 58#(<= ~N1~0 ~i1~0), 8#L52true, 911#true, Black: 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 447#true, 6#L100-1true, Black: 188#(<= ~counter~0 1), 140#true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 53#(= ~counter~0 0), 35#L75true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-31 17:17:41,460 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-01-31 17:17:41,460 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-31 17:17:41,460 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-31 17:17:41,461 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-31 17:17:41,612 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][203], [451#(= ~counter~0 2), Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), 20#L99-1true, Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), 88#true, Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 805#(< (+ ~i2~0 1) ~N2~0), 109#true, Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 95#true, Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 449#(= ~counter~0 0), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 659#(<= (+ ~i2~0 1) ~N2~0), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 1093#(or (< ~M1~0 (+ 2 ~j1~0)) (< ~i1~0 ~N1~0)), 19#L64true, 8#L52true, Black: 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 188#(<= ~counter~0 1), 25#L44true, 140#true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 53#(= ~counter~0 0), 35#L75true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0)), 55#true]) [2024-01-31 17:17:41,612 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-01-31 17:17:41,612 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-31 17:17:41,612 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-31 17:17:41,613 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-31 17:17:42,950 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][183], [Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 91#(<= ~N1~0 ~i1~0), Black: 805#(< (+ ~i2~0 1) ~N2~0), Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), 109#true, Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 95#true, Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 449#(= ~counter~0 0), Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 450#(= ~counter~0 1), Black: 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 659#(<= (+ ~i2~0 1) ~N2~0), 58#(<= ~N1~0 ~i1~0), 19#L64true, 188#(<= ~counter~0 1), 8#L52true, 911#true, Black: 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 6#L100-1true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 53#(= ~counter~0 0), 35#L75true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-31 17:17:42,951 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2024-01-31 17:17:42,951 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-01-31 17:17:42,951 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-01-31 17:17:42,951 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-01-31 17:17:43,070 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][183], [451#(= ~counter~0 2), Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), 91#(<= ~N1~0 ~i1~0), Black: 805#(< (+ ~i2~0 1) ~N2~0), 109#true, Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 449#(= ~counter~0 0), 95#true, Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 659#(<= (+ ~i2~0 1) ~N2~0), 58#(<= ~N1~0 ~i1~0), 19#L64true, 8#L52true, 911#true, Black: 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 14#L99-2true, Black: 188#(<= ~counter~0 1), 140#true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 53#(= ~counter~0 0), 35#L75true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-31 17:17:43,070 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is not cut-off event [2024-01-31 17:17:43,070 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2024-01-31 17:17:43,070 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2024-01-31 17:17:43,071 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2024-01-31 17:17:43,465 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] 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[][183], [451#(= ~counter~0 2), Black: 128#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 654#true, Black: 846#(or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0)), Black: 65#(and (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 878#(and (<= 0 ~i1~0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 892#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 68#(and (<= 1 ~M1~0) (= ~j1~0 0) (<= ~N1~0 (+ ~M1~0 ~i1~0))), Black: 888#(and (<= 2 ~N2~0) (<= ~i2~0 1) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 890#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 137#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 898#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 2 ~N2~0) (<= ~i2~0 1)), 91#(<= ~N1~0 ~i1~0), Black: 805#(< (+ ~i2~0 1) ~N2~0), 109#true, Black: 134#(and (<= (+ ~N2~0 ~i1~0) ~N1~0) (= ~i2~0 0)), Black: 894#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 842#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 449#(= ~counter~0 0), 95#true, Black: 73#(and (<= (+ ~M1~0 ~i1~0) ~N1~0) (= ~j1~0 0)), Black: 882#(and (<= 1 ~N2~0) (= ~i2~0 0) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 85#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 82#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 659#(<= (+ ~i2~0 1) ~N2~0), 19#L64true, 58#(<= ~N1~0 ~i1~0), 8#L52true, 911#true, Black: 97#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 6#L100-1true, Black: 188#(<= ~counter~0 1), 140#true, Black: 111#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 53#(= ~counter~0 0), 35#L75true, Black: 119#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 60#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0) (<= ~N1~0 ~i1~0)), Black: 57#(and (<= ~N1~0 (+ ~N2~0 ~i1~0)) (= ~i2~0 0))]) [2024-01-31 17:17:43,465 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is not cut-off event [2024-01-31 17:17:43,466 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2024-01-31 17:17:43,466 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2024-01-31 17:17:43,466 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2024-01-31 17:17:43,545 INFO L124 PetriNetUnfolderBase]: 94315/133919 cut-off events. [2024-01-31 17:17:43,546 INFO L125 PetriNetUnfolderBase]: For 1257747/1263414 co-relation queries the response was YES. [2024-01-31 17:17:44,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 744977 conditions, 133919 events. 94315/133919 cut-off events. For 1257747/1263414 co-relation queries the response was YES. Maximal size of possible extension queue 6599. Compared 1031758 event pairs, 14202 based on Foata normal form. 5937/133774 useless extension candidates. Maximal degree in co-relation 613089. Up to 34099 conditions per place. [2024-01-31 17:17:45,031 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 670 selfloop transitions, 191 changer transitions 46/922 dead transitions. [2024-01-31 17:17:45,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 922 transitions, 11916 flow [2024-01-31 17:17:45,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-01-31 17:17:45,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-01-31 17:17:45,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 455 transitions. [2024-01-31 17:17:45,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2024-01-31 17:17:45,033 INFO L175 Difference]: Start difference. First operand has 109 places, 203 transitions, 2428 flow. Second operand 18 states and 455 transitions. [2024-01-31 17:17:45,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 922 transitions, 11916 flow [2024-01-31 17:17:51,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 922 transitions, 11170 flow, removed 351 selfloop flow, removed 2 redundant places. [2024-01-31 17:17:51,343 INFO L231 Difference]: Finished difference. Result has 133 places, 394 transitions, 5027 flow [2024-01-31 17:17:51,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2254, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=5027, PETRI_PLACES=133, PETRI_TRANSITIONS=394} [2024-01-31 17:17:51,344 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 90 predicate places. [2024-01-31 17:17:51,344 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 394 transitions, 5027 flow [2024-01-31 17:17:51,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 16.076923076923077) internal successors, (209), 13 states have internal predecessors, (209), 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-01-31 17:17:51,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:17:51,344 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, 1, 1] [2024-01-31 17:17:51,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-01-31 17:17:51,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-01-31 17:17:51,555 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 17:17:51,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:17:51,556 INFO L85 PathProgramCache]: Analyzing trace with hash 740188622, now seen corresponding path program 5 times [2024-01-31 17:17:51,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:17:51,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191829215] [2024-01-31 17:17:51,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:17:51,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:17:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:17:51,632 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-31 17:17:51,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:17:51,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191829215] [2024-01-31 17:17:51,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191829215] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 17:17:51,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183217277] [2024-01-31 17:17:51,633 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-31 17:17:51,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:17:51,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:17:51,636 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-31 17:17:51,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-01-31 17:17:51,748 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-01-31 17:17:51,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-31 17:17:51,750 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-31 17:17:51,752 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 17:17:51,840 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-31 17:17:51,841 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 17:17:51,913 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-31 17:17:51,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183217277] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 17:17:51,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 17:17:51,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 11 [2024-01-31 17:17:51,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894179152] [2024-01-31 17:17:51,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 17:17:51,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-01-31 17:17:51,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:17:51,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-01-31 17:17:51,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-01-31 17:17:51,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-01-31 17:17:51,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 394 transitions, 5027 flow. Second operand has 12 states, 12 states have (on average 15.833333333333334) internal successors, (190), 12 states have internal predecessors, (190), 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-01-31 17:17:51,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:17:51,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-01-31 17:17:51,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand