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.r153-smll-167819440200292.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 smartxred
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 r153-smll-167819440200292
=====================================================================

--------------------
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 1678402554300

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=smartxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-004
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 22:55:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-09 22:55:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 22:55:56] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2023-03-09 22:55:57] [INFO ] Transformed 216 places.
[2023-03-09 22:55:57] [INFO ] Transformed 198 transitions.
[2023-03-09 22:55:57] [INFO ] Parsed PT model containing 216 places and 198 transitions and 558 arcs in 195 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 57 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 22:55:57] [INFO ] Computed 21 place invariants in 26 ms
[2023-03-09 22:55:57] [INFO ] Implicit Places using invariants in 389 ms returned [47, 48]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 434 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 8 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 22:55:57] [INFO ] Computed 19 place invariants in 5 ms
[2023-03-09 22:55:57] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-09 22:55:57] [INFO ] Invariant cache hit.
[2023-03-09 22:55:57] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 22:55:58] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 537 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 1037 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 1223 resets, run finished after 709 ms. (steps per millisecond=14 ) properties (out of 75) seen :14
Incomplete Best-First random walk after 1000 steps, including 69 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 74 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 75 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 61) 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 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 73 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 69 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 61) seen :6
Incomplete Best-First random walk after 1000 steps, including 74 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 76 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 74 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 79 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 79 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 79 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 78 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 71 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 77 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 71 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 25 ms. (steps per millisecond=40 ) properties (out of 55) 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 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 67 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 76 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 72 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 78 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 73 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 72 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 66 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 65 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 74 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 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 83 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 77 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 69 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 71 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 73 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 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 76 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 68 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 72 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 76 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 71 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 21 ms. (steps per millisecond=47 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 76 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 74 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 73 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 78 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 68 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 71 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 75 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 75 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 77 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 53) seen :0
Running SMT prover for 53 properties.
[2023-03-09 22:56:00] [INFO ] Invariant cache hit.
[2023-03-09 22:56:00] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:56:00] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 9 ms returned sat
[2023-03-09 22:56:01] [INFO ] After 1071ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:53
[2023-03-09 22:56:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:56:01] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 11 ms returned sat
[2023-03-09 22:56:02] [INFO ] After 601ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :53
[2023-03-09 22:56:02] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 22:56:02] [INFO ] After 504ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :53
[2023-03-09 22:56:02] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 9 ms to minimize.
[2023-03-09 22:56:02] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2023-03-09 22:56:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 116 ms
[2023-03-09 22:56:02] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 2 ms to minimize.
[2023-03-09 22:56:02] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2023-03-09 22:56:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 88 ms
[2023-03-09 22:56:03] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2023-03-09 22:56:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-09 22:56:03] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 2 ms to minimize.
[2023-03-09 22:56:03] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2023-03-09 22:56:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 113 ms
[2023-03-09 22:56:03] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2023-03-09 22:56:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-09 22:56:03] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2023-03-09 22:56:03] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2023-03-09 22:56:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 88 ms
[2023-03-09 22:56:04] [INFO ] After 1746ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :53
Attempting to minimize the solution found.
Minimization took 494 ms.
[2023-03-09 22:56:04] [INFO ] After 3295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :53
Parikh walk visited 0 properties in 8206 ms.
Support contains 78 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
Applied a total of 2 rules in 24 ms. Remains 104 /104 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 104/104 places, 98/98 transitions.
Incomplete random walk after 1000000 steps, including 111035 resets, run finished after 22335 ms. (steps per millisecond=44 ) properties (out of 53) seen :6
Incomplete Best-First random walk after 100001 steps, including 7708 resets, run finished after 1283 ms. (steps per millisecond=77 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 7705 resets, run finished after 1241 ms. (steps per millisecond=80 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 7714 resets, run finished after 1306 ms. (steps per millisecond=76 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 7762 resets, run finished after 1301 ms. (steps per millisecond=76 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 7705 resets, run finished after 1385 ms. (steps per millisecond=72 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 7671 resets, run finished after 1254 ms. (steps per millisecond=79 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 7791 resets, run finished after 1305 ms. (steps per millisecond=76 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 7698 resets, run finished after 1282 ms. (steps per millisecond=78 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 7701 resets, run finished after 1229 ms. (steps per millisecond=81 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 7759 resets, run finished after 1266 ms. (steps per millisecond=78 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 7769 resets, run finished after 1719 ms. (steps per millisecond=58 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 7665 resets, run finished after 2119 ms. (steps per millisecond=47 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 7728 resets, run finished after 2051 ms. (steps per millisecond=48 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 7654 resets, run finished after 2179 ms. (steps per millisecond=45 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 7730 resets, run finished after 2293 ms. (steps per millisecond=43 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 7707 resets, run finished after 2235 ms. (steps per millisecond=44 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 7642 resets, run finished after 2236 ms. (steps per millisecond=44 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 7766 resets, run finished after 2324 ms. (steps per millisecond=43 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 7698 resets, run finished after 2309 ms. (steps per millisecond=43 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 7728 resets, run finished after 2300 ms. (steps per millisecond=43 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 7682 resets, run finished after 2331 ms. (steps per millisecond=42 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 7788 resets, run finished after 1843 ms. (steps per millisecond=54 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 7725 resets, run finished after 1399 ms. (steps per millisecond=71 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 7644 resets, run finished after 1239 ms. (steps per millisecond=80 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 7570 resets, run finished after 1237 ms. (steps per millisecond=80 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 7627 resets, run finished after 1299 ms. (steps per millisecond=76 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 7640 resets, run finished after 1254 ms. (steps per millisecond=79 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 7760 resets, run finished after 1223 ms. (steps per millisecond=81 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 7711 resets, run finished after 1294 ms. (steps per millisecond=77 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 7655 resets, run finished after 1239 ms. (steps per millisecond=80 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 7625 resets, run finished after 1278 ms. (steps per millisecond=78 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 7707 resets, run finished after 1226 ms. (steps per millisecond=81 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 7648 resets, run finished after 1729 ms. (steps per millisecond=57 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 7678 resets, run finished after 2014 ms. (steps per millisecond=49 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 7619 resets, run finished after 2156 ms. (steps per millisecond=46 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 7669 resets, run finished after 2269 ms. (steps per millisecond=44 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 7736 resets, run finished after 1453 ms. (steps per millisecond=68 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 7697 resets, run finished after 1225 ms. (steps per millisecond=81 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 7668 resets, run finished after 1425 ms. (steps per millisecond=70 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 7720 resets, run finished after 1342 ms. (steps per millisecond=74 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 7617 resets, run finished after 1448 ms. (steps per millisecond=69 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 7624 resets, run finished after 2147 ms. (steps per millisecond=46 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 7718 resets, run finished after 2242 ms. (steps per millisecond=44 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 7719 resets, run finished after 2194 ms. (steps per millisecond=45 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 7721 resets, run finished after 2240 ms. (steps per millisecond=44 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 7621 resets, run finished after 2222 ms. (steps per millisecond=45 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 7779 resets, run finished after 2239 ms. (steps per millisecond=44 ) properties (out of 47) seen :0
Running SMT prover for 47 properties.
// Phase 1: matrix 98 rows 104 cols
[2023-03-09 22:57:54] [INFO ] Computed 19 place invariants in 8 ms
[2023-03-09 22:57:55] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:57:55] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 11 ms returned sat
[2023-03-09 22:57:55] [INFO ] After 958ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:47
[2023-03-09 22:57:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:57:56] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 11 ms returned sat
[2023-03-09 22:57:56] [INFO ] After 639ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :47
[2023-03-09 22:57:56] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-09 22:57:57] [INFO ] After 637ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :47
[2023-03-09 22:57:57] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2023-03-09 22:57:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-09 22:57:57] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2023-03-09 22:57:57] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2023-03-09 22:57:57] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2023-03-09 22:57:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 186 ms
[2023-03-09 22:57:57] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2023-03-09 22:57:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-09 22:57:58] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2023-03-09 22:57:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-09 22:57:58] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2023-03-09 22:57:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-09 22:57:58] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2023-03-09 22:57:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-09 22:57:58] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2023-03-09 22:57:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-09 22:57:58] [INFO ] After 1948ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :47
Attempting to minimize the solution found.
Minimization took 695 ms.
[2023-03-09 22:57:59] [INFO ] After 3752ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :47
Parikh walk visited 0 properties in 6875 ms.
Support contains 68 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 98/98 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 103 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 102 transition count 96
Applied a total of 5 rules in 17 ms. Remains 102 /104 variables (removed 2) and now considering 96/98 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 102/104 places, 96/98 transitions.
Interrupted random walk after 962391 steps, including 123376 resets, run timeout after 30001 ms. (steps per millisecond=32 ) properties seen 0
Incomplete Best-First random walk after 100000 steps, including 8442 resets, run finished after 2284 ms. (steps per millisecond=43 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8429 resets, run finished after 2188 ms. (steps per millisecond=45 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8558 resets, run finished after 2115 ms. (steps per millisecond=47 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8440 resets, run finished after 2090 ms. (steps per millisecond=47 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8475 resets, run finished after 2265 ms. (steps per millisecond=44 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8472 resets, run finished after 2289 ms. (steps per millisecond=43 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8493 resets, run finished after 2302 ms. (steps per millisecond=43 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 8479 resets, run finished after 2165 ms. (steps per millisecond=46 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8440 resets, run finished after 2182 ms. (steps per millisecond=45 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8464 resets, run finished after 2081 ms. (steps per millisecond=48 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 8565 resets, run finished after 1986 ms. (steps per millisecond=50 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 8515 resets, run finished after 1961 ms. (steps per millisecond=50 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8461 resets, run finished after 1844 ms. (steps per millisecond=54 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 8499 resets, run finished after 1912 ms. (steps per millisecond=52 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8476 resets, run finished after 1930 ms. (steps per millisecond=51 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8477 resets, run finished after 1977 ms. (steps per millisecond=50 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 8528 resets, run finished after 2122 ms. (steps per millisecond=47 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8416 resets, run finished after 2016 ms. (steps per millisecond=49 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8456 resets, run finished after 2082 ms. (steps per millisecond=48 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8504 resets, run finished after 1980 ms. (steps per millisecond=50 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8524 resets, run finished after 1861 ms. (steps per millisecond=53 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8566 resets, run finished after 2078 ms. (steps per millisecond=48 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 8448 resets, run finished after 2098 ms. (steps per millisecond=47 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 8491 resets, run finished after 2112 ms. (steps per millisecond=47 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8466 resets, run finished after 2058 ms. (steps per millisecond=48 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100000 steps, including 8467 resets, run finished after 1889 ms. (steps per millisecond=52 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 100001 steps, including 8559 resets, run finished after 1948 ms. (steps per millisecond=51 ) properties (out of 47) seen :5
Incomplete Best-First random walk after 100000 steps, including 8458 resets, run finished after 1856 ms. (steps per millisecond=53 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100001 steps, including 8388 resets, run finished after 1978 ms. (steps per millisecond=50 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100001 steps, including 8443 resets, run finished after 1926 ms. (steps per millisecond=51 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8442 resets, run finished after 1938 ms. (steps per millisecond=51 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8423 resets, run finished after 1819 ms. (steps per millisecond=54 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8476 resets, run finished after 1951 ms. (steps per millisecond=51 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8468 resets, run finished after 1948 ms. (steps per millisecond=51 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100001 steps, including 8496 resets, run finished after 1916 ms. (steps per millisecond=52 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8415 resets, run finished after 2019 ms. (steps per millisecond=49 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100001 steps, including 8524 resets, run finished after 2072 ms. (steps per millisecond=48 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100001 steps, including 8402 resets, run finished after 2150 ms. (steps per millisecond=46 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8452 resets, run finished after 2169 ms. (steps per millisecond=46 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8495 resets, run finished after 2130 ms. (steps per millisecond=46 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100001 steps, including 8450 resets, run finished after 2156 ms. (steps per millisecond=46 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8457 resets, run finished after 2052 ms. (steps per millisecond=48 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8485 resets, run finished after 2081 ms. (steps per millisecond=48 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8438 resets, run finished after 2079 ms. (steps per millisecond=48 ) properties (out of 42) seen :0
Running SMT prover for 42 properties.
// Phase 1: matrix 96 rows 102 cols
[2023-03-09 23:00:06] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-09 23:00:06] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:00:06] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-09 23:00:07] [INFO ] After 762ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:42
[2023-03-09 23:00:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:00:07] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-09 23:00:08] [INFO ] After 360ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :42
[2023-03-09 23:00:08] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 23:00:08] [INFO ] After 347ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :42
[2023-03-09 23:00:08] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2023-03-09 23:00:08] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2023-03-09 23:00:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 84 ms
[2023-03-09 23:00:08] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2023-03-09 23:00:08] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2023-03-09 23:00:08] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2023-03-09 23:00:08] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2023-03-09 23:00:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 142 ms
[2023-03-09 23:00:08] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2023-03-09 23:00:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-09 23:00:08] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2023-03-09 23:00:08] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2023-03-09 23:00:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 68 ms
[2023-03-09 23:00:08] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2023-03-09 23:00:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-09 23:00:09] [INFO ] After 1210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :42
Attempting to minimize the solution found.
Minimization took 357 ms.
[2023-03-09 23:00:09] [INFO ] After 2220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :42
Parikh walk visited 0 properties in 7283 ms.
Support contains 60 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 96/96 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 102 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 101 transition count 95
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 101 transition count 95
Applied a total of 6 rules in 13 ms. Remains 101 /102 variables (removed 1) and now considering 95/96 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 101/102 places, 95/96 transitions.
Interrupted random walk after 991816 steps, including 127123 resets, run timeout after 30001 ms. (steps per millisecond=33 ) properties seen 0
Incomplete Best-First random walk after 100001 steps, including 8455 resets, run finished after 1936 ms. (steps per millisecond=51 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8535 resets, run finished after 2075 ms. (steps per millisecond=48 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8467 resets, run finished after 1973 ms. (steps per millisecond=50 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8508 resets, run finished after 2273 ms. (steps per millisecond=43 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8461 resets, run finished after 2272 ms. (steps per millisecond=44 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8468 resets, run finished after 2221 ms. (steps per millisecond=45 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8518 resets, run finished after 2404 ms. (steps per millisecond=41 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100001 steps, including 8539 resets, run finished after 2452 ms. (steps per millisecond=40 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100001 steps, including 8541 resets, run finished after 2378 ms. (steps per millisecond=42 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100001 steps, including 8486 resets, run finished after 2374 ms. (steps per millisecond=42 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8453 resets, run finished after 2010 ms. (steps per millisecond=49 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8503 resets, run finished after 2085 ms. (steps per millisecond=47 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8480 resets, run finished after 1997 ms. (steps per millisecond=50 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8476 resets, run finished after 1922 ms. (steps per millisecond=52 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100001 steps, including 8466 resets, run finished after 2059 ms. (steps per millisecond=48 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8449 resets, run finished after 2166 ms. (steps per millisecond=46 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100001 steps, including 8405 resets, run finished after 2159 ms. (steps per millisecond=46 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8431 resets, run finished after 2145 ms. (steps per millisecond=46 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8389 resets, run finished after 2096 ms. (steps per millisecond=47 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8378 resets, run finished after 2186 ms. (steps per millisecond=45 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8491 resets, run finished after 2107 ms. (steps per millisecond=47 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8444 resets, run finished after 2158 ms. (steps per millisecond=46 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100001 steps, including 8453 resets, run finished after 2084 ms. (steps per millisecond=47 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8430 resets, run finished after 2119 ms. (steps per millisecond=47 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8488 resets, run finished after 2057 ms. (steps per millisecond=48 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8505 resets, run finished after 1940 ms. (steps per millisecond=51 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8493 resets, run finished after 2222 ms. (steps per millisecond=45 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100001 steps, including 8459 resets, run finished after 2329 ms. (steps per millisecond=42 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100001 steps, including 8549 resets, run finished after 2423 ms. (steps per millisecond=41 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100001 steps, including 8455 resets, run finished after 2308 ms. (steps per millisecond=43 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100001 steps, including 8417 resets, run finished after 2319 ms. (steps per millisecond=43 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100001 steps, including 8435 resets, run finished after 2391 ms. (steps per millisecond=41 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8474 resets, run finished after 2457 ms. (steps per millisecond=40 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8445 resets, run finished after 2447 ms. (steps per millisecond=40 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8511 resets, run finished after 2478 ms. (steps per millisecond=40 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8403 resets, run finished after 2434 ms. (steps per millisecond=41 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100001 steps, including 8429 resets, run finished after 2449 ms. (steps per millisecond=40 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8450 resets, run finished after 1983 ms. (steps per millisecond=50 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8490 resets, run finished after 1465 ms. (steps per millisecond=68 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100000 steps, including 8452 resets, run finished after 2154 ms. (steps per millisecond=46 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100001 steps, including 8504 resets, run finished after 2137 ms. (steps per millisecond=46 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100001 steps, including 8413 resets, run finished after 2164 ms. (steps per millisecond=46 ) properties (out of 42) seen :0
Interrupted probabilistic random walk after 28510016 steps, run timeout after 363001 ms. (steps per millisecond=78 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 13=1, 15=1, 16=1, 17=1, 18=1, 20=1, 21=1, 22=1, 23=1, 24=1, 25=1, 26=1, 27=1, 28=1, 29=1, 30=1, 33=1, 34=1, 35=1, 36=1, 37=1, 38=1, 39=1}
Probabilistic random walk after 28510016 steps, saw 14228789 distinct states, run finished after 363004 ms. (steps per millisecond=78 ) properties seen :36
Running SMT prover for 6 properties.
// Phase 1: matrix 95 rows 101 cols
[2023-03-09 23:08:21] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-09 23:08:21] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:08:21] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 10 ms returned sat
[2023-03-09 23:08:21] [INFO ] After 101ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-09 23:08:21] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-09 23:08:21] [INFO ] After 17ms SMT Verify possible using 10 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 23:08:21] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 23:08:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 23:08:21] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 6 ms returned sat
[2023-03-09 23:08:22] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 23:08:22] [INFO ] After 53ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 23:08:22] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2023-03-09 23:08:22] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2023-03-09 23:08:22] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 5 ms to minimize.
[2023-03-09 23:08:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 144 ms
[2023-03-09 23:08:22] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2023-03-09 23:08:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-09 23:08:22] [INFO ] After 294ms 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 23:08:22] [INFO ] After 515ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 6806 ms.
Support contains 11 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 95/95 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 101 transition count 88
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 94 transition count 88
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 19 place count 94 transition count 88
Applied a total of 19 rules in 17 ms. Remains 94 /101 variables (removed 7) and now considering 88/95 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 94/101 places, 88/95 transitions.
Incomplete random walk after 1000000 steps, including 128326 resets, run finished after 15662 ms. (steps per millisecond=63 ) properties (out of 6) seen :0
Interrupted Best-First random walk after 444616 steps, including 37525 resets, run timeout after 5001 ms. (steps per millisecond=88 ) properties seen 0
Interrupted Best-First random walk after 413118 steps, including 34870 resets, run timeout after 5001 ms. (steps per millisecond=82 ) properties seen 0
Interrupted Best-First random walk after 404061 steps, including 34271 resets, run timeout after 5001 ms. (steps per millisecond=80 ) properties seen 0
Interrupted Best-First random walk after 395396 steps, including 33499 resets, run timeout after 5001 ms. (steps per millisecond=79 ) properties seen 0
Interrupted Best-First random walk after 391032 steps, including 33249 resets, run timeout after 5001 ms. (steps per millisecond=78 ) properties seen 0
Interrupted Best-First random walk after 725099 steps, including 61153 resets, run timeout after 5001 ms. (steps per millisecond=144 ) properties seen 0
Interrupted probabilistic random walk after 11033569 steps, run timeout after 135001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 11033569 steps, saw 5515244 distinct states, run finished after 135003 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 88 rows 94 cols
[2023-03-09 23:11:29] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-09 23:11:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:11:29] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-09 23:11:30] [INFO ] After 88ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-09 23:11:30] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:11:30] [INFO ] After 25ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :1 real:5
[2023-03-09 23:11:30] [INFO ] After 36ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:5
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 23:11:30] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:5
[2023-03-09 23:11:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:11:30] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-09 23:11:30] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 23:11:30] [INFO ] After 53ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 23:11:30] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-09 23:11:30] [INFO ] After 324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 5269 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 5 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 5 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 23:11:35] [INFO ] Invariant cache hit.
[2023-03-09 23:11:35] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-09 23:11:35] [INFO ] Invariant cache hit.
[2023-03-09 23:11:35] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:11:36] [INFO ] Implicit Places using invariants and state equation in 410 ms returned [20, 62, 67, 85, 91]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 511 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 18 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 23:11:36] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-09 23:11:36] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-09 23:11:36] [INFO ] Invariant cache hit.
[2023-03-09 23:11:36] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:11:36] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 538 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 1074 ms. Remains : 87/94 places, 86/88 transitions.
Incomplete random walk after 1000000 steps, including 144353 resets, run finished after 17784 ms. (steps per millisecond=56 ) properties (out of 6) seen :0
Interrupted Best-First random walk after 509816 steps, including 46583 resets, run timeout after 5001 ms. (steps per millisecond=101 ) properties seen 0
Interrupted Best-First random walk after 507849 steps, including 46588 resets, run timeout after 5001 ms. (steps per millisecond=101 ) properties seen 0
Interrupted Best-First random walk after 511937 steps, including 46887 resets, run timeout after 5001 ms. (steps per millisecond=102 ) properties seen 0
Interrupted Best-First random walk after 503596 steps, including 46086 resets, run timeout after 5001 ms. (steps per millisecond=100 ) properties seen 0
Interrupted Best-First random walk after 508376 steps, including 46603 resets, run timeout after 5001 ms. (steps per millisecond=101 ) properties seen 0
Interrupted Best-First random walk after 393866 steps, including 36116 resets, run timeout after 5001 ms. (steps per millisecond=78 ) properties seen 0
Interrupted probabilistic random walk after 11689293 steps, run timeout after 141001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 11689293 steps, saw 5842360 distinct states, run finished after 141002 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-09 23:14:45] [INFO ] Invariant cache hit.
[2023-03-09 23:14:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:14:45] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 7 ms returned sat
[2023-03-09 23:14:45] [INFO ] After 87ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-09 23:14:45] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:14:45] [INFO ] After 24ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 23:14:45] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 23:14:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:14:45] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-09 23:14:45] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 23:14:45] [INFO ] After 73ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 23:14:46] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 2 ms to minimize.
[2023-03-09 23:14:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-09 23:14:46] [INFO ] After 217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-09 23:14:46] [INFO ] After 425ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 2835 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 4 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 4 ms. Remains 87 /87 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2023-03-09 23:14:49] [INFO ] Invariant cache hit.
[2023-03-09 23:14:49] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-09 23:14:49] [INFO ] Invariant cache hit.
[2023-03-09 23:14:49] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:14:49] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2023-03-09 23:14:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:14:49] [INFO ] Invariant cache hit.
[2023-03-09 23:14:49] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 428 ms. Remains : 87/87 places, 86/86 transitions.
Incomplete random walk after 100000 steps, including 14423 resets, run finished after 2792 ms. (steps per millisecond=35 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-09 23:14:52] [INFO ] Invariant cache hit.
[2023-03-09 23:14:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:14:52] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-09 23:14:52] [INFO ] After 66ms SMT Verify possible using state equation in real domain returned unsat :0 sat :11
[2023-03-09 23:14:52] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:14:52] [INFO ] After 35ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :11
[2023-03-09 23:14:52] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2023-03-09 23:14:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-09 23:14:52] [INFO ] After 219ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-09 23:14:52] [INFO ] After 332ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-09 23:14:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:14:52] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 10 ms returned sat
[2023-03-09 23:14:52] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-09 23:14:52] [INFO ] After 52ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-09 23:14:52] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2023-03-09 23:14:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-09 23:14:52] [INFO ] After 222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 23:14:53] [INFO ] After 406ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Incomplete random walk after 1000000 steps, including 144277 resets, run finished after 17555 ms. (steps per millisecond=56 ) properties (out of 6) seen :0
Interrupted Best-First random walk after 443104 steps, including 40633 resets, run timeout after 5001 ms. (steps per millisecond=88 ) properties seen 0
Interrupted Best-First random walk after 442845 steps, including 40743 resets, run timeout after 5001 ms. (steps per millisecond=88 ) properties seen 0
Interrupted Best-First random walk after 443626 steps, including 40595 resets, run timeout after 5001 ms. (steps per millisecond=88 ) properties seen 0
Interrupted Best-First random walk after 442624 steps, including 40267 resets, run timeout after 5001 ms. (steps per millisecond=88 ) properties seen 0
Interrupted Best-First random walk after 449506 steps, including 41208 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen 0
Interrupted Best-First random walk after 449549 steps, including 41188 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen 0
Interrupted probabilistic random walk after 10718917 steps, run timeout after 141001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 10718917 steps, saw 5357568 distinct states, run finished after 141002 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-09 23:18:01] [INFO ] Invariant cache hit.
[2023-03-09 23:18:01] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:18:01] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-09 23:18:01] [INFO ] After 84ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-09 23:18:01] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:18:01] [INFO ] After 20ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 23:18:01] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 23:18:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:18:01] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-09 23:18:01] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 23:18:01] [INFO ] After 56ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 23:18:02] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2023-03-09 23:18:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-09 23:18:02] [INFO ] After 160ms 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 23:18:02] [INFO ] After 349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 2844 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 4 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 4 ms. Remains 87 /87 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2023-03-09 23:18:04] [INFO ] Invariant cache hit.
[2023-03-09 23:18:05] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-09 23:18:05] [INFO ] Invariant cache hit.
[2023-03-09 23:18:05] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:18:05] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2023-03-09 23:18:05] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:18:05] [INFO ] Invariant cache hit.
[2023-03-09 23:18:05] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 445 ms. Remains : 87/87 places, 86/86 transitions.
Incomplete random walk after 100000 steps, including 14563 resets, run finished after 2744 ms. (steps per millisecond=36 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-09 23:18:08] [INFO ] Invariant cache hit.
[2023-03-09 23:18:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:18:08] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-09 23:18:08] [INFO ] After 58ms SMT Verify possible using state equation in real domain returned unsat :0 sat :11
[2023-03-09 23:18:08] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:18:08] [INFO ] After 29ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :11
[2023-03-09 23:18:08] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2023-03-09 23:18:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-09 23:18:08] [INFO ] After 171ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-09 23:18:08] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-09 23:18:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:18:08] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 8 ms returned sat
[2023-03-09 23:18:08] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-09 23:18:08] [INFO ] After 46ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-09 23:18:08] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2023-03-09 23:18:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-09 23:18:08] [INFO ] After 241ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-09 23:18:08] [INFO ] After 424ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Incomplete random walk after 10000 steps, including 1422 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 921 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 946052 steps, run timeout after 3001 ms. (steps per millisecond=315 ) properties seen :{}
Probabilistic random walk after 946052 steps, saw 473125 distinct states, run finished after 3001 ms. (steps per millisecond=315 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:18:11] [INFO ] Invariant cache hit.
[2023-03-09 23:18:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:18:11] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-09 23:18:11] [INFO ] After 44ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:18:11] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:18:12] [INFO ] After 13ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:18:12] [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 7 ms.
[2023-03-09 23:18:12] [INFO ] After 113ms 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.
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 1449 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 911 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 974707 steps, run timeout after 3001 ms. (steps per millisecond=324 ) properties seen :{}
Probabilistic random walk after 974707 steps, saw 487450 distinct states, run finished after 3001 ms. (steps per millisecond=324 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 82 rows 83 cols
[2023-03-09 23:18:15] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-09 23:18:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:18:15] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-09 23:18:15] [INFO ] After 58ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:18:15] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:18:15] [INFO ] After 15ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:18:15] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:18:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:18:15] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-09 23:18:15] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:18:15] [INFO ] After 16ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:18:15] [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 23:18:15] [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 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 4 ms. Remains 83 /83 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-09 23:18:15] [INFO ] Invariant cache hit.
[2023-03-09 23:18:15] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-09 23:18:15] [INFO ] Invariant cache hit.
[2023-03-09 23:18:15] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:18:15] [INFO ] Implicit Places using invariants and state equation in 386 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 498 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 13 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 23:18:15] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-09 23:18:15] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-09 23:18:15] [INFO ] Invariant cache hit.
[2023-03-09 23:18:16] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:18:16] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 432 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 949 ms. Remains : 81/83 places, 81/82 transitions.
Incomplete random walk after 10000 steps, including 1446 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 896 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 968304 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :{}
Probabilistic random walk after 968304 steps, saw 484247 distinct states, run finished after 3001 ms. (steps per millisecond=322 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:18:19] [INFO ] Invariant cache hit.
[2023-03-09 23:18:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:18:19] [INFO ] [Real]Absence check using 2 positive and 11 generalized place invariants in 6 ms returned sat
[2023-03-09 23:18:19] [INFO ] After 57ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:18:19] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:18:19] [INFO ] After 15ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:18:19] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:18:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:18:19] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 5 ms returned sat
[2023-03-09 23:18:19] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:18:19] [INFO ] After 16ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:18:19] [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 8 ms.
[2023-03-09 23:18:19] [INFO ] After 136ms 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 6 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-09 23:18:19] [INFO ] Invariant cache hit.
[2023-03-09 23:18:19] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-09 23:18:19] [INFO ] Invariant cache hit.
[2023-03-09 23:18:19] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:18:20] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
[2023-03-09 23:18:20] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 23:18:20] [INFO ] Invariant cache hit.
[2023-03-09 23:18:20] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 702 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 25 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 23:18:20] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-09 23:18:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:18:20] [INFO ] [Real]Absence check using 2 positive and 11 generalized place invariants in 4 ms returned sat
[2023-03-09 23:18:20] [INFO ] After 46ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:18:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:18:20] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:18:20] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:18:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:18:20] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 6 ms returned sat
[2023-03-09 23:18:20] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:18:20] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:18:20] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-09 23:18:20] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1445 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 878 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 846126 steps, run timeout after 3001 ms. (steps per millisecond=281 ) properties seen :{}
Probabilistic random walk after 846126 steps, saw 423154 distinct states, run finished after 3001 ms. (steps per millisecond=281 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 87 cols
[2023-03-09 23:18:23] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-09 23:18:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:18:23] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-09 23:18:23] [INFO ] After 47ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:18:23] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:18:23] [INFO ] After 15ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:18:23] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:18:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:18:23] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-09 23:18:23] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:18:23] [INFO ] After 18ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:18:23] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-09 23:18:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-09 23:18:23] [INFO ] After 72ms 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 23:18:23] [INFO ] After 163ms 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.
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 1429 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 918 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 961948 steps, run timeout after 3001 ms. (steps per millisecond=320 ) properties seen :{}
Probabilistic random walk after 961948 steps, saw 481074 distinct states, run finished after 3001 ms. (steps per millisecond=320 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 85 rows 86 cols
[2023-03-09 23:18:26] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-09 23:18:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:18:26] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-09 23:18:26] [INFO ] After 60ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:18:26] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:18:26] [INFO ] After 21ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:18:26] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:18:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:18:27] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 7 ms returned sat
[2023-03-09 23:18:27] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:18:27] [INFO ] After 20ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:18:27] [INFO ] After 32ms 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 23:18:27] [INFO ] After 164ms 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 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 6 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 7 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 23:18:27] [INFO ] Invariant cache hit.
[2023-03-09 23:18:27] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-09 23:18:27] [INFO ] Invariant cache hit.
[2023-03-09 23:18:27] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:18:27] [INFO ] Implicit Places using invariants and state equation in 483 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 618 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 9 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 23:18:27] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-09 23:18:27] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-09 23:18:27] [INFO ] Invariant cache hit.
[2023-03-09 23:18:28] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:18:28] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 470 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 1102 ms. Remains : 84/86 places, 84/85 transitions.
Incomplete random walk after 10000 steps, including 1479 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 928 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 959053 steps, run timeout after 3001 ms. (steps per millisecond=319 ) properties seen :{}
Probabilistic random walk after 959053 steps, saw 479625 distinct states, run finished after 3001 ms. (steps per millisecond=319 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:18:31] [INFO ] Invariant cache hit.
[2023-03-09 23:18:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:18:31] [INFO ] [Real]Absence check using 2 positive and 11 generalized place invariants in 5 ms returned sat
[2023-03-09 23:18:31] [INFO ] After 46ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:18:31] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:18:31] [INFO ] After 14ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:18:31] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:18:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:18:31] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 5 ms returned sat
[2023-03-09 23:18:31] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:18:31] [INFO ] After 20ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:18:31] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-09 23:18:31] [INFO ] After 140ms 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 4 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 4 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 4 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 23:18:31] [INFO ] Invariant cache hit.
[2023-03-09 23:18:31] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-09 23:18:31] [INFO ] Invariant cache hit.
[2023-03-09 23:18:31] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:18:32] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2023-03-09 23:18:32] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-09 23:18:32] [INFO ] Invariant cache hit.
[2023-03-09 23:18:32] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 659 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 22 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 23:18:32] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 23:18:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:18:32] [INFO ] [Real]Absence check using 2 positive and 11 generalized place invariants in 7 ms returned sat
[2023-03-09 23:18:32] [INFO ] After 61ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:18:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:18:32] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:18:32] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:18:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:18:32] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 6 ms returned sat
[2023-03-09 23:18:32] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:18:32] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:18:32] [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 23:18:32] [INFO ] After 114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1425 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 869 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 923170 steps, run timeout after 3001 ms. (steps per millisecond=307 ) properties seen :{}
Probabilistic random walk after 923170 steps, saw 461684 distinct states, run finished after 3001 ms. (steps per millisecond=307 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 87 cols
[2023-03-09 23:18:35] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-09 23:18:35] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 23:18:35] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-09 23:18:35] [INFO ] After 43ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:18:35] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:18:35] [INFO ] After 16ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:18:35] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:18:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:18:35] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-09 23:18:35] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:18:35] [INFO ] After 21ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:18:35] [INFO ] After 30ms 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 23:18:35] [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 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 86/86 transitions.
Graph (complete) has 320 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 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 11 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 12 ms. Remains : 84/87 places, 83/86 transitions.
Incomplete random walk after 10000 steps, including 1435 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 906 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 916782 steps, run timeout after 3001 ms. (steps per millisecond=305 ) properties seen :{}
Probabilistic random walk after 916782 steps, saw 458493 distinct states, run finished after 3001 ms. (steps per millisecond=305 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 83 rows 84 cols
[2023-03-09 23:18:38] [INFO ] Computed 14 place invariants in 6 ms
[2023-03-09 23:18:38] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:18:38] [INFO ] [Real]Absence check using 3 positive and 11 generalized place invariants in 8 ms returned sat
[2023-03-09 23:18:38] [INFO ] After 72ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:18:38] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:18:38] [INFO ] After 34ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:18:38] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:18:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 23:18:38] [INFO ] [Nat]Absence check using 3 positive and 11 generalized place invariants in 8 ms returned sat
[2023-03-09 23:18:39] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:18:39] [INFO ] After 35ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:18:39] [INFO ] After 48ms 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 23:18:39] [INFO ] After 183ms 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, 83/83 transitions.
Applied a total of 0 rules in 6 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 7 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 3 ms. Remains 84 /84 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2023-03-09 23:18:39] [INFO ] Invariant cache hit.
[2023-03-09 23:18:39] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-09 23:18:39] [INFO ] Invariant cache hit.
[2023-03-09 23:18:39] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:18:39] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
[2023-03-09 23:18:39] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 23:18:39] [INFO ] Invariant cache hit.
[2023-03-09 23:18:39] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 694 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 23:18:39] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-09 23:18:39] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 23:18:39] [INFO ] [Real]Absence check using 4 positive and 10 generalized place invariants in 5 ms returned sat
[2023-03-09 23:18:39] [INFO ] After 54ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:18:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:18:39] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:18:39] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:18:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 23:18:40] [INFO ] [Nat]Absence check using 4 positive and 10 generalized place invariants in 5 ms returned sat
[2023-03-09 23:18:40] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:18:40] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:18:40] [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 23:18:40] [INFO ] After 125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1434 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 940 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 929478 steps, run timeout after 3001 ms. (steps per millisecond=309 ) properties seen :{}
Probabilistic random walk after 929478 steps, saw 464839 distinct states, run finished after 3001 ms. (steps per millisecond=309 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 87 cols
[2023-03-09 23:18:43] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-09 23:18:43] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:18:43] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-09 23:18:43] [INFO ] After 55ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:18:43] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:18:43] [INFO ] After 15ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:18:43] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:18:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:18:43] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-09 23:18:43] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:18:43] [INFO ] After 14ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:18:43] [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 23:18:43] [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 320 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 10 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 10 ms. Remains : 83/87 places, 82/86 transitions.
Incomplete random walk after 10000 steps, including 1421 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 936333 steps, run timeout after 3001 ms. (steps per millisecond=312 ) properties seen :{}
Probabilistic random walk after 936333 steps, saw 468264 distinct states, run finished after 3001 ms. (steps per millisecond=312 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 82 rows 83 cols
[2023-03-09 23:18:46] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-09 23:18:46] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 23:18:46] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 23:18:46] [INFO ] After 55ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:18:46] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:18:46] [INFO ] After 18ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:18:46] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:18:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-09 23:18:46] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 23:18:46] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:18:46] [INFO ] After 16ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:18:46] [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 7 ms.
[2023-03-09 23:18:46] [INFO ] After 154ms 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 23:18:46] [INFO ] Invariant cache hit.
[2023-03-09 23:18:46] [INFO ] Implicit Places using invariants in 121 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 122 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 6 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 23:18:46] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 23:18:46] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-09 23:18:46] [INFO ] Invariant cache hit.
[2023-03-09 23:18:47] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:18:47] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 474 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 606 ms. Remains : 81/83 places, 81/82 transitions.
Incomplete random walk after 10000 steps, including 1473 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 910 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 975315 steps, run timeout after 3001 ms. (steps per millisecond=324 ) properties seen :{}
Probabilistic random walk after 975315 steps, saw 487761 distinct states, run finished after 3001 ms. (steps per millisecond=324 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:18:50] [INFO ] Invariant cache hit.
[2023-03-09 23:18:50] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 23:18:50] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 23:18:50] [INFO ] After 63ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:18:50] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:18:50] [INFO ] After 29ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:18:50] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:18:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 23:18:50] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 23:18:50] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:18:50] [INFO ] After 32ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:18:50] [INFO ] After 44ms 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 23:18:50] [INFO ] After 164ms 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 3 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 23:18:50] [INFO ] Invariant cache hit.
[2023-03-09 23:18:50] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-09 23:18:50] [INFO ] Invariant cache hit.
[2023-03-09 23:18:50] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:18:51] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
[2023-03-09 23:18:51] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 23:18:51] [INFO ] Invariant cache hit.
[2023-03-09 23:18:51] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 639 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 11 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 23:18:51] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-09 23:18:51] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:18:51] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 6 ms returned sat
[2023-03-09 23:18:51] [INFO ] After 51ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:18:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:18:51] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:18:51] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:18:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:18:51] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 5 ms returned sat
[2023-03-09 23:18:51] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:18:51] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:18:51] [INFO ] After 17ms 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 23:18:51] [INFO ] After 124ms 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 10001 steps, including 895 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 841412 steps, run timeout after 3001 ms. (steps per millisecond=280 ) properties seen :{}
Probabilistic random walk after 841412 steps, saw 420797 distinct states, run finished after 3001 ms. (steps per millisecond=280 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 87 cols
[2023-03-09 23:18:54] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-09 23:18:54] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:18:54] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-09 23:18:54] [INFO ] After 46ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:18:54] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:18:54] [INFO ] After 19ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:18:54] [INFO ] After 28ms 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 23:18:54] [INFO ] After 119ms 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 320 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 15 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 15 ms. Remains : 82/87 places, 81/86 transitions.
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 909 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 986768 steps, run timeout after 3001 ms. (steps per millisecond=328 ) properties seen :{}
Probabilistic random walk after 986768 steps, saw 493495 distinct states, run finished after 3001 ms. (steps per millisecond=328 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 81 rows 82 cols
[2023-03-09 23:18:57] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-09 23:18:57] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 23:18:57] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 23:18:57] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:18:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 23:18:57] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 23:18:57] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:18:57] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:18:57] [INFO ] After 14ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:18:57] [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 6 ms.
[2023-03-09 23:18:57] [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 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 3 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 1 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-09 23:18:57] [INFO ] Invariant cache hit.
[2023-03-09 23:18:58] [INFO ] Implicit Places using invariants in 119 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 121 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 5 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 23:18:58] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 23:18:58] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-09 23:18:58] [INFO ] Invariant cache hit.
[2023-03-09 23:18:58] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:18:58] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 366 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 493 ms. Remains : 80/82 places, 80/81 transitions.
Incomplete random walk after 10000 steps, including 1458 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 903 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 987591 steps, run timeout after 3001 ms. (steps per millisecond=329 ) properties seen :{}
Probabilistic random walk after 987591 steps, saw 493903 distinct states, run finished after 3001 ms. (steps per millisecond=329 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:19:01] [INFO ] Invariant cache hit.
[2023-03-09 23:19:01] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 23:19:01] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 23:19:01] [INFO ] After 51ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:19:01] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:19:01] [INFO ] After 19ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:19:01] [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 7 ms.
[2023-03-09 23:19:01] [INFO ] After 134ms 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 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 3 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 4 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 3 ms. Remains 80 /80 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-09 23:19:01] [INFO ] Invariant cache hit.
[2023-03-09 23:19:01] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-09 23:19:01] [INFO ] Invariant cache hit.
[2023-03-09 23:19:01] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:19:02] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
[2023-03-09 23:19:02] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 23:19:02] [INFO ] Invariant cache hit.
[2023-03-09 23:19:02] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 576 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 10 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 23:19:02] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 23:19:02] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:19:02] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 5 ms returned sat
[2023-03-09 23:19:02] [INFO ] After 61ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:19:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:19:02] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:19:02] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:19:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:19:02] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 6 ms returned sat
[2023-03-09 23:19:02] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:19:02] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:19:02] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-09 23:19:02] [INFO ] After 142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1433 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 922 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 901559 steps, run timeout after 3001 ms. (steps per millisecond=300 ) properties seen :{}
Probabilistic random walk after 901559 steps, saw 450879 distinct states, run finished after 3001 ms. (steps per millisecond=300 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 87 cols
[2023-03-09 23:19:05] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-09 23:19:05] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:19:05] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-09 23:19:05] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:19:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:19:05] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-09 23:19:05] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:19:05] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:19:05] [INFO ] After 16ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:19:05] [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 23:19:05] [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 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 86/86 transitions.
Graph (complete) has 320 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 7 ms. Remains : 83/87 places, 82/86 transitions.
Incomplete random walk after 10000 steps, including 1435 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 910 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 973990 steps, run timeout after 3001 ms. (steps per millisecond=324 ) properties seen :{}
Probabilistic random walk after 973990 steps, saw 487097 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 23:19:08] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-09 23:19:08] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 23:19:08] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 23:19:08] [INFO ] After 43ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:19:08] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 23:19:08] [INFO ] After 14ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:19:08] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:19:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 23:19:08] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 23:19:08] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:19:08] [INFO ] After 14ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:19:08] [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 6 ms.
[2023-03-09 23:19:08] [INFO ] After 111ms 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 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 2 ms. Remains 83 /83 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-09 23:19:08] [INFO ] Invariant cache hit.
[2023-03-09 23:19:09] [INFO ] Implicit Places using invariants in 135 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 137 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 5 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 23:19:09] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-09 23:19:09] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-09 23:19:09] [INFO ] Invariant cache hit.
[2023-03-09 23:19:09] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 23:19:09] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 527 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 673 ms. Remains : 81/83 places, 81/82 transitions.
Incomplete random walk after 10000 steps, including 1411 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 910 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 935967 steps, run timeout after 3001 ms. (steps per millisecond=311 ) properties seen :{}
Probabilistic random walk after 935967 steps, saw 468085 distinct states, run finished after 3001 ms. (steps per millisecond=311 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:19:12] [INFO ] Invariant cache hit.
[2023-03-09 23:19:12] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 23:19:12] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 23:19:12] [INFO ] After 44ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:19:12] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 23:19:12] [INFO ] After 12ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:19:12] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:19:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-09 23:19:12] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 23:19:12] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:19:12] [INFO ] After 11ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:19:12] [INFO ] After 19ms 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 23:19:12] [INFO ] After 103ms 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 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-09 23:19:12] [INFO ] Invariant cache hit.
[2023-03-09 23:19:12] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-09 23:19:12] [INFO ] Invariant cache hit.
[2023-03-09 23:19:12] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 23:19:13] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
[2023-03-09 23:19:13] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 23:19:13] [INFO ] Invariant cache hit.
[2023-03-09 23:19:13] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 548 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 12 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 23:19:13] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 23:19:13] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:19:13] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 6 ms returned sat
[2023-03-09 23:19:13] [INFO ] After 38ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:19:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:19:13] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:19:13] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:19:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 23:19:13] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-09 23:19:13] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:19:13] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:19:13] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2023-03-09 23:19:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-09 23:19:13] [INFO ] After 47ms 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 23:19:13] [INFO ] After 121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1450 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 937 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2055 steps, run visited all 1 properties in 8 ms. (steps per millisecond=256 )
Probabilistic random walk after 2055 steps, saw 1042 distinct states, run finished after 9 ms. (steps per millisecond=228 ) properties seen :1
Incomplete random walk after 10000 steps, including 1451 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 899 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 934481 steps, run timeout after 3001 ms. (steps per millisecond=311 ) properties seen :{}
Probabilistic random walk after 934481 steps, saw 467342 distinct states, run finished after 3004 ms. (steps per millisecond=311 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 87 cols
[2023-03-09 23:19:16] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-09 23:19:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:19:16] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-09 23:19:16] [INFO ] After 48ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:19:16] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:19:16] [INFO ] After 15ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:19:16] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:19:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:19:16] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-09 23:19:16] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:19:16] [INFO ] After 15ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:19:16] [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 23:19:16] [INFO ] After 109ms 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 320 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 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 1432 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 898 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 952435 steps, run timeout after 3001 ms. (steps per millisecond=317 ) properties seen :{}
Probabilistic random walk after 952435 steps, saw 476315 distinct states, run finished after 3001 ms. (steps per millisecond=317 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 82 rows 83 cols
[2023-03-09 23:19:19] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-09 23:19:19] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-09 23:19:19] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 23:19:19] [INFO ] After 43ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:19:19] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 23:19:19] [INFO ] After 15ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:19:19] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:19:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 23:19:20] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 23:19:20] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:19:20] [INFO ] After 14ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:19:20] [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 6 ms.
[2023-03-09 23:19:20] [INFO ] After 114ms 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 1 ms. Remains 83 /83 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-09 23:19:20] [INFO ] Invariant cache hit.
[2023-03-09 23:19:20] [INFO ] Implicit Places using invariants in 94 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 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 23:19:20] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 23:19:20] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-09 23:19:20] [INFO ] Invariant cache hit.
[2023-03-09 23:19:20] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 23:19:20] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 404 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 505 ms. Remains : 81/83 places, 81/82 transitions.
Incomplete random walk after 10000 steps, including 1428 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 932 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 853061 steps, run timeout after 3001 ms. (steps per millisecond=284 ) properties seen :{}
Probabilistic random walk after 853061 steps, saw 426620 distinct states, run finished after 3001 ms. (steps per millisecond=284 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:19:23] [INFO ] Invariant cache hit.
[2023-03-09 23:19:23] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 23:19:23] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 23:19:23] [INFO ] After 44ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:19:23] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 23:19:23] [INFO ] After 17ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:19:23] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-09 23:19:23] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-09 23:19:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 87 ms
[2023-03-09 23:19:23] [INFO ] After 109ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:19:23] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:19:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-09 23:19:23] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 23:19:23] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:19:23] [INFO ] After 31ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:19:23] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-09 23:19:23] [INFO ] After 151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 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 3 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 3 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 23:19:24] [INFO ] Invariant cache hit.
[2023-03-09 23:19:24] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-09 23:19:24] [INFO ] Invariant cache hit.
[2023-03-09 23:19:24] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 23:19:24] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
[2023-03-09 23:19:24] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-09 23:19:24] [INFO ] Invariant cache hit.
[2023-03-09 23:19:24] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 630 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 12 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 23:19:24] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 23:19:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 23:19:24] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-09 23:19:24] [INFO ] After 36ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:19:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:19:24] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:19:24] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:19:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 23:19:24] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-09 23:19:24] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:19:24] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:19:24] [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 6 ms.
[2023-03-09 23:19:24] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1449 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 899 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 855051 steps, run timeout after 3001 ms. (steps per millisecond=284 ) properties seen :{}
Probabilistic random walk after 855051 steps, saw 427619 distinct states, run finished after 3001 ms. (steps per millisecond=284 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 87 cols
[2023-03-09 23:19:27] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-09 23:19:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:19:27] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-09 23:19:27] [INFO ] After 50ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:19:27] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:19:27] [INFO ] After 13ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:19:28] [INFO ] After 22ms 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 23:19:28] [INFO ] After 123ms 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 320 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 1485 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 928 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 857630 steps, run timeout after 3001 ms. (steps per millisecond=285 ) properties seen :{}
Probabilistic random walk after 857630 steps, saw 428900 distinct states, run finished after 3001 ms. (steps per millisecond=285 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 83 rows 84 cols
[2023-03-09 23:19:31] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-09 23:19:31] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-09 23:19:31] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 23:19:31] [INFO ] After 43ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:19:31] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:19:31] [INFO ] After 19ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:19:31] [INFO ] After 28ms 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 23:19:31] [INFO ] After 138ms 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 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 1 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 4 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 23:19:31] [INFO ] Invariant cache hit.
[2023-03-09 23:19:31] [INFO ] Implicit Places using invariants in 99 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 100 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 23:19:31] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 23:19:31] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-09 23:19:31] [INFO ] Invariant cache hit.
[2023-03-09 23:19:31] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:19:31] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 351 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 456 ms. Remains : 82/84 places, 82/83 transitions.
Incomplete random walk after 10000 steps, including 1483 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 927 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 922133 steps, run timeout after 3001 ms. (steps per millisecond=307 ) properties seen :{}
Probabilistic random walk after 922133 steps, saw 461167 distinct states, run finished after 3001 ms. (steps per millisecond=307 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:19:34] [INFO ] Invariant cache hit.
[2023-03-09 23:19:34] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 23:19:34] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 23:19:34] [INFO ] After 43ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:19:34] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:19:34] [INFO ] After 19ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:19:34] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:19:34] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 23:19:34] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 23:19:34] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:19:34] [INFO ] After 16ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:19:34] [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 23:19:34] [INFO ] After 114ms 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 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 4 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 4 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 1 ms. Remains 82 /82 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-09 23:19:34] [INFO ] Invariant cache hit.
[2023-03-09 23:19:35] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-09 23:19:35] [INFO ] Invariant cache hit.
[2023-03-09 23:19:35] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:19:35] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
[2023-03-09 23:19:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 23:19:35] [INFO ] Invariant cache hit.
[2023-03-09 23:19:35] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 595 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 9 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 23:19:35] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 23:19:35] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-09 23:19:35] [INFO ] [Real]Absence check using 5 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-09 23:19:35] [INFO ] After 63ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:19:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:19:35] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:19:35] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2023-03-09 23:19:35] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2023-03-09 23:19:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 117 ms
[2023-03-09 23:19:35] [INFO ] After 131ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:19:35] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:19:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 23:19:35] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-09 23:19:35] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:19:35] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:19:35] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2023-03-09 23:19:35] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2023-03-09 23:19:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2023-03-09 23:19:35] [INFO ] After 116ms 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 23:19:35] [INFO ] After 210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1446 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 908 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2055 steps, run visited all 1 properties in 12 ms. (steps per millisecond=171 )
Probabilistic random walk after 2055 steps, saw 1042 distinct states, run finished after 13 ms. (steps per millisecond=158 ) properties seen :1
Incomplete random walk after 10000 steps, including 1432 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 943 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 877706 steps, run timeout after 3001 ms. (steps per millisecond=292 ) properties seen :{}
Probabilistic random walk after 877706 steps, saw 438944 distinct states, run finished after 3001 ms. (steps per millisecond=292 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 87 cols
[2023-03-09 23:19:39] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-09 23:19:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:19:39] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-09 23:19:39] [INFO ] After 47ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:19:39] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:19:39] [INFO ] After 18ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:19:39] [INFO ] After 27ms 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 23:19:39] [INFO ] After 120ms 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 320 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 5 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 5 ms. Remains : 83/87 places, 82/86 transitions.
Incomplete random walk after 10000 steps, including 1422 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 928 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 926329 steps, run timeout after 3001 ms. (steps per millisecond=308 ) properties seen :{}
Probabilistic random walk after 926329 steps, saw 463263 distinct states, run finished after 3001 ms. (steps per millisecond=308 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 82 rows 83 cols
[2023-03-09 23:19:42] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-09 23:19:42] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 23:19:42] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 23:19:42] [INFO ] After 43ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:19:42] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:19: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 23:19:42] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:19:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 23:19:42] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 23:19:42] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:19:42] [INFO ] After 14ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:19:42] [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 23:19:42] [INFO ] After 108ms 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 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 23:19:42] [INFO ] Invariant cache hit.
[2023-03-09 23:19:42] [INFO ] Implicit Places using invariants in 145 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 146 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 5 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 23:19:42] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-09 23:19:42] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-09 23:19:42] [INFO ] Invariant cache hit.
[2023-03-09 23:19:42] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:19:42] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 382 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 534 ms. Remains : 81/83 places, 81/82 transitions.
Incomplete random walk after 10000 steps, including 1441 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 918 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 944042 steps, run timeout after 3001 ms. (steps per millisecond=314 ) properties seen :{}
Probabilistic random walk after 944042 steps, saw 472114 distinct states, run finished after 3001 ms. (steps per millisecond=314 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:19:45] [INFO ] Invariant cache hit.
[2023-03-09 23:19:45] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 23:19:46] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 23:19:46] [INFO ] After 40ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:19:46] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:19:46] [INFO ] After 12ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 23:19:46] [INFO ] After 20ms 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 23:19:46] [INFO ] After 104ms 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 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 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-09 23:19:46] [INFO ] Invariant cache hit.
[2023-03-09 23:19:46] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-09 23:19:46] [INFO ] Invariant cache hit.
[2023-03-09 23:19:46] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:19:46] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2023-03-09 23:19:46] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:19:46] [INFO ] Invariant cache hit.
[2023-03-09 23:19:46] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 418 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 10 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 23:19:46] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-09 23:19:46] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 23:19:46] [INFO ] [Real]Absence check using 5 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-09 23:19:46] [INFO ] After 45ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 23:19:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:19:46] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:19:46] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:19:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 23:19:46] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-09 23:19:46] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:19:46] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:19:46] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2023-03-09 23:19:46] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2023-03-09 23:19:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 94 ms
[2023-03-09 23:19:46] [INFO ] After 109ms 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 23:19:46] [INFO ] After 224ms 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 10 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 23:19:46] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-09 23:19:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:19:46] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-09 23:19:46] [INFO ] After 86ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-09 23:19:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:19:47] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 23:19:47] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 23:19:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:19:47] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 7 ms returned sat
[2023-03-09 23:19:47] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 23:19:47] [INFO ] After 53ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 23:19:47] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2023-03-09 23:19:47] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2023-03-09 23:19:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 82 ms
[2023-03-09 23:19:47] [INFO ] After 200ms 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 23:19:47] [INFO ] After 458ms 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 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 1430691 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DoubleExponent (PT), instance 004
Examination QuasiLiveness
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/QuasiLive.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

PNML FILE: model.pnml
Petri model created: 216 places, 198 transitions, 558 arcs.
(potential((tk(P1)>=1)))
(potential((tk(P2)>=1) & (tk(P68)>=1)))
(potential((tk(P11)>=1) & (tk(P18)>=1)))
(potential((tk(P19)>=1)))
(potential((tk(P12)>=1) & (tk(P20)>=1)))
(potential((tk(P21)>=1)))
(potential((tk(P22)>=1)))
(potential((tk(P23)>=1)))
(potential((tk(P25)>=1)))
(potential((tk(P26)>=1)))
(potential((tk(P27)>=1) & (tk(P36)>=1)))
(potential((tk(P27)>=1) & (tk(P43)>=1)))
(potential((tk(P79)>=1)))
(potential((tk(P28)>=1)))
(potential((tk(P29)>=1) & (tk(P49)>=1)))
(potential((tk(P29)>=1) & (tk(P56)>=1)))
(potential((tk(P31)>=1)))
(potential((tk(P32)>=1)))
(potential((tk(P12)>=1) & (tk(P33)>=1)))
(potential((tk(P34)>=1)))
(potential((tk(P32)>=1)))
(potential((tk(P16)>=1) & (tk(P37)>=1)))
(potential((tk(P38)>=1)))
(potential((tk(P90)>=1)))
(potential((tk(P39)>=1)))
(potential((tk(P14)>=1) & (tk(P40)>=1)))
(potential((tk(P41)>=1)))
(potential((tk(P41)>=1)))
(potential((tk(P42)>=1) & (tk(P69)>=1)))
(potential((tk(P44)>=1)))
(potential((tk(P45)>=1)))
(potential((tk(P11)>=1) & (tk(P47)>=1)))
(potential((tk(P48)>=1)))
(potential((tk(P45)>=1)))
(potential((tk(P101)>=1)))
(potential((tk(P50)>=1) & (tk(P15)>=1)))
(potential((tk(P51)>=1)))
(potential((tk(P52)>=1)))
(potential((tk(P14)>=1) & (tk(P53)>=1)))
(potential((tk(P54)>=1)))
(potential((tk(P54)>=1)))
(potential((tk(P55)>=1) & (tk(P69)>=1)))
(potential((tk(P58)>=1) & (tk(P168)>=1)))
(potential((tk(P59)>=1)))
(potential((tk(P60)>=1) & (tk(P169)>=1)))
(potential((tk(P113)>=1)))
(potential((tk(P61)>=1)))
(potential((tk(P17)>=1) & (tk(P62)>=1)))
(potential((tk(P63)>=1)))
(potential((tk(P64)>=1)))
(potential((tk(P65)>=1) & (tk(P192)>=1)))
(potential((tk(P65)>=1) & (tk(P200)>=1)))
(potential((tk(P66)>=1)))
(potential((tk(P67)>=1) & (tk(P205)>=1)))
(potential((tk(P67)>=1) & (tk(P213)>=1)))
(potential((tk(P30)>=1)))
(potential((tk(P124)>=1)))
(potential((tk(P70)>=1) & (tk(P76)>=1)))
(potential((tk(P77)>=1)))
(potential((tk(P71)>=1) & (tk(P78)>=1)))
(potential((tk(P80)>=1)))
(potential((tk(P81)>=1)))
(potential((tk(P82)>=1)))
(potential((tk(P83)>=1)))
(potential((tk(P84)>=1)))
(potential((tk(P85)>=1) & (tk(P94)>=1)))
(potential((tk(P85)>=1) & (tk(P102)>=1)))
(potential((tk(P132)>=1) & (tk(P141)>=1)))
(potential((tk(P86)>=1)))
(potential((tk(P87)>=1) & (tk(P107)>=1)))
(potential((tk(P87)>=1) & (tk(P116)>=1)))
(potential((tk(P89)>=1)))
(potential((tk(P91)>=1)))
(potential((tk(P71)>=1) & (tk(P92)>=1)))
(potential((tk(P93)>=1)))
(potential((tk(P91)>=1)))
(potential((tk(P74)>=1) & (tk(P95)>=1)))
(potential((tk(P96)>=1)))
(potential((tk(P132)>=1) & (tk(P148)>=1)))
(potential((tk(P97)>=1)))
(potential((tk(P72)>=1) & (tk(P98)>=1)))
(potential((tk(P99)>=1)))
(potential((tk(P99)>=1)))
(potential((tk(P100)>=1) & (tk(P128)>=1)))
(potential((tk(P103)>=1)))
(potential((tk(P104)>=1)))
(potential((tk(P70)>=1) & (tk(P105)>=1)))
(potential((tk(P106)>=1)))
(potential((tk(P104)>=1)))
(potential((tk(P133)>=1)))
(potential((tk(P73)>=1) & (tk(P108)>=1)))
(potential((tk(P109)>=1)))
(potential((tk(P110)>=1)))
(potential((tk(P72)>=1) & (tk(P111)>=1)))
(potential((tk(P114)>=1)))
(potential((tk(P114)>=1)))
(potential((tk(P115)>=1) & (tk(P128)>=1)))
(potential((tk(P11)>=1) & (tk(P117)>=1)))
(potential((tk(P118)>=1)))
(potential((tk(P12)>=1) & (tk(P119)>=1)))
(potential((tk(P134)>=1) & (tk(P154)>=1)))
(potential((tk(P120)>=1)))
(potential((tk(P75)>=1) & (tk(P121)>=1)))
(potential((tk(P122)>=1)))
(potential((tk(P123)>=1)))
(potential((tk(P36)>=1) & (tk(P125)>=1)))
(potential((tk(P43)>=1) & (tk(P125)>=1)))
(potential((tk(P126)>=1)))
(potential((tk(P49)>=1) & (tk(P127)>=1)))
(potential((tk(P56)>=1) & (tk(P127)>=1)))
(potential((tk(P112)>=1)))
(potential((tk(P134)>=1) & (tk(P161)>=1)))
(potential((tk(P136)>=1)))
(potential((tk(P137)>=1)))
(potential((tk(P2)>=1) & (tk(P138)>=1)))
(potential((tk(P139)>=1)))
(potential((tk(P137)>=1)))
(potential((tk(P13)>=1) & (tk(P142)>=1)))
(potential((tk(P143)>=1)))
(potential((tk(P144)>=1)))
(potential((tk(P35)>=1) & (tk(P145)>=1)))
(potential((tk(P140)>=1)))
(potential((tk(P146)>=1)))
(potential((tk(P146)>=1)))
(potential((tk(P147)>=1) & (tk(P167)>=1)))
(potential((tk(P149)>=1)))
(potential((tk(P150)>=1)))
(potential((tk(P152)>=1) & (tk(P195)>=1)))
(potential((tk(P153)>=1)))
(potential((tk(P150)>=1)))
(potential((tk(P155)>=1) & (tk(P206)>=1)))
(potential((tk(P156)>=1)))
(potential((tk(P151)>=1)))
(potential((tk(P157)>=1)))
(potential((tk(P35)>=1) & (tk(P158)>=1)))
(potential((tk(P159)>=1)))
(potential((tk(P159)>=1)))
(potential((tk(P160)>=1) & (tk(P167)>=1)))
(potential((tk(P24)>=1) & (tk(P163)>=1)))
(potential((tk(P164)>=1)))
(potential((tk(P24)>=1) & (tk(P165)>=1)))
(potential((tk(P166)>=1)))
(potential((tk(P135)>=1)))
(potential((tk(P162)>=1)))
(potential((tk(P168)>=1) & (tk(P175)>=1)))
(potential((tk(P176)>=1)))
(potential((tk(P169)>=1) & (tk(P177)>=1)))
(potential((tk(P178)>=1)))
(potential((tk(P179)>=1)))
(potential((tk(P180)>=1)))
(potential((tk(P181)>=1)))
(potential((tk(P182)>=1)))
(potential((tk(P183)>=1) & (tk(P192)>=1)))
(potential((tk(P183)>=1) & (tk(P200)>=1)))
(potential((tk(P173)>=1)))
(potential((tk(P185)>=1)))
(potential((tk(P186)>=1) & (tk(P205)>=1)))
(potential((tk(P186)>=1) & (tk(P213)>=1)))
(potential((tk(P188)>=1)))
(potential((tk(P189)>=1)))
(potential((tk(P169)>=1) & (tk(P190)>=1)))
(potential((tk(P191)>=1)))
(potential((tk(P189)>=1)))
(potential((tk(P172)>=1) & (tk(P193)>=1)))
(potential((tk(P194)>=1)))
(potential((tk(P184)>=1)))
(potential((tk(P196)>=1)))
(potential((tk(P170)>=1) & (tk(P197)>=1)))
(potential((tk(P198)>=1)))
(potential((tk(P198)>=1)))
(potential((tk(P10)>=1) & (tk(P199)>=1)))
(potential((tk(P201)>=1)))
(potential((tk(P202)>=1)))
(potential((tk(P168)>=1) & (tk(P203)>=1)))
(potential((tk(P204)>=1)))
(potential((tk(P202)>=1)))
(potential((tk(P46)>=1) & (tk(P195)>=1)))
(potential((tk(P171)>=1) & (tk(P207)>=1)))
(potential((tk(P208)>=1)))
(potential((tk(P209)>=1)))
(potential((tk(P170)>=1) & (tk(P210)>=1)))
(potential((tk(P211)>=1)))
(potential((tk(P211)>=1)))
(potential((tk(P10)>=1) & (tk(P212)>=1)))
(potential((tk(P195)>=1) & (tk(P214)>=1)))
(potential((tk(P215)>=1)))
(potential((tk(P2)>=1) & (tk(P216)>=1)))
(potential((tk(P57)>=1)))
(potential((tk(P3)>=1)))
(potential((tk(P4)>=1) & (tk(P174)>=1)))
(potential((tk(P5)>=1)))
(potential((tk(P6)>=1)))
(potential((tk(P7)>=1) & (tk(P141)>=1)))
(potential((tk(P7)>=1) & (tk(P148)>=1)))
(potential((tk(P8)>=1)))
(potential((tk(P9)>=1) & (tk(P154)>=1)))
(potential((tk(P9)>=1) & (tk(P161)>=1)))
(potential((tk(P187)>=1)))
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 15367196 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16164504 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
Caught signal 15, terminating.

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="smartxred"
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 smartxred"
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 r153-smll-167819440200292"
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 ;