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.r480-tall-171624189900757.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 DES-PT-60b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189900757
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 12 08:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 08:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 08:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 139K May 18 16:42 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 DES-PT-60b-UpperBounds-00
FORMULA_NAME DES-PT-60b-UpperBounds-01
FORMULA_NAME DES-PT-60b-UpperBounds-02
FORMULA_NAME DES-PT-60b-UpperBounds-03
FORMULA_NAME DES-PT-60b-UpperBounds-04
FORMULA_NAME DES-PT-60b-UpperBounds-05
FORMULA_NAME DES-PT-60b-UpperBounds-06
FORMULA_NAME DES-PT-60b-UpperBounds-07
FORMULA_NAME DES-PT-60b-UpperBounds-08
FORMULA_NAME DES-PT-60b-UpperBounds-09
FORMULA_NAME DES-PT-60b-UpperBounds-10
FORMULA_NAME DES-PT-60b-UpperBounds-11
FORMULA_NAME DES-PT-60b-UpperBounds-12
FORMULA_NAME DES-PT-60b-UpperBounds-13
FORMULA_NAME DES-PT-60b-UpperBounds-14
FORMULA_NAME DES-PT-60b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717200329913

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-60b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:05:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 00:05:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:05:31] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2024-06-01 00:05:31] [INFO ] Transformed 519 places.
[2024-06-01 00:05:31] [INFO ] Transformed 470 transitions.
[2024-06-01 00:05:31] [INFO ] Found NUPN structural information;
[2024-06-01 00:05:31] [INFO ] Parsed PT model containing 519 places and 470 transitions and 1623 arcs in 223 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
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:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 470 rows 519 cols
[2024-06-01 00:05:31] [INFO ] Computed 65 invariants in 53 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:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (86 resets) in 74 ms. (133 steps per ms)
FORMULA DES-PT-60b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (55 resets) in 79 ms. (625 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-06-01 00:05:31] [INFO ] Invariant cache hit.
[2024-06-01 00:05:32] [INFO ] [Real]Absence check using 39 positive place invariants in 24 ms returned sat
[2024-06-01 00:05:32] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 23 ms returned sat
[2024-06-01 00:05:32] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2024-06-01 00:05:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:05:32] [INFO ] [Nat]Absence check using 39 positive place invariants in 32 ms returned sat
[2024-06-01 00:05:32] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 26 ms returned sat
[2024-06-01 00:05:32] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2024-06-01 00:05:33] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 36 ms.
[2024-06-01 00:05:37] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 29 ms to minimize.
[2024-06-01 00:05:37] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-06-01 00:05:37] [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 0
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.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
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-06-01 00:05:37] [INFO ] [Real]Absence check using 39 positive place invariants in 19 ms returned sat
[2024-06-01 00:05:37] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 19 ms returned sat
[2024-06-01 00:05:37] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2024-06-01 00:05:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:05:38] [INFO ] [Nat]Absence check using 39 positive place invariants in 16 ms returned sat
[2024-06-01 00:05:38] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 21 ms returned sat
[2024-06-01 00:05:38] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2024-06-01 00:05:38] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 3 ms to minimize.
[2024-06-01 00:05:38] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 2 ms to minimize.
[2024-06-01 00:05:38] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 2 ms to minimize.
[2024-06-01 00:05:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 456 ms
[2024-06-01 00:05:38] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 26 ms.
[2024-06-01 00:05:41] [INFO ] Added : 261 causal constraints over 53 iterations in 2344 ms. Result :sat
Minimization took 502 ms.
[2024-06-01 00:05:41] [INFO ] [Real]Absence check using 39 positive place invariants in 18 ms returned sat
[2024-06-01 00:05:41] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 22 ms returned sat
[2024-06-01 00:05:42] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2024-06-01 00:05:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:05:42] [INFO ] [Nat]Absence check using 39 positive place invariants in 15 ms returned sat
[2024-06-01 00:05:42] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 19 ms returned sat
[2024-06-01 00:05:42] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2024-06-01 00:05:42] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 2 ms to minimize.
[2024-06-01 00:05:42] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 2 ms to minimize.
[2024-06-01 00:05:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 328 ms
[2024-06-01 00:05:42] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 44 ms.
[2024-06-01 00:05:45] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 2 ms to minimize.
[2024-06-01 00:05:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2024-06-01 00:05:45] [INFO ] Added : 311 causal constraints over 63 iterations in 2747 ms. Result :sat
Minimization took 501 ms.
[2024-06-01 00:05:46] [INFO ] [Real]Absence check using 39 positive place invariants in 16 ms returned sat
[2024-06-01 00:05:46] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 21 ms returned sat
[2024-06-01 00:05:46] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2024-06-01 00:05:46] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 2 ms to minimize.
[2024-06-01 00:05:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:05:46] [INFO ] [Nat]Absence check using 39 positive place invariants in 17 ms returned sat
[2024-06-01 00:05:46] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 21 ms returned sat
[2024-06-01 00:05:46] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2024-06-01 00:05:47] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 2 ms to minimize.
[2024-06-01 00:05:47] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 2 ms to minimize.
[2024-06-01 00:05:47] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 2 ms to minimize.
[2024-06-01 00:05:47] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 2 ms to minimize.
[2024-06-01 00:05:47] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 3 ms to minimize.
[2024-06-01 00:05:47] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 3 ms to minimize.
[2024-06-01 00:05:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 832 ms
[2024-06-01 00:05:47] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 31 ms.
[2024-06-01 00:05:50] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 6 ms to minimize.
[2024-06-01 00:05:50] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 3 ms to minimize.
[2024-06-01 00:05:50] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 2 ms to minimize.
[2024-06-01 00:05:50] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2024-06-01 00:05:50] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-06-01 00:05:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 771 ms
[2024-06-01 00:05:51] [INFO ] Added : 266 causal constraints over 54 iterations in 3207 ms. Result :sat
Minimization took 501 ms.
[2024-06-01 00:05:51] [INFO ] [Real]Absence check using 39 positive place invariants in 15 ms returned sat
[2024-06-01 00:05:51] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 20 ms returned sat
[2024-06-01 00:05:51] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2024-06-01 00:05:52] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 3 ms to minimize.
[2024-06-01 00:05:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:05:52] [INFO ] [Nat]Absence check using 39 positive place invariants in 16 ms returned sat
[2024-06-01 00:05:52] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 20 ms returned sat
[2024-06-01 00:05:52] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2024-06-01 00:05:52] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 3 ms to minimize.
[2024-06-01 00:05:52] [INFO ] Deduced a trap composed of 50 places in 107 ms of which 2 ms to minimize.
[2024-06-01 00:05:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 277 ms
[2024-06-01 00:05:52] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 27 ms.
[2024-06-01 00:05:54] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 2 ms to minimize.
[2024-06-01 00:05:55] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 3 ms to minimize.
[2024-06-01 00:05:55] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 2 ms to minimize.
[2024-06-01 00:05:55] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 3 ms to minimize.
[2024-06-01 00:05:55] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 3 ms to minimize.
[2024-06-01 00:05:55] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 3 ms to minimize.
[2024-06-01 00:05:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 983 ms
[2024-06-01 00:05:55] [INFO ] Added : 243 causal constraints over 50 iterations in 3051 ms. Result :sat
Minimization took 501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 519 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 519/519 places, 470/470 transitions.
Graph (complete) has 1218 edges and 519 vertex of which 508 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.8 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 508 transition count 442
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 487 transition count 442
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 487 transition count 433
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 478 transition count 433
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 459 transition count 414
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 459 transition count 414
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 459 transition count 413
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 458 transition count 413
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 443 transition count 398
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 443 transition count 398
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 148 place count 443 transition count 383
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 441 transition count 382
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 441 transition count 379
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 438 transition count 379
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 361 transition count 302
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 359 transition count 304
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 359 transition count 303
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 358 transition count 303
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 358 transition count 303
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 319 place count 357 transition count 302
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 320 place count 356 transition count 302
Applied a total of 320 rules in 284 ms. Remains 356 /519 variables (removed 163) and now considering 302/470 (removed 168) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 294 ms. Remains : 356/519 places, 302/470 transitions.
// Phase 1: matrix 302 rows 356 cols
[2024-06-01 00:05:56] [INFO ] Computed 60 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (47945 resets) in 3213 ms. (311 steps per ms)
BEST_FIRST walk for 5000004 steps (45737 resets) in 5464 ms. (914 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-06-01 00:06:05] [INFO ] Invariant cache hit.
[2024-06-01 00:06:05] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned sat
[2024-06-01 00:06:05] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-06-01 00:06:05] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2024-06-01 00:06:05] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 20 ms.
[2024-06-01 00:06:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:06:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 8 ms returned sat
[2024-06-01 00:06:05] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-06-01 00:06:05] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2024-06-01 00:06:05] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 18 ms.
[2024-06-01 00:06:07] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-06-01 00:06:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2024-06-01 00:06:07] [INFO ] Added : 241 causal constraints over 49 iterations in 1279 ms. Result :sat
Minimization took 193 ms.
[2024-06-01 00:06:07] [INFO ] [Real]Absence check using 36 positive place invariants in 10 ms returned sat
[2024-06-01 00:06:07] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-06-01 00:06:07] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2024-06-01 00:06:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:06:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2024-06-01 00:06:07] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-06-01 00:06:07] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2024-06-01 00:06:07] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 19 ms.
[2024-06-01 00:06:08] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 1 ms to minimize.
[2024-06-01 00:06:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2024-06-01 00:06:08] [INFO ] Added : 153 causal constraints over 31 iterations in 845 ms. Result :sat
Minimization took 165 ms.
[2024-06-01 00:06:08] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-06-01 00:06:08] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-06-01 00:06:08] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2024-06-01 00:06:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:06:09] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-06-01 00:06:09] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-06-01 00:06:09] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2024-06-01 00:06:09] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 21 ms.
[2024-06-01 00:06:10] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:06:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2024-06-01 00:06:10] [INFO ] Added : 204 causal constraints over 41 iterations in 1091 ms. Result :sat
Minimization took 164 ms.
[2024-06-01 00:06:10] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-06-01 00:06:10] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2024-06-01 00:06:10] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2024-06-01 00:06:10] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 19 ms.
[2024-06-01 00:06:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:06:10] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2024-06-01 00:06:10] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-06-01 00:06:10] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2024-06-01 00:06:10] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 22 ms.
[2024-06-01 00:06:12] [INFO ] Added : 261 causal constraints over 53 iterations in 1186 ms. Result :sat
Minimization took 197 ms.
[2024-06-01 00:06:12] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-06-01 00:06:12] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2024-06-01 00:06:12] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2024-06-01 00:06:12] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 19 ms.
[2024-06-01 00:06:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:06:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-06-01 00:06:12] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-06-01 00:06:12] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2024-06-01 00:06:12] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 15 ms.
[2024-06-01 00:06:13] [INFO ] Added : 233 causal constraints over 47 iterations in 1077 ms. Result :sat
Minimization took 185 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 20 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 15 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2024-06-01 00:06:17] [INFO ] Invariant cache hit.
[2024-06-01 00:06:18] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-06-01 00:06:18] [INFO ] Invariant cache hit.
[2024-06-01 00:06:18] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
[2024-06-01 00:06:18] [INFO ] Redundant transitions in 14 ms returned []
Running 299 sub problems to find dead transitions.
[2024-06-01 00:06:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 299 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/355 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (OVERLAPS) 302/657 variables, 355/415 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-06-01 00:06:27] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-06-01 00:06:27] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:06:27] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:06:28] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/657 variables, 4/419 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/657 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 8 (OVERLAPS) 1/658 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-06-01 00:06:34] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:06:34] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/658 variables, 2/422 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/658 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 11 (OVERLAPS) 0/658 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 658/658 variables, and 422 constraints, problems are : Problem set: 0 solved, 299 unsolved in 28780 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 2/355 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (OVERLAPS) 302/657 variables, 355/421 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/657 variables, 299/720 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/658 variables, and 720 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 355/356 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 6/6 constraints]
After SMT, in 59248ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 59260ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60080 ms. Remains : 356/356 places, 302/302 transitions.
RANDOM walk for 40000 steps (1862 resets) in 2344 ms. (17 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (379 resets) in 221 ms. (180 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (362 resets) in 235 ms. (169 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (365 resets) in 146 ms. (272 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (357 resets) in 140 ms. (283 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (373 resets) in 131 ms. (303 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (375 resets) in 152 ms. (261 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (371 resets) in 117 ms. (339 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (370 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (359 resets) in 104 ms. (380 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (364 resets) in 101 ms. (392 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 800405 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :0 out of 10
Probabilistic random walk after 800405 steps, saw 112986 distinct states, run finished after 3005 ms. (steps per millisecond=266 ) properties seen :0
[2024-06-01 00:07:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 213/218 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/255 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 25/280 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 7/287 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 244/531 variables, 287/342 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 00:07:23] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 74/605 variables, 16/359 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/605 variables, 4/363 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/605 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 2/607 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/607 variables, 2/366 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/607 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 51/658 variables, 51/417 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 00:07:23] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/658 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/658 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 0/658 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 658/658 variables, and 418 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2041 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 213/218 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 37/255 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 25/280 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 7/287 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 244/531 variables, 287/343 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 4/347 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/531 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 74/605 variables, 16/363 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/605 variables, 4/367 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/605 variables, 6/373 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/605 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/605 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 2/607 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/607 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/607 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 51/658 variables, 51/428 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/658 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (OVERLAPS) 0/658 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 658/658 variables, and 428 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1619 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 2/2 constraints]
After SMT, in 3676ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 6851 ms.
Support contains 5 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 10 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 356/356 places, 302/302 transitions.
RANDOM walk for 40000 steps (1917 resets) in 269 ms. (148 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (384 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (348 resets) in 103 ms. (384 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (364 resets) in 105 ms. (377 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (353 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (351 resets) in 130 ms. (305 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (366 resets) in 96 ms. (412 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (360 resets) in 92 ms. (430 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (379 resets) in 91 ms. (434 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (360 resets) in 89 ms. (444 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (386 resets) in 86 ms. (459 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 785563 steps, run timeout after 3001 ms. (steps per millisecond=261 ) properties seen :0 out of 10
Probabilistic random walk after 785563 steps, saw 110852 distinct states, run finished after 3013 ms. (steps per millisecond=260 ) properties seen :0
[2024-06-01 00:07:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 213/218 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/255 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 25/280 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 7/287 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 244/531 variables, 287/342 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 00:07:36] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 74/605 variables, 16/359 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/605 variables, 4/363 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/605 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 2/607 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/607 variables, 2/366 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/607 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 51/658 variables, 51/417 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 00:07:37] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/658 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/658 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 0/658 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 658/658 variables, and 418 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1831 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 213/218 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 37/255 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 25/280 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 7/287 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 244/531 variables, 287/343 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 4/347 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/531 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 74/605 variables, 16/363 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/605 variables, 4/367 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/605 variables, 6/373 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/605 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/605 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 2/607 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/607 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/607 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 51/658 variables, 51/428 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/658 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (OVERLAPS) 0/658 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 658/658 variables, and 428 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1664 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 2/2 constraints]
After SMT, in 3509ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 6202 ms.
Support contains 5 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 10 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 9 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2024-06-01 00:07:46] [INFO ] Invariant cache hit.
[2024-06-01 00:07:46] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-06-01 00:07:46] [INFO ] Invariant cache hit.
[2024-06-01 00:07:46] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2024-06-01 00:07:46] [INFO ] Redundant transitions in 5 ms returned []
Running 299 sub problems to find dead transitions.
[2024-06-01 00:07:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 299 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/355 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (OVERLAPS) 302/657 variables, 355/415 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-06-01 00:07:54] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-01 00:07:54] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-06-01 00:07:55] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:07:56] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/657 variables, 4/419 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/657 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 8 (OVERLAPS) 1/658 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-06-01 00:08:02] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:08:02] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/658 variables, 2/422 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/658 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 11 (OVERLAPS) 0/658 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 658/658 variables, and 422 constraints, problems are : Problem set: 0 solved, 299 unsolved in 29114 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 2/355 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (OVERLAPS) 302/657 variables, 355/421 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/657 variables, 299/720 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/658 variables, and 720 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 355/356 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 6/6 constraints]
After SMT, in 59390ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 59396ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60062 ms. Remains : 356/356 places, 302/302 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 356 transition count 302
Applied a total of 1 rules in 18 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 302 rows 356 cols
[2024-06-01 00:08:46] [INFO ] Computed 60 invariants in 7 ms
[2024-06-01 00:08:46] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-06-01 00:08:46] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2024-06-01 00:08:46] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-06-01 00:08:46] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-06-01 00:08:46] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2024-06-01 00:08:46] [INFO ] After 310ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
TRAPS : Iteration 0
[2024-06-01 00:08:47] [INFO ] After 576ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
[2024-06-01 00:08:47] [INFO ] After 916ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Over-approximation ignoring read arcs solved 0 properties in 1165 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Starting property specific reduction for DES-PT-60b-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]
// Phase 1: matrix 302 rows 356 cols
[2024-06-01 00:08:47] [INFO ] Computed 60 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (467 resets) in 33 ms. (294 steps per ms)
BEST_FIRST walk for 10001 steps (102 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 00:08:47] [INFO ] Invariant cache hit.
[2024-06-01 00:08:47] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-06-01 00:08:47] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-06-01 00:08:47] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2024-06-01 00:08:47] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 18 ms.
[2024-06-01 00:08:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:08:47] [INFO ] [Nat]Absence check using 36 positive place invariants in 8 ms returned sat
[2024-06-01 00:08:47] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-06-01 00:08:47] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2024-06-01 00:08:47] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 20 ms.
[2024-06-01 00:08:49] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2024-06-01 00:08:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2024-06-01 00:08:49] [INFO ] Added : 241 causal constraints over 49 iterations in 1304 ms. Result :sat
Minimization took 186 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 356 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p155) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 301/301 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 355 transition count 300
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 354 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 353 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 352 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 351 transition count 296
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 350 transition count 295
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 349 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 348 transition count 293
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 347 transition count 292
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 346 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 345 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 344 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 343 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 342 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 341 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 340 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17 place count 339 transition count 284
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 18 place count 338 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 19 place count 337 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 20 place count 336 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 21 place count 335 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 22 place count 334 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 23 place count 333 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 24 place count 332 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 25 place count 331 transition count 276
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 26 place count 330 transition count 275
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 27 place count 329 transition count 274
Applied a total of 27 rules in 59 ms. Remains 329 /356 variables (removed 27) and now considering 274/301 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 329/356 places, 274/301 transitions.
// Phase 1: matrix 274 rows 329 cols
[2024-06-01 00:08:50] [INFO ] Computed 61 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47891 resets) in 3058 ms. (326 steps per ms)
BEST_FIRST walk for 1000001 steps (9082 resets) in 1118 ms. (893 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 00:08:54] [INFO ] Invariant cache hit.
[2024-06-01 00:08:54] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-06-01 00:08:54] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 13 ms returned sat
[2024-06-01 00:08:54] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2024-06-01 00:08:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:08:54] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-06-01 00:08:54] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 13 ms returned sat
[2024-06-01 00:08:54] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2024-06-01 00:08:54] [INFO ] Computed and/alt/rep : 260/470/260 causal constraints (skipped 11 transitions) in 18 ms.
[2024-06-01 00:08:55] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 2 ms to minimize.
[2024-06-01 00:08:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2024-06-01 00:08:55] [INFO ] Added : 258 causal constraints over 52 iterations in 1216 ms. Result :sat
Minimization took 165 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 329 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 329/329 places, 274/274 transitions.
Applied a total of 0 rules in 7 ms. Remains 329 /329 variables (removed 0) and now considering 274/274 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 329/329 places, 274/274 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 329/329 places, 274/274 transitions.
Applied a total of 0 rules in 6 ms. Remains 329 /329 variables (removed 0) and now considering 274/274 (removed 0) transitions.
[2024-06-01 00:08:57] [INFO ] Invariant cache hit.
[2024-06-01 00:08:57] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-06-01 00:08:57] [INFO ] Invariant cache hit.
[2024-06-01 00:08:57] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
[2024-06-01 00:08:57] [INFO ] Redundant transitions in 4 ms returned []
Running 271 sub problems to find dead transitions.
[2024-06-01 00:08:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (OVERLAPS) 2/327 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (OVERLAPS) 2/329 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 271 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (OVERLAPS) 274/603 variables, 329/390 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-06-01 00:09:07] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 3 ms to minimize.
[2024-06-01 00:09:07] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-06-01 00:09:08] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-06-01 00:09:09] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-06-01 00:09:09] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/603 variables, 5/395 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/603 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 10 (OVERLAPS) 0/603 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 603/603 variables, and 395 constraints, problems are : Problem set: 0 solved, 271 unsolved in 21898 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 329/329 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/325 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 2/327 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (OVERLAPS) 2/329 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (OVERLAPS) 274/603 variables, 329/395 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/603 variables, 271/666 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 603/603 variables, and 666 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 329/329 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 5/5 constraints]
After SMT, in 52097ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 52100ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52687 ms. Remains : 329/329 places, 274/274 transitions.
RANDOM walk for 40000 steps (1888 resets) in 360 ms. (110 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (327 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (380 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1054454 steps, run timeout after 3001 ms. (steps per millisecond=351 ) properties seen :0 out of 2
Probabilistic random walk after 1054454 steps, saw 148002 distinct states, run finished after 3001 ms. (steps per millisecond=351 ) properties seen :0
[2024-06-01 00:09:52] [INFO ] Invariant cache hit.
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) 32/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/65 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/68 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/73 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/75 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/75 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 14/89 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/89 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/89 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/91 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/91 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/95 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/95 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 195/290 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/290 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 40/330 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/330 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 32/362 variables, 22/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/362 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 9/371 variables, 9/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/371 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 232/603 variables, 284/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/603 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/603 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/603 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 603/603 variables, and 390 constraints, problems are : Problem set: 0 solved, 2 unsolved in 468 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 329/329 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 32/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/65 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/68 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/73 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/75 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/75 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 14/89 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/89 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/89 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/91 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/91 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/95 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/95 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 195/290 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/290 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 40/330 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/330 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 32/362 variables, 22/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 00:09:53] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:09:53] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 7 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/362 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/362 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 9/371 variables, 9/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/371 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 232/603 variables, 284/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/603 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/603 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 0/603 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 603/603 variables, and 394 constraints, problems are : Problem set: 0 solved, 2 unsolved in 489 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 329/329 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 963ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 580 ms.
Support contains 1 out of 329 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 329/329 places, 274/274 transitions.
Applied a total of 0 rules in 7 ms. Remains 329 /329 variables (removed 0) and now considering 274/274 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 329/329 places, 274/274 transitions.
RANDOM walk for 40000 steps (1899 resets) in 201 ms. (198 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (379 resets) in 72 ms. (547 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (349 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1077218 steps, run timeout after 3001 ms. (steps per millisecond=358 ) properties seen :0 out of 2
Probabilistic random walk after 1077218 steps, saw 150833 distinct states, run finished after 3001 ms. (steps per millisecond=358 ) properties seen :0
[2024-06-01 00:09:57] [INFO ] Invariant cache hit.
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) 32/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/65 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/68 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/73 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/75 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/75 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 14/89 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/89 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/89 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/91 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/91 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/95 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/95 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 195/290 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/290 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 40/330 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/330 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 32/362 variables, 22/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/362 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 9/371 variables, 9/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/371 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 232/603 variables, 284/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/603 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/603 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/603 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 603/603 variables, and 390 constraints, problems are : Problem set: 0 solved, 2 unsolved in 452 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 329/329 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 32/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/65 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/68 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/73 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/75 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/75 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 14/89 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/89 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/89 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/91 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/91 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/95 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/95 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 195/290 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/290 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 40/330 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/330 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 32/362 variables, 22/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 00:09:58] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-06-01 00:09:58] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/362 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/362 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 9/371 variables, 9/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/371 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 232/603 variables, 284/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/603 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/603 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 0/603 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 603/603 variables, and 394 constraints, problems are : Problem set: 0 solved, 2 unsolved in 457 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 329/329 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 928ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 585 ms.
Support contains 1 out of 329 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 329/329 places, 274/274 transitions.
Applied a total of 0 rules in 16 ms. Remains 329 /329 variables (removed 0) and now considering 274/274 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 329/329 places, 274/274 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 329/329 places, 274/274 transitions.
Applied a total of 0 rules in 6 ms. Remains 329 /329 variables (removed 0) and now considering 274/274 (removed 0) transitions.
[2024-06-01 00:09:59] [INFO ] Invariant cache hit.
[2024-06-01 00:09:59] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-06-01 00:09:59] [INFO ] Invariant cache hit.
[2024-06-01 00:09:59] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
[2024-06-01 00:09:59] [INFO ] Redundant transitions in 2 ms returned []
Running 271 sub problems to find dead transitions.
[2024-06-01 00:09:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (OVERLAPS) 2/327 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (OVERLAPS) 2/329 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 271 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (OVERLAPS) 274/603 variables, 329/390 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-06-01 00:10:10] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2024-06-01 00:10:10] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-06-01 00:10:11] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 2 ms to minimize.
[2024-06-01 00:10:11] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-06-01 00:10:11] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/603 variables, 5/395 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/603 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 10 (OVERLAPS) 0/603 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 603/603 variables, and 395 constraints, problems are : Problem set: 0 solved, 271 unsolved in 22145 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 329/329 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/325 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 2/327 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (OVERLAPS) 2/329 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (OVERLAPS) 274/603 variables, 329/395 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/603 variables, 271/666 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 603/603 variables, and 666 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 329/329 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 5/5 constraints]
After SMT, in 52355ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 52358ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52955 ms. Remains : 329/329 places, 274/274 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 10 ms. Remains 329 /329 variables (removed 0) and now considering 274/274 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-06-01 00:10:52] [INFO ] Invariant cache hit.
[2024-06-01 00:10:52] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-06-01 00:10:52] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 14 ms returned sat
[2024-06-01 00:10:52] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 00:10:52] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2024-06-01 00:10:52] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 15 ms returned sat
[2024-06-01 00:10:52] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 00:10:52] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-06-01 00:10:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
TRAPS : Iteration 1
[2024-06-01 00:10:52] [INFO ] After 299ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 00:10:52] [INFO ] After 406ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 511 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DES-PT-60b-UpperBounds-04 in 125330 ms.
Starting property specific reduction for DES-PT-60b-UpperBounds-05
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]
// Phase 1: matrix 302 rows 356 cols
[2024-06-01 00:10:52] [INFO ] Computed 60 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (481 resets) in 32 ms. (303 steps per ms)
BEST_FIRST walk for 10001 steps (88 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 00:10:52] [INFO ] Invariant cache hit.
[2024-06-01 00:10:52] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-06-01 00:10:52] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2024-06-01 00:10:52] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2024-06-01 00:10:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:10:52] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-06-01 00:10:52] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-06-01 00:10:53] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2024-06-01 00:10:53] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 19 ms.
[2024-06-01 00:10:53] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 1 ms to minimize.
[2024-06-01 00:10:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2024-06-01 00:10:53] [INFO ] Added : 153 causal constraints over 31 iterations in 807 ms. Result :sat
Minimization took 162 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 356 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p110) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 301/301 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 355 transition count 300
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 354 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 353 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 352 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 351 transition count 296
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 350 transition count 295
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 349 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 348 transition count 293
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 347 transition count 292
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 346 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 345 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 344 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 343 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 342 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 341 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 340 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17 place count 339 transition count 284
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 18 place count 338 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 19 place count 337 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 20 place count 336 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 21 place count 335 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 22 place count 334 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 23 place count 333 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 24 place count 332 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 25 place count 331 transition count 276
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 26 place count 330 transition count 275
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 27 place count 329 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 28 place count 328 transition count 273
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 28 with 1 rules applied. Total rules applied 29 place count 327 transition count 272
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 29 with 1 rules applied. Total rules applied 30 place count 326 transition count 271
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 30 with 1 rules applied. Total rules applied 31 place count 325 transition count 270
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 31 with 1 rules applied. Total rules applied 32 place count 324 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 32 with 1 rules applied. Total rules applied 33 place count 323 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 33 with 1 rules applied. Total rules applied 34 place count 322 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 34 with 1 rules applied. Total rules applied 35 place count 321 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 35 with 1 rules applied. Total rules applied 36 place count 320 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 36 with 1 rules applied. Total rules applied 37 place count 319 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 37 with 1 rules applied. Total rules applied 38 place count 318 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 38 with 1 rules applied. Total rules applied 39 place count 317 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 39 with 1 rules applied. Total rules applied 40 place count 316 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 40 with 1 rules applied. Total rules applied 41 place count 315 transition count 260
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 41 with 1 rules applied. Total rules applied 42 place count 314 transition count 259
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 42 with 1 rules applied. Total rules applied 43 place count 313 transition count 258
Applied a total of 43 rules in 56 ms. Remains 313 /356 variables (removed 43) and now considering 258/301 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 313/356 places, 258/301 transitions.
// Phase 1: matrix 258 rows 313 cols
[2024-06-01 00:10:54] [INFO ] Computed 61 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47738 resets) in 2838 ms. (352 steps per ms)
BEST_FIRST walk for 1000001 steps (9124 resets) in 1059 ms. (943 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 00:10:58] [INFO ] Invariant cache hit.
[2024-06-01 00:10:58] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-06-01 00:10:58] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 8 ms returned sat
[2024-06-01 00:10:58] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-06-01 00:10:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:10:58] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-06-01 00:10:58] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 9 ms returned sat
[2024-06-01 00:10:58] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2024-06-01 00:10:58] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:10:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2024-06-01 00:10:58] [INFO ] Computed and/alt/rep : 244/456/244 causal constraints (skipped 11 transitions) in 15 ms.
[2024-06-01 00:10:59] [INFO ] Added : 111 causal constraints over 23 iterations in 432 ms. Result :sat
Minimization took 126 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 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 258/258 transitions.
Applied a total of 0 rules in 15 ms. Remains 313 /313 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 313/313 places, 258/258 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 258/258 transitions.
Applied a total of 0 rules in 5 ms. Remains 313 /313 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2024-06-01 00:10:59] [INFO ] Invariant cache hit.
[2024-06-01 00:10:59] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-06-01 00:10:59] [INFO ] Invariant cache hit.
[2024-06-01 00:11:00] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
[2024-06-01 00:11:00] [INFO ] Redundant transitions in 1 ms returned []
Running 255 sub problems to find dead transitions.
[2024-06-01 00:11:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (OVERLAPS) 2/311 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-06-01 00:11:05] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 1/312 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD207 is UNSAT
At refinement iteration 9 (OVERLAPS) 258/570 variables, 312/374 constraints. Problems are: Problem set: 84 solved, 171 unsolved
[2024-06-01 00:11:12] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:11:12] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 2 ms to minimize.
[2024-06-01 00:11:12] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/570 variables, 3/377 constraints. Problems are: Problem set: 84 solved, 171 unsolved
[2024-06-01 00:11:15] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/570 variables, 1/378 constraints. Problems are: Problem set: 84 solved, 171 unsolved
[2024-06-01 00:11:16] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/570 variables, 1/379 constraints. Problems are: Problem set: 84 solved, 171 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/570 variables, 0/379 constraints. Problems are: Problem set: 84 solved, 171 unsolved
At refinement iteration 14 (OVERLAPS) 1/571 variables, 1/380 constraints. Problems are: Problem set: 84 solved, 171 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/571 variables, 0/380 constraints. Problems are: Problem set: 84 solved, 171 unsolved
At refinement iteration 16 (OVERLAPS) 0/571 variables, 0/380 constraints. Problems are: Problem set: 84 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 571/571 variables, and 380 constraints, problems are : Problem set: 84 solved, 171 unsolved in 26184 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 84 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 36/36 constraints. Problems are: Problem set: 84 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 17/53 constraints. Problems are: Problem set: 84 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 6/59 constraints. Problems are: Problem set: 84 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 0/59 constraints. Problems are: Problem set: 84 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 2/227 variables, 1/60 constraints. Problems are: Problem set: 84 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/60 constraints. Problems are: Problem set: 84 solved, 171 unsolved
At refinement iteration 6 (OVERLAPS) 85/312 variables, 7/67 constraints. Problems are: Problem set: 84 solved, 171 unsolved
[2024-06-01 00:11:29] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 1/68 constraints. Problems are: Problem set: 84 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/68 constraints. Problems are: Problem set: 84 solved, 171 unsolved
At refinement iteration 9 (OVERLAPS) 258/570 variables, 312/380 constraints. Problems are: Problem set: 84 solved, 171 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/570 variables, 171/551 constraints. Problems are: Problem set: 84 solved, 171 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/570 variables, 0/551 constraints. Problems are: Problem set: 84 solved, 171 unsolved
At refinement iteration 12 (OVERLAPS) 1/571 variables, 1/552 constraints. Problems are: Problem set: 84 solved, 171 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/571 variables, and 552 constraints, problems are : Problem set: 84 solved, 171 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 171/255 constraints, Known Traps: 7/7 constraints]
After SMT, in 56383ms problems are : Problem set: 84 solved, 171 unsolved
Search for dead transitions found 84 dead transitions in 56385ms
Found 84 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 84 transitions
Dead transitions reduction (with SMT) removed 84 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 313/313 places, 174/258 transitions.
Graph (complete) has 738 edges and 313 vertex of which 229 are kept as prefixes of interest. Removing 84 places using SCC suffix rule.0 ms
Discarding 84 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 229 /313 variables (removed 84) and now considering 174/174 (removed 0) transitions.
// Phase 1: matrix 174 rows 229 cols
[2024-06-01 00:11:56] [INFO ] Computed 61 invariants in 3 ms
[2024-06-01 00:11:56] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-06-01 00:11:56] [INFO ] Invariant cache hit.
[2024-06-01 00:11:56] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 229/313 places, 174/258 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 57333 ms. Remains : 229/313 places, 174/258 transitions.
[2024-06-01 00:11:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47864 resets) in 2784 ms. (359 steps per ms)
BEST_FIRST walk for 1000001 steps (9069 resets) in 1054 ms. (947 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 00:12:00] [INFO ] Invariant cache hit.
[2024-06-01 00:12:00] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-06-01 00:12:00] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 6 ms returned sat
[2024-06-01 00:12:00] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-06-01 00:12:00] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:12:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:12:01] [INFO ] [Nat]Absence check using 37 positive place invariants in 8 ms returned sat
[2024-06-01 00:12:01] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 6 ms returned sat
[2024-06-01 00:12:01] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-06-01 00:12:01] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:12:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-06-01 00:12:01] [INFO ] Computed and/alt/rep : 160/286/160 causal constraints (skipped 11 transitions) in 9 ms.
[2024-06-01 00:12:01] [INFO ] Added : 109 causal constraints over 22 iterations in 293 ms. Result :sat
Minimization took 77 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 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 174/174 transitions.
Applied a total of 0 rules in 11 ms. Remains 229 /229 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 229/229 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 174/174 transitions.
Applied a total of 0 rules in 3 ms. Remains 229 /229 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2024-06-01 00:12:01] [INFO ] Invariant cache hit.
[2024-06-01 00:12:01] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-06-01 00:12:01] [INFO ] Invariant cache hit.
[2024-06-01 00:12:02] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2024-06-01 00:12:02] [INFO ] Redundant transitions in 1 ms returned []
Running 171 sub problems to find dead transitions.
[2024-06-01 00:12:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (OVERLAPS) 2/227 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 171 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/228 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 174/402 variables, 228/289 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-06-01 00:12:06] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-06-01 00:12:06] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-06-01 00:12:07] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:12:07] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:12:07] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 3/294 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-06-01 00:12:08] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-06-01 00:12:08] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:12:09] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/402 variables, 3/297 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/402 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 13 (OVERLAPS) 1/403 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/403 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 15 (OVERLAPS) 0/403 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 298 constraints, problems are : Problem set: 0 solved, 171 unsolved in 11409 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 2/227 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-06-01 00:12:15] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (OVERLAPS) 1/228 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 12 (OVERLAPS) 174/402 variables, 228/298 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/402 variables, 171/469 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-06-01 00:12:24] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:12:24] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/402 variables, 2/471 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-06-01 00:12:40] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/402 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 402/403 variables, and 472 constraints, problems are : Problem set: 0 solved, 171 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 228/229 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 12/12 constraints]
After SMT, in 41495ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 41496ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41882 ms. Remains : 229/229 places, 174/174 transitions.
RANDOM walk for 40000 steps (1903 resets) in 218 ms. (182 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (350 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (366 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1192590 steps, run timeout after 3001 ms. (steps per millisecond=397 ) properties seen :0 out of 2
Probabilistic random walk after 1192590 steps, saw 165557 distinct states, run finished after 3001 ms. (steps per millisecond=397 ) properties seen :0
[2024-06-01 00:12:46] [INFO ] Invariant cache hit.
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) 16/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 71/88 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/125 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/150 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/157 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 110/267 variables, 157/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/280 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/280 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/280 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/282 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/282 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/282 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 62/344 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/344 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/344 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 59/403 variables, 59/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/403 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/403 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 290 constraints, problems are : Problem set: 0 solved, 2 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 16/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 71/88 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/125 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/150 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/157 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 110/267 variables, 157/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 00:12:47] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/267 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 13/280 variables, 8/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/280 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/280 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/282 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/282 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/282 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 62/344 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/344 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/344 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 59/403 variables, 59/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/403 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/403 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 293 constraints, problems are : Problem set: 0 solved, 2 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 523ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 590 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 174/174 transitions.
Applied a total of 0 rules in 3 ms. Remains 229 /229 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 229/229 places, 174/174 transitions.
RANDOM walk for 40000 steps (1862 resets) in 360 ms. (110 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (352 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (388 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1161039 steps, run timeout after 3001 ms. (steps per millisecond=386 ) properties seen :0 out of 2
Probabilistic random walk after 1161039 steps, saw 161536 distinct states, run finished after 3001 ms. (steps per millisecond=386 ) properties seen :0
[2024-06-01 00:12:51] [INFO ] Invariant cache hit.
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) 16/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 71/88 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/125 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/150 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/157 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 110/267 variables, 157/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/280 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/280 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/280 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/282 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/282 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/282 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 62/344 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/344 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/344 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 59/403 variables, 59/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/403 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/403 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 290 constraints, problems are : Problem set: 0 solved, 2 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 16/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 71/88 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/125 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/150 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/157 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 110/267 variables, 157/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 00:12:51] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/267 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 13/280 variables, 8/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/280 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/280 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/282 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/282 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/282 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 62/344 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/344 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/344 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 59/403 variables, 59/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/403 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/403 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 293 constraints, problems are : Problem set: 0 solved, 2 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 508ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 421 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 174/174 transitions.
Applied a total of 0 rules in 3 ms. Remains 229 /229 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 229/229 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 174/174 transitions.
Applied a total of 0 rules in 15 ms. Remains 229 /229 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2024-06-01 00:12:52] [INFO ] Invariant cache hit.
[2024-06-01 00:12:52] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-01 00:12:52] [INFO ] Invariant cache hit.
[2024-06-01 00:12:52] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2024-06-01 00:12:52] [INFO ] Redundant transitions in 1 ms returned []
Running 171 sub problems to find dead transitions.
[2024-06-01 00:12:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (OVERLAPS) 2/227 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 171 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/228 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 174/402 variables, 228/289 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-06-01 00:12:56] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-06-01 00:12:57] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-06-01 00:12:57] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:12:57] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:12:57] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 3/294 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-06-01 00:12:58] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-06-01 00:12:58] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:12:59] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/402 variables, 3/297 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/402 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 13 (OVERLAPS) 1/403 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/403 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 15 (OVERLAPS) 0/403 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 298 constraints, problems are : Problem set: 0 solved, 171 unsolved in 11294 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 2/227 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-06-01 00:13:05] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (OVERLAPS) 1/228 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 12 (OVERLAPS) 174/402 variables, 228/298 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/402 variables, 171/469 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-06-01 00:13:14] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:13:14] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/402 variables, 2/471 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-06-01 00:13:30] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/402 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 402/403 variables, and 472 constraints, problems are : Problem set: 0 solved, 171 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 228/229 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 12/12 constraints]
After SMT, in 41375ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 41376ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41756 ms. Remains : 229/229 places, 174/174 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 229 transition count 174
Applied a total of 1 rules in 11 ms. Remains 229 /229 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 174 rows 229 cols
[2024-06-01 00:13:33] [INFO ] Computed 61 invariants in 3 ms
[2024-06-01 00:13:33] [INFO ] [Real]Absence check using 37 positive place invariants in 4 ms returned sat
[2024-06-01 00:13:33] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 7 ms returned sat
[2024-06-01 00:13:33] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 00:13:33] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2024-06-01 00:13:33] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 7 ms returned sat
[2024-06-01 00:13:34] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 00:13:34] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 00:13:34] [INFO ] After 171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 268 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DES-PT-60b-UpperBounds-05 in 161489 ms.
Starting property specific reduction for DES-PT-60b-UpperBounds-07
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]
// Phase 1: matrix 302 rows 356 cols
[2024-06-01 00:13:34] [INFO ] Computed 60 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (472 resets) in 32 ms. (303 steps per ms)
BEST_FIRST walk for 10001 steps (93 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 00:13:34] [INFO ] Invariant cache hit.
[2024-06-01 00:13:34] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-06-01 00:13:34] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-06-01 00:13:34] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2024-06-01 00:13:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:13:34] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-06-01 00:13:34] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-06-01 00:13:34] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2024-06-01 00:13:34] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 20 ms.
[2024-06-01 00:13:35] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 1 ms to minimize.
[2024-06-01 00:13:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2024-06-01 00:13:35] [INFO ] Added : 204 causal constraints over 41 iterations in 1065 ms. Result :sat
Minimization took 166 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 356 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p94) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 301/301 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 355 transition count 300
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 354 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 353 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 352 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 351 transition count 296
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 350 transition count 295
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 349 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 348 transition count 293
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 347 transition count 292
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 346 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 345 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 344 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 343 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 342 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 341 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 340 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17 place count 339 transition count 284
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 18 place count 338 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 19 place count 337 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 20 place count 336 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 21 place count 335 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 22 place count 334 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 23 place count 333 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 24 place count 332 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 25 place count 331 transition count 276
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 26 place count 330 transition count 275
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 27 place count 329 transition count 274
Applied a total of 27 rules in 30 ms. Remains 329 /356 variables (removed 27) and now considering 274/301 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 329/356 places, 274/301 transitions.
// Phase 1: matrix 274 rows 329 cols
[2024-06-01 00:13:36] [INFO ] Computed 61 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47792 resets) in 2872 ms. (348 steps per ms)
BEST_FIRST walk for 1000001 steps (9194 resets) in 1057 ms. (945 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 00:13:40] [INFO ] Invariant cache hit.
[2024-06-01 00:13:40] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-06-01 00:13:40] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 10 ms returned sat
[2024-06-01 00:13:40] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2024-06-01 00:13:40] [INFO ] Computed and/alt/rep : 260/472/260 causal constraints (skipped 11 transitions) in 18 ms.
[2024-06-01 00:13:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:13:40] [INFO ] [Nat]Absence check using 37 positive place invariants in 8 ms returned sat
[2024-06-01 00:13:40] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 10 ms returned sat
[2024-06-01 00:13:40] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2024-06-01 00:13:41] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:13:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2024-06-01 00:13:41] [INFO ] Computed and/alt/rep : 260/472/260 causal constraints (skipped 11 transitions) in 19 ms.
[2024-06-01 00:13:41] [INFO ] Added : 172 causal constraints over 35 iterations in 732 ms. Result :sat
Minimization took 139 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 329 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 329/329 places, 274/274 transitions.
Applied a total of 0 rules in 6 ms. Remains 329 /329 variables (removed 0) and now considering 274/274 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 329/329 places, 274/274 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 329/329 places, 274/274 transitions.
Applied a total of 0 rules in 4 ms. Remains 329 /329 variables (removed 0) and now considering 274/274 (removed 0) transitions.
[2024-06-01 00:13:42] [INFO ] Invariant cache hit.
[2024-06-01 00:13:42] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-06-01 00:13:42] [INFO ] Invariant cache hit.
[2024-06-01 00:13:43] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
[2024-06-01 00:13:43] [INFO ] Redundant transitions in 1 ms returned []
Running 271 sub problems to find dead transitions.
[2024-06-01 00:13:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (OVERLAPS) 2/327 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (OVERLAPS) 1/328 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD207 is UNSAT
At refinement iteration 8 (OVERLAPS) 274/602 variables, 328/389 constraints. Problems are: Problem set: 52 solved, 219 unsolved
[2024-06-01 00:13:52] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-06-01 00:13:53] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-01 00:13:53] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-01 00:13:53] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:13:54] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-06-01 00:13:54] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/602 variables, 6/395 constraints. Problems are: Problem set: 52 solved, 219 unsolved
[2024-06-01 00:13:57] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-06-01 00:13:58] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/602 variables, 2/397 constraints. Problems are: Problem set: 52 solved, 219 unsolved
[2024-06-01 00:13:59] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/602 variables, 1/398 constraints. Problems are: Problem set: 52 solved, 219 unsolved
[2024-06-01 00:14:02] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/602 variables, 1/399 constraints. Problems are: Problem set: 52 solved, 219 unsolved
[2024-06-01 00:14:07] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-01 00:14:09] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/602 variables, 2/401 constraints. Problems are: Problem set: 52 solved, 219 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/602 variables, 0/401 constraints. Problems are: Problem set: 52 solved, 219 unsolved
SMT process timed out in 30196ms, After SMT, problems are : Problem set: 52 solved, 219 unsolved
Search for dead transitions found 52 dead transitions in 30200ms
Found 52 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 52 transitions
Dead transitions reduction (with SMT) removed 52 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 329/329 places, 222/274 transitions.
Graph (complete) has 930 edges and 329 vertex of which 277 are kept as prefixes of interest. Removing 52 places using SCC suffix rule.0 ms
Discarding 52 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 277 /329 variables (removed 52) and now considering 222/222 (removed 0) transitions.
// Phase 1: matrix 222 rows 277 cols
[2024-06-01 00:14:13] [INFO ] Computed 61 invariants in 12 ms
[2024-06-01 00:14:13] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-06-01 00:14:13] [INFO ] Invariant cache hit.
[2024-06-01 00:14:13] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 277/329 places, 222/274 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 31322 ms. Remains : 277/329 places, 222/274 transitions.
[2024-06-01 00:14:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47644 resets) in 2868 ms. (348 steps per ms)
BEST_FIRST walk for 1000000 steps (9025 resets) in 1079 ms. (925 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 00:14:17] [INFO ] Invariant cache hit.
[2024-06-01 00:14:17] [INFO ] [Real]Absence check using 37 positive place invariants in 9 ms returned sat
[2024-06-01 00:14:17] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 11 ms returned sat
[2024-06-01 00:14:17] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-06-01 00:14:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:14:17] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-06-01 00:14:17] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 7 ms returned sat
[2024-06-01 00:14:17] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-06-01 00:14:18] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:14:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-06-01 00:14:18] [INFO ] Computed and/alt/rep : 208/366/208 causal constraints (skipped 11 transitions) in 12 ms.
[2024-06-01 00:14:18] [INFO ] Added : 179 causal constraints over 36 iterations in 652 ms. Result :sat
Minimization took 91 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 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 277 /277 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 277/277 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 277 /277 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-06-01 00:14:19] [INFO ] Invariant cache hit.
[2024-06-01 00:14:19] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-06-01 00:14:19] [INFO ] Invariant cache hit.
[2024-06-01 00:14:19] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2024-06-01 00:14:19] [INFO ] Redundant transitions in 0 ms returned []
Running 219 sub problems to find dead transitions.
[2024-06-01 00:14:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 2/275 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 219 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/276 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 222/498 variables, 276/337 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-01 00:14:25] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-06-01 00:14:26] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2024-06-01 00:14:26] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:14:27] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/498 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-01 00:14:27] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:14:27] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 2 ms to minimize.
[2024-06-01 00:14:28] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-06-01 00:14:28] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 4/345 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-01 00:14:31] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:14:31] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/498 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/498 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 13 (OVERLAPS) 1/499 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/499 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 15 (OVERLAPS) 0/499 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 348 constraints, problems are : Problem set: 0 solved, 219 unsolved in 18314 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 2/275 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 1/276 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (OVERLAPS) 222/498 variables, 276/347 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/498 variables, 219/566 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-01 00:14:51] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:14:58] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:14:58] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:14:59] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/498 variables, 4/570 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/499 variables, and 570 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 276/277 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 14/14 constraints]
After SMT, in 48431ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 48434ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48928 ms. Remains : 277/277 places, 222/222 transitions.
RANDOM walk for 40000 steps (1932 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (359 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (379 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1196118 steps, run timeout after 3001 ms. (steps per millisecond=398 ) properties seen :0 out of 2
Probabilistic random walk after 1196118 steps, saw 166119 distinct states, run finished after 3001 ms. (steps per millisecond=398 ) properties seen :0
[2024-06-01 00:15:11] [INFO ] Invariant cache hit.
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) 32/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 103/136 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/173 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/198 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/205 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 158/363 variables, 205/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/363 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/376 variables, 8/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/376 variables, 3/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/376 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/378 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/378 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/378 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 62/440 variables, 3/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/440 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/440 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 59/499 variables, 59/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/499 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/499 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 338 constraints, problems are : Problem set: 0 solved, 2 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 32/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 103/136 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/173 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/198 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/205 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 158/363 variables, 205/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/363 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/363 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 13/376 variables, 8/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/376 variables, 3/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/376 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/378 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/378 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/378 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 62/440 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/440 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/440 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 59/499 variables, 59/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/499 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/499 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/499 variables, and 340 constraints, problems are : Problem set: 0 solved, 2 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 606ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1060 ms.
Support contains 1 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 277 /277 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 277/277 places, 222/222 transitions.
RANDOM walk for 40000 steps (1926 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (374 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (375 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1197721 steps, run timeout after 3001 ms. (steps per millisecond=399 ) properties seen :0 out of 2
Probabilistic random walk after 1197721 steps, saw 166336 distinct states, run finished after 3001 ms. (steps per millisecond=399 ) properties seen :0
[2024-06-01 00:15:16] [INFO ] Invariant cache hit.
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) 32/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 103/136 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/173 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/198 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/205 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 158/363 variables, 205/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/363 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/376 variables, 8/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/376 variables, 3/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/376 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/378 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/378 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/378 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 62/440 variables, 3/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/440 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/440 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 59/499 variables, 59/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/499 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/499 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 338 constraints, problems are : Problem set: 0 solved, 2 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 32/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 103/136 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/173 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/198 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/205 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 158/363 variables, 205/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/363 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/363 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 13/376 variables, 8/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/376 variables, 3/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/376 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/378 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/378 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/378 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 62/440 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/440 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/440 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 59/499 variables, 59/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/499 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/499 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/499 variables, and 340 constraints, problems are : Problem set: 0 solved, 2 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 607ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 834 ms.
Support contains 1 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 222/222 transitions.
Applied a total of 0 rules in 3 ms. Remains 277 /277 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 277/277 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 222/222 transitions.
Applied a total of 0 rules in 3 ms. Remains 277 /277 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-06-01 00:15:17] [INFO ] Invariant cache hit.
[2024-06-01 00:15:17] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-06-01 00:15:17] [INFO ] Invariant cache hit.
[2024-06-01 00:15:17] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2024-06-01 00:15:17] [INFO ] Redundant transitions in 0 ms returned []
Running 219 sub problems to find dead transitions.
[2024-06-01 00:15:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 2/275 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 219 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/276 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 222/498 variables, 276/337 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-01 00:15:23] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:15:24] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:15:24] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:15:24] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/498 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-01 00:15:25] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2024-06-01 00:15:25] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:15:26] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-06-01 00:15:26] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 4/345 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-01 00:15:29] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:15:29] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/498 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/498 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 13 (OVERLAPS) 1/499 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/499 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 15 (OVERLAPS) 0/499 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 348 constraints, problems are : Problem set: 0 solved, 219 unsolved in 17743 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 2/275 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 1/276 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (OVERLAPS) 222/498 variables, 276/347 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/498 variables, 219/566 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-01 00:15:49] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-06-01 00:15:56] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:15:56] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-06-01 00:15:56] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/498 variables, 4/570 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/499 variables, and 570 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 276/277 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 14/14 constraints]
After SMT, in 47875ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 47877ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48356 ms. Remains : 277/277 places, 222/222 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 277 transition count 222
Applied a total of 1 rules in 7 ms. Remains 277 /277 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 222 rows 277 cols
[2024-06-01 00:16:05] [INFO ] Computed 61 invariants in 4 ms
[2024-06-01 00:16:05] [INFO ] [Real]Absence check using 37 positive place invariants in 5 ms returned sat
[2024-06-01 00:16:05] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 13 ms returned sat
[2024-06-01 00:16:05] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 00:16:05] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2024-06-01 00:16:05] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 13 ms returned sat
[2024-06-01 00:16:06] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 00:16:06] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-06-01 00:16:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
TRAPS : Iteration 1
[2024-06-01 00:16:06] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 00:16:06] [INFO ] After 324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 418 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DES-PT-60b-UpperBounds-07 in 152178 ms.
Starting property specific reduction for DES-PT-60b-UpperBounds-11
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]
// Phase 1: matrix 302 rows 356 cols
[2024-06-01 00:16:06] [INFO ] Computed 60 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (485 resets) in 32 ms. (303 steps per ms)
BEST_FIRST walk for 10000 steps (86 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 00:16:06] [INFO ] Invariant cache hit.
[2024-06-01 00:16:06] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-06-01 00:16:06] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-06-01 00:16:06] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2024-06-01 00:16:06] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 19 ms.
[2024-06-01 00:16:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:16:06] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-06-01 00:16:06] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-06-01 00:16:06] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2024-06-01 00:16:06] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 18 ms.
[2024-06-01 00:16:07] [INFO ] Added : 261 causal constraints over 53 iterations in 1166 ms. Result :sat
Minimization took 195 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 356 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p136) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 301/301 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 355 transition count 300
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 354 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 353 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 352 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 351 transition count 296
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 350 transition count 295
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 349 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 348 transition count 293
Applied a total of 8 rules in 12 ms. Remains 348 /356 variables (removed 8) and now considering 293/301 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 348/356 places, 293/301 transitions.
// Phase 1: matrix 293 rows 348 cols
[2024-06-01 00:16:08] [INFO ] Computed 61 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47865 resets) in 2848 ms. (351 steps per ms)
BEST_FIRST walk for 1000001 steps (9107 resets) in 1053 ms. (948 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 00:16:12] [INFO ] Invariant cache hit.
[2024-06-01 00:16:12] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-06-01 00:16:12] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 15 ms returned sat
[2024-06-01 00:16:13] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2024-06-01 00:16:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:16:13] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-06-01 00:16:13] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 13 ms returned sat
[2024-06-01 00:16:13] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2024-06-01 00:16:13] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:16:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2024-06-01 00:16:13] [INFO ] Computed and/alt/rep : 279/489/279 causal constraints (skipped 11 transitions) in 16 ms.
[2024-06-01 00:16:13] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-06-01 00:16:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-06-01 00:16:13] [INFO ] Added : 107 causal constraints over 23 iterations in 527 ms. Result :sat
Minimization took 133 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 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 348 /348 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 348/348 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 293/293 transitions.
Applied a total of 0 rules in 5 ms. Remains 348 /348 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-06-01 00:16:14] [INFO ] Invariant cache hit.
[2024-06-01 00:16:15] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-06-01 00:16:15] [INFO ] Invariant cache hit.
[2024-06-01 00:16:15] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
[2024-06-01 00:16:15] [INFO ] Redundant transitions in 1 ms returned []
Running 290 sub problems to find dead transitions.
[2024-06-01 00:16:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/344 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (OVERLAPS) 2/346 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 2/348 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 290 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 293/641 variables, 348/409 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-01 00:16:26] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:16:26] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2024-06-01 00:16:27] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-06-01 00:16:28] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 4/413 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/641 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-01 00:16:37] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/641 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/641 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 12 (OVERLAPS) 0/641 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 641/641 variables, and 414 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 348/348 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/344 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/344 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 2/346 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (OVERLAPS) 2/348 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 293/641 variables, 348/414 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/641 variables, 290/704 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 641/641 variables, and 704 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 348/348 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 5/5 constraints]
After SMT, in 60218ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 60221ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60801 ms. Remains : 348/348 places, 293/293 transitions.
RANDOM walk for 40000 steps (1876 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (356 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (369 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 971402 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :0 out of 2
Probabilistic random walk after 971402 steps, saw 135956 distinct states, run finished after 3001 ms. (steps per millisecond=323 ) properties seen :0
[2024-06-01 00:17:18] [INFO ] Invariant cache hit.
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) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/103 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/106 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/111 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/113 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 14/127 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/127 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/127 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/129 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/129 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/133 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/133 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 195/328 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/328 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 40/368 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/368 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 32/400 variables, 22/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/400 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 9/409 variables, 9/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/409 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 232/641 variables, 284/408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/641 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/641 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/641 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 641/641 variables, and 409 constraints, problems are : Problem set: 0 solved, 2 unsolved in 515 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 348/348 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/103 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/106 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/111 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/111 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/113 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/113 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 14/127 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/127 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/127 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/129 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/129 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/133 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/133 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 195/328 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/328 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 40/368 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/368 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 32/400 variables, 22/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/400 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 9/409 variables, 9/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/409 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 232/641 variables, 284/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/641 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/641 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 0/641 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 641/641 variables, and 411 constraints, problems are : Problem set: 0 solved, 2 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 348/348 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 867ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 734 ms.
Support contains 1 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 293/293 transitions.
Applied a total of 0 rules in 5 ms. Remains 348 /348 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 348/348 places, 293/293 transitions.
RANDOM walk for 40000 steps (1901 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (353 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (365 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 920384 steps, run timeout after 3001 ms. (steps per millisecond=306 ) properties seen :0 out of 2
Probabilistic random walk after 920384 steps, saw 129204 distinct states, run finished after 3001 ms. (steps per millisecond=306 ) properties seen :0
[2024-06-01 00:17:23] [INFO ] Invariant cache hit.
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) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/103 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/106 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/111 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/113 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 14/127 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/127 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/127 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/129 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/129 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/133 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/133 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 195/328 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/328 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 40/368 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/368 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 32/400 variables, 22/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/400 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 9/409 variables, 9/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/409 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 232/641 variables, 284/408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/641 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/641 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/641 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 641/641 variables, and 409 constraints, problems are : Problem set: 0 solved, 2 unsolved in 510 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 348/348 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/103 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/106 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/111 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/111 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/113 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/113 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 14/127 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/127 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/127 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/129 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/129 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/133 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/133 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 195/328 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/328 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 40/368 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/368 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 32/400 variables, 22/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/400 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 9/409 variables, 9/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/409 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 232/641 variables, 284/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/641 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/641 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 0/641 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 641/641 variables, and 411 constraints, problems are : Problem set: 0 solved, 2 unsolved in 366 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 348/348 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 886ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1282 ms.
Support contains 1 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 293/293 transitions.
Applied a total of 0 rules in 5 ms. Remains 348 /348 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 348/348 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 293/293 transitions.
Applied a total of 0 rules in 10 ms. Remains 348 /348 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-06-01 00:17:25] [INFO ] Invariant cache hit.
[2024-06-01 00:17:25] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-06-01 00:17:25] [INFO ] Invariant cache hit.
[2024-06-01 00:17:26] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
[2024-06-01 00:17:26] [INFO ] Redundant transitions in 0 ms returned []
Running 290 sub problems to find dead transitions.
[2024-06-01 00:17:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/344 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (OVERLAPS) 2/346 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 2/348 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 290 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 293/641 variables, 348/409 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-01 00:17:37] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2024-06-01 00:17:37] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-06-01 00:17:38] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2024-06-01 00:17:38] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 4/413 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/641 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-01 00:17:47] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/641 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/641 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 12 (OVERLAPS) 0/641 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 641/641 variables, and 414 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 348/348 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/344 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/344 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 2/346 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (OVERLAPS) 2/348 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 293/641 variables, 348/414 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/641 variables, 290/704 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 641/641 variables, and 704 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 348/348 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 5/5 constraints]
After SMT, in 60220ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 60223ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60825 ms. Remains : 348/348 places, 293/293 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 5 ms. Remains 348 /348 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-06-01 00:18:26] [INFO ] Invariant cache hit.
[2024-06-01 00:18:26] [INFO ] [Real]Absence check using 37 positive place invariants in 5 ms returned sat
[2024-06-01 00:18:26] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 15 ms returned sat
[2024-06-01 00:18:26] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 00:18:26] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-06-01 00:18:26] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 14 ms returned sat
[2024-06-01 00:18:26] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 00:18:26] [INFO ] After 193ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 00:18:26] [INFO ] After 307ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 405 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DES-PT-60b-UpperBounds-11 in 140606 ms.
Starting property specific reduction for DES-PT-60b-UpperBounds-12
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]
// Phase 1: matrix 302 rows 356 cols
[2024-06-01 00:18:26] [INFO ] Computed 60 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (482 resets) in 30 ms. (322 steps per ms)
BEST_FIRST walk for 10000 steps (86 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 00:18:26] [INFO ] Invariant cache hit.
[2024-06-01 00:18:26] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-06-01 00:18:26] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-06-01 00:18:27] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2024-06-01 00:18:27] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 17 ms.
[2024-06-01 00:18:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:18:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 8 ms returned sat
[2024-06-01 00:18:27] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-06-01 00:18:27] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2024-06-01 00:18:27] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 18 ms.
[2024-06-01 00:18:28] [INFO ] Added : 233 causal constraints over 47 iterations in 994 ms. Result :sat
Minimization took 171 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 356 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p162) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 301/301 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 355 transition count 300
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 354 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 353 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 352 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 351 transition count 296
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 350 transition count 295
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 349 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 348 transition count 293
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 347 transition count 292
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 346 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 345 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 344 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 343 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 342 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 341 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 340 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17 place count 339 transition count 284
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 18 place count 338 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 19 place count 337 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 20 place count 336 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 21 place count 335 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 22 place count 334 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 23 place count 333 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 24 place count 332 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 25 place count 331 transition count 276
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 26 place count 330 transition count 275
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 27 place count 329 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 28 place count 328 transition count 273
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 28 with 1 rules applied. Total rules applied 29 place count 327 transition count 272
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 29 with 1 rules applied. Total rules applied 30 place count 326 transition count 271
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 30 with 1 rules applied. Total rules applied 31 place count 325 transition count 270
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 31 with 1 rules applied. Total rules applied 32 place count 324 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 32 with 1 rules applied. Total rules applied 33 place count 323 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 33 with 1 rules applied. Total rules applied 34 place count 322 transition count 267
Applied a total of 34 rules in 27 ms. Remains 322 /356 variables (removed 34) and now considering 267/301 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 322/356 places, 267/301 transitions.
// Phase 1: matrix 267 rows 322 cols
[2024-06-01 00:18:29] [INFO ] Computed 61 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47687 resets) in 2842 ms. (351 steps per ms)
BEST_FIRST walk for 1000001 steps (9091 resets) in 1051 ms. (950 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 00:18:33] [INFO ] Invariant cache hit.
[2024-06-01 00:18:33] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-06-01 00:18:33] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 13 ms returned sat
[2024-06-01 00:18:33] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2024-06-01 00:18:33] [INFO ] Computed and/alt/rep : 253/463/253 causal constraints (skipped 11 transitions) in 16 ms.
[2024-06-01 00:18:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:18:33] [INFO ] [Nat]Absence check using 37 positive place invariants in 9 ms returned sat
[2024-06-01 00:18:33] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 13 ms returned sat
[2024-06-01 00:18:33] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2024-06-01 00:18:33] [INFO ] Computed and/alt/rep : 253/463/253 causal constraints (skipped 11 transitions) in 16 ms.
[2024-06-01 00:18:34] [INFO ] Added : 195 causal constraints over 39 iterations in 729 ms. Result :sat
Minimization took 144 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 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 267/267 transitions.
Applied a total of 0 rules in 4 ms. Remains 322 /322 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 322/322 places, 267/267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 267/267 transitions.
Applied a total of 0 rules in 4 ms. Remains 322 /322 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-06-01 00:18:35] [INFO ] Invariant cache hit.
[2024-06-01 00:18:35] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-06-01 00:18:35] [INFO ] Invariant cache hit.
[2024-06-01 00:18:35] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
[2024-06-01 00:18:35] [INFO ] Redundant transitions in 1 ms returned []
Running 264 sub problems to find dead transitions.
[2024-06-01 00:18:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 2/320 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (OVERLAPS) 2/322 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 264 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 267/589 variables, 322/383 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-01 00:18:45] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:18:45] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/589 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-01 00:18:50] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2024-06-01 00:18:50] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 2/387 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 11 (OVERLAPS) 0/589 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 589/589 variables, and 387 constraints, problems are : Problem set: 0 solved, 264 unsolved in 24029 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (OVERLAPS) 2/320 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 2/322 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (OVERLAPS) 267/589 variables, 322/387 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 264/651 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 589/589 variables, and 651 constraints, problems are : Problem set: 0 solved, 264 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 4/4 constraints]
After SMT, in 54228ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 54230ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54805 ms. Remains : 322/322 places, 267/267 transitions.
RANDOM walk for 40000 steps (1890 resets) in 174 ms. (228 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (372 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (356 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1141166 steps, run timeout after 3001 ms. (steps per millisecond=380 ) properties seen :0 out of 2
Probabilistic random walk after 1141166 steps, saw 159015 distinct states, run finished after 3001 ms. (steps per millisecond=380 ) properties seen :0
[2024-06-01 00:19:33] [INFO ] Invariant cache hit.
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) 25/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/51 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/54 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/59 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/61 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/61 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 14/75 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/75 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/75 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/77 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/77 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/81 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/81 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 195/276 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/276 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 40/316 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/316 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 32/348 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/348 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 9/357 variables, 9/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/357 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 232/589 variables, 284/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/589 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/589 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/589 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 589/589 variables, and 383 constraints, problems are : Problem set: 0 solved, 2 unsolved in 387 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 25/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/51 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/54 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/59 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/59 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/61 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/61 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 14/75 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/75 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/75 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/77 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/77 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/81 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/81 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 195/276 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/276 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 40/316 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/316 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 32/348 variables, 22/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/348 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 9/357 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/357 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 232/589 variables, 284/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/589 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/589 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 0/589 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 589/589 variables, and 385 constraints, problems are : Problem set: 0 solved, 2 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 713ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 453 ms.
Support contains 1 out of 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 267/267 transitions.
Applied a total of 0 rules in 4 ms. Remains 322 /322 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 322/322 places, 267/267 transitions.
RANDOM walk for 40000 steps (1942 resets) in 193 ms. (206 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (394 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (363 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1146695 steps, run timeout after 3001 ms. (steps per millisecond=382 ) properties seen :0 out of 2
Probabilistic random walk after 1146695 steps, saw 159724 distinct states, run finished after 3001 ms. (steps per millisecond=382 ) properties seen :0
[2024-06-01 00:19:37] [INFO ] Invariant cache hit.
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) 25/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/51 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/54 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/59 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/61 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/61 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 14/75 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/75 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/75 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/77 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/77 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/81 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/81 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 195/276 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/276 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 40/316 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/316 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 32/348 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/348 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 9/357 variables, 9/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/357 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 232/589 variables, 284/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/589 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/589 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/589 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 589/589 variables, and 383 constraints, problems are : Problem set: 0 solved, 2 unsolved in 357 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 25/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/51 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/54 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/59 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/59 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/61 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/61 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 14/75 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/75 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/75 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/77 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/77 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/81 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/81 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 195/276 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/276 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 40/316 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/316 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 32/348 variables, 22/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/348 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 9/357 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/357 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 232/589 variables, 284/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/589 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/589 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 0/589 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 589/589 variables, and 385 constraints, problems are : Problem set: 0 solved, 2 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 689ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 456 ms.
Support contains 1 out of 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 267/267 transitions.
Applied a total of 0 rules in 3 ms. Remains 322 /322 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 322/322 places, 267/267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 267/267 transitions.
Applied a total of 0 rules in 4 ms. Remains 322 /322 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-06-01 00:19:38] [INFO ] Invariant cache hit.
[2024-06-01 00:19:38] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-06-01 00:19:38] [INFO ] Invariant cache hit.
[2024-06-01 00:19:39] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
[2024-06-01 00:19:39] [INFO ] Redundant transitions in 1 ms returned []
Running 264 sub problems to find dead transitions.
[2024-06-01 00:19:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 2/320 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (OVERLAPS) 2/322 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 264 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 267/589 variables, 322/383 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-01 00:19:48] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:19:48] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/589 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-01 00:19:53] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-06-01 00:19:53] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 2/387 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 11 (OVERLAPS) 0/589 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 589/589 variables, and 387 constraints, problems are : Problem set: 0 solved, 264 unsolved in 23964 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (OVERLAPS) 2/320 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 2/322 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (OVERLAPS) 267/589 variables, 322/387 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 264/651 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 589/589 variables, and 651 constraints, problems are : Problem set: 0 solved, 264 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 4/4 constraints]
After SMT, in 54145ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 54148ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54730 ms. Remains : 322/322 places, 267/267 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 6 ms. Remains 322 /322 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-06-01 00:20:33] [INFO ] Invariant cache hit.
[2024-06-01 00:20:33] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-06-01 00:20:33] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 15 ms returned sat
[2024-06-01 00:20:33] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 00:20:33] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-06-01 00:20:33] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 14 ms returned sat
[2024-06-01 00:20:33] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 00:20:33] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-06-01 00:20:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
TRAPS : Iteration 1
[2024-06-01 00:20:33] [INFO ] After 292ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 00:20:33] [INFO ] After 405ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 513 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DES-PT-60b-UpperBounds-12 in 126903 ms.
[2024-06-01 00:20:34] [INFO ] Flatten gal took : 63 ms
[2024-06-01 00:20:34] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-06-01 00:20:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 356 places, 302 transitions and 1465 arcs took 5 ms.
Total runtime 902882 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 : DES-PT-60b-UpperBounds-04
Could not compute solution for formula : DES-PT-60b-UpperBounds-05
Could not compute solution for formula : DES-PT-60b-UpperBounds-07
Could not compute solution for formula : DES-PT-60b-UpperBounds-11
Could not compute solution for formula : DES-PT-60b-UpperBounds-12

BK_STOP 1717201234347

--------------------
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 DES-PT-60b-UpperBounds-04
ub formula formula --maxsum=/tmp/1573/ub_0_
ub formula name DES-PT-60b-UpperBounds-05
ub formula formula --maxsum=/tmp/1573/ub_1_
ub formula name DES-PT-60b-UpperBounds-07
ub formula formula --maxsum=/tmp/1573/ub_2_
ub formula name DES-PT-60b-UpperBounds-11
ub formula formula --maxsum=/tmp/1573/ub_3_
ub formula name DES-PT-60b-UpperBounds-12
ub formula formula --maxsum=/tmp/1573/ub_4_
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="DES-PT-60b"
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 DES-PT-60b, 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 r480-tall-171624189900757"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-60b.tgz
mv DES-PT-60b 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 ;