About the Execution of Smart+red for DES-PT-40a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1876.644 | 1800000.00 | 2024701.00 | 3444.60 | [undef] | Time out reached |
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-167814499400287.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-40a, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-167814499400287
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.4K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 15:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 12K Feb 26 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 26 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 15:45 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 83K 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 1678393726891
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-40a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 20:28:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-09 20:28:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 20:28:48] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2023-03-09 20:28:48] [INFO ] Transformed 274 places.
[2023-03-09 20:28:48] [INFO ] Transformed 231 transitions.
[2023-03-09 20:28:48] [INFO ] Found NUPN structural information;
[2023-03-09 20:28:48] [INFO ] Parsed PT model containing 274 places and 231 transitions and 1116 arcs in 115 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 274/274 places, 231/231 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 274 transition count 217
Applied a total of 14 rules in 15 ms. Remains 274 /274 variables (removed 0) and now considering 217/231 (removed 14) transitions.
// Phase 1: matrix 217 rows 274 cols
[2023-03-09 20:28:48] [INFO ] Computed 59 place invariants in 33 ms
[2023-03-09 20:28:48] [INFO ] Implicit Places using invariants in 491 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 515 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 273/274 places, 217/231 transitions.
Applied a total of 0 rules in 10 ms. Remains 273 /273 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 541 ms. Remains : 273/274 places, 217/231 transitions.
Discarding 9 transitions out of 217. Remains 208
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 215 resets, run finished after 472 ms. (steps per millisecond=21 ) properties (out of 207) seen :65
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 142) 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 142) 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 142) 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 142) 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 142) 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 142) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) 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 142) seen :0
Running SMT prover for 142 properties.
// Phase 1: matrix 217 rows 273 cols
[2023-03-09 20:28:49] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-09 20:28:50] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-09 20:28:50] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-09 20:28:51] [INFO ] After 1497ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:142
[2023-03-09 20:28:51] [INFO ] [Nat]Absence check using 33 positive place invariants in 17 ms returned sat
[2023-03-09 20:28:52] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 306 ms returned sat
[2023-03-09 20:29:11] [INFO ] After 16578ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :142
[2023-03-09 20:29:12] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 5 ms to minimize.
[2023-03-09 20:29:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-09 20:29:14] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2023-03-09 20:29:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-09 20:29:16] [INFO ] After 21717ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :141
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-09 20:29:16] [INFO ] After 25010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :141
Parikh walk visited 136 properties in 30067 ms.
Support contains 9 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 217/217 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 273 transition count 215
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 272 transition count 214
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 272 transition count 214
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 272 transition count 214
Applied a total of 9 rules in 61 ms. Remains 272 /273 variables (removed 1) and now considering 214/217 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 272/273 places, 214/217 transitions.
Incomplete random walk after 1000000 steps, including 13454 resets, run finished after 14937 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2328 resets, run finished after 2889 ms. (steps per millisecond=346 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2286 resets, run finished after 2812 ms. (steps per millisecond=355 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7282 resets, run finished after 4057 ms. (steps per millisecond=246 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 7284 resets, run finished after 3966 ms. (steps per millisecond=252 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7267 resets, run finished after 3985 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7274 resets, run finished after 3980 ms. (steps per millisecond=251 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 34692010 steps, run timeout after 108001 ms. (steps per millisecond=321 ) properties seen :{}
Probabilistic random walk after 34692010 steps, saw 4107652 distinct states, run finished after 108004 ms. (steps per millisecond=321 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 214 rows 272 cols
[2023-03-09 20:32:11] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-09 20:32:11] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 20:32:11] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 20:32:11] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 20:32:11] [INFO ] [Nat]Absence check using 36 positive place invariants in 8 ms returned sat
[2023-03-09 20:32:11] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 97 ms returned sat
[2023-03-09 20:32:11] [INFO ] After 349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 20:32:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:32:11] [INFO ] After 163ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 20:32:12] [INFO ] After 402ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 166 ms.
[2023-03-09 20:32:12] [INFO ] After 1159ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 3 properties in 16128 ms.
Support contains 4 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 12 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 272/272 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 11 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 20:32:28] [INFO ] Invariant cache hit.
[2023-03-09 20:32:28] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-09 20:32:28] [INFO ] Invariant cache hit.
[2023-03-09 20:32:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:32:28] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2023-03-09 20:32:28] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-09 20:32:28] [INFO ] Invariant cache hit.
[2023-03-09 20:32:29] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 638 ms. Remains : 272/272 places, 214/214 transitions.
Incomplete random walk after 100000 steps, including 1372 resets, run finished after 1013 ms. (steps per millisecond=98 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
[2023-03-09 20:32:30] [INFO ] Invariant cache hit.
[2023-03-09 20:32:30] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:32:30] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 20:32:30] [INFO ] After 90ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-09 20:32:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:32:30] [INFO ] After 11ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :3
[2023-03-09 20:32:30] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 2 ms to minimize.
[2023-03-09 20:32:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-09 20:32:30] [INFO ] After 121ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 20:32:30] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 20:32:30] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:32:30] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 20:32:30] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 20:32:30] [INFO ] After 5ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 20:32:30] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2023-03-09 20:32:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-03-09 20:32:30] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 20:32:30] [INFO ] After 251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Incomplete random walk after 1000000 steps, including 13497 resets, run finished after 10170 ms. (steps per millisecond=98 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 7274 resets, run finished after 2941 ms. (steps per millisecond=340 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7280 resets, run finished after 2925 ms. (steps per millisecond=341 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 7271 resets, run finished after 3084 ms. (steps per millisecond=324 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 22900423 steps, run timeout after 57001 ms. (steps per millisecond=401 ) properties seen :{}
Probabilistic random walk after 22900423 steps, saw 2782323 distinct states, run finished after 57001 ms. (steps per millisecond=401 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-09 20:33:46] [INFO ] Invariant cache hit.
[2023-03-09 20:33:46] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:33:46] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 20:33:47] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 20:33:47] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:33:47] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 20:33:47] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 20:33:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:33:47] [INFO ] After 107ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 20:33:47] [INFO ] After 222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 99 ms.
[2023-03-09 20:33:47] [INFO ] After 645ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 5615 ms.
Support contains 4 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 11 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 272/272 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 12 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 20:33:53] [INFO ] Invariant cache hit.
[2023-03-09 20:33:53] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-09 20:33:53] [INFO ] Invariant cache hit.
[2023-03-09 20:33:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:33:53] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2023-03-09 20:33:53] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-09 20:33:53] [INFO ] Invariant cache hit.
[2023-03-09 20:33:53] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 676 ms. Remains : 272/272 places, 214/214 transitions.
Incomplete random walk after 100000 steps, including 1357 resets, run finished after 973 ms. (steps per millisecond=102 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
[2023-03-09 20:33:54] [INFO ] Invariant cache hit.
[2023-03-09 20:33:54] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:33:55] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 20:33:55] [INFO ] After 92ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-09 20:33:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:33:55] [INFO ] After 8ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :3
[2023-03-09 20:33:55] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2023-03-09 20:33:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-09 20:33:55] [INFO ] After 108ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 20:33:55] [INFO ] After 267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 20:33:55] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:33:55] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 20:33:55] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 20:33:55] [INFO ] After 6ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 20:33:55] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2023-03-09 20:33:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-09 20:33:55] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 20:33:55] [INFO ] After 263ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Incomplete random walk after 10000 steps, including 138 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 24 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1741232 steps, run timeout after 3001 ms. (steps per millisecond=580 ) properties seen :{}
Probabilistic random walk after 1741232 steps, saw 243085 distinct states, run finished after 3001 ms. (steps per millisecond=580 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:33:58] [INFO ] Invariant cache hit.
[2023-03-09 20:33:58] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:33:58] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 20:33:58] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:33:58] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:33:58] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 20:33:58] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:33:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:33:58] [INFO ] After 17ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:33:58] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 20:33:58] [INFO ] After 235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 271 transition count 213
Applied a total of 1 rules in 18 ms. Remains 271 /272 variables (removed 1) and now considering 213/214 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 271/272 places, 213/214 transitions.
Incomplete random walk after 10000 steps, including 139 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 20 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1769573 steps, run timeout after 3001 ms. (steps per millisecond=589 ) properties seen :{}
Probabilistic random walk after 1769573 steps, saw 247026 distinct states, run finished after 3001 ms. (steps per millisecond=589 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2023-03-09 20:34:02] [INFO ] Computed 60 place invariants in 14 ms
[2023-03-09 20:34:02] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:34:02] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 20:34:02] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:34:02] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:34:02] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 103 ms returned sat
[2023-03-09 20:34:02] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:34:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:34:02] [INFO ] After 14ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:34:02] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-09 20:34:02] [INFO ] After 324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 8 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 8 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-09 20:34:02] [INFO ] Invariant cache hit.
[2023-03-09 20:34:02] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-09 20:34:02] [INFO ] Invariant cache hit.
[2023-03-09 20:34:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:34:03] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2023-03-09 20:34:03] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-09 20:34:03] [INFO ] Invariant cache hit.
[2023-03-09 20:34:03] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 616 ms. Remains : 271/271 places, 213/213 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 271 transition count 213
Applied a total of 1 rules in 15 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2023-03-09 20:34:03] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-09 20:34:03] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:34:03] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 20:34:03] [INFO ] After 73ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 20:34:03] [INFO ] After 89ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 20:34:03] [INFO ] After 166ms SMT Verify possible using all constraints in real 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 134 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 19 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1692557 steps, run timeout after 3001 ms. (steps per millisecond=563 ) properties seen :{}
Probabilistic random walk after 1692557 steps, saw 237279 distinct states, run finished after 3001 ms. (steps per millisecond=563 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 214 rows 272 cols
[2023-03-09 20:34:06] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-09 20:34:06] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:34:06] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2023-03-09 20:34:06] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:34:06] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:34:06] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 77 ms returned sat
[2023-03-09 20:34:06] [INFO ] After 280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:34:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:34:06] [INFO ] After 22ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:34:07] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-09 20:34:07] [INFO ] After 503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 271 transition count 213
Applied a total of 1 rules in 13 ms. Remains 271 /272 variables (removed 1) and now considering 213/214 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 271/272 places, 213/214 transitions.
Incomplete random walk after 10000 steps, including 143 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1694009 steps, run timeout after 3001 ms. (steps per millisecond=564 ) properties seen :{}
Probabilistic random walk after 1694009 steps, saw 237454 distinct states, run finished after 3001 ms. (steps per millisecond=564 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2023-03-09 20:34:10] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-09 20:34:10] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:34:10] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 20:34:10] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:34:10] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:34:10] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 103 ms returned sat
[2023-03-09 20:34:10] [INFO ] After 236ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:34:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:34:10] [INFO ] After 16ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:34:10] [INFO ] After 33ms 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:34:10] [INFO ] After 444ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 7 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 7 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-09 20:34:10] [INFO ] Invariant cache hit.
[2023-03-09 20:34:10] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-09 20:34:10] [INFO ] Invariant cache hit.
[2023-03-09 20:34:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:34:11] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2023-03-09 20:34:11] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 20:34:11] [INFO ] Invariant cache hit.
[2023-03-09 20:34:11] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 612 ms. Remains : 271/271 places, 213/213 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 271 transition count 213
Applied a total of 1 rules in 12 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2023-03-09 20:34:11] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-09 20:34:11] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:34:11] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 20:34:11] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:34:11] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:34:11] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 103 ms returned sat
[2023-03-09 20:34:11] [INFO ] After 207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:34:11] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-09 20:34:11] [INFO ] After 403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 131 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1686403 steps, run timeout after 3001 ms. (steps per millisecond=561 ) properties seen :{}
Probabilistic random walk after 1686403 steps, saw 236485 distinct states, run finished after 3001 ms. (steps per millisecond=561 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 214 rows 272 cols
[2023-03-09 20:34:14] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-09 20:34:14] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:34:14] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 20:34:14] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:34:14] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:34:14] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 76 ms returned sat
[2023-03-09 20:34:15] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:34:15] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:34:15] [INFO ] After 11ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:34:15] [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 10 ms.
[2023-03-09 20:34:15] [INFO ] After 327ms 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 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 271 transition count 213
Applied a total of 1 rules in 12 ms. Remains 271 /272 variables (removed 1) and now considering 213/214 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 271/272 places, 213/214 transitions.
Incomplete random walk after 10000 steps, including 135 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 23 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1766524 steps, run timeout after 3001 ms. (steps per millisecond=588 ) properties seen :{}
Probabilistic random walk after 1766524 steps, saw 246623 distinct states, run finished after 3001 ms. (steps per millisecond=588 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2023-03-09 20:34:18] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-09 20:34:18] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:34:18] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 20:34:18] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:34:18] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:34:18] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 102 ms returned sat
[2023-03-09 20:34:18] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:34:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:34:18] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:34:18] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
[2023-03-09 20:34:18] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2023-03-09 20:34:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 152 ms
[2023-03-09 20:34:18] [INFO ] After 170ms 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:34:18] [INFO ] After 443ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-09 20:34:18] [INFO ] Invariant cache hit.
[2023-03-09 20:34:18] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-09 20:34:18] [INFO ] Invariant cache hit.
[2023-03-09 20:34:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:34:19] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2023-03-09 20:34:19] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 20:34:19] [INFO ] Invariant cache hit.
[2023-03-09 20:34:19] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 597 ms. Remains : 271/271 places, 213/213 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 271 transition count 213
Applied a total of 1 rules in 12 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2023-03-09 20:34:19] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-09 20:34:19] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:34:19] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2023-03-09 20:34:19] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:34:19] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:34:19] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 104 ms returned sat
[2023-03-09 20:34:19] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:34:19] [INFO ] After 138ms 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:34:19] [INFO ] After 310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
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 272 transition count 214
Applied a total of 1 rules in 12 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 214 rows 272 cols
[2023-03-09 20:34:19] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-09 20:34:19] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:34:19] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 20:34:19] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 20:34:19] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:34:19] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 56 ms returned sat
[2023-03-09 20:34:20] [INFO ] After 268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 20:34:20] [INFO ] After 385ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 101 ms.
[2023-03-09 20:34:20] [INFO ] After 614ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Unable to solve all queries for examination QuasiLiveness. Remains :3 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 3 properties from file /home/mcc/execution/QuasiLiveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 332203 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DES (PT), instance 40a
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: 274 places, 231 transitions, 1116 arcs.
(potential((tk(P181)>=1) & (tk(P179)>=1)))
(potential((tk(P247)>=1) & (tk(P243)>=1) & (tk(P239)>=1) & (tk(P235)>=1) & (tk(P233)>=1) & (tk(P237)>=1) & (tk(P241)>=1) & (tk(P245)>=1)))
(potential((tk(P251)>=1) & (tk(P249)>=1)))
(potential((tk(P260)>=1) & (tk(P258)>=1)))
(potential((tk(P264)>=1) & (tk(P262)>=1)))
(potential((tk(P274)>=1) & (tk(P272)>=1)))
(potential((tk(P1)>=1)))
(potential((tk(P185)>=1) & (tk(P183)>=1)))
(potential((tk(P166)>=1)))
(potential((tk(P164)>=1)))
(potential((tk(P162)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P3)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P4)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P5)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P6)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P7)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P8)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P9)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P10)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P11)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P12)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P13)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P14)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P15)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P16)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P17)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P18)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P19)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P20)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P21)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P22)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P23)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P24)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P25)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P26)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P27)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P28)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P29)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P30)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P31)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P32)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P33)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P34)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P35)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P36)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P37)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P38)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P39)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P40)>=1)))
(potential((tk(P193)>=1) & (tk(P195)>=1) & (tk(P2)>=1)))
(potential((tk(P42)>=1) & (tk(P270)>=1)))
(potential((tk(P43)>=1) & (tk(P270)>=1)))
(potential((tk(P44)>=1) & (tk(P270)>=1)))
(potential((tk(P45)>=1) & (tk(P270)>=1)))
(potential((tk(P46)>=1) & (tk(P270)>=1)))
(potential((tk(P47)>=1) & (tk(P270)>=1)))
(potential((tk(P48)>=1) & (tk(P270)>=1)))
(potential((tk(P49)>=1) & (tk(P270)>=1)))
(potential((tk(P50)>=1) & (tk(P270)>=1)))
(potential((tk(P51)>=1) & (tk(P270)>=1)))
(potential((tk(P52)>=1) & (tk(P270)>=1)))
(potential((tk(P53)>=1) & (tk(P270)>=1)))
(potential((tk(P54)>=1) & (tk(P270)>=1)))
(potential((tk(P55)>=1) & (tk(P270)>=1)))
(potential((tk(P56)>=1) & (tk(P270)>=1)))
(potential((tk(P57)>=1) & (tk(P270)>=1)))
(potential((tk(P58)>=1) & (tk(P270)>=1)))
(potential((tk(P59)>=1) & (tk(P270)>=1)))
(potential((tk(P60)>=1) & (tk(P270)>=1)))
(potential((tk(P61)>=1) & (tk(P270)>=1)))
(potential((tk(P62)>=1) & (tk(P270)>=1)))
(potential((tk(P63)>=1) & (tk(P270)>=1)))
(potential((tk(P64)>=1) & (tk(P270)>=1)))
(potential((tk(P65)>=1) & (tk(P270)>=1)))
(potential((tk(P66)>=1) & (tk(P270)>=1)))
(potential((tk(P67)>=1) & (tk(P270)>=1)))
(potential((tk(P68)>=1) & (tk(P270)>=1)))
(potential((tk(P69)>=1) & (tk(P270)>=1)))
(potential((tk(P70)>=1) & (tk(P270)>=1)))
(potential((tk(P71)>=1) & (tk(P270)>=1)))
(potential((tk(P72)>=1) & (tk(P270)>=1)))
(potential((tk(P73)>=1) & (tk(P270)>=1)))
(potential((tk(P74)>=1) & (tk(P270)>=1)))
(potential((tk(P75)>=1) & (tk(P270)>=1)))
(potential((tk(P76)>=1) & (tk(P270)>=1)))
(potential((tk(P77)>=1) & (tk(P270)>=1)))
(potential((tk(P78)>=1) & (tk(P270)>=1)))
(potential((tk(P79)>=1) & (tk(P270)>=1)))
(potential((tk(P80)>=1) & (tk(P270)>=1)))
(potential((tk(P41)>=1) & (tk(P270)>=1)))
(potential((tk(P122)>=1) & (tk(P165)>=1)))
(potential((tk(P123)>=1) & (tk(P165)>=1)))
(potential((tk(P124)>=1) & (tk(P165)>=1)))
(potential((tk(P125)>=1) & (tk(P165)>=1)))
(potential((tk(P126)>=1) & (tk(P165)>=1)))
(potential((tk(P127)>=1) & (tk(P165)>=1)))
(potential((tk(P128)>=1) & (tk(P165)>=1)))
(potential((tk(P129)>=1) & (tk(P165)>=1)))
(potential((tk(P130)>=1) & (tk(P165)>=1)))
(potential((tk(P131)>=1) & (tk(P165)>=1)))
(potential((tk(P132)>=1) & (tk(P165)>=1)))
(potential((tk(P133)>=1) & (tk(P165)>=1)))
(potential((tk(P134)>=1) & (tk(P165)>=1)))
(potential((tk(P135)>=1) & (tk(P165)>=1)))
(potential((tk(P136)>=1) & (tk(P165)>=1)))
(potential((tk(P137)>=1) & (tk(P165)>=1)))
(potential((tk(P138)>=1) & (tk(P165)>=1)))
(potential((tk(P139)>=1) & (tk(P165)>=1)))
(potential((tk(P140)>=1) & (tk(P165)>=1)))
(potential((tk(P141)>=1) & (tk(P165)>=1)))
(potential((tk(P142)>=1) & (tk(P165)>=1)))
(potential((tk(P143)>=1) & (tk(P165)>=1)))
(potential((tk(P144)>=1) & (tk(P165)>=1)))
(potential((tk(P145)>=1) & (tk(P165)>=1)))
(potential((tk(P146)>=1) & (tk(P165)>=1)))
(potential((tk(P147)>=1) & (tk(P165)>=1)))
(potential((tk(P148)>=1) & (tk(P165)>=1)))
(potential((tk(P149)>=1) & (tk(P165)>=1)))
(potential((tk(P150)>=1) & (tk(P165)>=1)))
(potential((tk(P151)>=1) & (tk(P165)>=1)))
(potential((tk(P152)>=1) & (tk(P165)>=1)))
(potential((tk(P153)>=1) & (tk(P165)>=1)))
(potential((tk(P154)>=1) & (tk(P165)>=1)))
(potential((tk(P155)>=1) & (tk(P165)>=1)))
(potential((tk(P156)>=1) & (tk(P165)>=1)))
(potential((tk(P157)>=1) & (tk(P165)>=1)))
(potential((tk(P158)>=1) & (tk(P165)>=1)))
(potential((tk(P159)>=1) & (tk(P165)>=1)))
(potential((tk(P160)>=1) & (tk(P165)>=1)))
(potential((tk(P121)>=1) & (tk(P165)>=1)))
(potential((tk(P81)>=1) & (tk(P190)>=1)))
(potential((tk(P120)>=1) & (tk(P190)>=1)))
(potential((tk(P119)>=1) & (tk(P190)>=1)))
(potential((tk(P118)>=1) & (tk(P190)>=1)))
(potential((tk(P117)>=1) & (tk(P190)>=1)))
(potential((tk(P116)>=1) & (tk(P190)>=1)))
(potential((tk(P115)>=1) & (tk(P190)>=1)))
(potential((tk(P114)>=1) & (tk(P190)>=1)))
(potential((tk(P113)>=1) & (tk(P190)>=1)))
(potential((tk(P112)>=1) & (tk(P190)>=1)))
(potential((tk(P111)>=1) & (tk(P190)>=1)))
(potential((tk(P110)>=1) & (tk(P190)>=1)))
(potential((tk(P109)>=1) & (tk(P190)>=1)))
(potential((tk(P108)>=1) & (tk(P190)>=1)))
(potential((tk(P107)>=1) & (tk(P190)>=1)))
(potential((tk(P106)>=1) & (tk(P190)>=1)))
(potential((tk(P105)>=1) & (tk(P190)>=1)))
(potential((tk(P104)>=1) & (tk(P190)>=1)))
(potential((tk(P103)>=1) & (tk(P190)>=1)))
(potential((tk(P102)>=1) & (tk(P190)>=1)))
(potential((tk(P101)>=1) & (tk(P190)>=1)))
(potential((tk(P100)>=1) & (tk(P190)>=1)))
(potential((tk(P99)>=1) & (tk(P190)>=1)))
(potential((tk(P98)>=1) & (tk(P190)>=1)))
(potential((tk(P97)>=1) & (tk(P190)>=1)))
(potential((tk(P96)>=1) & (tk(P190)>=1)))
(potential((tk(P95)>=1) & (tk(P190)>=1)))
(potential((tk(P94)>=1) & (tk(P190)>=1)))
(potential((tk(P93)>=1) & (tk(P190)>=1)))
(potential((tk(P92)>=1) & (tk(P190)>=1)))
(potential((tk(P91)>=1) & (tk(P190)>=1)))
(potential((tk(P90)>=1) & (tk(P190)>=1)))
(potential((tk(P89)>=1) & (tk(P190)>=1)))
(potential((tk(P88)>=1) & (tk(P190)>=1)))
(potential((tk(P87)>=1) & (tk(P190)>=1)))
(potential((tk(P86)>=1) & (tk(P190)>=1)))
(potential((tk(P85)>=1) & (tk(P190)>=1)))
(potential((tk(P84)>=1) & (tk(P190)>=1)))
(potential((tk(P83)>=1) & (tk(P190)>=1)))
(potential((tk(P82)>=1) & (tk(P190)>=1)))
(potential((tk(P166)>=1) & (tk(P188)>=1)))
(potential((tk(P166)>=1) & (tk(P188)>=1)))
(potential((tk(P166)>=1) & (tk(P188)>=1)))
(potential((tk(P166)>=1) & (tk(P188)>=1)))
(potential((tk(P166)>=1) & (tk(P188)>=1)))
(potential((tk(P162)>=1) & (tk(P175)>=1)))
(potential((tk(P162)>=1) & (tk(P175)>=1)))
(potential((tk(P164)>=1) & (tk(P184)>=1)))
(potential((tk(P164)>=1) & (tk(P184)>=1)))
(potential((tk(P169)>=1) & (tk(P254)>=1)))
(potential((tk(P169)>=1) & (tk(P254)>=1)))
(potential((tk(P169)>=1) & (tk(P254)>=1)))
(potential((tk(P174)>=1) & (tk(P248)>=1)))
(potential((tk(P171)>=1) & (tk(P265)>=1)))
(potential((tk(P171)>=1) & (tk(P265)>=1)))
(potential((tk(P171)>=1) & (tk(P265)>=1)))
(potential((tk(P194)>=1) & (tk(P266)>=1)))
(potential((tk(P192)>=1) & (tk(P255)>=1)))
(potential((tk(P269)>=1) & (tk(P273)>=1)))
(potential((tk(P256)>=1) & (tk(P271)>=1)))
(potential((tk(P256)>=1) & (tk(P197)>=1) & (tk(P199)>=1)))
(potential((tk(P252)>=1) & (tk(P257)>=1)))
(potential((tk(P256)>=1) & (tk(P197)>=1) & (tk(P199)>=1)))
(potential((tk(P252)>=1) & (tk(P261)>=1)))
(potential((tk(P213)>=1) & (tk(P209)>=1) & (tk(P205)>=1) & (tk(P201)>=1) & (tk(P203)>=1) & (tk(P207)>=1) & (tk(P211)>=1) & (tk(P215)>=1) & (tk(P196)>=1)))
(potential((tk(P198)>=1) & (tk(P268)>=1)))
(potential((tk(P269)>=1) & (tk(P259)>=1)))
(potential((tk(P269)>=1) & (tk(P263)>=1)))
(potential((tk(P198)>=1) & (tk(P267)>=1)))
(potential((tk(P269)>=1) & (tk(P259)>=1)))
(potential((tk(P269)>=1) & (tk(P263)>=1)))
(potential((tk(P230)>=1) & (tk(P246)>=1)))
(potential((tk(P226)>=1) & (tk(P242)>=1)))
(potential((tk(P222)>=1) & (tk(P238)>=1)))
(potential((tk(P218)>=1) & (tk(P234)>=1)))
(potential((tk(P216)>=1) & (tk(P232)>=1)))
(potential((tk(P220)>=1) & (tk(P236)>=1)))
(potential((tk(P224)>=1) & (tk(P240)>=1)))
(potential((tk(P228)>=1) & (tk(P244)>=1)))
(potential((tk(P212)>=1) & (tk(P229)>=1)))
(potential((tk(P208)>=1) & (tk(P225)>=1)))
(potential((tk(P204)>=1) & (tk(P221)>=1)))
(potential((tk(P200)>=1) & (tk(P217)>=1)))
(potential((tk(P202)>=1) & (tk(P219)>=1)))
(potential((tk(P206)>=1) & (tk(P223)>=1)))
(potential((tk(P210)>=1) & (tk(P227)>=1)))
(potential((tk(P214)>=1) & (tk(P231)>=1)))
(potential((tk(P250)>=1) & (tk(P253)>=1)))
(potential((tk(P185)>=1) & (tk(P183)>=1) & (tk(P173)>=1)))
(potential((tk(P173)>=1) & (tk(P180)>=1)))
(potential((tk(P177)>=1) & (tk(P191)>=1)))
(potential((tk(P177)>=1) & (tk(P178)>=1)))
(potential((tk(P189)>=1) & (tk(P187)>=1) & (tk(P182)>=1)))
(potential((tk(P189)>=1) & (tk(P187)>=1) & (tk(P182)>=1)))
(potential((tk(P189)>=1) & (tk(P187)>=1) & (tk(P182)>=1)))
(potential((tk(P189)>=1) & (tk(P187)>=1) & (tk(P182)>=1)))
(potential((tk(P189)>=1) & (tk(P187)>=1) & (tk(P182)>=1)))
(potential((tk(P176)>=1) & (tk(P186)>=1)))
(potential((tk(P185)>=1) & (tk(P183)>=1)))
(potential((tk(P177)>=1)))
(potential((tk(P170)>=1) & (tk(P167)>=1) & (tk(P161)>=1) & (tk(P163)>=1) & (tk(P168)>=1) & (tk(P172)>=1)))
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393232 kB
MemFree: 14332032 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16164336 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-40a"
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-40a, 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-167814499400287"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40a.tgz
mv DES-PT-40a 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 '
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 ;