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-167814499400277.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-30a, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-167814499400277
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.2K Feb 26 15:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 15:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 9.2K Feb 26 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:44 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 70K 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 1678393455561

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-30a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 20:24:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-09 20:24:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 20:24:17] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2023-03-09 20:24:17] [INFO ] Transformed 234 places.
[2023-03-09 20:24:17] [INFO ] Transformed 191 transitions.
[2023-03-09 20:24:17] [INFO ] Found NUPN structural information;
[2023-03-09 20:24:17] [INFO ] Parsed PT model containing 234 places and 191 transitions and 926 arcs in 116 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 234/234 places, 191/191 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 234 transition count 177
Applied a total of 14 rules in 15 ms. Remains 234 /234 variables (removed 0) and now considering 177/191 (removed 14) transitions.
// Phase 1: matrix 177 rows 234 cols
[2023-03-09 20:24:17] [INFO ] Computed 59 place invariants in 27 ms
[2023-03-09 20:24:17] [INFO ] Implicit Places using invariants in 441 ms returned [131]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 467 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 233/234 places, 177/191 transitions.
Applied a total of 0 rules in 7 ms. Remains 233 /233 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 491 ms. Remains : 233/234 places, 177/191 transitions.
Discarding 9 transitions out of 177. Remains 168
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 225 resets, run finished after 591 ms. (steps per millisecond=16 ) properties (out of 167) seen :64
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 103) seen :0
Running SMT prover for 103 properties.
// Phase 1: matrix 177 rows 233 cols
[2023-03-09 20:24:18] [INFO ] Computed 58 place invariants in 14 ms
[2023-03-09 20:24:19] [INFO ] [Real]Absence check using 32 positive place invariants in 17 ms returned sat
[2023-03-09 20:24:19] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 23 ms returned sat
[2023-03-09 20:24:19] [INFO ] After 1070ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:103
[2023-03-09 20:24:20] [INFO ] [Nat]Absence check using 32 positive place invariants in 21 ms returned sat
[2023-03-09 20:24:20] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 26 ms returned sat
[2023-03-09 20:24:31] [INFO ] After 9769ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :103
[2023-03-09 20:24:33] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 4 ms to minimize.
[2023-03-09 20:24:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-03-09 20:24:33] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2023-03-09 20:24:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-09 20:24:34] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2023-03-09 20:24:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-03-09 20:24:38] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2023-03-09 20:24:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-09 20:24:39] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2023-03-09 20:24:39] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 0 ms to minimize.
[2023-03-09 20:24:39] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 0 ms to minimize.
[2023-03-09 20:24:39] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2023-03-09 20:24:39] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2023-03-09 20:24:39] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2023-03-09 20:24:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 694 ms
[2023-03-09 20:24:44] [INFO ] After 23072ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :103
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-09 20:24:44] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :103
Parikh walk visited 96 properties in 30804 ms.
Support contains 11 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 177/177 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 233 transition count 175
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 232 transition count 174
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 232 transition count 174
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 232 transition count 174
Applied a total of 8 rules in 53 ms. Remains 232 /233 variables (removed 1) and now considering 174/177 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 232/233 places, 174/177 transitions.
Incomplete random walk after 1000000 steps, including 13495 resets, run finished after 10198 ms. (steps per millisecond=98 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2251 resets, run finished after 2765 ms. (steps per millisecond=361 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2300 resets, run finished after 2722 ms. (steps per millisecond=367 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 7285 resets, run finished after 3584 ms. (steps per millisecond=279 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7293 resets, run finished after 3281 ms. (steps per millisecond=304 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7270 resets, run finished after 3302 ms. (steps per millisecond=302 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2424 resets, run finished after 2756 ms. (steps per millisecond=362 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2378 resets, run finished after 2785 ms. (steps per millisecond=359 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 30441860 steps, run timeout after 93001 ms. (steps per millisecond=327 ) properties seen :{}
Probabilistic random walk after 30441860 steps, saw 3632178 distinct states, run finished after 93005 ms. (steps per millisecond=327 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 174 rows 232 cols
[2023-03-09 20:27:20] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-09 20:27:20] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-09 20:27:20] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 20:27:20] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-09 20:27:20] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:27:20] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 24 ms returned sat
[2023-03-09 20:27:20] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-09 20:27:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:27:20] [INFO ] After 151ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-09 20:27:20] [INFO ] After 339ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 129 ms.
[2023-03-09 20:27:21] [INFO ] After 816ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 15265 ms.
Support contains 11 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 9 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 232/232 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 9 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2023-03-09 20:27:36] [INFO ] Invariant cache hit.
[2023-03-09 20:27:36] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-09 20:27:36] [INFO ] Invariant cache hit.
[2023-03-09 20:27:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:27:36] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2023-03-09 20:27:36] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-09 20:27:36] [INFO ] Invariant cache hit.
[2023-03-09 20:27:36] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 481 ms. Remains : 232/232 places, 174/174 transitions.
Incomplete random walk after 100000 steps, including 1333 resets, run finished after 1616 ms. (steps per millisecond=61 ) properties (out of 11) seen :4
Running SMT prover for 7 properties.
[2023-03-09 20:27:38] [INFO ] Invariant cache hit.
[2023-03-09 20:27:38] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:27:38] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-09 20:27:38] [INFO ] After 83ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7
[2023-03-09 20:27:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:27:38] [INFO ] After 11ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :7
[2023-03-09 20:27:38] [INFO ] After 118ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-09 20:27:38] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :7
Incomplete random walk after 1000000 steps, including 13503 resets, run finished after 15586 ms. (steps per millisecond=64 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2307 resets, run finished after 3010 ms. (steps per millisecond=332 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2275 resets, run finished after 2985 ms. (steps per millisecond=335 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 7272 resets, run finished after 4210 ms. (steps per millisecond=237 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 7303 resets, run finished after 4204 ms. (steps per millisecond=237 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7266 resets, run finished after 4278 ms. (steps per millisecond=233 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2395 resets, run finished after 3153 ms. (steps per millisecond=317 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2376 resets, run finished after 3168 ms. (steps per millisecond=315 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 37574624 steps, run timeout after 120001 ms. (steps per millisecond=313 ) properties seen :{}
Probabilistic random walk after 37574624 steps, saw 4449849 distinct states, run finished after 120001 ms. (steps per millisecond=313 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-09 20:30:19] [INFO ] Invariant cache hit.
[2023-03-09 20:30:19] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:30:19] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-09 20:30:19] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-09 20:30:19] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:19] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 56 ms returned sat
[2023-03-09 20:30:19] [INFO ] After 237ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-09 20:30:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:30:20] [INFO ] After 197ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-09 20:30:20] [INFO ] After 375ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 152 ms.
[2023-03-09 20:30:20] [INFO ] After 997ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 9426 ms.
Support contains 11 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 9 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 232/232 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 7 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2023-03-09 20:30:29] [INFO ] Invariant cache hit.
[2023-03-09 20:30:29] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-09 20:30:29] [INFO ] Invariant cache hit.
[2023-03-09 20:30:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:30:30] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2023-03-09 20:30:30] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-09 20:30:30] [INFO ] Invariant cache hit.
[2023-03-09 20:30:30] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 480 ms. Remains : 232/232 places, 174/174 transitions.
Incomplete random walk after 100000 steps, including 1327 resets, run finished after 1234 ms. (steps per millisecond=81 ) properties (out of 11) seen :4
Running SMT prover for 7 properties.
[2023-03-09 20:30:31] [INFO ] Invariant cache hit.
[2023-03-09 20:30:31] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:31] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-09 20:30:31] [INFO ] After 79ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7
[2023-03-09 20:30:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:30:31] [INFO ] After 11ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :7
[2023-03-09 20:30:31] [INFO ] After 108ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-09 20:30:31] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :7
Incomplete random walk after 10000 steps, including 133 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 21 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1876616 steps, run timeout after 3001 ms. (steps per millisecond=625 ) properties seen :{}
Probabilistic random walk after 1876616 steps, saw 261634 distinct states, run finished after 3001 ms. (steps per millisecond=625 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:30:34] [INFO ] Invariant cache hit.
[2023-03-09 20:30:34] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:34] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-09 20:30:34] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:30:34] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:34] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 42 ms returned sat
[2023-03-09 20:30:35] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:30:35] [INFO ] After 17ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:35] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-09 20:30:35] [INFO ] After 262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 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 232 transition count 174
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 231 transition count 173
Applied a total of 2 rules in 22 ms. Remains 231 /232 variables (removed 1) and now considering 173/174 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 231/232 places, 173/174 transitions.
Incomplete random walk after 10000 steps, including 137 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 20 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1895156 steps, run timeout after 3001 ms. (steps per millisecond=631 ) properties seen :{}
Probabilistic random walk after 1895156 steps, saw 264138 distinct states, run finished after 3001 ms. (steps per millisecond=631 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 173 rows 231 cols
[2023-03-09 20:30:38] [INFO ] Computed 60 place invariants in 15 ms
[2023-03-09 20:30:38] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:38] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-09 20:30:38] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:30:38] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:38] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 85 ms returned sat
[2023-03-09 20:30:38] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:30:38] [INFO ] After 16ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:38] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2023-03-09 20:30:38] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2023-03-09 20:30:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 121 ms
[2023-03-09 20:30:38] [INFO ] After 143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-09 20:30:38] [INFO ] After 420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 20 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 231/231 places, 173/173 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 7 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2023-03-09 20:30:38] [INFO ] Invariant cache hit.
[2023-03-09 20:30:38] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-09 20:30:38] [INFO ] Invariant cache hit.
[2023-03-09 20:30:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:30:39] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2023-03-09 20:30:39] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 20:30:39] [INFO ] Invariant cache hit.
[2023-03-09 20:30:39] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 512 ms. Remains : 231/231 places, 173/173 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 231 transition count 173
Applied a total of 1 rules in 14 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 173 rows 231 cols
[2023-03-09 20:30:39] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-09 20:30:39] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:39] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-09 20:30:39] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:30:39] [INFO ] [Nat]Absence check using 36 positive place invariants in 9 ms returned sat
[2023-03-09 20:30:39] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 86 ms returned sat
[2023-03-09 20:30:39] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:39] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2023-03-09 20:30:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-09 20:30:39] [INFO ] After 216ms 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:39] [INFO ] After 367ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 1116 steps, including 15 resets, run visited all 1 properties in 4 ms. (steps per millisecond=279 )
Finished random walk after 29 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=29 )
Incomplete random walk after 10000 steps, including 137 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1872012 steps, run timeout after 3001 ms. (steps per millisecond=623 ) properties seen :{}
Probabilistic random walk after 1872012 steps, saw 260969 distinct states, run finished after 3001 ms. (steps per millisecond=623 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 174 rows 232 cols
[2023-03-09 20:30:42] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-09 20:30:42] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:42] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2023-03-09 20:30:42] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:30:42] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:42] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2023-03-09 20:30:43] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:30:43] [INFO ] After 20ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:43] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2023-03-09 20:30:43] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 5 ms to minimize.
[2023-03-09 20:30:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 136 ms
[2023-03-09 20:30:43] [INFO ] After 166ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-09 20:30:43] [INFO ] After 475ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 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 232 transition count 174
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 231 transition count 173
Applied a total of 2 rules in 28 ms. Remains 231 /232 variables (removed 1) and now considering 173/174 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 231/232 places, 173/174 transitions.
Incomplete random walk after 10000 steps, including 144 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 19 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1891798 steps, run timeout after 3001 ms. (steps per millisecond=630 ) properties seen :{}
Probabilistic random walk after 1891798 steps, saw 263663 distinct states, run finished after 3001 ms. (steps per millisecond=630 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 173 rows 231 cols
[2023-03-09 20:30:46] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-09 20:30:46] [INFO ] [Real]Absence check using 36 positive place invariants in 3 ms returned sat
[2023-03-09 20:30:46] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-09 20:30:46] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:30:46] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:46] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 84 ms returned sat
[2023-03-09 20:30:46] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:30:46] [INFO ] After 12ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:46] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-09 20:30:46] [INFO ] After 311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1444 steps, including 2 resets, run visited all 1 properties in 5 ms. (steps per millisecond=288 )
Parikh walk visited 1 properties in 5 ms.
Incomplete random walk after 10000 steps, including 130 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 19 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1870835 steps, run timeout after 3001 ms. (steps per millisecond=623 ) properties seen :{}
Probabilistic random walk after 1870835 steps, saw 260834 distinct states, run finished after 3001 ms. (steps per millisecond=623 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 174 rows 232 cols
[2023-03-09 20:30:49] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-09 20:30:49] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:49] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-09 20:30:49] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:30:49] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:49] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2023-03-09 20:30:50] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:30:50] [INFO ] After 14ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:50] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-09 20:30:50] [INFO ] After 210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1661 steps, including 3 resets, run visited all 1 properties in 7 ms. (steps per millisecond=237 )
Parikh walk visited 1 properties in 6 ms.
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 130 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 26 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1891151 steps, run timeout after 3001 ms. (steps per millisecond=630 ) properties seen :{}
Probabilistic random walk after 1891151 steps, saw 263550 distinct states, run finished after 3001 ms. (steps per millisecond=630 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:30:53] [INFO ] Invariant cache hit.
[2023-03-09 20:30:53] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:53] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-09 20:30:53] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:30:53] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:53] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 43 ms returned sat
[2023-03-09 20:30:53] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:30:53] [INFO ] After 20ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:53] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-09 20:30:53] [INFO ] After 262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1561 steps, including 2 resets, run visited all 1 properties in 5 ms. (steps per millisecond=312 )
Parikh walk visited 1 properties in 4 ms.
Incomplete random walk after 10000 steps, including 129 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 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1893647 steps, run timeout after 3001 ms. (steps per millisecond=631 ) properties seen :{}
Probabilistic random walk after 1893647 steps, saw 263925 distinct states, run finished after 3001 ms. (steps per millisecond=631 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:30:56] [INFO ] Invariant cache hit.
[2023-03-09 20:30:56] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:56] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-09 20:30:56] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:30:56] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:30:56] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 42 ms returned sat
[2023-03-09 20:30:56] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:30:56] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:30:56] [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 8 ms.
[2023-03-09 20:30:56] [INFO ] After 304ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 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 232 transition count 174
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 231 transition count 173
Applied a total of 2 rules in 17 ms. Remains 231 /232 variables (removed 1) and now considering 173/174 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 231/232 places, 173/174 transitions.
Incomplete random walk after 10000 steps, including 133 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 23 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1904904 steps, run timeout after 3001 ms. (steps per millisecond=634 ) properties seen :{}
Probabilistic random walk after 1904904 steps, saw 265581 distinct states, run finished after 3001 ms. (steps per millisecond=634 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 173 rows 231 cols
[2023-03-09 20:30:59] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-09 20:30:59] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:30:59] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-09 20:31:00] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:31:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:31:00] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 88 ms returned sat
[2023-03-09 20:31:03] [INFO ] After 3607ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:31:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:31:03] [INFO ] After 87ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:31:03] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 0 ms to minimize.
[2023-03-09 20:31:03] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2023-03-09 20:31:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 289 ms
[2023-03-09 20:31:04] [INFO ] After 390ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 20:31:04] [INFO ] After 4150ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 5 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 231/231 places, 173/173 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 5 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2023-03-09 20:31:04] [INFO ] Invariant cache hit.
[2023-03-09 20:31:04] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-09 20:31:04] [INFO ] Invariant cache hit.
[2023-03-09 20:31:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:31:04] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2023-03-09 20:31:04] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:31:04] [INFO ] Invariant cache hit.
[2023-03-09 20:31:04] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 480 ms. Remains : 231/231 places, 173/173 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 231 transition count 173
Applied a total of 1 rules in 9 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 173 rows 231 cols
[2023-03-09 20:31:04] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-09 20:31:04] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:31:04] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-09 20:31:04] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:31:04] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:31:04] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 88 ms returned sat
[2023-03-09 20:31:10] [INFO ] After 5730ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:31:10] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2023-03-09 20:31:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2023-03-09 20:31:10] [INFO ] After 5808ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-09 20:31:10] [INFO ] After 5970ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 128 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 22 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1882481 steps, run timeout after 3001 ms. (steps per millisecond=627 ) properties seen :{}
Probabilistic random walk after 1882481 steps, saw 262377 distinct states, run finished after 3001 ms. (steps per millisecond=627 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 174 rows 232 cols
[2023-03-09 20:31:13] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-09 20:31:13] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:31:13] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 20:31:13] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:31:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 20:31:13] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 24 ms returned sat
[2023-03-09 20:31:13] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:31:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:31:13] [INFO ] After 16ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:31:13] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-09 20:31:13] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1309 steps, including 5 resets, run visited all 1 properties in 6 ms. (steps per millisecond=218 )
Parikh walk visited 1 properties in 5 ms.
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 134 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 26 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1889117 steps, run timeout after 3001 ms. (steps per millisecond=629 ) properties seen :{}
Probabilistic random walk after 1889117 steps, saw 263185 distinct states, run finished after 3001 ms. (steps per millisecond=629 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:31:17] [INFO ] Invariant cache hit.
[2023-03-09 20:31:17] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 20:31:17] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-09 20:31:17] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:31:17] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:31:17] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 43 ms returned sat
[2023-03-09 20:31:17] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:31:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:31:17] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:31:17] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 20:31:17] [INFO ] After 256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 173
Applied a total of 1 rules in 12 ms. Remains 231 /232 variables (removed 1) and now considering 173/174 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 231/232 places, 173/174 transitions.
Incomplete random walk after 10000 steps, including 137 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 24 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1888387 steps, run timeout after 3001 ms. (steps per millisecond=629 ) properties seen :{}
Probabilistic random walk after 1888387 steps, saw 263105 distinct states, run finished after 3001 ms. (steps per millisecond=629 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 173 rows 231 cols
[2023-03-09 20:31:20] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-09 20:31:20] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:31:20] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-09 20:31:20] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:31:20] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:31:20] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 89 ms returned sat
[2023-03-09 20:31:20] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:31:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:31:20] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:31:20] [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 14 ms.
[2023-03-09 20:31:20] [INFO ] After 323ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 4 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 231/231 places, 173/173 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 4 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2023-03-09 20:31:20] [INFO ] Invariant cache hit.
[2023-03-09 20:31:20] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-09 20:31:20] [INFO ] Invariant cache hit.
[2023-03-09 20:31:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:31:21] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2023-03-09 20:31:21] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 20:31:21] [INFO ] Invariant cache hit.
[2023-03-09 20:31:21] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 445 ms. Remains : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 5 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-09 20:31:21] [INFO ] Invariant cache hit.
[2023-03-09 20:31:21] [INFO ] [Real]Absence check using 36 positive place invariants in 3 ms returned sat
[2023-03-09 20:31:21] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 20:31:21] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:31:21] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:31:21] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 94 ms returned sat
[2023-03-09 20:31:22] [INFO ] After 629ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:31:22] [INFO ] After 651ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 20:31:22] [INFO ] After 807ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Applied a total of 0 rules in 13 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 174 rows 232 cols
[2023-03-09 20:31:22] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-09 20:31:22] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:31:22] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2023-03-09 20:31:22] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-09 20:31:22] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:31:22] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 28 ms returned sat
[2023-03-09 20:31:22] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-09 20:31:22] [INFO ] After 418ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 149 ms.
[2023-03-09 20:31:22] [INFO ] After 700ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Unable to solve all queries for examination QuasiLiveness. Remains :7 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 7 properties from file /home/mcc/execution/QuasiLiveness.xml in 0 ms.
Working with output stream class java.io.PrintStream
Total runtime 425720 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DES (PT), instance 30a
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: 234 places, 191 transitions, 926 arcs.
(potential((tk(P141)>=1) & (tk(P139)>=1)))
(potential((tk(P207)>=1) & (tk(P203)>=1) & (tk(P199)>=1) & (tk(P195)>=1) & (tk(P193)>=1) & (tk(P197)>=1) & (tk(P201)>=1) & (tk(P205)>=1)))
(potential((tk(P211)>=1) & (tk(P209)>=1)))
(potential((tk(P220)>=1) & (tk(P218)>=1)))
(potential((tk(P224)>=1) & (tk(P222)>=1)))
(potential((tk(P234)>=1) & (tk(P232)>=1)))
(potential((tk(P1)>=1)))
(potential((tk(P145)>=1) & (tk(P143)>=1)))
(potential((tk(P126)>=1)))
(potential((tk(P124)>=1)))
(potential((tk(P122)>=1)))
(potential((tk(P153)>=1) & (tk(P155)>=1) & (tk(P3)>=1)))
(potential((tk(P153)>=1) & (tk(P155)>=1) & (tk(P4)>=1)))
(potential((tk(P153)>=1) & (tk(P155)>=1) & (tk(P5)>=1)))
(potential((tk(P153)>=1) & (tk(P155)>=1) & (tk(P6)>=1)))
(potential((tk(P153)>=1) & (tk(P155)>=1) & (tk(P7)>=1)))
(potential((tk(P153)>=1) & (tk(P155)>=1) & (tk(P8)>=1)))
(potential((tk(P153)>=1) & (tk(P155)>=1) & (tk(P9)>=1)))
(potential((tk(P153)>=1) & (tk(P155)>=1) & (tk(P10)>=1)))
(potential((tk(P153)>=1) & (tk(P155)>=1) & (tk(P11)>=1)))
(potential((tk(P153)>=1) & (tk(P155)>=1) & (tk(P12)>=1)))
(potential((tk(P153)>=1) & (tk(P155)>=1) & (tk(P13)>=1)))
(potential((tk(P153)>=1) & (tk(P155)>=1) & (tk(P14)>=1)))
(potential((tk(P153)>=1) & (tk(P155)>=1) & (tk(P15)>=1)))
(potential((tk(P153)>=1) & (tk(P155)>=1) & (tk(P16)>=1)))
(potential((tk(P153)>=1) & (tk(P155)>=1) & (tk(P17)>=1)))
(potential((tk(P153)>=1) & (tk(P155)>=1) & (tk(P18)>=1)))
(potential((tk(P153)>=1) & (tk(P155)>=1) & (tk(P19)>=1)))
(potential((tk(P153)>=1) & (tk(P155)>=1) & (tk(P20)>=1)))
(potential((tk(P153)>=1) & (tk(P155)>=1) & (tk(P21)>=1)))
(potential((tk(P153)>=1) & (tk(P155)>=1) & (tk(P22)>=1)))
(potential((tk(P153)>=1) & (tk(P155)>=1) & (tk(P23)>=1)))
(potential((tk(P153)>=1) & (tk(P155)>=1) & (tk(P24)>=1)))
(potential((tk(P153)>=1) & (tk(P155)>=1) & (tk(P25)>=1)))
(potential((tk(P153)>=1) & (tk(P155)>=1) & (tk(P26)>=1)))
(potential((tk(P153)>=1) & (tk(P155)>=1) & (tk(P27)>=1)))
(potential((tk(P153)>=1) & (tk(P155)>=1) & (tk(P28)>=1)))
(potential((tk(P153)>=1) & (tk(P155)>=1) & (tk(P29)>=1)))
(potential((tk(P153)>=1) & (tk(P155)>=1) & (tk(P30)>=1)))
(potential((tk(P153)>=1) & (tk(P155)>=1) & (tk(P2)>=1)))
(potential((tk(P32)>=1) & (tk(P230)>=1)))
(potential((tk(P33)>=1) & (tk(P230)>=1)))
(potential((tk(P34)>=1) & (tk(P230)>=1)))
(potential((tk(P35)>=1) & (tk(P230)>=1)))
(potential((tk(P36)>=1) & (tk(P230)>=1)))
(potential((tk(P37)>=1) & (tk(P230)>=1)))
(potential((tk(P38)>=1) & (tk(P230)>=1)))
(potential((tk(P39)>=1) & (tk(P230)>=1)))
(potential((tk(P40)>=1) & (tk(P230)>=1)))
(potential((tk(P41)>=1) & (tk(P230)>=1)))
(potential((tk(P42)>=1) & (tk(P230)>=1)))
(potential((tk(P43)>=1) & (tk(P230)>=1)))
(potential((tk(P44)>=1) & (tk(P230)>=1)))
(potential((tk(P45)>=1) & (tk(P230)>=1)))
(potential((tk(P46)>=1) & (tk(P230)>=1)))
(potential((tk(P47)>=1) & (tk(P230)>=1)))
(potential((tk(P48)>=1) & (tk(P230)>=1)))
(potential((tk(P49)>=1) & (tk(P230)>=1)))
(potential((tk(P50)>=1) & (tk(P230)>=1)))
(potential((tk(P51)>=1) & (tk(P230)>=1)))
(potential((tk(P52)>=1) & (tk(P230)>=1)))
(potential((tk(P53)>=1) & (tk(P230)>=1)))
(potential((tk(P54)>=1) & (tk(P230)>=1)))
(potential((tk(P55)>=1) & (tk(P230)>=1)))
(potential((tk(P56)>=1) & (tk(P230)>=1)))
(potential((tk(P57)>=1) & (tk(P230)>=1)))
(potential((tk(P58)>=1) & (tk(P230)>=1)))
(potential((tk(P59)>=1) & (tk(P230)>=1)))
(potential((tk(P60)>=1) & (tk(P230)>=1)))
(potential((tk(P31)>=1) & (tk(P230)>=1)))
(potential((tk(P92)>=1) & (tk(P125)>=1)))
(potential((tk(P93)>=1) & (tk(P125)>=1)))
(potential((tk(P94)>=1) & (tk(P125)>=1)))
(potential((tk(P95)>=1) & (tk(P125)>=1)))
(potential((tk(P96)>=1) & (tk(P125)>=1)))
(potential((tk(P97)>=1) & (tk(P125)>=1)))
(potential((tk(P98)>=1) & (tk(P125)>=1)))
(potential((tk(P99)>=1) & (tk(P125)>=1)))
(potential((tk(P100)>=1) & (tk(P125)>=1)))
(potential((tk(P101)>=1) & (tk(P125)>=1)))
(potential((tk(P102)>=1) & (tk(P125)>=1)))
(potential((tk(P103)>=1) & (tk(P125)>=1)))
(potential((tk(P104)>=1) & (tk(P125)>=1)))
(potential((tk(P105)>=1) & (tk(P125)>=1)))
(potential((tk(P106)>=1) & (tk(P125)>=1)))
(potential((tk(P107)>=1) & (tk(P125)>=1)))
(potential((tk(P108)>=1) & (tk(P125)>=1)))
(potential((tk(P109)>=1) & (tk(P125)>=1)))
(potential((tk(P110)>=1) & (tk(P125)>=1)))
(potential((tk(P111)>=1) & (tk(P125)>=1)))
(potential((tk(P112)>=1) & (tk(P125)>=1)))
(potential((tk(P113)>=1) & (tk(P125)>=1)))
(potential((tk(P114)>=1) & (tk(P125)>=1)))
(potential((tk(P115)>=1) & (tk(P125)>=1)))
(potential((tk(P116)>=1) & (tk(P125)>=1)))
(potential((tk(P117)>=1) & (tk(P125)>=1)))
(potential((tk(P118)>=1) & (tk(P125)>=1)))
(potential((tk(P119)>=1) & (tk(P125)>=1)))
(potential((tk(P120)>=1) & (tk(P125)>=1)))
(potential((tk(P91)>=1) & (tk(P125)>=1)))
(potential((tk(P61)>=1) & (tk(P150)>=1)))
(potential((tk(P90)>=1) & (tk(P150)>=1)))
(potential((tk(P89)>=1) & (tk(P150)>=1)))
(potential((tk(P88)>=1) & (tk(P150)>=1)))
(potential((tk(P87)>=1) & (tk(P150)>=1)))
(potential((tk(P86)>=1) & (tk(P150)>=1)))
(potential((tk(P85)>=1) & (tk(P150)>=1)))
(potential((tk(P84)>=1) & (tk(P150)>=1)))
(potential((tk(P83)>=1) & (tk(P150)>=1)))
(potential((tk(P82)>=1) & (tk(P150)>=1)))
(potential((tk(P81)>=1) & (tk(P150)>=1)))
(potential((tk(P80)>=1) & (tk(P150)>=1)))
(potential((tk(P79)>=1) & (tk(P150)>=1)))
(potential((tk(P78)>=1) & (tk(P150)>=1)))
(potential((tk(P77)>=1) & (tk(P150)>=1)))
(potential((tk(P76)>=1) & (tk(P150)>=1)))
(potential((tk(P75)>=1) & (tk(P150)>=1)))
(potential((tk(P74)>=1) & (tk(P150)>=1)))
(potential((tk(P73)>=1) & (tk(P150)>=1)))
(potential((tk(P72)>=1) & (tk(P150)>=1)))
(potential((tk(P71)>=1) & (tk(P150)>=1)))
(potential((tk(P70)>=1) & (tk(P150)>=1)))
(potential((tk(P69)>=1) & (tk(P150)>=1)))
(potential((tk(P68)>=1) & (tk(P150)>=1)))
(potential((tk(P67)>=1) & (tk(P150)>=1)))
(potential((tk(P66)>=1) & (tk(P150)>=1)))
(potential((tk(P65)>=1) & (tk(P150)>=1)))
(potential((tk(P64)>=1) & (tk(P150)>=1)))
(potential((tk(P63)>=1) & (tk(P150)>=1)))
(potential((tk(P62)>=1) & (tk(P150)>=1)))
(potential((tk(P126)>=1) & (tk(P148)>=1)))
(potential((tk(P126)>=1) & (tk(P148)>=1)))
(potential((tk(P126)>=1) & (tk(P148)>=1)))
(potential((tk(P126)>=1) & (tk(P148)>=1)))
(potential((tk(P126)>=1) & (tk(P148)>=1)))
(potential((tk(P122)>=1) & (tk(P135)>=1)))
(potential((tk(P122)>=1) & (tk(P135)>=1)))
(potential((tk(P124)>=1) & (tk(P144)>=1)))
(potential((tk(P124)>=1) & (tk(P144)>=1)))
(potential((tk(P129)>=1) & (tk(P214)>=1)))
(potential((tk(P129)>=1) & (tk(P214)>=1)))
(potential((tk(P129)>=1) & (tk(P214)>=1)))
(potential((tk(P134)>=1) & (tk(P208)>=1)))
(potential((tk(P131)>=1) & (tk(P225)>=1)))
(potential((tk(P131)>=1) & (tk(P225)>=1)))
(potential((tk(P131)>=1) & (tk(P225)>=1)))
(potential((tk(P154)>=1) & (tk(P226)>=1)))
(potential((tk(P152)>=1) & (tk(P215)>=1)))
(potential((tk(P229)>=1) & (tk(P233)>=1)))
(potential((tk(P216)>=1) & (tk(P231)>=1)))
(potential((tk(P216)>=1) & (tk(P157)>=1) & (tk(P159)>=1)))
(potential((tk(P212)>=1) & (tk(P217)>=1)))
(potential((tk(P216)>=1) & (tk(P157)>=1) & (tk(P159)>=1)))
(potential((tk(P212)>=1) & (tk(P221)>=1)))
(potential((tk(P173)>=1) & (tk(P169)>=1) & (tk(P165)>=1) & (tk(P161)>=1) & (tk(P163)>=1) & (tk(P167)>=1) & (tk(P171)>=1) & (tk(P175)>=1) & (tk(P156)>=1)))
(potential((tk(P158)>=1) & (tk(P228)>=1)))
(potential((tk(P229)>=1) & (tk(P219)>=1)))
(potential((tk(P229)>=1) & (tk(P223)>=1)))
(potential((tk(P158)>=1) & (tk(P227)>=1)))
(potential((tk(P229)>=1) & (tk(P219)>=1)))
(potential((tk(P229)>=1) & (tk(P223)>=1)))
(potential((tk(P190)>=1) & (tk(P206)>=1)))
(potential((tk(P186)>=1) & (tk(P202)>=1)))
(potential((tk(P182)>=1) & (tk(P198)>=1)))
(potential((tk(P178)>=1) & (tk(P194)>=1)))
(potential((tk(P176)>=1) & (tk(P192)>=1)))
(potential((tk(P180)>=1) & (tk(P196)>=1)))
(potential((tk(P184)>=1) & (tk(P200)>=1)))
(potential((tk(P188)>=1) & (tk(P204)>=1)))
(potential((tk(P172)>=1) & (tk(P189)>=1)))
(potential((tk(P168)>=1) & (tk(P185)>=1)))
(potential((tk(P164)>=1) & (tk(P181)>=1)))
(potential((tk(P160)>=1) & (tk(P177)>=1)))
(potential((tk(P162)>=1) & (tk(P179)>=1)))
(potential((tk(P166)>=1) & (tk(P183)>=1)))
(potential((tk(P170)>=1) & (tk(P187)>=1)))
(potential((tk(P174)>=1) & (tk(P191)>=1)))
(potential((tk(P210)>=1) & (tk(P213)>=1)))
(potential((tk(P145)>=1) & (tk(P143)>=1) & (tk(P133)>=1)))
(potential((tk(P133)>=1) & (tk(P140)>=1)))
(potential((tk(P137)>=1) & (tk(P151)>=1)))
(potential((tk(P137)>=1) & (tk(P138)>=1)))
(potential((tk(P149)>=1) & (tk(P147)>=1) & (tk(P142)>=1)))
(potential((tk(P149)>=1) & (tk(P147)>=1) & (tk(P142)>=1)))
(potential((tk(P149)>=1) & (tk(P147)>=1) & (tk(P142)>=1)))
(potential((tk(P149)>=1) & (tk(P147)>=1) & (tk(P142)>=1)))
(potential((tk(P149)>=1) & (tk(P147)>=1) & (tk(P142)>=1)))
(potential((tk(P136)>=1) & (tk(P146)>=1)))
(potential((tk(P145)>=1) & (tk(P143)>=1)))
(potential((tk(P137)>=1)))
(potential((tk(P130)>=1) & (tk(P127)>=1) & (tk(P121)>=1) & (tk(P123)>=1) & (tk(P128)>=1) & (tk(P132)>=1)))
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 13427868 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16125576 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML
Caught signal 15, terminating.

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-30a"
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-30a, 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-167814499400277"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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