Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r149-smll-167819435900292.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is DoubleExponent-PT-004, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r149-smll-167819435900292
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.6K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 26 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 67K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1678372043326

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-004
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 14:27:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-09 14:27:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 14:27:25] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2023-03-09 14:27:26] [INFO ] Transformed 216 places.
[2023-03-09 14:27:26] [INFO ] Transformed 198 transitions.
[2023-03-09 14:27:26] [INFO ] Parsed PT model containing 216 places and 198 transitions and 558 arcs in 186 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 216/216 places, 198/198 transitions.
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 212 transition count 150
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 100 place count 164 transition count 150
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 100 place count 164 transition count 142
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 116 place count 156 transition count 142
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 196 place count 116 transition count 102
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 208 place count 110 transition count 102
Applied a total of 208 rules in 51 ms. Remains 110 /216 variables (removed 106) and now considering 102/198 (removed 96) transitions.
// Phase 1: matrix 102 rows 110 cols
[2023-03-09 14:27:26] [INFO ] Computed 21 place invariants in 17 ms
[2023-03-09 14:27:26] [INFO ] Implicit Places using invariants in 396 ms returned [47, 48]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 442 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 108/216 places, 102/198 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 108 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 107 transition count 101
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 104 transition count 98
Applied a total of 8 rules in 10 ms. Remains 104 /108 variables (removed 4) and now considering 98/102 (removed 4) transitions.
// Phase 1: matrix 98 rows 104 cols
[2023-03-09 14:27:26] [INFO ] Computed 19 place invariants in 5 ms
[2023-03-09 14:27:26] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-09 14:27:26] [INFO ] Invariant cache hit.
[2023-03-09 14:27:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 14:27:27] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 104/216 places, 98/198 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1070 ms. Remains : 104/216 places, 98/198 transitions.
Discarding 22 transitions out of 98. Remains 76
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 1236 resets, run finished after 744 ms. (steps per millisecond=13 ) properties (out of 75) seen :20
Incomplete Best-First random walk after 1000 steps, including 76 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 77 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 76 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 76 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 62 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 55) seen :2
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 74 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 72 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 70 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 75 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 73 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 70 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 72 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 70 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 72 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 78 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 76 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 74 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 75 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 66 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 66 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 74 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 71 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 70 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 72 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 53) seen :3
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 76 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 76 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 74 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 70 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 74 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 75 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 68 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 73 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 75 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 69 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 67 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 73 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 72 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 68 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 73 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 50) seen :0
Running SMT prover for 50 properties.
[2023-03-09 14:27:29] [INFO ] Invariant cache hit.
[2023-03-09 14:27:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:27:29] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 8 ms returned sat
[2023-03-09 14:27:30] [INFO ] After 521ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:49
[2023-03-09 14:27:30] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 14:27:30] [INFO ] After 24ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:50
[2023-03-09 14:27:30] [INFO ] After 1026ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:50
[2023-03-09 14:27:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 14:27:30] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 9 ms returned sat
[2023-03-09 14:27:31] [INFO ] After 475ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :50
[2023-03-09 14:27:31] [INFO ] After 413ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :50
[2023-03-09 14:27:31] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 21 ms to minimize.
[2023-03-09 14:27:31] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 2 ms to minimize.
[2023-03-09 14:27:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 134 ms
[2023-03-09 14:27:31] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2023-03-09 14:27:31] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 2 ms to minimize.
[2023-03-09 14:27:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 90 ms
[2023-03-09 14:27:31] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2023-03-09 14:27:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-09 14:27:32] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2023-03-09 14:27:32] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2023-03-09 14:27:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 123 ms
[2023-03-09 14:27:32] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2023-03-09 14:27:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-09 14:27:32] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2023-03-09 14:27:32] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2023-03-09 14:27:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 90 ms
[2023-03-09 14:27:32] [INFO ] After 1676ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :50
Attempting to minimize the solution found.
Minimization took 447 ms.
[2023-03-09 14:27:33] [INFO ] After 3039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :50
Parikh walk visited 0 properties in 7334 ms.
Support contains 72 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 98/98 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 104 transition count 98
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 103 transition count 97
Applied a total of 3 rules in 38 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 103/104 places, 97/98 transitions.
Interrupted random walk after 876409 steps, including 109568 resets, run timeout after 30001 ms. (steps per millisecond=29 ) properties seen 3
Incomplete Best-First random walk after 100000 steps, including 8377 resets, run finished after 2193 ms. (steps per millisecond=45 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8235 resets, run finished after 2315 ms. (steps per millisecond=43 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8307 resets, run finished after 2266 ms. (steps per millisecond=44 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8418 resets, run finished after 2330 ms. (steps per millisecond=42 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8364 resets, run finished after 2336 ms. (steps per millisecond=42 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8335 resets, run finished after 2329 ms. (steps per millisecond=42 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 8320 resets, run finished after 2325 ms. (steps per millisecond=43 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 8283 resets, run finished after 2260 ms. (steps per millisecond=44 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8397 resets, run finished after 2225 ms. (steps per millisecond=44 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8298 resets, run finished after 1966 ms. (steps per millisecond=50 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8337 resets, run finished after 2291 ms. (steps per millisecond=43 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8332 resets, run finished after 2357 ms. (steps per millisecond=42 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8358 resets, run finished after 2515 ms. (steps per millisecond=39 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8321 resets, run finished after 2464 ms. (steps per millisecond=40 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8444 resets, run finished after 2208 ms. (steps per millisecond=45 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 8287 resets, run finished after 2368 ms. (steps per millisecond=42 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8209 resets, run finished after 1997 ms. (steps per millisecond=50 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8288 resets, run finished after 2383 ms. (steps per millisecond=41 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8363 resets, run finished after 2370 ms. (steps per millisecond=42 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8324 resets, run finished after 2418 ms. (steps per millisecond=41 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 8405 resets, run finished after 2346 ms. (steps per millisecond=42 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8380 resets, run finished after 2404 ms. (steps per millisecond=41 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8332 resets, run finished after 2285 ms. (steps per millisecond=43 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 8260 resets, run finished after 1939 ms. (steps per millisecond=51 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8443 resets, run finished after 2374 ms. (steps per millisecond=42 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8306 resets, run finished after 2373 ms. (steps per millisecond=42 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8405 resets, run finished after 2387 ms. (steps per millisecond=41 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 8392 resets, run finished after 2315 ms. (steps per millisecond=43 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8306 resets, run finished after 2403 ms. (steps per millisecond=41 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 8321 resets, run finished after 2246 ms. (steps per millisecond=44 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 8380 resets, run finished after 2380 ms. (steps per millisecond=42 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8296 resets, run finished after 2262 ms. (steps per millisecond=44 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 8407 resets, run finished after 2161 ms. (steps per millisecond=46 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8253 resets, run finished after 1727 ms. (steps per millisecond=57 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 8327 resets, run finished after 1774 ms. (steps per millisecond=56 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8304 resets, run finished after 1557 ms. (steps per millisecond=64 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8394 resets, run finished after 1556 ms. (steps per millisecond=64 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8308 resets, run finished after 2304 ms. (steps per millisecond=43 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 8325 resets, run finished after 2398 ms. (steps per millisecond=41 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 8404 resets, run finished after 2409 ms. (steps per millisecond=41 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8290 resets, run finished after 2406 ms. (steps per millisecond=41 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 8400 resets, run finished after 2426 ms. (steps per millisecond=41 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 8341 resets, run finished after 2417 ms. (steps per millisecond=41 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 8303 resets, run finished after 2386 ms. (steps per millisecond=41 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8378 resets, run finished after 2397 ms. (steps per millisecond=41 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 8332 resets, run finished after 2417 ms. (steps per millisecond=41 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8314 resets, run finished after 2415 ms. (steps per millisecond=41 ) properties (out of 47) seen :0
Probably explored full state space saw : 882644 states, properties seen :28
Probabilistic random walk after 1765367 steps, saw 882644 distinct states, run finished after 36782 ms. (steps per millisecond=47 ) properties seen :28
Interrupted probabilistic random walk after 28219537 steps, run timeout after 408001 ms. (steps per millisecond=69 ) properties seen :{0=1, 1=1, 2=1, 4=1, 5=1, 6=1, 7=1, 9=1, 10=1, 11=1, 14=1, 15=1, 16=1}
Exhaustive walk after 28219537 steps, saw 14109890 distinct states, run finished after 408004 ms. (steps per millisecond=69 ) properties seen :13
Running SMT prover for 6 properties.
// Phase 1: matrix 97 rows 103 cols
[2023-03-09 14:37:21] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-09 14:37:21] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 14:37:22] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 8 ms returned sat
[2023-03-09 14:37:22] [INFO ] After 100ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2023-03-09 14:37:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 14:37:22] [INFO ] After 25ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 14:37:22] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 14:37:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:37:22] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-09 14:37:22] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 14:37:22] [INFO ] After 51ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 14:37:22] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2023-03-09 14:37:22] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2023-03-09 14:37:22] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2023-03-09 14:37:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 137 ms
[2023-03-09 14:37:22] [INFO ] After 259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-09 14:37:22] [INFO ] After 487ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 6055 ms.
Support contains 11 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 97/97 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 103 transition count 88
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 94 transition count 88
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 27 place count 94 transition count 88
Applied a total of 27 rules in 41 ms. Remains 94 /103 variables (removed 9) and now considering 88/97 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 94/103 places, 88/97 transitions.
Incomplete random walk after 1000000 steps, including 127093 resets, run finished after 19397 ms. (steps per millisecond=51 ) properties (out of 6) seen :0
Interrupted Best-First random walk after 375193 steps, including 31584 resets, run timeout after 5001 ms. (steps per millisecond=75 ) properties seen 0
Interrupted Best-First random walk after 365042 steps, including 30795 resets, run timeout after 5001 ms. (steps per millisecond=72 ) properties seen 0
Interrupted Best-First random walk after 365668 steps, including 30896 resets, run timeout after 5001 ms. (steps per millisecond=73 ) properties seen 0
Interrupted Best-First random walk after 387071 steps, including 32637 resets, run timeout after 5001 ms. (steps per millisecond=77 ) properties seen 0
Interrupted Best-First random walk after 361857 steps, including 30482 resets, run timeout after 5001 ms. (steps per millisecond=72 ) properties seen 0
Interrupted Best-First random walk after 350764 steps, including 29411 resets, run timeout after 5001 ms. (steps per millisecond=70 ) properties seen 0
Interrupted probabilistic random walk after 11453358 steps, run timeout after 147001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 11453358 steps, saw 5724867 distinct states, run finished after 147009 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 88 rows 94 cols
[2023-03-09 14:40:45] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-09 14:40:45] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 14:40:45] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-09 14:40:45] [INFO ] After 95ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-09 14:40:45] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:40:45] [INFO ] After 19ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 14:40:45] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 14:40:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:40:45] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 10 ms returned sat
[2023-03-09 14:40:45] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 14:40:45] [INFO ] After 57ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 14:40:45] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2023-03-09 14:40:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-09 14:40:45] [INFO ] After 157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-09 14:40:45] [INFO ] After 389ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 3617 ms.
Support contains 11 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 88/88 transitions.
Applied a total of 0 rules in 6 ms. Remains 94 /94 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 94/94 places, 88/88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 88/88 transitions.
Applied a total of 0 rules in 5 ms. Remains 94 /94 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2023-03-09 14:40:49] [INFO ] Invariant cache hit.
[2023-03-09 14:40:49] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-09 14:40:49] [INFO ] Invariant cache hit.
[2023-03-09 14:40:49] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:40:49] [INFO ] Implicit Places using invariants and state equation in 329 ms returned [20, 62, 67, 85, 91]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 465 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 89/94 places, 88/88 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 89 transition count 86
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 87 transition count 86
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 87 transition count 86
Applied a total of 5 rules in 16 ms. Remains 87 /89 variables (removed 2) and now considering 86/88 (removed 2) transitions.
// Phase 1: matrix 86 rows 87 cols
[2023-03-09 14:40:49] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-09 14:40:49] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-09 14:40:49] [INFO ] Invariant cache hit.
[2023-03-09 14:40:50] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:40:50] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 87/94 places, 86/88 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 820 ms. Remains : 87/94 places, 86/88 transitions.
Incomplete random walk after 1000000 steps, including 142780 resets, run finished after 18068 ms. (steps per millisecond=55 ) properties (out of 6) seen :0
Interrupted Best-First random walk after 409311 steps, including 37461 resets, run timeout after 5001 ms. (steps per millisecond=81 ) properties seen 0
Interrupted Best-First random walk after 496998 steps, including 45470 resets, run timeout after 5001 ms. (steps per millisecond=99 ) properties seen 0
Interrupted Best-First random walk after 384655 steps, including 34946 resets, run timeout after 5001 ms. (steps per millisecond=76 ) properties seen 0
Interrupted Best-First random walk after 400153 steps, including 36495 resets, run timeout after 5001 ms. (steps per millisecond=80 ) properties seen 0
Interrupted Best-First random walk after 421857 steps, including 38389 resets, run timeout after 5001 ms. (steps per millisecond=84 ) properties seen 0
Interrupted Best-First random walk after 414057 steps, including 37686 resets, run timeout after 5001 ms. (steps per millisecond=82 ) properties seen 0
Interrupted probabilistic random walk after 11160028 steps, run timeout after 144001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 11160028 steps, saw 5577904 distinct states, run finished after 144001 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-09 14:44:02] [INFO ] Invariant cache hit.
[2023-03-09 14:44:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:44:02] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-09 14:44:02] [INFO ] After 76ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2023-03-09 14:44:02] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:44:02] [INFO ] After 30ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 14:44:02] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 14:44:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:44:02] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-09 14:44:02] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 14:44:02] [INFO ] After 56ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 14:44:02] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2023-03-09 14:44:02] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2023-03-09 14:44:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 75 ms
[2023-03-09 14:44:02] [INFO ] After 191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-09 14:44:02] [INFO ] After 391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 5009 ms.
Support contains 11 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 86/86 transitions.
Applied a total of 0 rules in 5 ms. Remains 87 /87 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 87/87 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 86/86 transitions.
Applied a total of 0 rules in 6 ms. Remains 87 /87 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2023-03-09 14:44:07] [INFO ] Invariant cache hit.
[2023-03-09 14:44:07] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-09 14:44:07] [INFO ] Invariant cache hit.
[2023-03-09 14:44:08] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:44:08] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
[2023-03-09 14:44:08] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 14:44:08] [INFO ] Invariant cache hit.
[2023-03-09 14:44:08] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 516 ms. Remains : 87/87 places, 86/86 transitions.
Incomplete random walk after 100000 steps, including 14270 resets, run finished after 2299 ms. (steps per millisecond=43 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-09 14:44:10] [INFO ] Invariant cache hit.
[2023-03-09 14:44:10] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 14:44:10] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 9 ms returned sat
[2023-03-09 14:44:10] [INFO ] After 81ms SMT Verify possible using state equation in real domain returned unsat :0 sat :11
[2023-03-09 14:44:10] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:44:10] [INFO ] After 54ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :11
[2023-03-09 14:44:11] [INFO ] After 250ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-09 14:44:11] [INFO ] After 411ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-09 14:44:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:44:11] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 8 ms returned sat
[2023-03-09 14:44:11] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-09 14:44:11] [INFO ] After 55ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-09 14:44:11] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2023-03-09 14:44:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-03-09 14:44:11] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2023-03-09 14:44:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-09 14:44:11] [INFO ] After 316ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-09 14:44:11] [INFO ] After 534ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Incomplete random walk after 1000000 steps, including 142758 resets, run finished after 15009 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Interrupted Best-First random walk after 393203 steps, including 35698 resets, run timeout after 5001 ms. (steps per millisecond=78 ) properties seen 0
Interrupted Best-First random walk after 415088 steps, including 37801 resets, run timeout after 5001 ms. (steps per millisecond=83 ) properties seen 0
Interrupted Best-First random walk after 406505 steps, including 36800 resets, run timeout after 5001 ms. (steps per millisecond=81 ) properties seen 0
Interrupted Best-First random walk after 428044 steps, including 38803 resets, run timeout after 5001 ms. (steps per millisecond=85 ) properties seen 0
Interrupted Best-First random walk after 415618 steps, including 37729 resets, run timeout after 5001 ms. (steps per millisecond=83 ) properties seen 0
Interrupted Best-First random walk after 416782 steps, including 37769 resets, run timeout after 5001 ms. (steps per millisecond=83 ) properties seen 0
Interrupted probabilistic random walk after 10996309 steps, run timeout after 135001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 10996309 steps, saw 5496143 distinct states, run finished after 135002 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-09 14:47:11] [INFO ] Invariant cache hit.
[2023-03-09 14:47:11] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 14:47:11] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 10 ms returned sat
[2023-03-09 14:47:11] [INFO ] After 88ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2023-03-09 14:47:11] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:47:11] [INFO ] After 33ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 14:47:11] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 14:47:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 14:47:11] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-09 14:47:12] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 14:47:12] [INFO ] After 52ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 14:47:12] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2023-03-09 14:47:12] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2023-03-09 14:47:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 76 ms
[2023-03-09 14:47:12] [INFO ] After 186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-09 14:47:12] [INFO ] After 384ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 5640 ms.
Support contains 11 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 86/86 transitions.
Applied a total of 0 rules in 5 ms. Remains 87 /87 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 87/87 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 86/86 transitions.
Applied a total of 0 rules in 4 ms. Remains 87 /87 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2023-03-09 14:47:17] [INFO ] Invariant cache hit.
[2023-03-09 14:47:18] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-09 14:47:18] [INFO ] Invariant cache hit.
[2023-03-09 14:47:18] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:47:18] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2023-03-09 14:47:18] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 14:47:18] [INFO ] Invariant cache hit.
[2023-03-09 14:47:18] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 443 ms. Remains : 87/87 places, 86/86 transitions.
Incomplete random walk after 100000 steps, including 14322 resets, run finished after 2187 ms. (steps per millisecond=45 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-09 14:47:20] [INFO ] Invariant cache hit.
[2023-03-09 14:47:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:47:20] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-09 14:47:20] [INFO ] After 61ms SMT Verify possible using state equation in real domain returned unsat :0 sat :11
[2023-03-09 14:47:20] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:47:20] [INFO ] After 36ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :11
[2023-03-09 14:47:20] [INFO ] After 153ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-09 14:47:20] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-09 14:47:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:47:20] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-09 14:47:20] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-09 14:47:20] [INFO ] After 38ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-09 14:47:20] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2023-03-09 14:47:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-09 14:47:21] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2023-03-09 14:47:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-09 14:47:21] [INFO ] After 221ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-09 14:47:21] [INFO ] After 358ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Incomplete random walk after 10000 steps, including 1405 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 915 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 943203 steps, run timeout after 3001 ms. (steps per millisecond=314 ) properties seen :{}
Probabilistic random walk after 943203 steps, saw 471701 distinct states, run finished after 3004 ms. (steps per millisecond=313 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 14:47:24] [INFO ] Invariant cache hit.
[2023-03-09 14:47:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:47:24] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-09 14:47:24] [INFO ] After 54ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:47:24] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:47:24] [INFO ] After 18ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:47:24] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:47:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:47:24] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-09 14:47:24] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:47:24] [INFO ] After 18ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:47:24] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 14:47:24] [INFO ] After 125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 86/86 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 87 transition count 82
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 83 transition count 82
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 83 transition count 82
Applied a total of 11 rules in 14 ms. Remains 83 /87 variables (removed 4) and now considering 82/86 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 83/87 places, 82/86 transitions.
Incomplete random walk after 10000 steps, including 1443 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 937 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 949012 steps, run timeout after 3001 ms. (steps per millisecond=316 ) properties seen :{}
Probabilistic random walk after 949012 steps, saw 474604 distinct states, run finished after 3001 ms. (steps per millisecond=316 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 82 rows 83 cols
[2023-03-09 14:47:27] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-09 14:47:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:47:27] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-09 14:47:27] [INFO ] After 52ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:47:27] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:47:27] [INFO ] After 15ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:47:27] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:47:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 14:47:27] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-09 14:47:27] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:47:27] [INFO ] After 15ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:47:27] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 14:47:27] [INFO ] After 116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 82/82 transitions.
Applied a total of 0 rules in 5 ms. Remains 83 /83 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 83/83 places, 82/82 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 82/82 transitions.
Applied a total of 0 rules in 5 ms. Remains 83 /83 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-09 14:47:27] [INFO ] Invariant cache hit.
[2023-03-09 14:47:27] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-09 14:47:27] [INFO ] Invariant cache hit.
[2023-03-09 14:47:27] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:47:28] [INFO ] Implicit Places using invariants and state equation in 304 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 413 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 82/83 places, 82/82 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 82 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 81
Applied a total of 2 rules in 16 ms. Remains 81 /82 variables (removed 1) and now considering 81/82 (removed 1) transitions.
// Phase 1: matrix 81 rows 81 cols
[2023-03-09 14:47:28] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-09 14:47:28] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-09 14:47:28] [INFO ] Invariant cache hit.
[2023-03-09 14:47:28] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:47:28] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 81/83 places, 81/82 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 779 ms. Remains : 81/83 places, 81/82 transitions.
Incomplete random walk after 10000 steps, including 1420 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 897 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 958913 steps, run timeout after 3001 ms. (steps per millisecond=319 ) properties seen :{}
Probabilistic random walk after 958913 steps, saw 479556 distinct states, run finished after 3001 ms. (steps per millisecond=319 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 14:47:31] [INFO ] Invariant cache hit.
[2023-03-09 14:47:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:47:31] [INFO ] [Real]Absence check using 2 positive and 11 generalized place invariants in 4 ms returned sat
[2023-03-09 14:47:31] [INFO ] After 38ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:47:31] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:47:31] [INFO ] After 17ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:47:31] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:47:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:47:31] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 5 ms returned sat
[2023-03-09 14:47:31] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:47:31] [INFO ] After 17ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:47:31] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 14:47:31] [INFO ] After 134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 6 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 4 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-09 14:47:31] [INFO ] Invariant cache hit.
[2023-03-09 14:47:31] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-09 14:47:31] [INFO ] Invariant cache hit.
[2023-03-09 14:47:31] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:47:32] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2023-03-09 14:47:32] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 14:47:32] [INFO ] Invariant cache hit.
[2023-03-09 14:47:32] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 421 ms. Remains : 81/81 places, 81/81 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 71 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 69
Applied a total of 24 rules in 16 ms. Remains 69 /81 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 69 cols
[2023-03-09 14:47:32] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:47:32] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 14:47:32] [INFO ] [Real]Absence check using 2 positive and 11 generalized place invariants in 4 ms returned sat
[2023-03-09 14:47:32] [INFO ] After 39ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:47:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 14:47:32] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:47:32] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:47:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:47:32] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 4 ms returned sat
[2023-03-09 14:47:32] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:47:32] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:47:32] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 14:47:32] [INFO ] After 103ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1429 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 922 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 937964 steps, run timeout after 3001 ms. (steps per millisecond=312 ) properties seen :{}
Probabilistic random walk after 937964 steps, saw 469083 distinct states, run finished after 3001 ms. (steps per millisecond=312 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 87 cols
[2023-03-09 14:47:35] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-09 14:47:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:47:35] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-09 14:47:35] [INFO ] After 51ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:47:35] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:47:35] [INFO ] After 18ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:47:35] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:47:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:47:35] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-09 14:47:35] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:47:35] [INFO ] After 17ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:47:35] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 14:47:35] [INFO ] After 125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 86/86 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 87 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 86 transition count 85
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 86 transition count 85
Applied a total of 6 rules in 11 ms. Remains 86 /87 variables (removed 1) and now considering 85/86 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 86/87 places, 85/86 transitions.
Incomplete random walk after 10000 steps, including 1426 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 893 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 937957 steps, run timeout after 3001 ms. (steps per millisecond=312 ) properties seen :{}
Probabilistic random walk after 937957 steps, saw 469074 distinct states, run finished after 3001 ms. (steps per millisecond=312 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 85 rows 86 cols
[2023-03-09 14:47:38] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-09 14:47:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:47:38] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-09 14:47:38] [INFO ] After 41ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:47:38] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:47:38] [INFO ] After 13ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 14:47:38] [INFO ] After 23ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-09 14:47:38] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 85/85 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 86/86 places, 85/85 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 85/85 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2023-03-09 14:47:38] [INFO ] Invariant cache hit.
[2023-03-09 14:47:38] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-09 14:47:38] [INFO ] Invariant cache hit.
[2023-03-09 14:47:38] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:47:39] [INFO ] Implicit Places using invariants and state equation in 223 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 306 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 85/86 places, 85/85 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 85 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 84
Applied a total of 2 rules in 8 ms. Remains 84 /85 variables (removed 1) and now considering 84/85 (removed 1) transitions.
// Phase 1: matrix 84 rows 84 cols
[2023-03-09 14:47:39] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-09 14:47:39] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-09 14:47:39] [INFO ] Invariant cache hit.
[2023-03-09 14:47:39] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:47:39] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 84/86 places, 84/85 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 680 ms. Remains : 84/86 places, 84/85 transitions.
Incomplete random walk after 10000 steps, including 1437 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 912 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 944532 steps, run timeout after 3001 ms. (steps per millisecond=314 ) properties seen :{}
Probabilistic random walk after 944532 steps, saw 472365 distinct states, run finished after 3001 ms. (steps per millisecond=314 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 14:47:42] [INFO ] Invariant cache hit.
[2023-03-09 14:47:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:47:42] [INFO ] [Real]Absence check using 2 positive and 11 generalized place invariants in 4 ms returned sat
[2023-03-09 14:47:42] [INFO ] After 49ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:47:42] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:47:42] [INFO ] After 15ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:47:42] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:47:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:47:42] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 4 ms returned sat
[2023-03-09 14:47:42] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:47:42] [INFO ] After 15ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:47:42] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 14:47:42] [INFO ] After 117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 84/84 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 14:47:42] [INFO ] Invariant cache hit.
[2023-03-09 14:47:42] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-09 14:47:42] [INFO ] Invariant cache hit.
[2023-03-09 14:47:42] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:47:43] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2023-03-09 14:47:43] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 14:47:43] [INFO ] Invariant cache hit.
[2023-03-09 14:47:43] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 457 ms. Remains : 84/84 places, 84/84 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 84 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 83 transition count 83
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 83 transition count 77
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 77 transition count 77
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 74 transition count 74
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 74 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 73 transition count 73
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 73 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 72 transition count 72
Applied a total of 24 rules in 13 ms. Remains 72 /84 variables (removed 12) and now considering 72/84 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 72 rows 72 cols
[2023-03-09 14:47:43] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:47:43] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:47:43] [INFO ] [Real]Absence check using 2 positive and 11 generalized place invariants in 5 ms returned sat
[2023-03-09 14:47:43] [INFO ] After 43ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:47:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 14:47:43] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:47:43] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:47:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:47:43] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 5 ms returned sat
[2023-03-09 14:47:43] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:47:43] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:47:43] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 14:47:43] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1452 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 877 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 947715 steps, run timeout after 3001 ms. (steps per millisecond=315 ) properties seen :{}
Probabilistic random walk after 947715 steps, saw 473959 distinct states, run finished after 3007 ms. (steps per millisecond=315 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 87 cols
[2023-03-09 14:47:46] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-09 14:47:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:47:46] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-09 14:47:46] [INFO ] After 42ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:47:46] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:47:46] [INFO ] After 15ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:47:46] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:47:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:47:46] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-09 14:47:46] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:47:46] [INFO ] After 19ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:47:46] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 14:47:46] [INFO ] After 121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 86/86 transitions.
Graph (complete) has 319 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 86 transition count 85
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 86 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 84 transition count 83
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 84 transition count 83
Applied a total of 9 rules in 13 ms. Remains 84 /87 variables (removed 3) and now considering 83/86 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 84/87 places, 83/86 transitions.
Incomplete random walk after 10000 steps, including 1468 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 890 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 945895 steps, run timeout after 3001 ms. (steps per millisecond=315 ) properties seen :{}
Probabilistic random walk after 945895 steps, saw 473045 distinct states, run finished after 3003 ms. (steps per millisecond=314 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 83 rows 84 cols
[2023-03-09 14:47:49] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-09 14:47:49] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 14:47:49] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 14:47:49] [INFO ] After 48ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:47:49] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:47:49] [INFO ] After 20ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:47:49] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:47:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-09 14:47:49] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 14:47:49] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:47:49] [INFO ] After 18ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:47:49] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 14:47:49] [INFO ] After 121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 84/84 places, 83/83 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2023-03-09 14:47:49] [INFO ] Invariant cache hit.
[2023-03-09 14:47:50] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-09 14:47:50] [INFO ] Invariant cache hit.
[2023-03-09 14:47:50] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:47:50] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2023-03-09 14:47:50] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 14:47:50] [INFO ] Invariant cache hit.
[2023-03-09 14:47:50] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 503 ms. Remains : 84/84 places, 83/83 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 84 transition count 77
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 78 transition count 77
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 76 transition count 75
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 76 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 75 transition count 74
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 75 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 74 transition count 73
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 74 transition count 73
Applied a total of 21 rules in 14 ms. Remains 74 /84 variables (removed 10) and now considering 73/83 (removed 10) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 73 rows 74 cols
[2023-03-09 14:47:50] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-09 14:47:50] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 14:47:50] [INFO ] [Real]Absence check using 4 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-09 14:47:50] [INFO ] After 41ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:47:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 14:47:50] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:47:50] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:47:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 14:47:50] [INFO ] [Nat]Absence check using 4 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-09 14:47:50] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:47:50] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:47:50] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 14:47:50] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1430 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 933 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 954807 steps, run timeout after 3001 ms. (steps per millisecond=318 ) properties seen :{}
Probabilistic random walk after 954807 steps, saw 477503 distinct states, run finished after 3001 ms. (steps per millisecond=318 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 87 cols
[2023-03-09 14:47:53] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-09 14:47:53] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 14:47:53] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-09 14:47:53] [INFO ] After 51ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:47:53] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:47:53] [INFO ] After 14ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:47:53] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:47:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:47:53] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-09 14:47:53] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:47:53] [INFO ] After 16ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:47:53] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 14:47:53] [INFO ] After 120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 86/86 transitions.
Graph (complete) has 319 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 86 transition count 85
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 86 transition count 82
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 83 transition count 82
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 83 transition count 82
Applied a total of 11 rules in 11 ms. Remains 83 /87 variables (removed 4) and now considering 82/86 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 83/87 places, 82/86 transitions.
Incomplete random walk after 10000 steps, including 1467 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 919 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 970040 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :{}
Probabilistic random walk after 970040 steps, saw 485118 distinct states, run finished after 3001 ms. (steps per millisecond=323 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 82 rows 83 cols
[2023-03-09 14:47:56] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-09 14:47:57] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 14:47:57] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 14:47:57] [INFO ] After 54ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:47:57] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:47:57] [INFO ] After 18ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:47:57] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:47:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 14:47:57] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 14:47:57] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:47:57] [INFO ] After 16ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:47:57] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 14:47:57] [INFO ] After 120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 83/83 places, 82/82 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-09 14:47:57] [INFO ] Invariant cache hit.
[2023-03-09 14:47:57] [INFO ] Implicit Places using invariants in 111 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 112 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 82/83 places, 82/82 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 82 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 81
Applied a total of 2 rules in 4 ms. Remains 81 /82 variables (removed 1) and now considering 81/82 (removed 1) transitions.
// Phase 1: matrix 81 rows 81 cols
[2023-03-09 14:47:57] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:47:57] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-09 14:47:57] [INFO ] Invariant cache hit.
[2023-03-09 14:47:57] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:47:57] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 81/83 places, 81/82 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 444 ms. Remains : 81/83 places, 81/82 transitions.
Incomplete random walk after 10000 steps, including 1431 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 890 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 937252 steps, run timeout after 3001 ms. (steps per millisecond=312 ) properties seen :{}
Probabilistic random walk after 937252 steps, saw 468725 distinct states, run finished after 3001 ms. (steps per millisecond=312 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 14:48:00] [INFO ] Invariant cache hit.
[2023-03-09 14:48:00] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 14:48:00] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 8 ms returned sat
[2023-03-09 14:48:00] [INFO ] After 43ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:48:00] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:48:00] [INFO ] After 17ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 14:48:00] [INFO ] After 26ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 14:48:00] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 14:48:00] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 14:48:00] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:00] [INFO ] After 17ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:00] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 14:48:00] [INFO ] After 115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-09 14:48:00] [INFO ] Invariant cache hit.
[2023-03-09 14:48:01] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-09 14:48:01] [INFO ] Invariant cache hit.
[2023-03-09 14:48:01] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:48:01] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2023-03-09 14:48:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 14:48:01] [INFO ] Invariant cache hit.
[2023-03-09 14:48:01] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 399 ms. Remains : 81/81 places, 81/81 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 71 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 69
Applied a total of 24 rules in 9 ms. Remains 69 /81 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 69 cols
[2023-03-09 14:48:01] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:48:01] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 14:48:01] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 5 ms returned sat
[2023-03-09 14:48:01] [INFO ] After 39ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:48:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 14:48:01] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:01] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 14:48:01] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 5 ms returned sat
[2023-03-09 14:48:01] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:01] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:01] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2023-03-09 14:48:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-09 14:48:01] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 14:48:01] [INFO ] After 131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1455 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 918 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 939555 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :{}
Probabilistic random walk after 939555 steps, saw 469878 distinct states, run finished after 3001 ms. (steps per millisecond=313 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 87 cols
[2023-03-09 14:48:04] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-09 14:48:04] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:48:04] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-09 14:48:04] [INFO ] After 51ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:48:04] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:48:04] [INFO ] After 20ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 14:48:04] [INFO ] After 29ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 14:48:04] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 86/86 transitions.
Graph (complete) has 319 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 86 transition count 85
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 86 transition count 81
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 82 transition count 81
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 82 transition count 81
Applied a total of 14 rules in 6 ms. Remains 82 /87 variables (removed 5) and now considering 81/86 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 82/87 places, 81/86 transitions.
Incomplete random walk after 10000 steps, including 1420 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 908 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 948113 steps, run timeout after 3001 ms. (steps per millisecond=315 ) properties seen :{}
Probabilistic random walk after 948113 steps, saw 474155 distinct states, run finished after 3001 ms. (steps per millisecond=315 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 81 rows 82 cols
[2023-03-09 14:48:07] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-09 14:48:07] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 14:48:07] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 14:48:07] [INFO ] After 49ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:48:07] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:48:07] [INFO ] After 13ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 14:48:07] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2023-03-09 14:48:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-09 14:48:07] [INFO ] After 63ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:07] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 14:48:07] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 14:48:08] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:08] [INFO ] After 13ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:08] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 14:48:08] [INFO ] After 118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 82/82 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-09 14:48:08] [INFO ] Invariant cache hit.
[2023-03-09 14:48:08] [INFO ] Implicit Places using invariants in 108 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 81/82 places, 81/81 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 81 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 80
Applied a total of 2 rules in 11 ms. Remains 80 /81 variables (removed 1) and now considering 80/81 (removed 1) transitions.
// Phase 1: matrix 80 rows 80 cols
[2023-03-09 14:48:08] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-09 14:48:08] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-09 14:48:08] [INFO ] Invariant cache hit.
[2023-03-09 14:48:08] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:48:08] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 80/82 places, 80/81 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 484 ms. Remains : 80/82 places, 80/81 transitions.
Incomplete random walk after 10000 steps, including 1404 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 931 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 955832 steps, run timeout after 3001 ms. (steps per millisecond=318 ) properties seen :{}
Probabilistic random walk after 955832 steps, saw 478011 distinct states, run finished after 3007 ms. (steps per millisecond=317 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 14:48:11] [INFO ] Invariant cache hit.
[2023-03-09 14:48:11] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 14:48:11] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 14:48:11] [INFO ] After 45ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:48:11] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:48:11] [INFO ] After 13ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 14:48:11] [INFO ] After 23ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:11] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 14:48:11] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 14:48:11] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:11] [INFO ] After 12ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:11] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 14:48:11] [INFO ] After 110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 80/80 transitions.
Applied a total of 0 rules in 5 ms. Remains 80 /80 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 80/80 places, 80/80 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-09 14:48:11] [INFO ] Invariant cache hit.
[2023-03-09 14:48:11] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-09 14:48:11] [INFO ] Invariant cache hit.
[2023-03-09 14:48:11] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:48:12] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2023-03-09 14:48:12] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 14:48:12] [INFO ] Invariant cache hit.
[2023-03-09 14:48:12] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 459 ms. Remains : 80/80 places, 80/80 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 80 transition count 74
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 74 transition count 74
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 71 transition count 71
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 71 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 70 transition count 70
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 70 transition count 68
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 68 transition count 68
Applied a total of 24 rules in 7 ms. Remains 68 /80 variables (removed 12) and now considering 68/80 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 68 rows 68 cols
[2023-03-09 14:48:12] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:48:12] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 14:48:12] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-09 14:48:12] [INFO ] After 44ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:48:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 14:48:12] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:12] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 14:48:12] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-09 14:48:12] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:12] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:12] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 14:48:12] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1422 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 891 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 956494 steps, run timeout after 3001 ms. (steps per millisecond=318 ) properties seen :{}
Probabilistic random walk after 956494 steps, saw 478348 distinct states, run finished after 3004 ms. (steps per millisecond=318 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 87 cols
[2023-03-09 14:48:15] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-09 14:48:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:48:15] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 10 ms returned sat
[2023-03-09 14:48:15] [INFO ] After 51ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:48:15] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:48:15] [INFO ] After 15ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:15] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:48:15] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-09 14:48:15] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:15] [INFO ] After 16ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:15] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 14:48:15] [INFO ] After 121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 86/86 transitions.
Graph (complete) has 319 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 86 transition count 85
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 86 transition count 82
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 83 transition count 82
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 83 transition count 82
Applied a total of 12 rules in 7 ms. Remains 83 /87 variables (removed 4) and now considering 82/86 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 83/87 places, 82/86 transitions.
Incomplete random walk after 10000 steps, including 1398 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 904 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 974804 steps, run timeout after 3001 ms. (steps per millisecond=324 ) properties seen :{}
Probabilistic random walk after 974804 steps, saw 487499 distinct states, run finished after 3004 ms. (steps per millisecond=324 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 82 rows 83 cols
[2023-03-09 14:48:18] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-09 14:48:18] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 14:48:18] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 14:48:18] [INFO ] After 45ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:48:18] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 14:48:18] [INFO ] After 15ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:18] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 14:48:18] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 14:48:18] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:18] [INFO ] After 15ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:18] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-09 14:48:18] [INFO ] After 131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 83 /83 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 83/83 places, 82/82 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-09 14:48:18] [INFO ] Invariant cache hit.
[2023-03-09 14:48:19] [INFO ] Implicit Places using invariants in 111 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 82/83 places, 82/82 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 82 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 81
Applied a total of 2 rules in 3 ms. Remains 81 /82 variables (removed 1) and now considering 81/82 (removed 1) transitions.
// Phase 1: matrix 81 rows 81 cols
[2023-03-09 14:48:19] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:48:19] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-09 14:48:19] [INFO ] Invariant cache hit.
[2023-03-09 14:48:19] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 14:48:19] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 81/83 places, 81/82 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 481 ms. Remains : 81/83 places, 81/82 transitions.
Incomplete random walk after 10000 steps, including 1439 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 885 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 962593 steps, run timeout after 3001 ms. (steps per millisecond=320 ) properties seen :{}
Probabilistic random walk after 962593 steps, saw 481390 distinct states, run finished after 3001 ms. (steps per millisecond=320 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 14:48:22] [INFO ] Invariant cache hit.
[2023-03-09 14:48:22] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-09 14:48:22] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 14:48:22] [INFO ] After 44ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:48:22] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 14:48:22] [INFO ] After 12ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:22] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 14:48:22] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 14:48:22] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:22] [INFO ] After 16ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:22] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 14:48:22] [INFO ] After 120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-09 14:48:22] [INFO ] Invariant cache hit.
[2023-03-09 14:48:22] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-09 14:48:22] [INFO ] Invariant cache hit.
[2023-03-09 14:48:22] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 14:48:23] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2023-03-09 14:48:23] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 14:48:23] [INFO ] Invariant cache hit.
[2023-03-09 14:48:23] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 462 ms. Remains : 81/81 places, 81/81 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 71 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 69
Applied a total of 24 rules in 7 ms. Remains 69 /81 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 69 cols
[2023-03-09 14:48:23] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:48:23] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 14:48:23] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-09 14:48:23] [INFO ] After 46ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:48:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 14:48:23] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:23] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 14:48:23] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 5 ms returned sat
[2023-03-09 14:48:23] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:23] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:23] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 14:48:23] [INFO ] After 99ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1430 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 932 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2057 steps, run visited all 1 properties in 9 ms. (steps per millisecond=228 )
Probabilistic random walk after 2057 steps, saw 1043 distinct states, run finished after 10 ms. (steps per millisecond=205 ) properties seen :1
Incomplete random walk after 10000 steps, including 1420 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 912 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 968045 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :{}
Probabilistic random walk after 968045 steps, saw 484122 distinct states, run finished after 3001 ms. (steps per millisecond=322 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 87 cols
[2023-03-09 14:48:26] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-09 14:48:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:48:26] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-09 14:48:26] [INFO ] After 44ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:48:26] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:48:26] [INFO ] After 15ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 14:48:26] [INFO ] After 25ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-09 14:48:26] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 86/86 transitions.
Graph (complete) has 319 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 86 transition count 85
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 86 transition count 82
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 83 transition count 82
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 83 transition count 82
Applied a total of 12 rules in 9 ms. Remains 83 /87 variables (removed 4) and now considering 82/86 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 83/87 places, 82/86 transitions.
Incomplete random walk after 10000 steps, including 1445 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 904 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 972134 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :{}
Probabilistic random walk after 972134 steps, saw 486169 distinct states, run finished after 3002 ms. (steps per millisecond=323 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 82 rows 83 cols
[2023-03-09 14:48:29] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-09 14:48:29] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 14:48:29] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 14:48:29] [INFO ] After 44ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:48:29] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 14:48:29] [INFO ] After 14ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:29] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 14:48:29] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 14:48:29] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:29] [INFO ] After 19ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:29] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-09 14:48:29] [INFO ] After 124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 83 /83 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 83/83 places, 82/82 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-09 14:48:29] [INFO ] Invariant cache hit.
[2023-03-09 14:48:29] [INFO ] Implicit Places using invariants in 83 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 84 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 82/83 places, 82/82 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 82 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 81
Applied a total of 2 rules in 3 ms. Remains 81 /82 variables (removed 1) and now considering 81/82 (removed 1) transitions.
// Phase 1: matrix 81 rows 81 cols
[2023-03-09 14:48:29] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:48:30] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-09 14:48:30] [INFO ] Invariant cache hit.
[2023-03-09 14:48:30] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 14:48:30] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 81/83 places, 81/82 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 431 ms. Remains : 81/83 places, 81/82 transitions.
Incomplete random walk after 10000 steps, including 1444 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 936 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 963492 steps, run timeout after 3001 ms. (steps per millisecond=321 ) properties seen :{}
Probabilistic random walk after 963492 steps, saw 481838 distinct states, run finished after 3001 ms. (steps per millisecond=321 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 14:48:33] [INFO ] Invariant cache hit.
[2023-03-09 14:48:33] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 14:48:33] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 14:48:33] [INFO ] After 42ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:48:33] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 14:48:33] [INFO ] After 16ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 14:48:33] [INFO ] After 24ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 14:48:33] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-09 14:48:33] [INFO ] Invariant cache hit.
[2023-03-09 14:48:33] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-09 14:48:33] [INFO ] Invariant cache hit.
[2023-03-09 14:48:33] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 14:48:33] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2023-03-09 14:48:33] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 14:48:33] [INFO ] Invariant cache hit.
[2023-03-09 14:48:33] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 455 ms. Remains : 81/81 places, 81/81 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 71 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 69
Applied a total of 24 rules in 7 ms. Remains 69 /81 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 69 cols
[2023-03-09 14:48:33] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:48:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 14:48:33] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 3 ms returned sat
[2023-03-09 14:48:34] [INFO ] After 35ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:48:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 14:48:34] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:34] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 14:48:34] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-09 14:48:34] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:34] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:34] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 14:48:34] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1401 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 964666 steps, run timeout after 3001 ms. (steps per millisecond=321 ) properties seen :{}
Probabilistic random walk after 964666 steps, saw 482434 distinct states, run finished after 3005 ms. (steps per millisecond=321 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 87 cols
[2023-03-09 14:48:37] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-09 14:48:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:48:37] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-09 14:48:37] [INFO ] After 44ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:48:37] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:48:37] [INFO ] After 22ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 14:48:37] [INFO ] After 32ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 14:48:37] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 86/86 transitions.
Graph (complete) has 319 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 86 transition count 85
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 86 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 84 transition count 83
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 11 place count 84 transition count 83
Applied a total of 11 rules in 7 ms. Remains 84 /87 variables (removed 3) and now considering 83/86 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 84/87 places, 83/86 transitions.
Incomplete random walk after 10000 steps, including 1463 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 900 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 941612 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :{}
Probabilistic random walk after 941612 steps, saw 470905 distinct states, run finished after 3004 ms. (steps per millisecond=313 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 83 rows 84 cols
[2023-03-09 14:48:40] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-09 14:48:40] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2023-03-09 14:48:40] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 14:48:40] [INFO ] After 44ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:48:40] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:48:40] [INFO ] After 12ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:40] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 14:48:40] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 14:48:40] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:40] [INFO ] After 13ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:40] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 14:48:40] [INFO ] After 122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 84/84 places, 83/83 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2023-03-09 14:48:40] [INFO ] Invariant cache hit.
[2023-03-09 14:48:40] [INFO ] Implicit Places using invariants in 102 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 115 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 83/84 places, 83/83 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 83 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 82 transition count 82
Applied a total of 2 rules in 3 ms. Remains 82 /83 variables (removed 1) and now considering 82/83 (removed 1) transitions.
// Phase 1: matrix 82 rows 82 cols
[2023-03-09 14:48:40] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:48:40] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-09 14:48:40] [INFO ] Invariant cache hit.
[2023-03-09 14:48:40] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:48:41] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 82/84 places, 82/83 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 504 ms. Remains : 82/84 places, 82/83 transitions.
Incomplete random walk after 10000 steps, including 1419 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 891 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 925813 steps, run timeout after 3001 ms. (steps per millisecond=308 ) properties seen :{}
Probabilistic random walk after 925813 steps, saw 463008 distinct states, run finished after 3001 ms. (steps per millisecond=308 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 14:48:44] [INFO ] Invariant cache hit.
[2023-03-09 14:48:44] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 14:48:44] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 14:48:44] [INFO ] After 50ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:48:44] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:48:44] [INFO ] After 16ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:44] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-09 14:48:44] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-09 14:48:44] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:44] [INFO ] After 16ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:44] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 14:48:44] [INFO ] After 117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 82/82 places, 82/82 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 82/82 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-09 14:48:44] [INFO ] Invariant cache hit.
[2023-03-09 14:48:44] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-09 14:48:44] [INFO ] Invariant cache hit.
[2023-03-09 14:48:44] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:48:44] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2023-03-09 14:48:44] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 14:48:44] [INFO ] Invariant cache hit.
[2023-03-09 14:48:44] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 418 ms. Remains : 82/82 places, 82/82 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 82 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 81 transition count 81
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 72 transition count 72
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 72 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 71 transition count 71
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 71 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 70 transition count 70
Applied a total of 24 rules in 8 ms. Remains 70 /82 variables (removed 12) and now considering 70/82 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 70 rows 70 cols
[2023-03-09 14:48:44] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-09 14:48:44] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 14:48:44] [INFO ] [Real]Absence check using 5 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-09 14:48:44] [INFO ] After 40ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:48:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 14:48:44] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:44] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 14:48:44] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-09 14:48:44] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:44] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:44] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2023-03-09 14:48:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-09 14:48:44] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 14:48:44] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1438 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 882 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2057 steps, run visited all 1 properties in 10 ms. (steps per millisecond=205 )
Probabilistic random walk after 2057 steps, saw 1043 distinct states, run finished after 10 ms. (steps per millisecond=205 ) properties seen :1
Incomplete random walk after 10000 steps, including 1404 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 900 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 949243 steps, run timeout after 3001 ms. (steps per millisecond=316 ) properties seen :{}
Probabilistic random walk after 949243 steps, saw 474722 distinct states, run finished after 3001 ms. (steps per millisecond=316 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 87 cols
[2023-03-09 14:48:48] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-09 14:48:48] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-09 14:48:48] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-09 14:48:48] [INFO ] After 49ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:48:48] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:48:48] [INFO ] After 18ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:48] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:48:48] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-09 14:48:48] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:48] [INFO ] After 16ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:48] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 14:48:48] [INFO ] After 120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 86/86 transitions.
Graph (complete) has 319 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 86 transition count 85
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 86 transition count 82
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 83 transition count 82
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 83 transition count 82
Applied a total of 12 rules in 6 ms. Remains 83 /87 variables (removed 4) and now considering 82/86 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 83/87 places, 82/86 transitions.
Incomplete random walk after 10000 steps, including 1399 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 925 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 951448 steps, run timeout after 3001 ms. (steps per millisecond=317 ) properties seen :{}
Probabilistic random walk after 951448 steps, saw 475822 distinct states, run finished after 3004 ms. (steps per millisecond=316 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 82 rows 83 cols
[2023-03-09 14:48:51] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-09 14:48:51] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 14:48:51] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 14:48:51] [INFO ] After 49ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:48:51] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:48:51] [INFO ] After 12ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:51] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 14:48:51] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 14:48:51] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:51] [INFO ] After 15ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:51] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 14:48:51] [INFO ] After 112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 83 /83 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 83/83 places, 82/82 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 83 /83 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-09 14:48:51] [INFO ] Invariant cache hit.
[2023-03-09 14:48:51] [INFO ] Implicit Places using invariants in 106 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 107 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 82/83 places, 82/82 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 82 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 81
Applied a total of 2 rules in 3 ms. Remains 81 /82 variables (removed 1) and now considering 81/82 (removed 1) transitions.
// Phase 1: matrix 81 rows 81 cols
[2023-03-09 14:48:51] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:48:51] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-09 14:48:51] [INFO ] Invariant cache hit.
[2023-03-09 14:48:51] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:48:51] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 81/83 places, 81/82 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 444 ms. Remains : 81/83 places, 81/82 transitions.
Incomplete random walk after 10000 steps, including 1451 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 905 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 953042 steps, run timeout after 3001 ms. (steps per millisecond=317 ) properties seen :{}
Probabilistic random walk after 953042 steps, saw 476617 distinct states, run finished after 3001 ms. (steps per millisecond=317 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 14:48:54] [INFO ] Invariant cache hit.
[2023-03-09 14:48:55] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 14:48:55] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 14:48:55] [INFO ] After 43ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:48:55] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:48:55] [INFO ] After 14ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:55] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:55] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 14:48:55] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 14:48:55] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:55] [INFO ] After 15ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:55] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 14:48:55] [INFO ] After 130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-09 14:48:55] [INFO ] Invariant cache hit.
[2023-03-09 14:48:55] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-09 14:48:55] [INFO ] Invariant cache hit.
[2023-03-09 14:48:55] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:48:55] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2023-03-09 14:48:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 14:48:55] [INFO ] Invariant cache hit.
[2023-03-09 14:48:55] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 450 ms. Remains : 81/81 places, 81/81 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 71 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 70 transition count 70
Applied a total of 22 rules in 7 ms. Remains 70 /81 variables (removed 11) and now considering 70/81 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 70 rows 70 cols
[2023-03-09 14:48:55] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:48:55] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 14:48:55] [INFO ] [Real]Absence check using 5 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 14:48:55] [INFO ] After 37ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:48:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 14:48:55] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:55] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:48:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 14:48:55] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 14:48:55] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:55] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:48:55] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 2 ms to minimize.
[2023-03-09 14:48:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-09 14:48:55] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-09 14:48:55] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 87 transition count 80
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 81 transition count 80
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 79 transition count 78
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 79 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 78 transition count 77
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 78 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 77 transition count 76
Applied a total of 20 rules in 5 ms. Remains 77 /87 variables (removed 10) and now considering 76/86 (removed 10) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 76 rows 77 cols
[2023-03-09 14:48:55] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-09 14:48:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:48:55] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-09 14:48:56] [INFO ] After 80ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-09 14:48:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 14:48:56] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 14:48:56] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 14:48:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:48:56] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-09 14:48:56] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 14:48:56] [INFO ] After 37ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 14:48:56] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-09 14:48:56] [INFO ] After 265ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Unable to solve all queries for examination QuasiLiveness. Remains :6 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 6 properties from file /home/mcc/execution/QuasiLiveness.xml in 0 ms.
Working with output stream class java.io.PrintStream
Total runtime 1290548 ms.
starting LoLA
BK_INPUT DoubleExponent-PT-004
BK_EXAMINATION: QuasiLiveness
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution
GlobalProperty: QuasiLiveness
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 4796584 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16120700 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/model.pnml
lola: STATE EQUATION TRIES TRANSITION t79
lola: LAUNCH SYMM
sara: try reading problem file stateEquationProblem-QuasiLiveness-39.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 5)

lola: SARA FINISHED
lola: STATE EQUATION TRIES TRANSITION t112
sara: try reading problem file stateEquationProblem-QuasiLiveness-58.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 12)
lola: reporting
lola: not produced: 15
lola: find path: 22
lola: goal oriented search: 74
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: reporting
lola: not produced: 13
lola: find path: 22
lola: goal oriented search: 76
lola: caught signal Terminated - aborting LoLA

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY


Time elapsed: 506 secs. Pages in use: 12

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="DoubleExponent-PT-004"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5348"
echo " Executing tool lolaxred"
echo " Input is DoubleExponent-PT-004, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r149-smll-167819435900292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-004.tgz
mv DoubleExponent-PT-004 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;