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.r121-tall-167814499400262.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 DES-PT-10b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-167814499400262
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 6.9K Feb 26 15:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 15:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 15:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 15:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 26 15:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 15:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 26 15:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 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 79K 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 1678393339592

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=DES-PT-10b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 20:22:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-09 20:22:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 20:22:21] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2023-03-09 20:22:21] [INFO ] Transformed 320 places.
[2023-03-09 20:22:21] [INFO ] Transformed 271 transitions.
[2023-03-09 20:22:21] [INFO ] Found NUPN structural information;
[2023-03-09 20:22:21] [INFO ] Parsed PT model containing 320 places and 271 transitions and 827 arcs in 118 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 320/320 places, 271/271 transitions.
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 317 transition count 248
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 49 place count 294 transition count 248
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 49 place count 294 transition count 239
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 67 place count 285 transition count 239
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 182 rules applied. Total rules applied 249 place count 194 transition count 148
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 257 place count 190 transition count 164
Applied a total of 257 rules in 45 ms. Remains 190 /320 variables (removed 130) and now considering 164/271 (removed 107) transitions.
// Phase 1: matrix 164 rows 190 cols
[2023-03-09 20:22:21] [INFO ] Computed 62 place invariants in 23 ms
[2023-03-09 20:22:21] [INFO ] Implicit Places using invariants in 365 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 389 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 189/320 places, 164/271 transitions.
Applied a total of 0 rules in 4 ms. Remains 189 /189 variables (removed 0) and now considering 164/164 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 438 ms. Remains : 189/320 places, 164/271 transitions.
Discarding 45 transitions out of 164. Remains 119
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 349 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 118) seen :88
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Running SMT prover for 30 properties.
// Phase 1: matrix 164 rows 189 cols
[2023-03-09 20:22:22] [INFO ] Computed 61 place invariants in 5 ms
[2023-03-09 20:22:22] [INFO ] [Real]Absence check using 32 positive place invariants in 6 ms returned sat
[2023-03-09 20:22:22] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 10 ms returned sat
[2023-03-09 20:22:22] [INFO ] After 428ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:30
[2023-03-09 20:22:23] [INFO ] [Nat]Absence check using 32 positive place invariants in 8 ms returned sat
[2023-03-09 20:22:23] [INFO ] [Nat]Absence check using 32 positive and 29 generalized place invariants in 16 ms returned sat
[2023-03-09 20:22:24] [INFO ] After 740ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :30
[2023-03-09 20:22:24] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 20:22:24] [INFO ] After 600ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :30
[2023-03-09 20:22:24] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 5 ms to minimize.
[2023-03-09 20:22:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-09 20:22:25] [INFO ] After 1390ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :30
Attempting to minimize the solution found.
Minimization took 835 ms.
[2023-03-09 20:22:26] [INFO ] After 3324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :30
Parikh walk visited 2 properties in 2510 ms.
Support contains 36 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 164/164 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 189 transition count 163
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 172 transition count 126
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 172 transition count 126
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 45 place count 172 transition count 116
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 45 place count 172 transition count 113
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 51 place count 169 transition count 113
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 55 place count 165 transition count 109
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 165 transition count 109
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 63 place count 165 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 65 place count 164 transition count 105
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 164 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 67 place count 163 transition count 104
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 68 place count 163 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 69 place count 162 transition count 103
Applied a total of 69 rules in 83 ms. Remains 162 /189 variables (removed 27) and now considering 103/164 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 162/189 places, 103/164 transitions.
Incomplete random walk after 1000000 steps, including 45836 resets, run finished after 21344 ms. (steps per millisecond=46 ) properties (out of 28) seen :3
Incomplete Best-First random walk after 100001 steps, including 946 resets, run finished after 594 ms. (steps per millisecond=168 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 1128 resets, run finished after 604 ms. (steps per millisecond=165 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 1126 resets, run finished after 541 ms. (steps per millisecond=184 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 1099 resets, run finished after 480 ms. (steps per millisecond=208 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 1100 resets, run finished after 603 ms. (steps per millisecond=165 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 1120 resets, run finished after 607 ms. (steps per millisecond=164 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 902 resets, run finished after 529 ms. (steps per millisecond=189 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100000 steps, including 871 resets, run finished after 546 ms. (steps per millisecond=183 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 933 resets, run finished after 543 ms. (steps per millisecond=184 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 896 resets, run finished after 545 ms. (steps per millisecond=183 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 902 resets, run finished after 537 ms. (steps per millisecond=186 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100000 steps, including 931 resets, run finished after 559 ms. (steps per millisecond=178 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 971 resets, run finished after 554 ms. (steps per millisecond=180 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 964 resets, run finished after 583 ms. (steps per millisecond=171 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 969 resets, run finished after 566 ms. (steps per millisecond=176 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100000 steps, including 991 resets, run finished after 567 ms. (steps per millisecond=176 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 941 resets, run finished after 571 ms. (steps per millisecond=175 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 916 resets, run finished after 560 ms. (steps per millisecond=178 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100000 steps, including 967 resets, run finished after 563 ms. (steps per millisecond=177 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100000 steps, including 932 resets, run finished after 558 ms. (steps per millisecond=179 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 960 resets, run finished after 585 ms. (steps per millisecond=170 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 943 resets, run finished after 567 ms. (steps per millisecond=176 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 948 resets, run finished after 565 ms. (steps per millisecond=176 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100000 steps, including 961 resets, run finished after 641 ms. (steps per millisecond=156 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 967 resets, run finished after 678 ms. (steps per millisecond=147 ) properties (out of 25) seen :0
Running SMT prover for 25 properties.
// Phase 1: matrix 103 rows 162 cols
[2023-03-09 20:23:04] [INFO ] Computed 62 place invariants in 2 ms
[2023-03-09 20:23:04] [INFO ] [Real]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-09 20:23:04] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-09 20:23:04] [INFO ] After 184ms SMT Verify possible using state equation in real domain returned unsat :0 sat :8 real:17
[2023-03-09 20:23:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:23:04] [INFO ] After 63ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :1 real:24
[2023-03-09 20:23:05] [INFO ] After 75ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:24
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-09 20:23:05] [INFO ] After 503ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:24
[2023-03-09 20:23:05] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-09 20:23:05] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 9 ms returned sat
[2023-03-09 20:23:05] [INFO ] After 317ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :25
[2023-03-09 20:23:05] [INFO ] After 310ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :25
[2023-03-09 20:23:06] [INFO ] After 724ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :25
Attempting to minimize the solution found.
Minimization took 348 ms.
[2023-03-09 20:23:06] [INFO ] After 1657ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :25
Parikh walk visited 1 properties in 2506 ms.
Support contains 32 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Applied a total of 0 rules in 6 ms. Remains 162 /162 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 162/162 places, 103/103 transitions.
Incomplete random walk after 1000000 steps, including 45924 resets, run finished after 19482 ms. (steps per millisecond=51 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100000 steps, including 984 resets, run finished after 483 ms. (steps per millisecond=207 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 1107 resets, run finished after 492 ms. (steps per millisecond=203 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 1108 resets, run finished after 500 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 1115 resets, run finished after 498 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100000 steps, including 1131 resets, run finished after 495 ms. (steps per millisecond=202 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 1097 resets, run finished after 493 ms. (steps per millisecond=202 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 915 resets, run finished after 444 ms. (steps per millisecond=225 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 866 resets, run finished after 437 ms. (steps per millisecond=228 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100000 steps, including 890 resets, run finished after 446 ms. (steps per millisecond=224 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 888 resets, run finished after 454 ms. (steps per millisecond=220 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 966 resets, run finished after 457 ms. (steps per millisecond=218 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 969 resets, run finished after 451 ms. (steps per millisecond=221 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 946 resets, run finished after 477 ms. (steps per millisecond=209 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 955 resets, run finished after 462 ms. (steps per millisecond=216 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 956 resets, run finished after 467 ms. (steps per millisecond=214 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100000 steps, including 923 resets, run finished after 470 ms. (steps per millisecond=212 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 915 resets, run finished after 463 ms. (steps per millisecond=215 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 973 resets, run finished after 482 ms. (steps per millisecond=207 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100000 steps, including 954 resets, run finished after 480 ms. (steps per millisecond=208 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 933 resets, run finished after 478 ms. (steps per millisecond=209 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 928 resets, run finished after 477 ms. (steps per millisecond=209 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 973 resets, run finished after 488 ms. (steps per millisecond=204 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100000 steps, including 993 resets, run finished after 484 ms. (steps per millisecond=206 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 955 resets, run finished after 485 ms. (steps per millisecond=206 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 18511680 steps, run timeout after 90001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 18511680 steps, saw 2341894 distinct states, run finished after 90005 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 24 properties.
[2023-03-09 20:25:10] [INFO ] Invariant cache hit.
[2023-03-09 20:25:10] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-09 20:25:10] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-09 20:25:10] [INFO ] After 328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-03-09 20:25:10] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-09 20:25:10] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-09 20:25:10] [INFO ] After 357ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-03-09 20:25:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:25:11] [INFO ] After 277ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-03-09 20:25:11] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 2 ms to minimize.
[2023-03-09 20:25:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-09 20:25:11] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2023-03-09 20:25:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-09 20:25:11] [INFO ] After 770ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 351 ms.
[2023-03-09 20:25:12] [INFO ] After 1726ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Parikh walk visited 6 properties in 1969 ms.
Support contains 26 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Applied a total of 0 rules in 7 ms. Remains 162 /162 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 162/162 places, 103/103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 162 /162 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-09 20:25:14] [INFO ] Invariant cache hit.
[2023-03-09 20:25:14] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-09 20:25:14] [INFO ] Invariant cache hit.
[2023-03-09 20:25:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:25:14] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2023-03-09 20:25:14] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 20:25:14] [INFO ] Invariant cache hit.
[2023-03-09 20:25:14] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 329 ms. Remains : 162/162 places, 103/103 transitions.
Incomplete random walk after 100000 steps, including 4580 resets, run finished after 2527 ms. (steps per millisecond=39 ) properties (out of 26) seen :5
Running SMT prover for 21 properties.
[2023-03-09 20:25:16] [INFO ] Invariant cache hit.
[2023-03-09 20:25:16] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-09 20:25:16] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 7 ms returned sat
[2023-03-09 20:25:17] [INFO ] After 54ms SMT Verify possible using state equation in real domain returned unsat :0 sat :21
[2023-03-09 20:25:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:25:17] [INFO ] After 25ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :21
[2023-03-09 20:25:17] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2023-03-09 20:25:17] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2023-03-09 20:25:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 100 ms
[2023-03-09 20:25:17] [INFO ] After 350ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-09 20:25:17] [INFO ] After 464ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-09 20:25:17] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:25:17] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-09 20:25:17] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2023-03-09 20:25:17] [INFO ] After 23ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :21
[2023-03-09 20:25:17] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2023-03-09 20:25:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-09 20:25:17] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2023-03-09 20:25:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-09 20:25:17] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2023-03-09 20:25:17] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2023-03-09 20:25:18] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2023-03-09 20:25:18] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2023-03-09 20:25:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 190 ms
[2023-03-09 20:25:18] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
[2023-03-09 20:25:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-09 20:25:18] [INFO ] After 585ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-09 20:25:18] [INFO ] After 801ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
Incomplete random walk after 1000000 steps, including 45984 resets, run finished after 26698 ms. (steps per millisecond=37 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 959 resets, run finished after 654 ms. (steps per millisecond=152 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100000 steps, including 1131 resets, run finished after 690 ms. (steps per millisecond=144 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 1111 resets, run finished after 691 ms. (steps per millisecond=144 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 1120 resets, run finished after 693 ms. (steps per millisecond=144 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 1122 resets, run finished after 696 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 893 resets, run finished after 619 ms. (steps per millisecond=161 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 898 resets, run finished after 615 ms. (steps per millisecond=162 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 887 resets, run finished after 620 ms. (steps per millisecond=161 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 976 resets, run finished after 659 ms. (steps per millisecond=151 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 967 resets, run finished after 662 ms. (steps per millisecond=151 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 982 resets, run finished after 662 ms. (steps per millisecond=151 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100000 steps, including 921 resets, run finished after 658 ms. (steps per millisecond=151 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 923 resets, run finished after 661 ms. (steps per millisecond=151 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 965 resets, run finished after 660 ms. (steps per millisecond=151 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 982 resets, run finished after 671 ms. (steps per millisecond=149 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 949 resets, run finished after 667 ms. (steps per millisecond=149 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 967 resets, run finished after 640 ms. (steps per millisecond=156 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 971 resets, run finished after 642 ms. (steps per millisecond=155 ) properties (out of 18) seen :0
Interrupted probabilistic random walk after 22997111 steps, run timeout after 114001 ms. (steps per millisecond=201 ) properties seen :{}
Probabilistic random walk after 22997111 steps, saw 2904320 distinct states, run finished after 114002 ms. (steps per millisecond=201 ) properties seen :0
Running SMT prover for 18 properties.
[2023-03-09 20:27:50] [INFO ] Invariant cache hit.
[2023-03-09 20:27:50] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-09 20:27:50] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-09 20:27:51] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-09 20:27:51] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-09 20:27:51] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 21 ms returned sat
[2023-03-09 20:27:51] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-09 20:27:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:27:51] [INFO ] After 238ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2023-03-09 20:27:51] [INFO ] After 514ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 188 ms.
[2023-03-09 20:27:52] [INFO ] After 1160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Parikh walk visited 0 properties in 2140 ms.
Support contains 26 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 162 /162 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 162/162 places, 103/103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Applied a total of 0 rules in 6 ms. Remains 162 /162 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-09 20:27:54] [INFO ] Invariant cache hit.
[2023-03-09 20:27:54] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-09 20:27:54] [INFO ] Invariant cache hit.
[2023-03-09 20:27:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:27:54] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2023-03-09 20:27:54] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 20:27:54] [INFO ] Invariant cache hit.
[2023-03-09 20:27:54] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 342 ms. Remains : 162/162 places, 103/103 transitions.
Incomplete random walk after 100000 steps, including 4607 resets, run finished after 2251 ms. (steps per millisecond=44 ) properties (out of 26) seen :5
Running SMT prover for 21 properties.
[2023-03-09 20:27:56] [INFO ] Invariant cache hit.
[2023-03-09 20:27:56] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 20:27:56] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 9 ms returned sat
[2023-03-09 20:27:57] [INFO ] After 59ms SMT Verify possible using state equation in real domain returned unsat :0 sat :21
[2023-03-09 20:27:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:27:57] [INFO ] After 23ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :21
[2023-03-09 20:27:57] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2023-03-09 20:27:57] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2023-03-09 20:27:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 99 ms
[2023-03-09 20:27:57] [INFO ] After 352ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-09 20:27:57] [INFO ] After 474ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-09 20:27:57] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:27:57] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-09 20:27:57] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2023-03-09 20:27:57] [INFO ] After 23ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :21
[2023-03-09 20:27:57] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2023-03-09 20:27:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-09 20:27:57] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2023-03-09 20:27:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-09 20:27:57] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2023-03-09 20:27:57] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2023-03-09 20:27:58] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2023-03-09 20:27:58] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 2 ms to minimize.
[2023-03-09 20:27:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 197 ms
[2023-03-09 20:27:58] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
[2023-03-09 20:27:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-09 20:27:58] [INFO ] After 589ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-09 20:27:58] [INFO ] After 806ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
Incomplete random walk after 10000 steps, including 469 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 98 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1925027 steps, run timeout after 3001 ms. (steps per millisecond=641 ) properties seen :{}
Probabilistic random walk after 1925027 steps, saw 251141 distinct states, run finished after 3001 ms. (steps per millisecond=641 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:28:01] [INFO ] Invariant cache hit.
[2023-03-09 20:28:01] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:01] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 7 ms returned sat
[2023-03-09 20:28:01] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:28:01] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:01] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 19 ms returned sat
[2023-03-09 20:28:01] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:28:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:28:01] [INFO ] After 8ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:28:01] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2023-03-09 20:28:01] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2023-03-09 20:28:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 102 ms
[2023-03-09 20:28:01] [INFO ] After 113ms 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 20:28:01] [INFO ] After 254ms 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 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 161 transition count 102
Applied a total of 1 rules in 16 ms. Remains 161 /162 variables (removed 1) and now considering 102/103 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 161/162 places, 102/103 transitions.
Incomplete random walk after 10000 steps, including 485 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1954350 steps, run timeout after 3001 ms. (steps per millisecond=651 ) properties seen :{}
Probabilistic random walk after 1954350 steps, saw 254940 distinct states, run finished after 3001 ms. (steps per millisecond=651 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 102 rows 161 cols
[2023-03-09 20:28:04] [INFO ] Computed 62 place invariants in 5 ms
[2023-03-09 20:28:04] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:04] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 7 ms returned sat
[2023-03-09 20:28:04] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:28:04] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:04] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 7 ms returned sat
[2023-03-09 20:28:04] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:28:04] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2023-03-09 20:28:04] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2023-03-09 20:28:04] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2023-03-09 20:28:05] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 2 ms to minimize.
[2023-03-09 20:28:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 195 ms
[2023-03-09 20:28:05] [INFO ] After 268ms 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 20:28:05] [INFO ] After 349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 102/102 transitions.
Applied a total of 0 rules in 6 ms. Remains 161 /161 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 161/161 places, 102/102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 102/102 transitions.
Applied a total of 0 rules in 5 ms. Remains 161 /161 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-09 20:28:05] [INFO ] Invariant cache hit.
[2023-03-09 20:28:05] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-09 20:28:05] [INFO ] Invariant cache hit.
[2023-03-09 20:28:05] [INFO ] Implicit Places using invariants and state equation in 150 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 251 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 160/161 places, 102/102 transitions.
Applied a total of 0 rules in 5 ms. Remains 160 /160 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 261 ms. Remains : 160/161 places, 102/102 transitions.
Incomplete random walk after 10000 steps, including 498 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 90 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1940922 steps, run timeout after 3001 ms. (steps per millisecond=646 ) properties seen :{}
Probabilistic random walk after 1940922 steps, saw 253207 distinct states, run finished after 3001 ms. (steps per millisecond=646 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 102 rows 160 cols
[2023-03-09 20:28:08] [INFO ] Computed 61 place invariants in 3 ms
[2023-03-09 20:28:08] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-09 20:28:08] [INFO ] [Real]Absence check using 34 positive and 27 generalized place invariants in 8 ms returned sat
[2023-03-09 20:28:08] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:28:08] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:08] [INFO ] [Nat]Absence check using 34 positive and 27 generalized place invariants in 9 ms returned sat
[2023-03-09 20:28:08] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:28:08] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2023-03-09 20:28:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-09 20:28:08] [INFO ] After 108ms 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 20:28:08] [INFO ] After 185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 102/102 transitions.
Applied a total of 0 rules in 5 ms. Remains 160 /160 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 160/160 places, 102/102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 102/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 160 /160 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-09 20:28:08] [INFO ] Invariant cache hit.
[2023-03-09 20:28:08] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-09 20:28:08] [INFO ] Invariant cache hit.
[2023-03-09 20:28:08] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2023-03-09 20:28:08] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 20:28:08] [INFO ] Invariant cache hit.
[2023-03-09 20:28:08] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 344 ms. Remains : 160/160 places, 102/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 160 /160 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-09 20:28:08] [INFO ] Invariant cache hit.
[2023-03-09 20:28:08] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:08] [INFO ] [Real]Absence check using 34 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-09 20:28:08] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:28:09] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:09] [INFO ] [Nat]Absence check using 34 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-09 20:28:09] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:28:09] [INFO ] After 59ms 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 20:28:09] [INFO ] After 131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 451 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1937442 steps, run timeout after 3001 ms. (steps per millisecond=645 ) properties seen :{}
Probabilistic random walk after 1937442 steps, saw 252730 distinct states, run finished after 3001 ms. (steps per millisecond=645 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 103 rows 162 cols
[2023-03-09 20:28:12] [INFO ] Computed 62 place invariants in 11 ms
[2023-03-09 20:28:12] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-09 20:28:12] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-09 20:28:12] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:28:12] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:12] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 23 ms returned sat
[2023-03-09 20:28:12] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:28:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:28:12] [INFO ] After 6ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:28:12] [INFO ] After 15ms 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 20:28:12] [INFO ] After 159ms 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 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 161 transition count 102
Applied a total of 1 rules in 9 ms. Remains 161 /162 variables (removed 1) and now considering 102/103 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 161/162 places, 102/103 transitions.
Incomplete random walk after 10000 steps, including 475 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1942528 steps, run timeout after 3001 ms. (steps per millisecond=647 ) properties seen :{}
Probabilistic random walk after 1942528 steps, saw 253421 distinct states, run finished after 3001 ms. (steps per millisecond=647 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 102 rows 161 cols
[2023-03-09 20:28:15] [INFO ] Computed 62 place invariants in 6 ms
[2023-03-09 20:28:15] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:15] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-09 20:28:15] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:28:15] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:15] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 7 ms returned sat
[2023-03-09 20:28:15] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:28:15] [INFO ] After 50ms 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 20:28:15] [INFO ] After 113ms 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 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 102/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 161 /161 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 161/161 places, 102/102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 102/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 161 /161 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-09 20:28:15] [INFO ] Invariant cache hit.
[2023-03-09 20:28:15] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-09 20:28:15] [INFO ] Invariant cache hit.
[2023-03-09 20:28:15] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2023-03-09 20:28:15] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 20:28:15] [INFO ] Invariant cache hit.
[2023-03-09 20:28:15] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 363 ms. Remains : 161/161 places, 102/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 161 /161 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-09 20:28:15] [INFO ] Invariant cache hit.
[2023-03-09 20:28:16] [INFO ] [Real]Absence check using 34 positive place invariants in 3 ms returned sat
[2023-03-09 20:28:16] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 7 ms returned sat
[2023-03-09 20:28:16] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:28:16] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:16] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 7 ms returned sat
[2023-03-09 20:28:16] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:28:16] [INFO ] After 73ms 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 20:28:16] [INFO ] After 160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 474 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1898473 steps, run timeout after 3001 ms. (steps per millisecond=632 ) properties seen :{}
Probabilistic random walk after 1898473 steps, saw 247846 distinct states, run finished after 3002 ms. (steps per millisecond=632 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 103 rows 162 cols
[2023-03-09 20:28:19] [INFO ] Computed 62 place invariants in 5 ms
[2023-03-09 20:28:19] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-09 20:28:19] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-09 20:28:19] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:28:19] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:19] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-09 20:28:19] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:28:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:28:19] [INFO ] After 11ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:28:19] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 20:28:19] [INFO ] After 125ms 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 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 161 transition count 102
Applied a total of 1 rules in 13 ms. Remains 161 /162 variables (removed 1) and now considering 102/103 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 161/162 places, 102/103 transitions.
Incomplete random walk after 10000 steps, including 463 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 93 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1928414 steps, run timeout after 3001 ms. (steps per millisecond=642 ) properties seen :{}
Probabilistic random walk after 1928414 steps, saw 251619 distinct states, run finished after 3001 ms. (steps per millisecond=642 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 102 rows 161 cols
[2023-03-09 20:28:22] [INFO ] Computed 62 place invariants in 2 ms
[2023-03-09 20:28:22] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:22] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 7 ms returned sat
[2023-03-09 20:28:22] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:28:22] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:22] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 20 ms returned sat
[2023-03-09 20:28:22] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:28:22] [INFO ] After 60ms 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 20:28:22] [INFO ] After 134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 161 /161 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 161/161 places, 102/102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 161 /161 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-09 20:28:22] [INFO ] Invariant cache hit.
[2023-03-09 20:28:22] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-09 20:28:22] [INFO ] Invariant cache hit.
[2023-03-09 20:28:22] [INFO ] Implicit Places using invariants and state equation in 143 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 274 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 160/161 places, 102/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 160 /160 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 282 ms. Remains : 160/161 places, 102/102 transitions.
Incomplete random walk after 10000 steps, including 490 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1836827 steps, run timeout after 3001 ms. (steps per millisecond=612 ) properties seen :{}
Probabilistic random walk after 1836827 steps, saw 240498 distinct states, run finished after 3001 ms. (steps per millisecond=612 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 102 rows 160 cols
[2023-03-09 20:28:25] [INFO ] Computed 61 place invariants in 2 ms
[2023-03-09 20:28:26] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:26] [INFO ] [Real]Absence check using 34 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-09 20:28:26] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:28:26] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:26] [INFO ] [Nat]Absence check using 34 positive and 27 generalized place invariants in 8 ms returned sat
[2023-03-09 20:28:26] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:28:26] [INFO ] After 76ms 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 20:28:26] [INFO ] After 147ms 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 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 160 /160 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 160/160 places, 102/102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 160 /160 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-09 20:28:26] [INFO ] Invariant cache hit.
[2023-03-09 20:28:26] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-09 20:28:26] [INFO ] Invariant cache hit.
[2023-03-09 20:28:26] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2023-03-09 20:28:26] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 20:28:26] [INFO ] Invariant cache hit.
[2023-03-09 20:28:26] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 378 ms. Remains : 160/160 places, 102/102 transitions.
Applied a total of 0 rules in 5 ms. Remains 160 /160 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-09 20:28:26] [INFO ] Invariant cache hit.
[2023-03-09 20:28:26] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:26] [INFO ] [Real]Absence check using 34 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-09 20:28:26] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:28:26] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:26] [INFO ] [Nat]Absence check using 34 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-09 20:28:26] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:28:26] [INFO ] After 90ms 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 20:28:26] [INFO ] After 169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 483 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 79 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1886959 steps, run timeout after 3001 ms. (steps per millisecond=628 ) properties seen :{}
Probabilistic random walk after 1886959 steps, saw 246504 distinct states, run finished after 3001 ms. (steps per millisecond=628 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 103 rows 162 cols
[2023-03-09 20:28:29] [INFO ] Computed 62 place invariants in 8 ms
[2023-03-09 20:28:29] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:29] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 7 ms returned sat
[2023-03-09 20:28:29] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:28:29] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:30] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 44 ms returned sat
[2023-03-09 20:28:30] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:28:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:28:30] [INFO ] After 6ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:28:30] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2023-03-09 20:28:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-03-09 20:28:30] [INFO ] After 83ms 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 20:28:30] [INFO ] After 218ms 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 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 161 transition count 102
Applied a total of 1 rules in 6 ms. Remains 161 /162 variables (removed 1) and now considering 102/103 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 161/162 places, 102/103 transitions.
Incomplete random walk after 10000 steps, including 491 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1880881 steps, run timeout after 3001 ms. (steps per millisecond=626 ) properties seen :{}
Probabilistic random walk after 1880881 steps, saw 245740 distinct states, run finished after 3001 ms. (steps per millisecond=626 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 102 rows 161 cols
[2023-03-09 20:28:33] [INFO ] Computed 62 place invariants in 4 ms
[2023-03-09 20:28:33] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-09 20:28:33] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 13 ms returned sat
[2023-03-09 20:28:33] [INFO ] After 70ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:28:33] [INFO ] After 86ms 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 20:28:33] [INFO ] After 204ms 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 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 161 /161 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 161/161 places, 102/102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 161 /161 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-09 20:28:33] [INFO ] Invariant cache hit.
[2023-03-09 20:28:33] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-09 20:28:33] [INFO ] Invariant cache hit.
[2023-03-09 20:28:33] [INFO ] Implicit Places using invariants and state equation in 161 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 301 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 160/161 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 160 /160 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 306 ms. Remains : 160/161 places, 102/102 transitions.
Incomplete random walk after 10000 steps, including 479 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 95 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1862001 steps, run timeout after 3001 ms. (steps per millisecond=620 ) properties seen :{}
Probabilistic random walk after 1862001 steps, saw 243546 distinct states, run finished after 3001 ms. (steps per millisecond=620 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 102 rows 160 cols
[2023-03-09 20:28:36] [INFO ] Computed 61 place invariants in 1 ms
[2023-03-09 20:28:36] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-09 20:28:36] [INFO ] [Real]Absence check using 34 positive and 27 generalized place invariants in 8 ms returned sat
[2023-03-09 20:28:36] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:28:36] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:36] [INFO ] [Nat]Absence check using 34 positive and 27 generalized place invariants in 37 ms returned sat
[2023-03-09 20:28:36] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:28:36] [INFO ] After 70ms 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 20:28:37] [INFO ] After 167ms 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 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 102/102 transitions.
Applied a total of 0 rules in 7 ms. Remains 160 /160 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 160/160 places, 102/102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 160 /160 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-09 20:28:37] [INFO ] Invariant cache hit.
[2023-03-09 20:28:37] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-09 20:28:37] [INFO ] Invariant cache hit.
[2023-03-09 20:28:37] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2023-03-09 20:28:37] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 20:28:37] [INFO ] Invariant cache hit.
[2023-03-09 20:28:37] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 359 ms. Remains : 160/160 places, 102/102 transitions.
Applied a total of 0 rules in 5 ms. Remains 160 /160 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-09 20:28:37] [INFO ] Invariant cache hit.
[2023-03-09 20:28:37] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:37] [INFO ] [Real]Absence check using 34 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-09 20:28:37] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:28:37] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:37] [INFO ] [Nat]Absence check using 34 positive and 27 generalized place invariants in 30 ms returned sat
[2023-03-09 20:28:37] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:28:37] [INFO ] After 75ms 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 20:28:37] [INFO ] After 147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 489 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 97 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1917433 steps, run timeout after 3001 ms. (steps per millisecond=638 ) properties seen :{}
Probabilistic random walk after 1917433 steps, saw 250052 distinct states, run finished after 3001 ms. (steps per millisecond=638 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 103 rows 162 cols
[2023-03-09 20:28:40] [INFO ] Computed 62 place invariants in 3 ms
[2023-03-09 20:28:40] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-09 20:28:40] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 24 ms returned sat
[2023-03-09 20:28:40] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:28:40] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:40] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 39 ms returned sat
[2023-03-09 20:28:40] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:28:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:28:40] [INFO ] After 6ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:28:40] [INFO ] After 15ms 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 20:28:40] [INFO ] After 199ms 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 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 8 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 157/162 places, 101/103 transitions.
Incomplete random walk after 10000 steps, including 458 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 100 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1930762 steps, run timeout after 3001 ms. (steps per millisecond=643 ) properties seen :{}
Probabilistic random walk after 1930762 steps, saw 251926 distinct states, run finished after 3001 ms. (steps per millisecond=643 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:28:43] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-09 20:28:43] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 20:28:43] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:28:43] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:28:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:44] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 31 ms returned sat
[2023-03-09 20:28:44] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:28:44] [INFO ] After 98ms 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 20:28:44] [INFO ] After 188ms 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 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2023-03-09 20:28:44] [INFO ] Invariant cache hit.
[2023-03-09 20:28:44] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-09 20:28:44] [INFO ] Invariant cache hit.
[2023-03-09 20:28:44] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2023-03-09 20:28:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 20:28:44] [INFO ] Invariant cache hit.
[2023-03-09 20:28:44] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 612 ms. Remains : 157/157 places, 101/101 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 101
Applied a total of 1 rules in 8 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:28:44] [INFO ] Computed 59 place invariants in 1 ms
[2023-03-09 20:28:44] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:44] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 5 ms returned sat
[2023-03-09 20:28:44] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:28:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:44] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 30 ms returned sat
[2023-03-09 20:28:45] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:28:45] [INFO ] After 79ms 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 20:28:45] [INFO ] After 180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 471 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1907329 steps, run timeout after 3001 ms. (steps per millisecond=635 ) properties seen :{}
Probabilistic random walk after 1907329 steps, saw 248857 distinct states, run finished after 3001 ms. (steps per millisecond=635 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 103 rows 162 cols
[2023-03-09 20:28:48] [INFO ] Computed 62 place invariants in 1 ms
[2023-03-09 20:28:48] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-09 20:28:48] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-09 20:28:48] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:28:48] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:48] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 38 ms returned sat
[2023-03-09 20:28:48] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:28:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:28:48] [INFO ] After 12ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:28:48] [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 7 ms.
[2023-03-09 20:28:48] [INFO ] After 173ms 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 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 9 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 157/162 places, 101/103 transitions.
Incomplete random walk after 10000 steps, including 490 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 95 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1914120 steps, run timeout after 3001 ms. (steps per millisecond=637 ) properties seen :{}
Probabilistic random walk after 1914120 steps, saw 249608 distinct states, run finished after 3001 ms. (steps per millisecond=637 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:28:51] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-09 20:28:51] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:51] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 20:28:51] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:28:51] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:51] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 30 ms returned sat
[2023-03-09 20:28:51] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:28:51] [INFO ] After 51ms 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 20:28:51] [INFO ] After 154ms 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 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2023-03-09 20:28:51] [INFO ] Invariant cache hit.
[2023-03-09 20:28:51] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-09 20:28:51] [INFO ] Invariant cache hit.
[2023-03-09 20:28:51] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2023-03-09 20:28:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 20:28:51] [INFO ] Invariant cache hit.
[2023-03-09 20:28:51] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 385 ms. Remains : 157/157 places, 101/101 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 101
Applied a total of 1 rules in 12 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:28:52] [INFO ] Computed 59 place invariants in 1 ms
[2023-03-09 20:28:52] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:52] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 5 ms returned sat
[2023-03-09 20:28:52] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:28:52] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:52] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 29 ms returned sat
[2023-03-09 20:28:52] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:28:52] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 20:28:52] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 452 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1900639 steps, run timeout after 3001 ms. (steps per millisecond=633 ) properties seen :{}
Probabilistic random walk after 1900639 steps, saw 248097 distinct states, run finished after 3001 ms. (steps per millisecond=633 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 103 rows 162 cols
[2023-03-09 20:28:55] [INFO ] Computed 62 place invariants in 2 ms
[2023-03-09 20:28:55] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:55] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-09 20:28:55] [INFO ] After 41ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:28:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:28:55] [INFO ] After 6ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:28:55] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:28:55] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:55] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 7 ms returned sat
[2023-03-09 20:28:55] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:28:55] [INFO ] After 6ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:28:55] [INFO ] After 15ms 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 20:28:55] [INFO ] After 135ms 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 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 11 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 157/162 places, 101/103 transitions.
Incomplete random walk after 10000 steps, including 465 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1923488 steps, run timeout after 3001 ms. (steps per millisecond=640 ) properties seen :{}
Probabilistic random walk after 1923488 steps, saw 250934 distinct states, run finished after 3001 ms. (steps per millisecond=640 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:28:58] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-09 20:28:58] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 20:28:58] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-09 20:28:58] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:28:58] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:28:58] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 30 ms returned sat
[2023-03-09 20:28:58] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:28:58] [INFO ] After 53ms 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 20:28:58] [INFO ] After 144ms 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 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2023-03-09 20:28:58] [INFO ] Invariant cache hit.
[2023-03-09 20:28:58] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-09 20:28:58] [INFO ] Invariant cache hit.
[2023-03-09 20:28:59] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2023-03-09 20:28:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:28:59] [INFO ] Invariant cache hit.
[2023-03-09 20:28:59] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 371 ms. Remains : 157/157 places, 101/101 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 101
Applied a total of 1 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:28:59] [INFO ] Computed 59 place invariants in 0 ms
[2023-03-09 20:28:59] [INFO ] [Real]Absence check using 35 positive place invariants in 3 ms returned sat
[2023-03-09 20:28:59] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 5 ms returned sat
[2023-03-09 20:28:59] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:28:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 3 ms returned sat
[2023-03-09 20:28:59] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 29 ms returned sat
[2023-03-09 20:28:59] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:28:59] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2023-03-09 20:28:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-09 20:28:59] [INFO ] After 106ms 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 20:28:59] [INFO ] After 184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 460 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 91 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1934699 steps, run timeout after 3001 ms. (steps per millisecond=644 ) properties seen :{}
Probabilistic random walk after 1934699 steps, saw 252405 distinct states, run finished after 3001 ms. (steps per millisecond=644 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 103 rows 162 cols
[2023-03-09 20:29:02] [INFO ] Computed 62 place invariants in 5 ms
[2023-03-09 20:29:02] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:02] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 19 ms returned sat
[2023-03-09 20:29:02] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:29:02] [INFO ] [Nat]Absence check using 34 positive place invariants in 10 ms returned sat
[2023-03-09 20:29:02] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 40 ms returned sat
[2023-03-09 20:29:02] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:29:02] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:29:02] [INFO ] After 6ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:29:02] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 20:29:02] [INFO ] After 198ms 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 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 6 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 157/162 places, 101/103 transitions.
Incomplete random walk after 10000 steps, including 504 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 81 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1939563 steps, run timeout after 3001 ms. (steps per millisecond=646 ) properties seen :{}
Probabilistic random walk after 1939563 steps, saw 253036 distinct states, run finished after 3001 ms. (steps per millisecond=646 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:29:05] [INFO ] Computed 59 place invariants in 4 ms
[2023-03-09 20:29:05] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:05] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:29:05] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:29:05] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 20:29:05] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 30 ms returned sat
[2023-03-09 20:29:05] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:29:05] [INFO ] After 49ms 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 20:29:05] [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 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2023-03-09 20:29:06] [INFO ] Invariant cache hit.
[2023-03-09 20:29:06] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-09 20:29:06] [INFO ] Invariant cache hit.
[2023-03-09 20:29:06] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2023-03-09 20:29:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 20:29:06] [INFO ] Invariant cache hit.
[2023-03-09 20:29:06] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 452 ms. Remains : 157/157 places, 101/101 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 101
Applied a total of 1 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:29:06] [INFO ] Computed 59 place invariants in 1 ms
[2023-03-09 20:29:06] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 20:29:06] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-09 20:29:06] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:29:06] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 20:29:06] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 46 ms returned sat
[2023-03-09 20:29:06] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:29:06] [INFO ] After 61ms 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 20:29:06] [INFO ] After 154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 445 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1914604 steps, run timeout after 3001 ms. (steps per millisecond=637 ) properties seen :{}
Probabilistic random walk after 1914604 steps, saw 249654 distinct states, run finished after 3001 ms. (steps per millisecond=637 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 103 rows 162 cols
[2023-03-09 20:29:09] [INFO ] Computed 62 place invariants in 3 ms
[2023-03-09 20:29:09] [INFO ] [Real]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-09 20:29:09] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-09 20:29:09] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:29:09] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:09] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 7 ms returned sat
[2023-03-09 20:29:09] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:29:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:29:09] [INFO ] After 14ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:29:09] [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 5 ms.
[2023-03-09 20:29:09] [INFO ] After 138ms 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 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 16 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 157/162 places, 101/103 transitions.
Incomplete random walk after 10000 steps, including 477 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1921077 steps, run timeout after 3001 ms. (steps per millisecond=640 ) properties seen :{}
Probabilistic random walk after 1921077 steps, saw 250603 distinct states, run finished after 3001 ms. (steps per millisecond=640 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:29:12] [INFO ] Computed 59 place invariants in 1 ms
[2023-03-09 20:29:13] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:13] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-09 20:29:13] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:29:13] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:13] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 43 ms returned sat
[2023-03-09 20:29:13] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:29:13] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 20:29:13] [INFO ] After 177ms 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 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2023-03-09 20:29:13] [INFO ] Invariant cache hit.
[2023-03-09 20:29:13] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-09 20:29:13] [INFO ] Invariant cache hit.
[2023-03-09 20:29:13] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2023-03-09 20:29:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 20:29:13] [INFO ] Invariant cache hit.
[2023-03-09 20:29:13] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 512 ms. Remains : 157/157 places, 101/101 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 101
Applied a total of 1 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:29:13] [INFO ] Computed 59 place invariants in 1 ms
[2023-03-09 20:29:13] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:13] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:29:13] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:29:13] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 20:29:13] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 18 ms returned sat
[2023-03-09 20:29:13] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:29:13] [INFO ] After 78ms 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 20:29:13] [INFO ] After 175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 449 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 106 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1898104 steps, run timeout after 3001 ms. (steps per millisecond=632 ) properties seen :{}
Probabilistic random walk after 1898104 steps, saw 247808 distinct states, run finished after 3001 ms. (steps per millisecond=632 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 103 rows 162 cols
[2023-03-09 20:29:17] [INFO ] Computed 62 place invariants in 2 ms
[2023-03-09 20:29:17] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-09 20:29:17] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-09 20:29:17] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:29:17] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:17] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-09 20:29:17] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:29:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:29:17] [INFO ] After 14ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:29:17] [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 20:29:17] [INFO ] After 144ms 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 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 8 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 157/162 places, 101/103 transitions.
Incomplete random walk after 10000 steps, including 475 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1919545 steps, run timeout after 3001 ms. (steps per millisecond=639 ) properties seen :{}
Probabilistic random walk after 1919545 steps, saw 250374 distinct states, run finished after 3001 ms. (steps per millisecond=639 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:29:20] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-09 20:29:20] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 20:29:20] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:29:20] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:29:20] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:20] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 19 ms returned sat
[2023-03-09 20:29:20] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:29:20] [INFO ] After 106ms 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 20:29:20] [INFO ] After 185ms 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 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2023-03-09 20:29:20] [INFO ] Invariant cache hit.
[2023-03-09 20:29:20] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-09 20:29:20] [INFO ] Invariant cache hit.
[2023-03-09 20:29:20] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-09 20:29:20] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 20:29:20] [INFO ] Invariant cache hit.
[2023-03-09 20:29:20] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 386 ms. Remains : 157/157 places, 101/101 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 101
Applied a total of 1 rules in 6 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:29:20] [INFO ] Computed 59 place invariants in 1 ms
[2023-03-09 20:29:21] [INFO ] [Real]Absence check using 35 positive place invariants in 61 ms returned sat
[2023-03-09 20:29:21] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 5 ms returned sat
[2023-03-09 20:29:21] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:29:21] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:21] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 18 ms returned sat
[2023-03-09 20:29:21] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:29:21] [INFO ] After 110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 20:29:21] [INFO ] After 188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 470 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 97 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1924630 steps, run timeout after 3001 ms. (steps per millisecond=641 ) properties seen :{}
Probabilistic random walk after 1924630 steps, saw 251093 distinct states, run finished after 3001 ms. (steps per millisecond=641 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 103 rows 162 cols
[2023-03-09 20:29:24] [INFO ] Computed 62 place invariants in 1 ms
[2023-03-09 20:29:24] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:24] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-09 20:29:24] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:29:24] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:24] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 19 ms returned sat
[2023-03-09 20:29:24] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:29:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:29:24] [INFO ] After 17ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:29:24] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 20:29:24] [INFO ] After 149ms 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 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 157 transition count 101
Applied a total of 2 rules in 5 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 157/162 places, 101/103 transitions.
Incomplete random walk after 10000 steps, including 464 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1924581 steps, run timeout after 3001 ms. (steps per millisecond=641 ) properties seen :{}
Probabilistic random walk after 1924581 steps, saw 251086 distinct states, run finished after 3001 ms. (steps per millisecond=641 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:29:27] [INFO ] Computed 59 place invariants in 1 ms
[2023-03-09 20:29:27] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 20:29:27] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:29:27] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:29:27] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:27] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 19 ms returned sat
[2023-03-09 20:29:27] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:29:27] [INFO ] After 110ms 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 20:29:27] [INFO ] After 217ms 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 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2023-03-09 20:29:27] [INFO ] Invariant cache hit.
[2023-03-09 20:29:28] [INFO ] Implicit Places using invariants in 275 ms returned []
[2023-03-09 20:29:28] [INFO ] Invariant cache hit.
[2023-03-09 20:29:28] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2023-03-09 20:29:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 20:29:28] [INFO ] Invariant cache hit.
[2023-03-09 20:29:28] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 530 ms. Remains : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-09 20:29:28] [INFO ] Invariant cache hit.
[2023-03-09 20:29:28] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:28] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:29:28] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:29:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:28] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 25 ms returned sat
[2023-03-09 20:29:28] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:29:28] [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 4 ms.
[2023-03-09 20:29:28] [INFO ] After 142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 473 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1903674 steps, run timeout after 3001 ms. (steps per millisecond=634 ) properties seen :{}
Probabilistic random walk after 1903674 steps, saw 248425 distinct states, run finished after 3001 ms. (steps per millisecond=634 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 103 rows 162 cols
[2023-03-09 20:29:31] [INFO ] Computed 62 place invariants in 3 ms
[2023-03-09 20:29:31] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:31] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 7 ms returned sat
[2023-03-09 20:29:31] [INFO ] After 38ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:29:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:29:31] [INFO ] After 8ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:29:31] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:29:31] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:31] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 7 ms returned sat
[2023-03-09 20:29:31] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:29:31] [INFO ] After 8ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:29:31] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2023-03-09 20:29:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-09 20:29:31] [INFO ] After 63ms 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 20:29:31] [INFO ] After 150ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 10 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 157/162 places, 101/103 transitions.
Incomplete random walk after 10000 steps, including 485 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1935517 steps, run timeout after 3001 ms. (steps per millisecond=644 ) properties seen :{}
Probabilistic random walk after 1935517 steps, saw 252508 distinct states, run finished after 3001 ms. (steps per millisecond=644 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:29:34] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-09 20:29:35] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:35] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:29:35] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:29:35] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:35] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 18 ms returned sat
[2023-03-09 20:29:35] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:29:35] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2023-03-09 20:29:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-09 20:29:35] [INFO ] After 128ms 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 20:29:35] [INFO ] After 231ms 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 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 6 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2023-03-09 20:29:35] [INFO ] Invariant cache hit.
[2023-03-09 20:29:35] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-09 20:29:35] [INFO ] Invariant cache hit.
[2023-03-09 20:29:35] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2023-03-09 20:29:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 20:29:35] [INFO ] Invariant cache hit.
[2023-03-09 20:29:35] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 378 ms. Remains : 157/157 places, 101/101 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 101
Applied a total of 1 rules in 6 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:29:35] [INFO ] Computed 59 place invariants in 1 ms
[2023-03-09 20:29:35] [INFO ] [Real]Absence check using 35 positive place invariants in 3 ms returned sat
[2023-03-09 20:29:35] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-09 20:29:35] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:29:35] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:35] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 18 ms returned sat
[2023-03-09 20:29:35] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:29:35] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2023-03-09 20:29:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-09 20:29:35] [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 8 ms.
[2023-03-09 20:29:35] [INFO ] After 211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 2389 steps, including 105 resets, run visited all 1 properties in 6 ms. (steps per millisecond=398 )
Finished random walk after 182 steps, including 6 resets, run visited all 1 properties in 2 ms. (steps per millisecond=91 )
Incomplete random walk after 10000 steps, including 468 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1897932 steps, run timeout after 3001 ms. (steps per millisecond=632 ) properties seen :{}
Probabilistic random walk after 1897932 steps, saw 247793 distinct states, run finished after 3001 ms. (steps per millisecond=632 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 103 rows 162 cols
[2023-03-09 20:29:38] [INFO ] Computed 62 place invariants in 1 ms
[2023-03-09 20:29:39] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:39] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 7 ms returned sat
[2023-03-09 20:29:39] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:29:39] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:39] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 23 ms returned sat
[2023-03-09 20:29:39] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:29:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:29:39] [INFO ] After 10ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:29:39] [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 6 ms.
[2023-03-09 20:29:39] [INFO ] After 160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 13 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 157/162 places, 101/103 transitions.
Incomplete random walk after 10000 steps, including 464 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 97 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1917313 steps, run timeout after 3001 ms. (steps per millisecond=638 ) properties seen :{}
Probabilistic random walk after 1917313 steps, saw 250031 distinct states, run finished after 3001 ms. (steps per millisecond=638 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:29:42] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-09 20:29:42] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 20:29:42] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:29:42] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:29:42] [INFO ] [Nat]Absence check using 35 positive place invariants in 3 ms returned sat
[2023-03-09 20:29:42] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:29:42] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:29:42] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2023-03-09 20:29:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-09 20:29:42] [INFO ] After 134ms 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 20:29:42] [INFO ] After 237ms 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 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 1 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 8 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2023-03-09 20:29:42] [INFO ] Invariant cache hit.
[2023-03-09 20:29:42] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-09 20:29:42] [INFO ] Invariant cache hit.
[2023-03-09 20:29:42] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2023-03-09 20:29:42] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:29:42] [INFO ] Invariant cache hit.
[2023-03-09 20:29:42] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 360 ms. Remains : 157/157 places, 101/101 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 101
Applied a total of 1 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:29:42] [INFO ] Computed 59 place invariants in 1 ms
[2023-03-09 20:29:43] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:43] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:29:43] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:29:43] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:43] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:29:43] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:29:43] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2023-03-09 20:29:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-09 20:29:43] [INFO ] After 122ms 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 20:29:43] [INFO ] After 210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 466 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 93 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1909244 steps, run timeout after 3001 ms. (steps per millisecond=636 ) properties seen :{}
Probabilistic random walk after 1909244 steps, saw 249085 distinct states, run finished after 3001 ms. (steps per millisecond=636 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 103 rows 162 cols
[2023-03-09 20:29:46] [INFO ] Computed 62 place invariants in 2 ms
[2023-03-09 20:29:46] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:46] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 7 ms returned sat
[2023-03-09 20:29:46] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:29:46] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:46] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 45 ms returned sat
[2023-03-09 20:29:46] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:29:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:29:46] [INFO ] After 7ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:29:46] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2023-03-09 20:29:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-09 20:29:46] [INFO ] After 71ms 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 20:29:46] [INFO ] After 223ms 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 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 5 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 157/162 places, 101/103 transitions.
Incomplete random walk after 10000 steps, including 483 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 105 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1866728 steps, run timeout after 3001 ms. (steps per millisecond=622 ) properties seen :{}
Probabilistic random walk after 1866728 steps, saw 244087 distinct states, run finished after 3001 ms. (steps per millisecond=622 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:29:49] [INFO ] Computed 59 place invariants in 1 ms
[2023-03-09 20:29:49] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:49] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-09 20:29:49] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:29:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:49] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:29:49] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:29:49] [INFO ] After 53ms 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 20:29:49] [INFO ] After 152ms 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 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2023-03-09 20:29:49] [INFO ] Invariant cache hit.
[2023-03-09 20:29:49] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-09 20:29:49] [INFO ] Invariant cache hit.
[2023-03-09 20:29:50] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2023-03-09 20:29:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 20:29:50] [INFO ] Invariant cache hit.
[2023-03-09 20:29:50] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 355 ms. Remains : 157/157 places, 101/101 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 101
Applied a total of 1 rules in 7 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:29:50] [INFO ] Computed 59 place invariants in 0 ms
[2023-03-09 20:29:50] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:50] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:29:50] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:29:50] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:50] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:29:50] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:29:50] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 20:29:50] [INFO ] After 176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 470 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 110 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1859179 steps, run timeout after 3001 ms. (steps per millisecond=619 ) properties seen :{}
Probabilistic random walk after 1859179 steps, saw 243267 distinct states, run finished after 3001 ms. (steps per millisecond=619 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 103 rows 162 cols
[2023-03-09 20:29:53] [INFO ] Computed 62 place invariants in 2 ms
[2023-03-09 20:29:53] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-09 20:29:53] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-09 20:29:53] [INFO ] After 38ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:29:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:29:53] [INFO ] After 8ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:29:53] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:29:53] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:53] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 7 ms returned sat
[2023-03-09 20:29:53] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:29:53] [INFO ] After 7ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:29:53] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2023-03-09 20:29:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-09 20:29:53] [INFO ] After 62ms 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 20:29:53] [INFO ] After 167ms 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 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 9 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 157/162 places, 101/103 transitions.
Incomplete random walk after 10000 steps, including 473 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1873278 steps, run timeout after 3001 ms. (steps per millisecond=624 ) properties seen :{}
Probabilistic random walk after 1873278 steps, saw 244831 distinct states, run finished after 3001 ms. (steps per millisecond=624 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:29:56] [INFO ] Computed 59 place invariants in 0 ms
[2023-03-09 20:29:56] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:56] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:29:56] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:29:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 3 ms returned sat
[2023-03-09 20:29:56] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:29:57] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:29:57] [INFO ] After 67ms 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 20:29:57] [INFO ] After 200ms 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 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 9 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2023-03-09 20:29:57] [INFO ] Invariant cache hit.
[2023-03-09 20:29:57] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-09 20:29:57] [INFO ] Invariant cache hit.
[2023-03-09 20:29:57] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2023-03-09 20:29:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 20:29:57] [INFO ] Invariant cache hit.
[2023-03-09 20:29:57] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 402 ms. Remains : 157/157 places, 101/101 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 101
Applied a total of 1 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:29:57] [INFO ] Computed 59 place invariants in 1 ms
[2023-03-09 20:29:57] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:57] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:29:57] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:29:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:29:57] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:29:57] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:29:57] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 20:29:57] [INFO ] After 188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 443 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 99 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1862620 steps, run timeout after 3001 ms. (steps per millisecond=620 ) properties seen :{}
Probabilistic random walk after 1862620 steps, saw 243636 distinct states, run finished after 3001 ms. (steps per millisecond=620 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 103 rows 162 cols
[2023-03-09 20:30:00] [INFO ] Computed 62 place invariants in 1 ms
[2023-03-09 20:30:00] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:00] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-09 20:30:00] [INFO ] After 38ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:30:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:30:00] [INFO ] After 12ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:30:00] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:30:00] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-09 20:30:00] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-09 20:30:01] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:01] [INFO ] After 7ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:01] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2023-03-09 20:30:01] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 0 ms to minimize.
[2023-03-09 20:30:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 159 ms
[2023-03-09 20:30:01] [INFO ] After 182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-09 20:30:01] [INFO ] After 320ms 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 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 4 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 157/162 places, 101/103 transitions.
Incomplete random walk after 10000 steps, including 483 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 100 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1914249 steps, run timeout after 3001 ms. (steps per millisecond=637 ) properties seen :{}
Probabilistic random walk after 1914249 steps, saw 249615 distinct states, run finished after 3001 ms. (steps per millisecond=637 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:30:04] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-09 20:30:04] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:04] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:30:04] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:30:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 20:30:04] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 18 ms returned sat
[2023-03-09 20:30:04] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:04] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-09 20:30:04] [INFO ] After 157ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2023-03-09 20:30:04] [INFO ] Invariant cache hit.
[2023-03-09 20:30:04] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-09 20:30:04] [INFO ] Invariant cache hit.
[2023-03-09 20:30:04] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2023-03-09 20:30:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 20:30:04] [INFO ] Invariant cache hit.
[2023-03-09 20:30:04] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 360 ms. Remains : 157/157 places, 101/101 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 101
Applied a total of 1 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:30:04] [INFO ] Computed 59 place invariants in 1 ms
[2023-03-09 20:30:04] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:04] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:30:04] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:30:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 3 ms returned sat
[2023-03-09 20:30:04] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 17 ms returned sat
[2023-03-09 20:30:05] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:05] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 20:30:05] [INFO ] After 159ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 460 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1905852 steps, run timeout after 3001 ms. (steps per millisecond=635 ) properties seen :{}
Probabilistic random walk after 1905852 steps, saw 248690 distinct states, run finished after 3001 ms. (steps per millisecond=635 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 103 rows 162 cols
[2023-03-09 20:30:08] [INFO ] Computed 62 place invariants in 2 ms
[2023-03-09 20:30:08] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:08] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-09 20:30:08] [INFO ] After 37ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:30:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:30:08] [INFO ] After 13ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:30:08] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:30:08] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:08] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 7 ms returned sat
[2023-03-09 20:30:08] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:08] [INFO ] After 10ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:08] [INFO ] After 20ms 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 20:30:08] [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 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 5 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 157/162 places, 101/103 transitions.
Incomplete random walk after 10000 steps, including 482 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 105 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1923530 steps, run timeout after 3001 ms. (steps per millisecond=640 ) properties seen :{}
Probabilistic random walk after 1923530 steps, saw 250938 distinct states, run finished after 3001 ms. (steps per millisecond=640 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:30:11] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-09 20:30:11] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:11] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:30:11] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:30:11] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:11] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 18 ms returned sat
[2023-03-09 20:30:11] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:11] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2023-03-09 20:30:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-09 20:30:11] [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 20:30:11] [INFO ] After 198ms 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 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 1 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2023-03-09 20:30:11] [INFO ] Invariant cache hit.
[2023-03-09 20:30:11] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-09 20:30:11] [INFO ] Invariant cache hit.
[2023-03-09 20:30:11] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2023-03-09 20:30:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 20:30:11] [INFO ] Invariant cache hit.
[2023-03-09 20:30:12] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 364 ms. Remains : 157/157 places, 101/101 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 101
Applied a total of 1 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:30:12] [INFO ] Computed 59 place invariants in 1 ms
[2023-03-09 20:30:12] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:12] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:30:12] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:30:12] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:12] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 18 ms returned sat
[2023-03-09 20:30:12] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:12] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2023-03-09 20:30:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-09 20:30:12] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 20:30:12] [INFO ] After 212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 489 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 91 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1911667 steps, run timeout after 3001 ms. (steps per millisecond=637 ) properties seen :{}
Probabilistic random walk after 1911667 steps, saw 249328 distinct states, run finished after 3001 ms. (steps per millisecond=637 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 103 rows 162 cols
[2023-03-09 20:30:15] [INFO ] Computed 62 place invariants in 3 ms
[2023-03-09 20:30:15] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-09 20:30:15] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-09 20:30:15] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:30:15] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:15] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 24 ms returned sat
[2023-03-09 20:30:15] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:15] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:30:15] [INFO ] After 7ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:15] [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 6 ms.
[2023-03-09 20:30:15] [INFO ] After 174ms 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 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 5 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 157/162 places, 101/103 transitions.
Incomplete random walk after 10000 steps, including 496 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 98 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1920388 steps, run timeout after 3001 ms. (steps per millisecond=639 ) properties seen :{}
Probabilistic random walk after 1920388 steps, saw 250505 distinct states, run finished after 3001 ms. (steps per millisecond=639 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:30:18] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-09 20:30:18] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 20:30:18] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:30:18] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:30:18] [INFO ] [Nat]Absence check using 35 positive place invariants in 3 ms returned sat
[2023-03-09 20:30:18] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:30:18] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:18] [INFO ] After 84ms 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 20:30:18] [INFO ] After 171ms 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 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 1 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2023-03-09 20:30:18] [INFO ] Invariant cache hit.
[2023-03-09 20:30:18] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-09 20:30:18] [INFO ] Invariant cache hit.
[2023-03-09 20:30:19] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2023-03-09 20:30:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 20:30:19] [INFO ] Invariant cache hit.
[2023-03-09 20:30:19] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 363 ms. Remains : 157/157 places, 101/101 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 101
Applied a total of 1 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:30:19] [INFO ] Computed 59 place invariants in 1 ms
[2023-03-09 20:30:19] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 20:30:19] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-09 20:30:19] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:30:19] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:19] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:30:19] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:19] [INFO ] After 53ms 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 20:30:19] [INFO ] After 134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 452 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1891630 steps, run timeout after 3001 ms. (steps per millisecond=630 ) properties seen :{}
Probabilistic random walk after 1891630 steps, saw 247081 distinct states, run finished after 3001 ms. (steps per millisecond=630 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 103 rows 162 cols
[2023-03-09 20:30:22] [INFO ] Computed 62 place invariants in 3 ms
[2023-03-09 20:30:22] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-09 20:30:22] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-09 20:30:22] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:30:22] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:22] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 29 ms returned sat
[2023-03-09 20:30:22] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:30:22] [INFO ] After 11ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:22] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 20:30:22] [INFO ] After 191ms 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 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 7 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 157/162 places, 101/103 transitions.
Incomplete random walk after 10000 steps, including 486 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 103 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1925011 steps, run timeout after 3001 ms. (steps per millisecond=641 ) properties seen :{}
Probabilistic random walk after 1925011 steps, saw 251138 distinct states, run finished after 3001 ms. (steps per millisecond=641 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:30:25] [INFO ] Computed 59 place invariants in 1 ms
[2023-03-09 20:30:25] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 20:30:25] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:30:25] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:30:25] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 20:30:25] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:30:26] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:26] [INFO ] After 130ms 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 20:30:26] [INFO ] After 205ms 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 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 1 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2023-03-09 20:30:26] [INFO ] Invariant cache hit.
[2023-03-09 20:30:26] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-09 20:30:26] [INFO ] Invariant cache hit.
[2023-03-09 20:30:26] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2023-03-09 20:30:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 20:30:26] [INFO ] Invariant cache hit.
[2023-03-09 20:30:26] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 366 ms. Remains : 157/157 places, 101/101 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 101
Applied a total of 1 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:30:26] [INFO ] Computed 59 place invariants in 1 ms
[2023-03-09 20:30:26] [INFO ] [Real]Absence check using 35 positive place invariants in 19 ms returned sat
[2023-03-09 20:30:26] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 25 ms returned sat
[2023-03-09 20:30:26] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:30:26] [INFO ] [Nat]Absence check using 35 positive place invariants in 3 ms returned sat
[2023-03-09 20:30:26] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 5 ms returned sat
[2023-03-09 20:30:26] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:26] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2023-03-09 20:30:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-09 20:30:26] [INFO ] After 165ms 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 20:30:26] [INFO ] After 222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 452 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1916638 steps, run timeout after 3001 ms. (steps per millisecond=638 ) properties seen :{}
Probabilistic random walk after 1916638 steps, saw 249921 distinct states, run finished after 3001 ms. (steps per millisecond=638 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 103 rows 162 cols
[2023-03-09 20:30:29] [INFO ] Computed 62 place invariants in 4 ms
[2023-03-09 20:30:29] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-09 20:30:29] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-09 20:30:29] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:30:29] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:29] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 43 ms returned sat
[2023-03-09 20:30:29] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:30:29] [INFO ] After 6ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:30] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2023-03-09 20:30:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-09 20:30:30] [INFO ] After 66ms 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 20:30:30] [INFO ] After 214ms 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 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 7 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 157/162 places, 101/103 transitions.
Incomplete random walk after 10000 steps, including 487 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 101 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1925686 steps, run timeout after 3001 ms. (steps per millisecond=641 ) properties seen :{}
Probabilistic random walk after 1925686 steps, saw 251232 distinct states, run finished after 3001 ms. (steps per millisecond=641 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:30:33] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-09 20:30:33] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:33] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 5 ms returned sat
[2023-03-09 20:30:33] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:30:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:33] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:30:33] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:33] [INFO ] After 77ms 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 20:30:33] [INFO ] After 160ms 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 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 14 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2023-03-09 20:30:33] [INFO ] Invariant cache hit.
[2023-03-09 20:30:33] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-09 20:30:33] [INFO ] Invariant cache hit.
[2023-03-09 20:30:33] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2023-03-09 20:30:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 20:30:33] [INFO ] Invariant cache hit.
[2023-03-09 20:30:33] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 392 ms. Remains : 157/157 places, 101/101 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 101
Applied a total of 1 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:30:33] [INFO ] Computed 59 place invariants in 0 ms
[2023-03-09 20:30:33] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:33] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:30:33] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:30:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 3 ms returned sat
[2023-03-09 20:30:33] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 5 ms returned sat
[2023-03-09 20:30:33] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:33] [INFO ] After 77ms 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 20:30:33] [INFO ] After 162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 470 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 100 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1918612 steps, run timeout after 3001 ms. (steps per millisecond=639 ) properties seen :{}
Probabilistic random walk after 1918612 steps, saw 250240 distinct states, run finished after 3001 ms. (steps per millisecond=639 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 103 rows 162 cols
[2023-03-09 20:30:36] [INFO ] Computed 62 place invariants in 2 ms
[2023-03-09 20:30:37] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:37] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-09 20:30:37] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:30:37] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:37] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 23 ms returned sat
[2023-03-09 20:30:37] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:30:37] [INFO ] After 19ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:37] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2023-03-09 20:30:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-09 20:30:37] [INFO ] After 77ms 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 20:30:37] [INFO ] After 225ms 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 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 14 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 157/162 places, 101/103 transitions.
Incomplete random walk after 10000 steps, including 498 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 98 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1958597 steps, run timeout after 3001 ms. (steps per millisecond=652 ) properties seen :{}
Probabilistic random walk after 1958597 steps, saw 255453 distinct states, run finished after 3001 ms. (steps per millisecond=652 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:30:40] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-09 20:30:40] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:40] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:30:40] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:30:40] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:40] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 5 ms returned sat
[2023-03-09 20:30:40] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:40] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2023-03-09 20:30:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-09 20:30:40] [INFO ] After 92ms 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 20:30:40] [INFO ] After 169ms 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 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 1 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2023-03-09 20:30:40] [INFO ] Invariant cache hit.
[2023-03-09 20:30:40] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-09 20:30:40] [INFO ] Invariant cache hit.
[2023-03-09 20:30:40] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2023-03-09 20:30:40] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:30:40] [INFO ] Invariant cache hit.
[2023-03-09 20:30:40] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 357 ms. Remains : 157/157 places, 101/101 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 101
Applied a total of 1 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2023-03-09 20:30:40] [INFO ] Computed 59 place invariants in 0 ms
[2023-03-09 20:30:40] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:40] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:30:40] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:30:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:41] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 20:30:41] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:41] [INFO ] After 53ms 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 20:30:41] [INFO ] After 140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Applied a total of 0 rules in 2 ms. Remains 162 /162 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Running SMT prover for 18 properties.
// Phase 1: matrix 103 rows 162 cols
[2023-03-09 20:30:41] [INFO ] Computed 62 place invariants in 4 ms
[2023-03-09 20:30:41] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-09 20:30:41] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-09 20:30:41] [INFO ] After 81ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:14
[2023-03-09 20:30:41] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2023-03-09 20:30:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-09 20:30:41] [INFO ] After 161ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-09 20:30:41] [INFO ] After 310ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-09 20:30:41] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:41] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 27 ms returned sat
[2023-03-09 20:30:42] [INFO ] After 371ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-09 20:30:42] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2023-03-09 20:30:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-09 20:30:42] [INFO ] After 914ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 241 ms.
[2023-03-09 20:30:42] [INFO ] After 1360ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Unable to solve all queries for examination QuasiLiveness. Remains :18 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 18 properties from file /home/mcc/execution/QuasiLiveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 501556 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DES (PT), instance 10b
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: 320 places, 271 transitions, 827 arcs.
(potential((tk(P40)>=1) & (tk(P18)>=1) & (tk(P7)>=1) & (tk(P29)>=1)))
(potential((tk(P142)>=1) & (tk(P140)>=1)))
(potential((tk(P146)>=1) & (tk(P144)>=1)))
(potential((tk(P164)>=1) & (tk(P162)>=1)))
(potential((tk(P176)>=1) & (tk(P174)>=1)))
(potential((tk(P186)>=1) & (tk(P184)>=1)))
(potential((tk(P214)>=1) & (tk(P210)>=1) & (tk(P206)>=1) & (tk(P202)>=1) & (tk(P200)>=1) & (tk(P204)>=1) & (tk(P208)>=1) & (tk(P212)>=1)))
(potential((tk(P271)>=1) & (tk(P267)>=1) & (tk(P263)>=1) & (tk(P259)>=1) & (tk(P257)>=1) & (tk(P261)>=1) & (tk(P265)>=1) & (tk(P269)>=1)))
(potential((tk(P275)>=1) & (tk(P273)>=1)))
(potential((tk(P295)>=1) & (tk(P293)>=1)))
(potential((tk(P299)>=1) & (tk(P297)>=1)))
(potential((tk(P320)>=1) & (tk(P318)>=1)))
(potential((tk(P1)>=1)))
(potential((tk(P50)>=1)))
(potential((tk(P168)>=1)))
(potential((tk(P316)>=1)))
(potential((tk(P315)>=1)))
(potential((tk(P314)>=1)))
(potential((tk(P169)>=1)))
(potential((tk(P177)>=1)))
(potential((tk(P312)>=1)))
(potential((tk(P311)>=1)))
(potential((tk(P310)>=1)))
(potential((tk(P307)>=1)))
(potential((tk(P310)>=1)))
(potential((tk(P304)>=1)))
(potential((tk(P310)>=1)))
(potential((tk(P301)>=1)))
(potential((tk(P178)>=1)))
(potential((tk(P291)>=1)))
(potential((tk(P290)>=1)))
(potential((tk(P289)>=1)))
(potential((tk(P287)>=1)))
(potential((tk(P286)>=1)))
(potential((tk(P289)>=1)))
(potential((tk(P284)>=1)))
(potential((tk(P283)>=1)))
(potential((tk(P289)>=1)))
(potential((tk(P280)>=1)))
(potential((tk(P179)>=1)))
(potential((tk(P187)>=1)))
(potential((tk(P277)>=1)))
(potential((tk(P188)>=1)))
(potential((tk(P246)>=1)))
(potential((tk(P249)>=1)))
(potential((tk(P248)>=1)))
(potential((tk(P250)>=1)))
(potential((tk(P251)>=1)))
(potential((tk(P252)>=1)))
(potential((tk(P253)>=1)))
(potential((tk(P254)>=1)))
(potential((tk(P255)>=1)))
(potential((tk(P247)>=1)))
(potential((tk(P189)>=1)))
(potential((tk(P215)>=1)))
(potential((tk(P244)>=1)))
(potential((tk(P216)>=1)))
(potential((tk(P241)>=1)))
(potential((tk(P217)>=1)))
(potential((tk(P238)>=1)))
(potential((tk(P218)>=1)))
(potential((tk(P235)>=1)))
(potential((tk(P219)>=1)))
(potential((tk(P232)>=1)))
(potential((tk(P220)>=1)))
(potential((tk(P229)>=1)))
(potential((tk(P221)>=1)))
(potential((tk(P226)>=1)))
(potential((tk(P223)>=1)))
(potential((tk(P190)>=1)))
(potential((tk(P193)>=1)))
(potential((tk(P194)>=1)))
(potential((tk(P195)>=1)))
(potential((tk(P196)>=1)))
(potential((tk(P197)>=1)))
(potential((tk(P198)>=1)))
(potential((tk(P191)>=1)))
(potential((tk(P180)>=1)))
(potential((tk(P181)>=1)))
(potential((tk(P170)>=1)))
(potential((tk(P171)>=1)))
(potential((tk(P51)>=1)))
(potential((tk(P109)>=1)))
(potential((tk(P166)>=1)))
(potential((tk(P110)>=1)))
(potential((tk(P114)>=1)))
(potential((tk(P147)>=1)))
(potential((tk(P160)>=1)))
(potential((tk(P159)>=1)))
(potential((tk(P158)>=1)))
(potential((tk(P156)>=1)))
(potential((tk(P158)>=1)))
(potential((tk(P154)>=1)))
(potential((tk(P158)>=1)))
(potential((tk(P152)>=1)))
(potential((tk(P158)>=1)))
(potential((tk(P150)>=1)))
(potential((tk(P158)>=1)))
(potential((tk(P148)>=1)))
(potential((tk(P115)>=1)))
(potential((tk(P128)>=1)))
(potential((tk(P138)>=1)))
(potential((tk(P136)>=1)))
(potential((tk(P138)>=1)))
(potential((tk(P135)>=1)))
(potential((tk(P134)>=1)))
(potential((tk(P135)>=1)))
(potential((tk(P131)>=1)))
(potential((tk(P130)>=1)))
(potential((tk(P129)>=1)))
(potential((tk(P127)>=1)))
(potential((tk(P125)>=1)))
(potential((tk(P123)>=1)))
(potential((tk(P127)>=1)))
(potential((tk(P122)>=1)))
(potential((tk(P121)>=1)))
(potential((tk(P122)>=1)))
(potential((tk(P117)>=1)))
(potential((tk(P112)>=1)))
(potential((tk(P52)>=1)))
(potential((tk(P104)>=1)))
(potential((tk(P108)>=1)))
(potential((tk(P106)>=1)))
(potential((tk(P105)>=1)))
(potential((tk(P53)>=1)))
(potential((tk(P103)>=1)))
(potential((tk(P101)>=1)))
(potential((tk(P103)>=1)))
(potential((tk(P99)>=1)))
(potential((tk(P103)>=1)))
(potential((tk(P97)>=1)))
(potential((tk(P54)>=1)))
(potential((tk(P95)>=1)))
(potential((tk(P93)>=1)))
(potential((tk(P95)>=1)))
(potential((tk(P91)>=1)))
(potential((tk(P95)>=1)))
(potential((tk(P89)>=1)))
(potential((tk(P55)>=1)))
(potential((tk(P87)>=1)))
(potential((tk(P85)>=1)))
(potential((tk(P84)>=1)))
(potential((tk(P85)>=1)))
(potential((tk(P83)>=1)))
(potential((tk(P81)>=1)))
(potential((tk(P83)>=1)))
(potential((tk(P79)>=1)))
(potential((tk(P85)>=1)))
(potential((tk(P78)>=1)))
(potential((tk(P76)>=1)))
(potential((tk(P78)>=1)))
(potential((tk(P74)>=1)))
(potential((tk(P78)>=1)))
(potential((tk(P72)>=1)))
(potential((tk(P56)>=1)))
(potential((tk(P70)>=1)))
(potential((tk(P68)>=1)))
(potential((tk(P70)>=1)))
(potential((tk(P66)>=1)))
(potential((tk(P70)>=1)))
(potential((tk(P65)>=1)))
(potential((tk(P63)>=1)))
(potential((tk(P61)>=1)))
(potential((tk(P63)>=1)))
(potential((tk(P59)>=1)))
(potential((tk(P63)>=1)))
(potential((tk(P58)>=1)))
(potential((tk(P2)>=1)))
(potential((tk(P4)>=1)))
(potential((tk(P5)>=1)))
(potential((tk(P8)>=1) & (tk(P172)>=1)))
(potential((tk(P9)>=1) & (tk(P172)>=1)))
(potential((tk(P10)>=1) & (tk(P172)>=1)))
(potential((tk(P11)>=1) & (tk(P172)>=1)))
(potential((tk(P12)>=1) & (tk(P172)>=1)))
(potential((tk(P13)>=1) & (tk(P172)>=1)))
(potential((tk(P14)>=1) & (tk(P172)>=1)))
(potential((tk(P15)>=1) & (tk(P172)>=1)))
(potential((tk(P16)>=1) & (tk(P172)>=1)))
(potential((tk(P6)>=1) & (tk(P172)>=1)))
(potential((tk(P19)>=1) & (tk(P313)>=1)))
(potential((tk(P20)>=1) & (tk(P313)>=1)))
(potential((tk(P21)>=1) & (tk(P313)>=1)))
(potential((tk(P22)>=1) & (tk(P313)>=1)))
(potential((tk(P23)>=1) & (tk(P313)>=1)))
(potential((tk(P24)>=1) & (tk(P313)>=1)))
(potential((tk(P25)>=1) & (tk(P313)>=1)))
(potential((tk(P26)>=1) & (tk(P313)>=1)))
(potential((tk(P27)>=1) & (tk(P313)>=1)))
(potential((tk(P17)>=1) & (tk(P313)>=1)))
(potential((tk(P41)>=1) & (tk(P71)>=1)))
(potential((tk(P42)>=1) & (tk(P71)>=1)))
(potential((tk(P43)>=1) & (tk(P71)>=1)))
(potential((tk(P44)>=1) & (tk(P71)>=1)))
(potential((tk(P45)>=1) & (tk(P71)>=1)))
(potential((tk(P46)>=1) & (tk(P71)>=1)))
(potential((tk(P47)>=1) & (tk(P71)>=1)))
(potential((tk(P48)>=1) & (tk(P71)>=1)))
(potential((tk(P49)>=1) & (tk(P71)>=1)))
(potential((tk(P39)>=1) & (tk(P71)>=1)))
(potential((tk(P28)>=1) & (tk(P165)>=1)))
(potential((tk(P38)>=1) & (tk(P165)>=1)))
(potential((tk(P37)>=1) & (tk(P165)>=1)))
(potential((tk(P36)>=1) & (tk(P165)>=1)))
(potential((tk(P35)>=1) & (tk(P165)>=1)))
(potential((tk(P34)>=1) & (tk(P165)>=1)))
(potential((tk(P33)>=1) & (tk(P165)>=1)))
(potential((tk(P32)>=1) & (tk(P165)>=1)))
(potential((tk(P31)>=1) & (tk(P165)>=1)))
(potential((tk(P30)>=1) & (tk(P165)>=1)))
(potential((tk(P73)>=1) & (tk(P163)>=1)))
(potential((tk(P75)>=1) & (tk(P163)>=1)))
(potential((tk(P77)>=1) & (tk(P163)>=1)))
(potential((tk(P80)>=1) & (tk(P163)>=1)))
(potential((tk(P82)>=1) & (tk(P163)>=1)))
(potential((tk(P62)>=1) & (tk(P116)>=1)))
(potential((tk(P60)>=1) & (tk(P116)>=1)))
(potential((tk(P69)>=1) & (tk(P145)>=1)))
(potential((tk(P67)>=1) & (tk(P145)>=1)))
(potential((tk(P94)>=1) & (tk(P279)>=1)))
(potential((tk(P92)>=1) & (tk(P279)>=1)))
(potential((tk(P90)>=1) & (tk(P279)>=1)))
(potential((tk(P113)>=1) & (tk(P272)>=1)))
(potential((tk(P98)>=1) & (tk(P300)>=1)))
(potential((tk(P100)>=1) & (tk(P300)>=1)))
(potential((tk(P102)>=1) & (tk(P300)>=1)))
(potential((tk(P175)>=1) & (tk(P302)>=1)))
(potential((tk(P173)>=1) & (tk(P281)>=1)))
(potential((tk(P309)>=1) & (tk(P319)>=1)))
(potential((tk(P288)>=1) & (tk(P317)>=1)))
(potential((tk(P182)>=1) & (tk(P282)>=1)))
(potential((tk(P276)>=1) & (tk(P292)>=1)))
(potential((tk(P182)>=1) & (tk(P285)>=1)))
(potential((tk(P276)>=1) & (tk(P296)>=1)))
(potential((tk(P183)>=1) & (tk(P192)>=1)))
(potential((tk(P185)>=1) & (tk(P308)>=1)))
(potential((tk(P294)>=1) & (tk(P306)>=1)))
(potential((tk(P298)>=1) & (tk(P306)>=1)))
(potential((tk(P185)>=1) & (tk(P305)>=1)))
(potential((tk(P294)>=1) & (tk(P303)>=1)))
(potential((tk(P298)>=1) & (tk(P303)>=1)))
(potential((tk(P243)>=1) & (tk(P270)>=1)))
(potential((tk(P237)>=1) & (tk(P266)>=1)))
(potential((tk(P231)>=1) & (tk(P262)>=1)))
(potential((tk(P225)>=1) & (tk(P258)>=1)))
(potential((tk(P222)>=1) & (tk(P256)>=1)))
(potential((tk(P228)>=1) & (tk(P260)>=1)))
(potential((tk(P234)>=1) & (tk(P264)>=1)))
(potential((tk(P240)>=1) & (tk(P268)>=1)))
(potential((tk(P211)>=1) & (tk(P242)>=1)))
(potential((tk(P207)>=1) & (tk(P236)>=1)))
(potential((tk(P203)>=1) & (tk(P230)>=1)))
(potential((tk(P199)>=1) & (tk(P224)>=1)))
(potential((tk(P201)>=1) & (tk(P227)>=1)))
(potential((tk(P205)>=1) & (tk(P233)>=1)))
(potential((tk(P209)>=1) & (tk(P239)>=1)))
(potential((tk(P213)>=1) & (tk(P245)>=1)))
(potential((tk(P274)>=1) & (tk(P278)>=1)))
(potential((tk(P111)>=1) & (tk(P137)>=1)))
(potential((tk(P111)>=1) & (tk(P141)>=1)))
(potential((tk(P126)>=1) & (tk(P167)>=1)))
(potential((tk(P118)>=1) & (tk(P139)>=1)))
(potential((tk(P143)>=1) & (tk(P149)>=1)))
(potential((tk(P143)>=1) & (tk(P151)>=1)))
(potential((tk(P143)>=1) & (tk(P153)>=1)))
(potential((tk(P143)>=1) & (tk(P155)>=1)))
(potential((tk(P143)>=1) & (tk(P157)>=1)))
(potential((tk(P124)>=1) & (tk(P161)>=1)))
(potential((tk(P133)>=1)))
(potential((tk(P120)>=1)))
(potential((tk(P96)>=1) & (tk(P86)>=1) & (tk(P57)>=1) & (tk(P64)>=1) & (tk(P88)>=1) & (tk(P107)>=1)))
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 10122980 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16125376 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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="DES-PT-10b"
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 DES-PT-10b, 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 r121-tall-167814499400262"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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