Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r508-tall-171654350700029.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is MultiCrashLeafsetExtension-PT-S16C05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654350700029
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 18K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 05:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 12 05:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 05:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 12 05:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.6M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717195427244

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:43:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 22:43:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:43:48] [INFO ] Load time of PNML (sax parser for PT used): 350 ms
[2024-05-31 22:43:48] [INFO ] Transformed 4914 places.
[2024-05-31 22:43:48] [INFO ] Transformed 6913 transitions.
[2024-05-31 22:43:48] [INFO ] Parsed PT model containing 4914 places and 6913 transitions and 26710 arcs in 493 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 22:43:49] [INFO ] Flow matrix only has 6641 transitions (discarded 272 similar events)
// Phase 1: matrix 6641 rows 4914 cols
[2024-05-31 22:43:49] [INFO ] Computed 535 invariants in 389 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 17, 51, 51, 1, 17, 1, 51, 1, 51, 17, 17, 17, 51, 17, 17]
RANDOM walk for 10000 steps (192 resets) in 124 ms. (80 steps per ms)
BEST_FIRST walk for 160010 steps (800 resets) in 513 ms. (311 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1] Max Struct:[2, 17, 51, 51, 1, 17, 1, 51, 1, 51, 17, 17, 17, 51, 17, 17]
[2024-05-31 22:43:50] [INFO ] Flow matrix only has 6641 transitions (discarded 272 similar events)
[2024-05-31 22:43:50] [INFO ] Invariant cache hit.
[2024-05-31 22:43:50] [INFO ] [Real]Absence check using 48 positive place invariants in 94 ms returned sat
[2024-05-31 22:43:51] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 143 ms returned unsat
[2024-05-31 22:43:51] [INFO ] [Real]Absence check using 48 positive place invariants in 63 ms returned sat
[2024-05-31 22:43:51] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 42 ms returned unsat
[2024-05-31 22:43:52] [INFO ] [Real]Absence check using 48 positive place invariants in 64 ms returned sat
[2024-05-31 22:43:52] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 158 ms returned unsat
[2024-05-31 22:43:52] [INFO ] [Real]Absence check using 48 positive place invariants in 65 ms returned sat
[2024-05-31 22:43:53] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 179 ms returned sat
[2024-05-31 22:43:56] [INFO ] [Real]Absence check using state equation in 3595 ms returned sat
[2024-05-31 22:43:57] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-31 22:43:57] [INFO ] [Real]Added 1906 Read/Feed constraints in 306 ms returned sat
[2024-05-31 22:43:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:43:57] [INFO ] [Nat]Absence check using 48 positive place invariants in 65 ms returned sat
[2024-05-31 22:43:58] [INFO ] [Nat]Absence check using 48 positive and 487 generalized place invariants in 152 ms returned sat
[2024-05-31 22:44:01] [INFO ] [Nat]Absence check using state equation in 3603 ms returned sat
[2024-05-31 22:44:02] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 22:44:02] [INFO ] [Nat]Added 1906 Read/Feed constraints in 778 ms returned unknown
[2024-05-31 22:44:03] [INFO ] [Real]Absence check using 48 positive place invariants in 62 ms returned sat
[2024-05-31 22:44:03] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 164 ms returned sat
[2024-05-31 22:44:05] [INFO ] [Real]Absence check using state equation in 2093 ms returned sat
[2024-05-31 22:44:05] [INFO ] [Real]Added 1906 Read/Feed constraints in 154 ms returned sat
[2024-05-31 22:44:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:44:06] [INFO ] [Nat]Absence check using 48 positive place invariants in 65 ms returned sat
[2024-05-31 22:44:06] [INFO ] [Nat]Absence check using 48 positive and 487 generalized place invariants in 172 ms returned sat
[2024-05-31 22:44:08] [INFO ] [Nat]Absence check using state equation in 2037 ms returned sat
[2024-05-31 22:44:08] [INFO ] [Nat]Added 1906 Read/Feed constraints in 344 ms returned sat
[2024-05-31 22:44:14] [INFO ] Deduced a trap composed of 782 places in 5024 ms of which 235 ms to minimize.
[2024-05-31 22:44:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 22:44:14] [INFO ] [Real]Absence check using 48 positive place invariants in 79 ms returned sat
[2024-05-31 22:44:14] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 42 ms returned unsat
[2024-05-31 22:44:15] [INFO ] [Real]Absence check using 48 positive place invariants in 75 ms returned sat
[2024-05-31 22:44:15] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 164 ms returned sat
[2024-05-31 22:44:19] [INFO ] [Real]Absence check using state equation in 4333 ms returned sat
[2024-05-31 22:44:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 22:44:20] [INFO ] [Real]Absence check using 48 positive place invariants in 67 ms returned sat
[2024-05-31 22:44:20] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 172 ms returned sat
[2024-05-31 22:44:24] [INFO ] [Real]Absence check using state equation in 3777 ms returned sat
[2024-05-31 22:44:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:44:24] [INFO ] [Nat]Absence check using 48 positive place invariants in 63 ms returned sat
[2024-05-31 22:44:24] [INFO ] [Nat]Absence check using 48 positive and 487 generalized place invariants in 166 ms returned sat
[2024-05-31 22:44:28] [INFO ] [Nat]Absence check using state equation in 3860 ms returned sat
[2024-05-31 22:44:29] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 22:44:29] [INFO ] [Nat]Added 1906 Read/Feed constraints in 512 ms returned unknown
[2024-05-31 22:44:29] [INFO ] [Real]Absence check using 48 positive place invariants in 62 ms returned sat
[2024-05-31 22:44:30] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 160 ms returned sat
[2024-05-31 22:44:33] [INFO ] [Real]Absence check using state equation in 3292 ms returned sat
[2024-05-31 22:44:34] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 22:44:34] [INFO ] [Real]Added 1906 Read/Feed constraints in 662 ms returned unsat
[2024-05-31 22:44:34] [INFO ] [Real]Absence check using 48 positive place invariants in 67 ms returned sat
[2024-05-31 22:44:34] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 164 ms returned sat
[2024-05-31 22:44:38] [INFO ] [Real]Absence check using state equation in 3734 ms returned sat
[2024-05-31 22:44:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:44:39] [INFO ] [Nat]Absence check using 48 positive place invariants in 65 ms returned sat
[2024-05-31 22:44:39] [INFO ] [Nat]Absence check using 48 positive and 487 generalized place invariants in 138 ms returned sat
[2024-05-31 22:44:43] [INFO ] [Nat]Absence check using state equation in 3688 ms returned sat
[2024-05-31 22:44:43] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 22:44:43] [INFO ] [Nat]Added 1906 Read/Feed constraints in 688 ms returned unknown
[2024-05-31 22:44:44] [INFO ] [Real]Absence check using 48 positive place invariants in 63 ms returned sat
[2024-05-31 22:44:44] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 153 ms returned sat
[2024-05-31 22:44:48] [INFO ] [Real]Absence check using state equation in 3915 ms returned sat
[2024-05-31 22:44:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:44:49] [INFO ] [Nat]Absence check using 48 positive place invariants in 63 ms returned sat
[2024-05-31 22:44:49] [INFO ] [Nat]Absence check using 48 positive and 487 generalized place invariants in 177 ms returned sat
[2024-05-31 22:44:53] [INFO ] [Nat]Absence check using state equation in 4020 ms returned sat
[2024-05-31 22:44:53] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 22:44:53] [INFO ] [Nat]Added 1906 Read/Feed constraints in 352 ms returned unknown
[2024-05-31 22:44:54] [INFO ] [Real]Absence check using 48 positive place invariants in 61 ms returned sat
[2024-05-31 22:44:54] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 43 ms returned unsat
[2024-05-31 22:44:54] [INFO ] [Real]Absence check using 48 positive place invariants in 61 ms returned sat
[2024-05-31 22:44:54] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 135 ms returned unsat
[2024-05-31 22:44:55] [INFO ] [Real]Absence check using 48 positive place invariants in 61 ms returned sat
[2024-05-31 22:44:55] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 149 ms returned sat
[2024-05-31 22:44:59] [INFO ] [Real]Absence check using state equation in 3585 ms returned sat
[2024-05-31 22:44:59] [INFO ] [Real]Added 1906 Read/Feed constraints in 150 ms returned sat
[2024-05-31 22:44:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:45:00] [INFO ] [Nat]Absence check using 48 positive place invariants in 63 ms returned sat
[2024-05-31 22:45:00] [INFO ] [Nat]Absence check using 48 positive and 487 generalized place invariants in 166 ms returned sat
[2024-05-31 22:45:04] [INFO ] [Nat]Absence check using state equation in 3800 ms returned sat
[2024-05-31 22:45:04] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 22:45:04] [INFO ] [Nat]Added 1906 Read/Feed constraints in 519 ms returned unknown
[2024-05-31 22:45:05] [INFO ] [Real]Absence check using 48 positive place invariants in 62 ms returned sat
[2024-05-31 22:45:05] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 44 ms returned unsat
[2024-05-31 22:45:05] [INFO ] [Real]Absence check using 48 positive place invariants in 64 ms returned sat
[2024-05-31 22:45:05] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 44 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1] Max Struct:[1, 1, 1, 51, 1, 1, 1, 51, 0, 51, 17, 1, 1, 51, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[51, 1, 1, 51, 51, 17, 51]
Support contains 7 out of 4914 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4914/4914 places, 6913/6913 transitions.
Graph (complete) has 15675 edges and 4914 vertex of which 4884 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.17 ms
Discarding 30 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1355 transitions
Trivial Post-agglo rules discarded 1355 transitions
Performed 1355 trivial Post agglomeration. Transition count delta: 1355
Iterating post reduction 0 with 1355 rules applied. Total rules applied 1356 place count 4884 transition count 5558
Reduce places removed 1355 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 1359 rules applied. Total rules applied 2715 place count 3529 transition count 5554
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 2719 place count 3525 transition count 5554
Performed 170 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 170 Pre rules applied. Total rules applied 2719 place count 3525 transition count 5384
Deduced a syphon composed of 170 places in 5 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 3 with 340 rules applied. Total rules applied 3059 place count 3355 transition count 5384
Discarding 1185 places :
Symmetric choice reduction at 3 with 1185 rule applications. Total rules 4244 place count 2170 transition count 4199
Iterating global reduction 3 with 1185 rules applied. Total rules applied 5429 place count 2170 transition count 4199
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 5429 place count 2170 transition count 4191
Deduced a syphon composed of 8 places in 6 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 5445 place count 2162 transition count 4191
Discarding 233 places :
Symmetric choice reduction at 3 with 233 rule applications. Total rules 5678 place count 1929 transition count 3026
Iterating global reduction 3 with 233 rules applied. Total rules applied 5911 place count 1929 transition count 3026
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 5945 place count 1912 transition count 3009
Free-agglomeration rule (complex) applied 165 times.
Iterating global reduction 3 with 165 rules applied. Total rules applied 6110 place count 1912 transition count 3776
Reduce places removed 165 places and 0 transitions.
Iterating post reduction 3 with 165 rules applied. Total rules applied 6275 place count 1747 transition count 3776
Partial Free-agglomeration rule applied 34 times.
Drop transitions (Partial Free agglomeration) removed 34 transitions
Iterating global reduction 4 with 34 rules applied. Total rules applied 6309 place count 1747 transition count 3776
Applied a total of 6309 rules in 1681 ms. Remains 1747 /4914 variables (removed 3167) and now considering 3776/6913 (removed 3137) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1691 ms. Remains : 1747/4914 places, 3776/6913 transitions.
[2024-05-31 22:45:07] [INFO ] Flow matrix only has 3378 transitions (discarded 398 similar events)
// Phase 1: matrix 3378 rows 1747 cols
[2024-05-31 22:45:07] [INFO ] Computed 505 invariants in 67 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 1, 1, 2, 2, 1, 2]
RANDOM walk for 1000000 steps (31861 resets) in 14699 ms. (68 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 6000004 steps (34014 resets) in 18797 ms. (319 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 1, 1, 1] Max Struct:[2, 1, 1, 2, 2, 2]
[2024-05-31 22:45:40] [INFO ] Flow matrix only has 3378 transitions (discarded 398 similar events)
[2024-05-31 22:45:40] [INFO ] Invariant cache hit.
[2024-05-31 22:45:41] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2024-05-31 22:45:41] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 36 ms returned unsat
[2024-05-31 22:45:41] [INFO ] [Real]Absence check using 33 positive place invariants in 30 ms returned sat
[2024-05-31 22:45:41] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 73 ms returned sat
[2024-05-31 22:45:42] [INFO ] [Real]Absence check using state equation in 941 ms returned sat
[2024-05-31 22:45:42] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-31 22:45:42] [INFO ] [Real]Added 1906 Read/Feed constraints in 379 ms returned sat
[2024-05-31 22:45:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:45:43] [INFO ] [Nat]Absence check using 33 positive place invariants in 38 ms returned sat
[2024-05-31 22:45:43] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 72 ms returned sat
[2024-05-31 22:45:44] [INFO ] [Nat]Absence check using state equation in 931 ms returned sat
[2024-05-31 22:45:45] [INFO ] [Nat]Added 1906 Read/Feed constraints in 1335 ms returned sat
[2024-05-31 22:45:46] [INFO ] Deduced a trap composed of 195 places in 1318 ms of which 12 ms to minimize.
[2024-05-31 22:45:48] [INFO ] Deduced a trap composed of 377 places in 1164 ms of which 13 ms to minimize.
[2024-05-31 22:45:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2788 ms
[2024-05-31 22:45:48] [INFO ] Computed and/alt/rep : 1580/3623/1580 causal constraints (skipped 1781 transitions) in 304 ms.
[2024-05-31 22:45:50] [INFO ] Added : 26 causal constraints over 7 iterations in 1951 ms. Result :sat
Minimization took 5845 ms.
[2024-05-31 22:45:56] [INFO ] [Real]Absence check using 33 positive place invariants in 30 ms returned sat
[2024-05-31 22:45:56] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 75 ms returned sat
[2024-05-31 22:45:57] [INFO ] [Real]Absence check using state equation in 988 ms returned sat
[2024-05-31 22:45:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:45:57] [INFO ] [Nat]Absence check using 33 positive place invariants in 34 ms returned sat
[2024-05-31 22:45:57] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 72 ms returned sat
[2024-05-31 22:45:58] [INFO ] [Nat]Absence check using state equation in 997 ms returned sat
[2024-05-31 22:46:00] [INFO ] [Nat]Added 1906 Read/Feed constraints in 1266 ms returned sat
[2024-05-31 22:46:01] [INFO ] Deduced a trap composed of 318 places in 1185 ms of which 11 ms to minimize.
[2024-05-31 22:46:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1390 ms
[2024-05-31 22:46:01] [INFO ] Computed and/alt/rep : 1580/3623/1580 causal constraints (skipped 1781 transitions) in 264 ms.
[2024-05-31 22:46:02] [INFO ] Added : 13 causal constraints over 3 iterations in 1142 ms. Result :sat
Minimization took 5808 ms.
[2024-05-31 22:46:08] [INFO ] [Real]Absence check using 33 positive place invariants in 30 ms returned sat
[2024-05-31 22:46:08] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 68 ms returned unsat
[2024-05-31 22:46:08] [INFO ] [Real]Absence check using 33 positive place invariants in 32 ms returned sat
[2024-05-31 22:46:08] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 54 ms returned unsat
[2024-05-31 22:46:09] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2024-05-31 22:46:09] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 1 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 1, 1, 1] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 1747 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1747/1747 places, 3776/3776 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1747 transition count 3775
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1746 transition count 3775
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1746 transition count 3773
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 1744 transition count 3773
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 11 place count 1739 transition count 3768
Iterating global reduction 3 with 5 rules applied. Total rules applied 16 place count 1739 transition count 3768
Applied a total of 16 rules in 301 ms. Remains 1739 /1747 variables (removed 8) and now considering 3768/3776 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 301 ms. Remains : 1739/1747 places, 3768/3776 transitions.
[2024-05-31 22:46:09] [INFO ] Flow matrix only has 3370 transitions (discarded 398 similar events)
// Phase 1: matrix 3370 rows 1739 cols
[2024-05-31 22:46:09] [INFO ] Computed 505 invariants in 38 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (31859 resets) in 13566 ms. (73 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (5669 resets) in 3036 ms. (329 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:46:26] [INFO ] Flow matrix only has 3370 transitions (discarded 398 similar events)
[2024-05-31 22:46:26] [INFO ] Invariant cache hit.
[2024-05-31 22:46:26] [INFO ] [Real]Absence check using 33 positive place invariants in 34 ms returned sat
[2024-05-31 22:46:26] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 86 ms returned sat
[2024-05-31 22:46:27] [INFO ] [Real]Absence check using state equation in 869 ms returned sat
[2024-05-31 22:46:27] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-31 22:46:27] [INFO ] [Real]Added 1906 Read/Feed constraints in 278 ms returned sat
[2024-05-31 22:46:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:46:27] [INFO ] [Nat]Absence check using 33 positive place invariants in 30 ms returned sat
[2024-05-31 22:46:27] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 80 ms returned sat
[2024-05-31 22:46:28] [INFO ] [Nat]Absence check using state equation in 860 ms returned sat
[2024-05-31 22:46:30] [INFO ] [Nat]Added 1906 Read/Feed constraints in 1744 ms returned sat
[2024-05-31 22:46:31] [INFO ] Deduced a trap composed of 367 places in 1151 ms of which 11 ms to minimize.
[2024-05-31 22:46:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1353 ms
[2024-05-31 22:46:32] [INFO ] Computed and/alt/rep : 1574/3612/1574 causal constraints (skipped 1779 transitions) in 196 ms.
[2024-05-31 22:46:34] [INFO ] Added : 30 causal constraints over 9 iterations in 2368 ms. Result :sat
Minimization took 5750 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 1739 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node3ThinksNode11ShouldBeNodeMasterToReplaceNode9) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 1739/1739 places, 3766/3766 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1738 transition count 3764
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1737 transition count 3762
Applied a total of 2 rules in 118 ms. Remains 1737 /1739 variables (removed 2) and now considering 3762/3766 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 1737/1739 places, 3762/3766 transitions.
[2024-05-31 22:46:40] [INFO ] Flow matrix only has 3364 transitions (discarded 398 similar events)
// Phase 1: matrix 3364 rows 1737 cols
[2024-05-31 22:46:40] [INFO ] Computed 505 invariants in 37 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (31862 resets) in 13619 ms. (73 steps per ms)
BEST_FIRST walk for 1000001 steps (5669 resets) in 3054 ms. (327 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:46:56] [INFO ] Flow matrix only has 3364 transitions (discarded 398 similar events)
[2024-05-31 22:46:56] [INFO ] Invariant cache hit.
[2024-05-31 22:46:57] [INFO ] [Real]Absence check using 33 positive place invariants in 36 ms returned sat
[2024-05-31 22:46:57] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 79 ms returned sat
[2024-05-31 22:46:57] [INFO ] [Real]Absence check using state equation in 814 ms returned sat
[2024-05-31 22:46:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:46:58] [INFO ] [Nat]Absence check using 33 positive place invariants in 37 ms returned sat
[2024-05-31 22:46:58] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 79 ms returned sat
[2024-05-31 22:46:59] [INFO ] [Nat]Absence check using state equation in 842 ms returned sat
[2024-05-31 22:46:59] [INFO ] State equation strengthened by 1903 read => feed constraints.
[2024-05-31 22:47:00] [INFO ] [Nat]Added 1903 Read/Feed constraints in 1341 ms returned sat
[2024-05-31 22:47:01] [INFO ] Deduced a trap composed of 221 places in 1300 ms of which 11 ms to minimize.
[2024-05-31 22:47:03] [INFO ] Deduced a trap composed of 366 places in 1208 ms of which 11 ms to minimize.
[2024-05-31 22:47:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2813 ms
[2024-05-31 22:47:03] [INFO ] Computed and/alt/rep : 1568/3603/1568 causal constraints (skipped 1779 transitions) in 195 ms.
[2024-05-31 22:47:04] [INFO ] Added : 15 causal constraints over 3 iterations in 1016 ms. Result :sat
Minimization took 5150 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 1737 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1737/1737 places, 3762/3762 transitions.
Applied a total of 0 rules in 101 ms. Remains 1737 /1737 variables (removed 0) and now considering 3762/3762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 1737/1737 places, 3762/3762 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1737/1737 places, 3762/3762 transitions.
Applied a total of 0 rules in 92 ms. Remains 1737 /1737 variables (removed 0) and now considering 3762/3762 (removed 0) transitions.
[2024-05-31 22:47:09] [INFO ] Flow matrix only has 3364 transitions (discarded 398 similar events)
[2024-05-31 22:47:09] [INFO ] Invariant cache hit.
[2024-05-31 22:47:12] [INFO ] Implicit Places using invariants in 3184 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 18, 24, 32, 42, 54, 68, 83, 97, 98, 99, 100, 101, 102, 114, 124, 132, 138, 142, 144, 157, 163, 165, 166, 167, 168, 169, 170, 172, 176, 182, 190, 200, 212, 225, 237, 238, 239, 240, 241, 242, 252, 260, 266, 270, 272, 274, 287, 293, 295, 296, 297, 298, 299, 300, 302, 304, 308, 314, 322, 332, 343, 353, 354, 355, 356, 357, 358, 366, 372, 376, 378, 380, 382, 395, 401, 403, 404, 405, 406, 407, 408, 410, 412, 414, 418, 424, 432, 441, 447, 448, 449, 450, 451, 452, 458, 462, 464, 466, 468, 470, 483, 489, 491, 492, 493, 494, 495, 496, 498, 500, 502, 504, 508, 514, 521, 527, 528, 529, 530, 531, 532, 536, 538, 540, 542, 544, 546, 559, 565, 567, 568, 569, 570, 571, 572, 574, 576, 578, 580, 582, 586, 591, 595, 596, 597, 598, 599, 600, 602, 604, 606, 608, 610, 612, 625, 631, 633, 634, 635, 636, 637, 638, 640, 642, 644, 646, 648, 650, 653, 655, 656, 657, 658, 659, 660, 662, 664, 666, 668, 670, 672, 685, 691, 693, 694, 695, 696, 697, 698, 700, 702, 704, 706, 708, 710, 712, 714, 715, 716, 717, 718, 719, 721, 723, 725, 727, 729, 731, 744, 746, 749, 751, 752, 753, 754, 755, 756, 758, 760, 762, 764, 766, 768, 770, 772, 773, 774, 775, 776, 777, 779, 781, 783, 785, 787, 789, 802, 808, 810, 811, 812, 813, 814, 815, 817, 819, 821, 823, 825, 827, 829, 831, 832, 833, 834, 835, 836, 838, 840, 842, 844, 846, 848, 861, 867, 869, 870, 871, 872, 873, 874, 876, 878, 880, 882, 884, 886, 888, 891, 892, 893, 894, 895, 896, 898, 900, 902, 904, 906, 908, 921, 927, 929, 930, 931, 932, 933, 934, 936, 938, 940, 942, 944, 946, 950, 955, 956, 957, 958, 959, 960, 964, 966, 968, 970, 972, 974, 987, 993, 995, 996, 997, 998, 999, 1000, 1002, 1004, 1006, 1008, 1010, 1014, 1020, 1027, 1028, 1029, 1030, 1031, 1032, 1038, 1042, 1044, 1046, 1048, 1050, 1063, 1069, 1071, 1072, 1073, 1074, 1075, 1076, 1078, 1080, 1082, 1084, 1088, 1094, 1102, 1111, 1112, 1113, 1114, 1115, 1116, 1124, 1130, 1134, 1136, 1138, 1140, 1153, 1159, 1161, 1162, 1163, 1164, 1165, 1166, 1168, 1170, 1172, 1176, 1182, 1190, 1200, 1211, 1212, 1213, 1214, 1215, 1216, 1226, 1234, 1240, 1244, 1246, 1248, 1261, 1267, 1269, 1270, 1271, 1272, 1273, 1274, 1276, 1278, 1282, 1288, 1296, 1306, 1318, 1331, 1332, 1333, 1334, 1335, 1336, 1348, 1358, 1366, 1372, 1376, 1378, 1391, 1393, 1396, 1398, 1399, 1400, 1401, 1402, 1403, 1405, 1409, 1415, 1423, 1433, 1445, 1459, 1474, 1475, 1476, 1477, 1478, 1479, 1493, 1505, 1515, 1523, 1529, 1533, 1546]
[2024-05-31 22:47:12] [INFO ] Actually due to overlaps returned [157, 287, 395, 483, 559, 625, 685, 744, 802, 861, 921, 987, 1063, 1153, 1261, 1391, 1546, 4, 9, 10, 11, 12, 13, 97, 98, 99, 100, 101, 165, 166, 167, 168, 169, 237, 238, 239, 240, 241, 295, 296, 297, 298, 299, 353, 354, 355, 356, 357, 403, 404, 405, 406, 407, 447, 448, 449, 450, 451, 491, 492, 493, 494, 495, 527, 528, 529, 530, 531, 567, 568, 569, 570, 571, 595, 596, 597, 598, 599, 633, 634, 635, 636, 637, 655, 656, 657, 658, 659, 693, 694, 695, 696, 697, 714, 715, 716, 717, 718, 746, 751, 752, 753, 754, 755, 772, 773, 774, 775, 776, 810, 811, 812, 813, 814, 831, 832, 833, 834, 835, 869, 870, 871, 872, 873, 891, 892, 893, 894, 895, 929, 930, 931, 932, 933, 955, 956, 957, 958, 959, 995, 996, 997, 998, 999, 1027, 1028, 1029, 1030, 1031, 1071, 1072, 1073, 1074, 1075, 1111, 1112, 1113, 1114, 1115, 1161, 1162, 1163, 1164, 1165, 1211, 1212, 1213, 1214, 1215, 1269, 1270, 1271, 1272, 1273, 1331, 1332, 1333, 1334, 1335, 1393, 1398, 1399, 1400, 1401, 1402, 1474, 1475, 1476, 1477, 1478]
Discarding 190 places :
Implicit Place search using SMT only with invariants took 3197 ms to find 190 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1547/1737 places, 3762/3762 transitions.
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 160 place count 1387 transition count 3602
Iterating global reduction 0 with 160 rules applied. Total rules applied 320 place count 1387 transition count 3602
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 480 place count 1227 transition count 3442
Iterating global reduction 0 with 160 rules applied. Total rules applied 640 place count 1227 transition count 3442
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 643 place count 1227 transition count 3439
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 646 place count 1224 transition count 3439
Applied a total of 646 rules in 223 ms. Remains 1224 /1547 variables (removed 323) and now considering 3439/3762 (removed 323) transitions.
[2024-05-31 22:47:13] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
// Phase 1: matrix 3041 rows 1224 cols
[2024-05-31 22:47:13] [INFO ] Computed 315 invariants in 30 ms
[2024-05-31 22:47:15] [INFO ] Implicit Places using invariants in 2008 ms returned [6, 8, 12, 18, 26, 36, 48, 62, 77, 91, 103, 113, 121, 127, 131, 133, 150, 152, 154, 158, 164, 172, 182, 194, 207, 219, 229, 237, 243, 247, 249, 251, 259, 261, 263, 265, 269, 275, 283, 293, 304, 314, 322, 328, 332, 334, 336, 338, 346, 348, 350, 352, 354, 358, 364, 372, 381, 387, 393, 397, 399, 401, 403, 405, 413, 415, 417, 419, 421, 423, 427, 433, 440, 446, 450, 452, 454, 456, 458, 460, 468, 470, 472, 474, 476, 478, 480, 484, 489, 493, 495, 497, 499, 501, 503, 505, 513, 515, 517, 519, 521, 523, 525, 527, 530, 532, 534, 536, 538, 540, 542, 544, 552, 554, 556, 558, 560, 562, 564, 566, 568, 570, 572, 574, 576, 578, 580, 582, 588, 590, 592, 594, 596, 598, 600, 602, 604, 606, 608, 610, 612, 614, 616, 618, 625, 627, 629, 631, 633, 635, 637, 639, 641, 643, 645, 647, 649, 651, 653, 655, 663, 665, 667, 669, 671, 673, 675, 677, 679, 682, 684, 686, 688, 690, 692, 694, 702, 704, 706, 708, 710, 712, 714, 716, 720, 725, 729, 731, 733, 735, 737, 739, 747, 749, 751, 753, 755, 757, 759, 763, 769, 776, 782, 786, 788, 790, 792, 794, 802, 804, 806, 808, 810, 812, 816, 822, 830, 839, 847, 853, 857, 859, 861, 863, 871, 873, 875, 877, 879, 883, 889, 897, 907, 918, 928, 936, 942, 946, 948, 950, 958, 960, 962, 964, 968, 974, 982, 992, 1004, 1017, 1029, 1039, 1047, 1053, 1057, 1059, 1065, 1067, 1069, 1073, 1079, 1087, 1097, 1109, 1123, 1138, 1152, 1164, 1174, 1182, 1188, 1192]
Discarding 272 places :
Implicit Place search using SMT only with invariants took 2016 ms to find 272 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 952/1737 places, 3439/3762 transitions.
Applied a total of 0 rules in 80 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5611 ms. Remains : 952/1737 places, 3439/3762 transitions.
[2024-05-31 22:47:15] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
// Phase 1: matrix 3041 rows 952 cols
[2024-05-31 22:47:15] [INFO ] Computed 43 invariants in 26 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (34068 resets) in 13130 ms. (76 steps per ms)
BEST_FIRST walk for 1000001 steps (4023 resets) in 2134 ms. (468 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:47:30] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-31 22:47:30] [INFO ] Invariant cache hit.
[2024-05-31 22:47:30] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-31 22:47:30] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 7 ms returned sat
[2024-05-31 22:47:31] [INFO ] [Real]Absence check using state equation in 656 ms returned sat
[2024-05-31 22:47:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:47:31] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-31 22:47:31] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2024-05-31 22:47:32] [INFO ] [Nat]Absence check using state equation in 634 ms returned sat
[2024-05-31 22:47:32] [INFO ] State equation strengthened by 1903 read => feed constraints.
[2024-05-31 22:47:32] [INFO ] [Nat]Added 1903 Read/Feed constraints in 764 ms returned sat
[2024-05-31 22:47:33] [INFO ] Deduced a trap composed of 201 places in 430 ms of which 5 ms to minimize.
[2024-05-31 22:47:33] [INFO ] Deduced a trap composed of 77 places in 489 ms of which 6 ms to minimize.
[2024-05-31 22:47:34] [INFO ] Deduced a trap composed of 72 places in 473 ms of which 5 ms to minimize.
[2024-05-31 22:47:35] [INFO ] Deduced a trap composed of 67 places in 483 ms of which 5 ms to minimize.
[2024-05-31 22:47:35] [INFO ] Deduced a trap composed of 71 places in 507 ms of which 6 ms to minimize.
[2024-05-31 22:47:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2840 ms
[2024-05-31 22:47:35] [INFO ] Computed and/alt/rep : 1326/1907/1326 causal constraints (skipped 1653 transitions) in 164 ms.
[2024-05-31 22:47:37] [INFO ] Added : 30 causal constraints over 9 iterations in 1770 ms. Result :sat
Minimization took 6255 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 82 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 952/952 places, 3439/3439 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 76 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
[2024-05-31 22:47:43] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-31 22:47:43] [INFO ] Invariant cache hit.
[2024-05-31 22:47:44] [INFO ] Implicit Places using invariants in 1020 ms returned []
[2024-05-31 22:47:44] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-31 22:47:44] [INFO ] Invariant cache hit.
[2024-05-31 22:47:45] [INFO ] State equation strengthened by 1903 read => feed constraints.
[2024-05-31 22:48:11] [INFO ] Implicit Places using invariants and state equation in 26900 ms returned []
Implicit Place search using SMT with State Equation took 27922 ms to find 0 implicit places.
[2024-05-31 22:48:12] [INFO ] Redundant transitions in 179 ms returned []
Running 3377 sub problems to find dead transitions.
[2024-05-31 22:48:12] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-31 22:48:12] [INFO ] Invariant cache hit.
[2024-05-31 22:48:12] [INFO ] State equation strengthened by 1903 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 0.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 0.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 0.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 0.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 0.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 0.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 0.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 0.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/949 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3377 unsolved
SMT process timed out in 47366ms, After SMT, problems are : Problem set: 0 solved, 3377 unsolved
Search for dead transitions found 0 dead transitions in 47423ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75629 ms. Remains : 952/952 places, 3439/3439 transitions.
RANDOM walk for 40000 steps (1361 resets) in 1298 ms. (30 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (160 resets) in 250 ms. (159 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (161 resets) in 265 ms. (150 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 68765 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 2
Probabilistic random walk after 68765 steps, saw 28717 distinct states, run finished after 3008 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-31 22:49:03] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-31 22:49:03] [INFO ] Invariant cache hit.
[2024-05-31 22:49:03] [INFO ] State equation strengthened by 1903 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 867/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/886 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:49:03] [INFO ] Deduced a trap composed of 181 places in 498 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/886 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/914 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/914 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/942 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/942 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/952 variables, 10/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3041/3993 variables, 952/996 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3993 variables, 1903/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3993 variables, 0/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/3993 variables, 0/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3993/3993 variables, and 2899 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2041 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 952/952 constraints, ReadFeed: 1903/1903 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 867/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/886 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:49:05] [INFO ] Deduced a trap composed of 80 places in 483 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/886 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/886 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/914 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:49:06] [INFO ] Deduced a trap composed of 5 places in 447 ms of which 5 ms to minimize.
[2024-05-31 22:49:06] [INFO ] Deduced a trap composed of 27 places in 436 ms of which 6 ms to minimize.
[2024-05-31 22:49:07] [INFO ] Deduced a trap composed of 27 places in 437 ms of which 5 ms to minimize.
[2024-05-31 22:49:07] [INFO ] Deduced a trap composed of 57 places in 432 ms of which 5 ms to minimize.
[2024-05-31 22:49:08] [INFO ] Deduced a trap composed of 46 places in 420 ms of which 5 ms to minimize.
[2024-05-31 22:49:08] [INFO ] Deduced a trap composed of 62 places in 421 ms of which 5 ms to minimize.
[2024-05-31 22:49:09] [INFO ] Deduced a trap composed of 143 places in 418 ms of which 6 ms to minimize.
[2024-05-31 22:49:09] [INFO ] Deduced a trap composed of 75 places in 428 ms of which 6 ms to minimize.
[2024-05-31 22:49:10] [INFO ] Deduced a trap composed of 163 places in 412 ms of which 6 ms to minimize.
[2024-05-31 22:49:10] [INFO ] Deduced a trap composed of 152 places in 412 ms of which 5 ms to minimize.
SMT process timed out in 7255ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 73 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 952/952 places, 3439/3439 transitions.
RANDOM walk for 40000 steps (1361 resets) in 1164 ms. (34 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (158 resets) in 205 ms. (194 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (159 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 70384 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 2
Probabilistic random walk after 70384 steps, saw 29366 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-31 22:49:13] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-31 22:49:13] [INFO ] Invariant cache hit.
[2024-05-31 22:49:14] [INFO ] State equation strengthened by 1903 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 867/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/886 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:49:14] [INFO ] Deduced a trap composed of 181 places in 463 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/886 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/914 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/914 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/942 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/942 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/952 variables, 10/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3041/3993 variables, 952/996 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3993 variables, 1903/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3993 variables, 0/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/3993 variables, 0/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3993/3993 variables, and 2899 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1867 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 952/952 constraints, ReadFeed: 1903/1903 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 867/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/886 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:49:16] [INFO ] Deduced a trap composed of 80 places in 450 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/886 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/886 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/914 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:49:16] [INFO ] Deduced a trap composed of 5 places in 403 ms of which 5 ms to minimize.
[2024-05-31 22:49:17] [INFO ] Deduced a trap composed of 27 places in 425 ms of which 5 ms to minimize.
[2024-05-31 22:49:17] [INFO ] Deduced a trap composed of 27 places in 436 ms of which 5 ms to minimize.
[2024-05-31 22:49:18] [INFO ] Deduced a trap composed of 57 places in 434 ms of which 7 ms to minimize.
[2024-05-31 22:49:18] [INFO ] Deduced a trap composed of 46 places in 413 ms of which 5 ms to minimize.
[2024-05-31 22:49:19] [INFO ] Deduced a trap composed of 62 places in 419 ms of which 5 ms to minimize.
[2024-05-31 22:49:19] [INFO ] Deduced a trap composed of 143 places in 412 ms of which 5 ms to minimize.
[2024-05-31 22:49:20] [INFO ] Deduced a trap composed of 75 places in 433 ms of which 6 ms to minimize.
[2024-05-31 22:49:20] [INFO ] Deduced a trap composed of 163 places in 419 ms of which 8 ms to minimize.
[2024-05-31 22:49:20] [INFO ] Deduced a trap composed of 152 places in 423 ms of which 6 ms to minimize.
[2024-05-31 22:49:21] [INFO ] Deduced a trap composed of 161 places in 413 ms of which 5 ms to minimize.
[2024-05-31 22:49:21] [INFO ] Deduced a trap composed of 85 places in 428 ms of which 5 ms to minimize.
[2024-05-31 22:49:22] [INFO ] Deduced a trap composed of 92 places in 417 ms of which 7 ms to minimize.
[2024-05-31 22:49:22] [INFO ] Deduced a trap composed of 173 places in 414 ms of which 5 ms to minimize.
[2024-05-31 22:49:23] [INFO ] Deduced a trap composed of 176 places in 397 ms of which 5 ms to minimize.
[2024-05-31 22:49:23] [INFO ] Deduced a trap composed of 113 places in 401 ms of which 5 ms to minimize.
[2024-05-31 22:49:23] [INFO ] Deduced a trap composed of 101 places in 408 ms of which 5 ms to minimize.
[2024-05-31 22:49:24] [INFO ] Deduced a trap composed of 201 places in 405 ms of which 5 ms to minimize.
[2024-05-31 22:49:24] [INFO ] Deduced a trap composed of 90 places in 407 ms of which 5 ms to minimize.
[2024-05-31 22:49:25] [INFO ] Deduced a trap composed of 92 places in 404 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/914 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:49:25] [INFO ] Deduced a trap composed of 115 places in 418 ms of which 5 ms to minimize.
[2024-05-31 22:49:26] [INFO ] Deduced a trap composed of 183 places in 422 ms of which 5 ms to minimize.
[2024-05-31 22:49:26] [INFO ] Deduced a trap composed of 118 places in 424 ms of which 5 ms to minimize.
[2024-05-31 22:49:26] [INFO ] Deduced a trap composed of 94 places in 431 ms of which 6 ms to minimize.
[2024-05-31 22:49:27] [INFO ] Deduced a trap composed of 115 places in 421 ms of which 5 ms to minimize.
[2024-05-31 22:49:27] [INFO ] Deduced a trap composed of 101 places in 420 ms of which 5 ms to minimize.
[2024-05-31 22:49:28] [INFO ] Deduced a trap composed of 122 places in 420 ms of which 6 ms to minimize.
[2024-05-31 22:49:28] [INFO ] Deduced a trap composed of 159 places in 422 ms of which 6 ms to minimize.
[2024-05-31 22:49:29] [INFO ] Deduced a trap composed of 160 places in 405 ms of which 5 ms to minimize.
[2024-05-31 22:49:29] [INFO ] Deduced a trap composed of 85 places in 425 ms of which 6 ms to minimize.
[2024-05-31 22:49:30] [INFO ] Deduced a trap composed of 95 places in 428 ms of which 7 ms to minimize.
[2024-05-31 22:49:30] [INFO ] Deduced a trap composed of 134 places in 414 ms of which 6 ms to minimize.
[2024-05-31 22:49:30] [INFO ] Deduced a trap composed of 82 places in 409 ms of which 5 ms to minimize.
[2024-05-31 22:49:31] [INFO ] Deduced a trap composed of 46 places in 423 ms of which 5 ms to minimize.
[2024-05-31 22:49:31] [INFO ] Deduced a trap composed of 62 places in 413 ms of which 6 ms to minimize.
[2024-05-31 22:49:32] [INFO ] Deduced a trap composed of 71 places in 403 ms of which 5 ms to minimize.
[2024-05-31 22:49:32] [INFO ] Deduced a trap composed of 176 places in 419 ms of which 5 ms to minimize.
[2024-05-31 22:49:33] [INFO ] Deduced a trap composed of 97 places in 448 ms of which 6 ms to minimize.
[2024-05-31 22:49:33] [INFO ] Deduced a trap composed of 130 places in 437 ms of which 6 ms to minimize.
[2024-05-31 22:49:34] [INFO ] Deduced a trap composed of 46 places in 467 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/914 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:49:34] [INFO ] Deduced a trap composed of 88 places in 417 ms of which 5 ms to minimize.
[2024-05-31 22:49:34] [INFO ] Deduced a trap composed of 123 places in 407 ms of which 5 ms to minimize.
[2024-05-31 22:49:35] [INFO ] Deduced a trap composed of 182 places in 420 ms of which 5 ms to minimize.
[2024-05-31 22:49:35] [INFO ] Deduced a trap composed of 165 places in 469 ms of which 5 ms to minimize.
[2024-05-31 22:49:36] [INFO ] Deduced a trap composed of 56 places in 471 ms of which 5 ms to minimize.
[2024-05-31 22:49:36] [INFO ] Deduced a trap composed of 74 places in 489 ms of which 5 ms to minimize.
[2024-05-31 22:49:37] [INFO ] Deduced a trap composed of 72 places in 488 ms of which 5 ms to minimize.
[2024-05-31 22:49:37] [INFO ] Deduced a trap composed of 66 places in 494 ms of which 5 ms to minimize.
[2024-05-31 22:49:38] [INFO ] Deduced a trap composed of 164 places in 489 ms of which 6 ms to minimize.
[2024-05-31 22:49:38] [INFO ] Deduced a trap composed of 75 places in 478 ms of which 5 ms to minimize.
[2024-05-31 22:49:39] [INFO ] Deduced a trap composed of 74 places in 482 ms of which 5 ms to minimize.
[2024-05-31 22:49:39] [INFO ] Deduced a trap composed of 54 places in 466 ms of which 5 ms to minimize.
[2024-05-31 22:49:40] [INFO ] Deduced a trap composed of 62 places in 483 ms of which 5 ms to minimize.
[2024-05-31 22:49:40] [INFO ] Deduced a trap composed of 104 places in 471 ms of which 5 ms to minimize.
[2024-05-31 22:49:41] [INFO ] Deduced a trap composed of 71 places in 474 ms of which 6 ms to minimize.
[2024-05-31 22:49:41] [INFO ] Deduced a trap composed of 85 places in 475 ms of which 5 ms to minimize.
[2024-05-31 22:49:42] [INFO ] Deduced a trap composed of 65 places in 491 ms of which 6 ms to minimize.
[2024-05-31 22:49:42] [INFO ] Deduced a trap composed of 66 places in 493 ms of which 6 ms to minimize.
[2024-05-31 22:49:43] [INFO ] Deduced a trap composed of 68 places in 480 ms of which 5 ms to minimize.
[2024-05-31 22:49:43] [INFO ] Deduced a trap composed of 62 places in 481 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/914 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:49:44] [INFO ] Deduced a trap composed of 66 places in 485 ms of which 5 ms to minimize.
[2024-05-31 22:49:44] [INFO ] Deduced a trap composed of 68 places in 472 ms of which 5 ms to minimize.
[2024-05-31 22:49:45] [INFO ] Deduced a trap composed of 69 places in 488 ms of which 5 ms to minimize.
[2024-05-31 22:49:45] [INFO ] Deduced a trap composed of 66 places in 480 ms of which 6 ms to minimize.
[2024-05-31 22:49:46] [INFO ] Deduced a trap composed of 66 places in 492 ms of which 5 ms to minimize.
[2024-05-31 22:49:46] [INFO ] Deduced a trap composed of 70 places in 490 ms of which 6 ms to minimize.
[2024-05-31 22:49:47] [INFO ] Deduced a trap composed of 64 places in 480 ms of which 5 ms to minimize.
[2024-05-31 22:49:47] [INFO ] Deduced a trap composed of 65 places in 465 ms of which 6 ms to minimize.
[2024-05-31 22:49:48] [INFO ] Deduced a trap composed of 59 places in 498 ms of which 6 ms to minimize.
[2024-05-31 22:49:48] [INFO ] Deduced a trap composed of 95 places in 431 ms of which 6 ms to minimize.
[2024-05-31 22:49:49] [INFO ] Deduced a trap composed of 72 places in 475 ms of which 5 ms to minimize.
[2024-05-31 22:49:49] [INFO ] Deduced a trap composed of 92 places in 424 ms of which 6 ms to minimize.
[2024-05-31 22:49:50] [INFO ] Deduced a trap composed of 55 places in 475 ms of which 6 ms to minimize.
[2024-05-31 22:49:50] [INFO ] Deduced a trap composed of 60 places in 464 ms of which 6 ms to minimize.
[2024-05-31 22:49:51] [INFO ] Deduced a trap composed of 74 places in 483 ms of which 6 ms to minimize.
[2024-05-31 22:49:51] [INFO ] Deduced a trap composed of 66 places in 490 ms of which 5 ms to minimize.
[2024-05-31 22:49:52] [INFO ] Deduced a trap composed of 55 places in 482 ms of which 6 ms to minimize.
[2024-05-31 22:49:52] [INFO ] Deduced a trap composed of 55 places in 487 ms of which 5 ms to minimize.
[2024-05-31 22:49:53] [INFO ] Deduced a trap composed of 67 places in 460 ms of which 5 ms to minimize.
[2024-05-31 22:49:53] [INFO ] Deduced a trap composed of 57 places in 485 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/914 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:49:54] [INFO ] Deduced a trap composed of 67 places in 469 ms of which 6 ms to minimize.
[2024-05-31 22:49:54] [INFO ] Deduced a trap composed of 92 places in 473 ms of which 5 ms to minimize.
[2024-05-31 22:49:55] [INFO ] Deduced a trap composed of 85 places in 460 ms of which 5 ms to minimize.
[2024-05-31 22:49:55] [INFO ] Deduced a trap composed of 68 places in 466 ms of which 5 ms to minimize.
[2024-05-31 22:49:56] [INFO ] Deduced a trap composed of 130 places in 462 ms of which 6 ms to minimize.
[2024-05-31 22:49:56] [INFO ] Deduced a trap composed of 65 places in 469 ms of which 6 ms to minimize.
[2024-05-31 22:49:57] [INFO ] Deduced a trap composed of 58 places in 457 ms of which 5 ms to minimize.
[2024-05-31 22:49:57] [INFO ] Deduced a trap composed of 58 places in 461 ms of which 5 ms to minimize.
[2024-05-31 22:49:57] [INFO ] Deduced a trap composed of 94 places in 408 ms of which 5 ms to minimize.
[2024-05-31 22:49:58] [INFO ] Deduced a trap composed of 59 places in 498 ms of which 5 ms to minimize.
[2024-05-31 22:49:58] [INFO ] Deduced a trap composed of 87 places in 460 ms of which 5 ms to minimize.
[2024-05-31 22:49:59] [INFO ] Deduced a trap composed of 81 places in 482 ms of which 5 ms to minimize.
[2024-05-31 22:49:59] [INFO ] Deduced a trap composed of 91 places in 475 ms of which 5 ms to minimize.
[2024-05-31 22:50:00] [INFO ] Deduced a trap composed of 57 places in 457 ms of which 5 ms to minimize.
[2024-05-31 22:50:00] [INFO ] Deduced a trap composed of 59 places in 460 ms of which 5 ms to minimize.
SMT process timed out in 46933ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 74 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 952/952 places, 3439/3439 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 73 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
[2024-05-31 22:50:01] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-31 22:50:01] [INFO ] Invariant cache hit.
[2024-05-31 22:50:02] [INFO ] Implicit Places using invariants in 1009 ms returned []
[2024-05-31 22:50:02] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-31 22:50:02] [INFO ] Invariant cache hit.
[2024-05-31 22:50:02] [INFO ] State equation strengthened by 1903 read => feed constraints.
[2024-05-31 22:50:28] [INFO ] Implicit Places using invariants and state equation in 26319 ms returned []
Implicit Place search using SMT with State Equation took 27331 ms to find 0 implicit places.
[2024-05-31 22:50:28] [INFO ] Redundant transitions in 137 ms returned []
Running 3377 sub problems to find dead transitions.
[2024-05-31 22:50:28] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-31 22:50:28] [INFO ] Invariant cache hit.
[2024-05-31 22:50:28] [INFO ] State equation strengthened by 1903 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/949 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3377 unsolved
SMT process timed out in 47148ms, After SMT, problems are : Problem set: 0 solved, 3377 unsolved
Search for dead transitions found 0 dead transitions in 47180ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74755 ms. Remains : 952/952 places, 3439/3439 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:51:15] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-31 22:51:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (341 resets) in 130 ms. (76 steps per ms)
BEST_FIRST walk for 10001 steps (40 resets) in 22 ms. (434 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:51:15] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-31 22:51:15] [INFO ] Invariant cache hit.
[2024-05-31 22:51:16] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-31 22:51:16] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-31 22:51:16] [INFO ] [Real]Absence check using state equation in 693 ms returned sat
[2024-05-31 22:51:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:51:16] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-31 22:51:16] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-31 22:51:17] [INFO ] [Nat]Absence check using state equation in 646 ms returned sat
[2024-05-31 22:51:17] [INFO ] State equation strengthened by 1903 read => feed constraints.
[2024-05-31 22:51:18] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 22:51:18] [INFO ] [Nat]Added 1903 Read/Feed constraints in 748 ms returned sat
[2024-05-31 22:51:18] [INFO ] Deduced a trap composed of 201 places in 424 ms of which 5 ms to minimize.
[2024-05-31 22:51:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 575 ms
[2024-05-31 22:51:19] [INFO ] Computed and/alt/rep : 1326/1907/1326 causal constraints (skipped 1653 transitions) in 159 ms.
[2024-05-31 22:51:21] [INFO ] Deduced a trap composed of 67 places in 529 ms of which 5 ms to minimize.
[2024-05-31 22:51:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 723 ms
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 74 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 952/952 places, 3439/3439 transitions.
[2024-05-31 22:51:21] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-31 22:51:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (34078 resets) in 12905 ms. (77 steps per ms)
BEST_FIRST walk for 1000001 steps (4016 resets) in 2112 ms. (473 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:51:36] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-31 22:51:36] [INFO ] Invariant cache hit.
[2024-05-31 22:51:37] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-31 22:51:37] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-31 22:51:37] [INFO ] [Real]Absence check using state equation in 673 ms returned sat
[2024-05-31 22:51:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:51:37] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-31 22:51:37] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-31 22:51:38] [INFO ] [Nat]Absence check using state equation in 669 ms returned sat
[2024-05-31 22:51:38] [INFO ] State equation strengthened by 1903 read => feed constraints.
[2024-05-31 22:51:39] [INFO ] [Nat]Added 1903 Read/Feed constraints in 815 ms returned sat
[2024-05-31 22:51:39] [INFO ] Deduced a trap composed of 201 places in 456 ms of which 6 ms to minimize.
[2024-05-31 22:51:40] [INFO ] Deduced a trap composed of 77 places in 549 ms of which 6 ms to minimize.
[2024-05-31 22:51:41] [INFO ] Deduced a trap composed of 72 places in 529 ms of which 6 ms to minimize.
[2024-05-31 22:51:41] [INFO ] Deduced a trap composed of 67 places in 533 ms of which 6 ms to minimize.
[2024-05-31 22:51:42] [INFO ] Deduced a trap composed of 71 places in 504 ms of which 6 ms to minimize.
[2024-05-31 22:51:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3049 ms
[2024-05-31 22:51:42] [INFO ] Computed and/alt/rep : 1326/1907/1326 causal constraints (skipped 1653 transitions) in 168 ms.
[2024-05-31 22:51:44] [INFO ] Added : 30 causal constraints over 9 iterations in 1772 ms. Result :sat
Minimization took 6518 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 81 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 952/952 places, 3439/3439 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 75 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
[2024-05-31 22:51:50] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-31 22:51:50] [INFO ] Invariant cache hit.
[2024-05-31 22:51:51] [INFO ] Implicit Places using invariants in 1050 ms returned []
[2024-05-31 22:51:51] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-31 22:51:51] [INFO ] Invariant cache hit.
[2024-05-31 22:51:52] [INFO ] State equation strengthened by 1903 read => feed constraints.
[2024-05-31 22:52:18] [INFO ] Implicit Places using invariants and state equation in 26176 ms returned []
Implicit Place search using SMT with State Equation took 27228 ms to find 0 implicit places.
[2024-05-31 22:52:18] [INFO ] Redundant transitions in 127 ms returned []
Running 3377 sub problems to find dead transitions.
[2024-05-31 22:52:18] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-31 22:52:18] [INFO ] Invariant cache hit.
[2024-05-31 22:52:18] [INFO ] State equation strengthened by 1903 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/949 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3377 unsolved
SMT process timed out in 47695ms, After SMT, problems are : Problem set: 0 solved, 3377 unsolved
Search for dead transitions found 0 dead transitions in 47723ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75169 ms. Remains : 952/952 places, 3439/3439 transitions.
RANDOM walk for 40000 steps (1362 resets) in 769 ms. (51 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (160 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (160 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 72412 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 2
Probabilistic random walk after 72412 steps, saw 30210 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
[2024-05-31 22:53:09] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-31 22:53:09] [INFO ] Invariant cache hit.
[2024-05-31 22:53:09] [INFO ] State equation strengthened by 1903 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 867/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/886 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:53:09] [INFO ] Deduced a trap composed of 181 places in 448 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/886 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/914 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/914 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/942 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/942 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/952 variables, 10/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3041/3993 variables, 952/996 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3993 variables, 1903/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3993 variables, 0/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/3993 variables, 0/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3993/3993 variables, and 2899 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2024 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 952/952 constraints, ReadFeed: 1903/1903 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 867/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/886 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:53:11] [INFO ] Deduced a trap composed of 80 places in 448 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/886 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/886 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/914 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:53:12] [INFO ] Deduced a trap composed of 5 places in 460 ms of which 6 ms to minimize.
[2024-05-31 22:53:13] [INFO ] Deduced a trap composed of 27 places in 483 ms of which 6 ms to minimize.
[2024-05-31 22:53:13] [INFO ] Deduced a trap composed of 27 places in 486 ms of which 5 ms to minimize.
[2024-05-31 22:53:14] [INFO ] Deduced a trap composed of 57 places in 479 ms of which 6 ms to minimize.
[2024-05-31 22:53:14] [INFO ] Deduced a trap composed of 46 places in 461 ms of which 6 ms to minimize.
[2024-05-31 22:53:14] [INFO ] Deduced a trap composed of 62 places in 464 ms of which 6 ms to minimize.
[2024-05-31 22:53:15] [INFO ] Deduced a trap composed of 143 places in 423 ms of which 6 ms to minimize.
[2024-05-31 22:53:15] [INFO ] Deduced a trap composed of 75 places in 487 ms of which 5 ms to minimize.
[2024-05-31 22:53:16] [INFO ] Deduced a trap composed of 163 places in 445 ms of which 5 ms to minimize.
SMT process timed out in 7097ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 74 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 952/952 places, 3439/3439 transitions.
RANDOM walk for 40000 steps (1362 resets) in 701 ms. (56 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (158 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (161 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 71597 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 2
Probabilistic random walk after 71597 steps, saw 29869 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-31 22:53:19] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-31 22:53:19] [INFO ] Invariant cache hit.
[2024-05-31 22:53:19] [INFO ] State equation strengthened by 1903 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 867/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/886 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:53:20] [INFO ] Deduced a trap composed of 181 places in 467 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/886 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/914 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/914 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/942 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/942 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/952 variables, 10/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3041/3993 variables, 952/996 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3993 variables, 1903/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3993 variables, 0/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/3993 variables, 0/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3993/3993 variables, and 2899 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2072 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 952/952 constraints, ReadFeed: 1903/1903 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 867/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/886 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:53:22] [INFO ] Deduced a trap composed of 80 places in 504 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/886 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/886 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/914 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:53:23] [INFO ] Deduced a trap composed of 5 places in 462 ms of which 5 ms to minimize.
[2024-05-31 22:53:23] [INFO ] Deduced a trap composed of 27 places in 467 ms of which 5 ms to minimize.
[2024-05-31 22:53:24] [INFO ] Deduced a trap composed of 27 places in 441 ms of which 6 ms to minimize.
[2024-05-31 22:53:24] [INFO ] Deduced a trap composed of 57 places in 437 ms of which 6 ms to minimize.
[2024-05-31 22:53:24] [INFO ] Deduced a trap composed of 46 places in 422 ms of which 6 ms to minimize.
[2024-05-31 22:53:25] [INFO ] Deduced a trap composed of 62 places in 425 ms of which 5 ms to minimize.
[2024-05-31 22:53:25] [INFO ] Deduced a trap composed of 143 places in 415 ms of which 5 ms to minimize.
[2024-05-31 22:53:26] [INFO ] Deduced a trap composed of 75 places in 437 ms of which 6 ms to minimize.
[2024-05-31 22:53:26] [INFO ] Deduced a trap composed of 163 places in 450 ms of which 5 ms to minimize.
[2024-05-31 22:53:27] [INFO ] Deduced a trap composed of 152 places in 413 ms of which 6 ms to minimize.
[2024-05-31 22:53:27] [INFO ] Deduced a trap composed of 161 places in 455 ms of which 5 ms to minimize.
[2024-05-31 22:53:28] [INFO ] Deduced a trap composed of 85 places in 477 ms of which 6 ms to minimize.
[2024-05-31 22:53:28] [INFO ] Deduced a trap composed of 92 places in 472 ms of which 6 ms to minimize.
[2024-05-31 22:53:29] [INFO ] Deduced a trap composed of 173 places in 465 ms of which 5 ms to minimize.
[2024-05-31 22:53:29] [INFO ] Deduced a trap composed of 176 places in 448 ms of which 5 ms to minimize.
[2024-05-31 22:53:30] [INFO ] Deduced a trap composed of 113 places in 456 ms of which 6 ms to minimize.
[2024-05-31 22:53:30] [INFO ] Deduced a trap composed of 101 places in 451 ms of which 5 ms to minimize.
[2024-05-31 22:53:30] [INFO ] Deduced a trap composed of 201 places in 458 ms of which 6 ms to minimize.
[2024-05-31 22:53:31] [INFO ] Deduced a trap composed of 90 places in 478 ms of which 5 ms to minimize.
[2024-05-31 22:53:31] [INFO ] Deduced a trap composed of 92 places in 454 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/914 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:53:32] [INFO ] Deduced a trap composed of 115 places in 423 ms of which 5 ms to minimize.
[2024-05-31 22:53:32] [INFO ] Deduced a trap composed of 183 places in 454 ms of which 6 ms to minimize.
[2024-05-31 22:53:33] [INFO ] Deduced a trap composed of 118 places in 447 ms of which 6 ms to minimize.
[2024-05-31 22:53:33] [INFO ] Deduced a trap composed of 94 places in 476 ms of which 6 ms to minimize.
[2024-05-31 22:53:34] [INFO ] Deduced a trap composed of 115 places in 476 ms of which 5 ms to minimize.
[2024-05-31 22:53:34] [INFO ] Deduced a trap composed of 101 places in 458 ms of which 6 ms to minimize.
[2024-05-31 22:53:35] [INFO ] Deduced a trap composed of 122 places in 423 ms of which 6 ms to minimize.
[2024-05-31 22:53:35] [INFO ] Deduced a trap composed of 159 places in 500 ms of which 6 ms to minimize.
[2024-05-31 22:53:36] [INFO ] Deduced a trap composed of 160 places in 480 ms of which 5 ms to minimize.
[2024-05-31 22:53:36] [INFO ] Deduced a trap composed of 85 places in 483 ms of which 6 ms to minimize.
[2024-05-31 22:53:37] [INFO ] Deduced a trap composed of 95 places in 488 ms of which 6 ms to minimize.
[2024-05-31 22:53:37] [INFO ] Deduced a trap composed of 134 places in 457 ms of which 6 ms to minimize.
[2024-05-31 22:53:38] [INFO ] Deduced a trap composed of 82 places in 448 ms of which 6 ms to minimize.
[2024-05-31 22:53:38] [INFO ] Deduced a trap composed of 46 places in 486 ms of which 5 ms to minimize.
[2024-05-31 22:53:39] [INFO ] Deduced a trap composed of 62 places in 476 ms of which 6 ms to minimize.
[2024-05-31 22:53:39] [INFO ] Deduced a trap composed of 71 places in 450 ms of which 5 ms to minimize.
[2024-05-31 22:53:40] [INFO ] Deduced a trap composed of 176 places in 447 ms of which 5 ms to minimize.
[2024-05-31 22:53:40] [INFO ] Deduced a trap composed of 97 places in 457 ms of which 6 ms to minimize.
[2024-05-31 22:53:41] [INFO ] Deduced a trap composed of 130 places in 473 ms of which 6 ms to minimize.
[2024-05-31 22:53:41] [INFO ] Deduced a trap composed of 46 places in 526 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/914 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:53:42] [INFO ] Deduced a trap composed of 88 places in 460 ms of which 5 ms to minimize.
[2024-05-31 22:53:42] [INFO ] Deduced a trap composed of 123 places in 472 ms of which 5 ms to minimize.
[2024-05-31 22:53:43] [INFO ] Deduced a trap composed of 182 places in 447 ms of which 6 ms to minimize.
[2024-05-31 22:53:43] [INFO ] Deduced a trap composed of 165 places in 506 ms of which 6 ms to minimize.
[2024-05-31 22:53:44] [INFO ] Deduced a trap composed of 56 places in 489 ms of which 6 ms to minimize.
[2024-05-31 22:53:44] [INFO ] Deduced a trap composed of 74 places in 503 ms of which 6 ms to minimize.
[2024-05-31 22:53:45] [INFO ] Deduced a trap composed of 72 places in 505 ms of which 6 ms to minimize.
[2024-05-31 22:53:45] [INFO ] Deduced a trap composed of 66 places in 544 ms of which 6 ms to minimize.
[2024-05-31 22:53:46] [INFO ] Deduced a trap composed of 164 places in 523 ms of which 6 ms to minimize.
[2024-05-31 22:53:46] [INFO ] Deduced a trap composed of 75 places in 529 ms of which 6 ms to minimize.
[2024-05-31 22:53:47] [INFO ] Deduced a trap composed of 74 places in 519 ms of which 6 ms to minimize.
[2024-05-31 22:53:47] [INFO ] Deduced a trap composed of 54 places in 492 ms of which 6 ms to minimize.
[2024-05-31 22:53:48] [INFO ] Deduced a trap composed of 62 places in 521 ms of which 5 ms to minimize.
[2024-05-31 22:53:48] [INFO ] Deduced a trap composed of 104 places in 476 ms of which 6 ms to minimize.
[2024-05-31 22:53:49] [INFO ] Deduced a trap composed of 71 places in 476 ms of which 6 ms to minimize.
[2024-05-31 22:53:49] [INFO ] Deduced a trap composed of 85 places in 493 ms of which 6 ms to minimize.
[2024-05-31 22:53:50] [INFO ] Deduced a trap composed of 65 places in 494 ms of which 5 ms to minimize.
[2024-05-31 22:53:50] [INFO ] Deduced a trap composed of 66 places in 482 ms of which 5 ms to minimize.
[2024-05-31 22:53:51] [INFO ] Deduced a trap composed of 68 places in 510 ms of which 6 ms to minimize.
[2024-05-31 22:53:51] [INFO ] Deduced a trap composed of 62 places in 488 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/914 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:53:52] [INFO ] Deduced a trap composed of 66 places in 492 ms of which 6 ms to minimize.
[2024-05-31 22:53:52] [INFO ] Deduced a trap composed of 68 places in 493 ms of which 5 ms to minimize.
[2024-05-31 22:53:53] [INFO ] Deduced a trap composed of 69 places in 482 ms of which 5 ms to minimize.
[2024-05-31 22:53:53] [INFO ] Deduced a trap composed of 66 places in 506 ms of which 6 ms to minimize.
[2024-05-31 22:53:54] [INFO ] Deduced a trap composed of 66 places in 489 ms of which 6 ms to minimize.
[2024-05-31 22:53:54] [INFO ] Deduced a trap composed of 70 places in 486 ms of which 5 ms to minimize.
[2024-05-31 22:53:55] [INFO ] Deduced a trap composed of 64 places in 486 ms of which 5 ms to minimize.
[2024-05-31 22:53:56] [INFO ] Deduced a trap composed of 65 places in 503 ms of which 5 ms to minimize.
[2024-05-31 22:53:56] [INFO ] Deduced a trap composed of 59 places in 529 ms of which 6 ms to minimize.
[2024-05-31 22:53:57] [INFO ] Deduced a trap composed of 95 places in 459 ms of which 6 ms to minimize.
[2024-05-31 22:53:57] [INFO ] Deduced a trap composed of 72 places in 513 ms of which 5 ms to minimize.
[2024-05-31 22:53:58] [INFO ] Deduced a trap composed of 92 places in 440 ms of which 6 ms to minimize.
[2024-05-31 22:53:58] [INFO ] Deduced a trap composed of 55 places in 518 ms of which 6 ms to minimize.
[2024-05-31 22:53:59] [INFO ] Deduced a trap composed of 60 places in 468 ms of which 5 ms to minimize.
[2024-05-31 22:53:59] [INFO ] Deduced a trap composed of 74 places in 484 ms of which 6 ms to minimize.
[2024-05-31 22:54:00] [INFO ] Deduced a trap composed of 66 places in 499 ms of which 5 ms to minimize.
[2024-05-31 22:54:00] [INFO ] Deduced a trap composed of 55 places in 516 ms of which 6 ms to minimize.
[2024-05-31 22:54:01] [INFO ] Deduced a trap composed of 55 places in 500 ms of which 6 ms to minimize.
[2024-05-31 22:54:01] [INFO ] Deduced a trap composed of 67 places in 490 ms of which 5 ms to minimize.
[2024-05-31 22:54:02] [INFO ] Deduced a trap composed of 57 places in 505 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/914 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:54:02] [INFO ] Deduced a trap composed of 67 places in 517 ms of which 6 ms to minimize.
[2024-05-31 22:54:03] [INFO ] Deduced a trap composed of 92 places in 491 ms of which 6 ms to minimize.
[2024-05-31 22:54:03] [INFO ] Deduced a trap composed of 85 places in 478 ms of which 6 ms to minimize.
[2024-05-31 22:54:04] [INFO ] Deduced a trap composed of 68 places in 478 ms of which 6 ms to minimize.
[2024-05-31 22:54:04] [INFO ] Deduced a trap composed of 130 places in 476 ms of which 6 ms to minimize.
[2024-05-31 22:54:05] [INFO ] Deduced a trap composed of 65 places in 471 ms of which 5 ms to minimize.
[2024-05-31 22:54:05] [INFO ] Deduced a trap composed of 58 places in 469 ms of which 5 ms to minimize.
[2024-05-31 22:54:06] [INFO ] Deduced a trap composed of 58 places in 475 ms of which 5 ms to minimize.
[2024-05-31 22:54:06] [INFO ] Deduced a trap composed of 94 places in 410 ms of which 6 ms to minimize.
[2024-05-31 22:54:07] [INFO ] Deduced a trap composed of 59 places in 468 ms of which 5 ms to minimize.
SMT process timed out in 47349ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 80 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 952/952 places, 3439/3439 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 84 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
[2024-05-31 22:54:07] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-31 22:54:07] [INFO ] Invariant cache hit.
[2024-05-31 22:54:08] [INFO ] Implicit Places using invariants in 1011 ms returned []
[2024-05-31 22:54:08] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-31 22:54:08] [INFO ] Invariant cache hit.
[2024-05-31 22:54:09] [INFO ] State equation strengthened by 1903 read => feed constraints.
[2024-05-31 22:54:35] [INFO ] Implicit Places using invariants and state equation in 26823 ms returned []
Implicit Place search using SMT with State Equation took 27836 ms to find 0 implicit places.
[2024-05-31 22:54:35] [INFO ] Redundant transitions in 135 ms returned []
Running 3377 sub problems to find dead transitions.
[2024-05-31 22:54:35] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-31 22:54:35] [INFO ] Invariant cache hit.
[2024-05-31 22:54:35] [INFO ] State equation strengthened by 1903 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/949 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3377 unsolved
SMT process timed out in 47475ms, After SMT, problems are : Problem set: 0 solved, 3377 unsolved
Search for dead transitions found 0 dead transitions in 47502ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75572 ms. Remains : 952/952 places, 3439/3439 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-04 in 246981 ms.
[2024-05-31 22:55:23] [INFO ] Flatten gal took : 297 ms
[2024-05-31 22:55:23] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-31 22:55:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 952 places, 3439 transitions and 17144 arcs took 19 ms.
Total runtime 694836 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-04

BK_STOP 1717196123422

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-04
ub formula formula --maxsum=/tmp/1447/ub_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S16C05"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C05, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r508-tall-171654350700029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C05.tgz
mv MultiCrashLeafsetExtension-PT-S16C05 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;