About the Execution of Smart+red for DES-PT-50a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2585.384 | 1800000.00 | 2152594.00 | 3876.40 | [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-167814499400297.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-50a, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-167814499400297
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.4K Feb 26 15:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 15:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 15:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 15:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 15:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 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 97K 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 1678395240161
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-50a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 20:54:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-09 20:54:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 20:54:01] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2023-03-09 20:54:01] [INFO ] Transformed 314 places.
[2023-03-09 20:54:01] [INFO ] Transformed 271 transitions.
[2023-03-09 20:54:01] [INFO ] Found NUPN structural information;
[2023-03-09 20:54:01] [INFO ] Parsed PT model containing 314 places and 271 transitions and 1306 arcs in 122 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 314/314 places, 271/271 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 314 transition count 257
Applied a total of 14 rules in 92 ms. Remains 314 /314 variables (removed 0) and now considering 257/271 (removed 14) transitions.
// Phase 1: matrix 257 rows 314 cols
[2023-03-09 20:54:02] [INFO ] Computed 59 place invariants in 42 ms
[2023-03-09 20:54:02] [INFO ] Implicit Places using invariants in 525 ms returned [211]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 551 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 313/314 places, 257/271 transitions.
Applied a total of 0 rules in 8 ms. Remains 313 /313 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 652 ms. Remains : 313/314 places, 257/271 transitions.
Discarding 9 transitions out of 257. Remains 248
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 624 ms. (steps per millisecond=16 ) properties (out of 247) seen :62
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) seen :0
Running SMT prover for 185 properties.
// Phase 1: matrix 257 rows 313 cols
[2023-03-09 20:54:03] [INFO ] Computed 58 place invariants in 17 ms
[2023-03-09 20:54:04] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-09 20:54:04] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 22 ms returned sat
[2023-03-09 20:54:05] [INFO ] After 2236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:185
[2023-03-09 20:54:06] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-09 20:54:06] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 54 ms returned sat
[2023-03-09 20:54:30] [INFO ] After 18495ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :184
[2023-03-09 20:54:30] [INFO ] After 18496ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :184
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-09 20:54:30] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :184
Fused 185 Parikh solutions to 54 different solutions.
Parikh walk visited 163 properties in 22880 ms.
Support contains 26 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 257/257 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 313 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 312 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 312 transition count 254
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 312 transition count 254
Applied a total of 8 rules in 77 ms. Remains 312 /313 variables (removed 1) and now considering 254/257 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 312/313 places, 254/257 transitions.
Incomplete random walk after 1000000 steps, including 13449 resets, run finished after 27957 ms. (steps per millisecond=35 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 205 resets, run finished after 548 ms. (steps per millisecond=182 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 730 resets, run finished after 936 ms. (steps per millisecond=106 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 732 resets, run finished after 1019 ms. (steps per millisecond=98 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100000 steps, including 235 resets, run finished after 607 ms. (steps per millisecond=164 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 231 resets, run finished after 523 ms. (steps per millisecond=191 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 223 resets, run finished after 549 ms. (steps per millisecond=182 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 246 resets, run finished after 562 ms. (steps per millisecond=177 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 248 resets, run finished after 594 ms. (steps per millisecond=168 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100000 steps, including 236 resets, run finished after 445 ms. (steps per millisecond=224 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100000 steps, including 251 resets, run finished after 444 ms. (steps per millisecond=225 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 231 resets, run finished after 612 ms. (steps per millisecond=163 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 244 resets, run finished after 446 ms. (steps per millisecond=224 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 244 resets, run finished after 447 ms. (steps per millisecond=223 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 239 resets, run finished after 449 ms. (steps per millisecond=222 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 243 resets, run finished after 579 ms. (steps per millisecond=172 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 241 resets, run finished after 444 ms. (steps per millisecond=225 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 242 resets, run finished after 438 ms. (steps per millisecond=228 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 244 resets, run finished after 439 ms. (steps per millisecond=227 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 248 resets, run finished after 479 ms. (steps per millisecond=208 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 232 resets, run finished after 435 ms. (steps per millisecond=229 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100000 steps, including 234 resets, run finished after 531 ms. (steps per millisecond=188 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 250 resets, run finished after 590 ms. (steps per millisecond=169 ) properties (out of 22) seen :0
Interrupted probabilistic random walk after 24606810 steps, run timeout after 120001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 24606810 steps, saw 2985516 distinct states, run finished after 120009 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 22 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-09 20:57:33] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-09 20:57:34] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 20:57:34] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2023-03-09 20:57:34] [INFO ] After 323ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2023-03-09 20:57:34] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 20:57:34] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 40 ms returned sat
[2023-03-09 20:57:35] [INFO ] After 766ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2023-03-09 20:57:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:57:35] [INFO ] After 518ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :22
[2023-03-09 20:57:36] [INFO ] After 1311ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 1138 ms.
[2023-03-09 20:57:37] [INFO ] After 3577ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :22
Parikh walk visited 0 properties in 9941 ms.
Support contains 26 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 14 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 14 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-09 20:57:47] [INFO ] Invariant cache hit.
[2023-03-09 20:57:47] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-09 20:57:47] [INFO ] Invariant cache hit.
[2023-03-09 20:57:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:57:48] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
[2023-03-09 20:57:48] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-09 20:57:48] [INFO ] Invariant cache hit.
[2023-03-09 20:57:48] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 700 ms. Remains : 312/312 places, 254/254 transitions.
Incomplete random walk after 100000 steps, including 1356 resets, run finished after 2969 ms. (steps per millisecond=33 ) properties (out of 26) seen :4
Running SMT prover for 22 properties.
[2023-03-09 20:57:51] [INFO ] Invariant cache hit.
[2023-03-09 20:57:51] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:57:51] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2023-03-09 20:57:51] [INFO ] After 174ms SMT Verify possible using state equation in real domain returned unsat :0 sat :22
[2023-03-09 20:57:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:57:51] [INFO ] After 21ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :22
[2023-03-09 20:57:52] [INFO ] After 497ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 20:57:52] [INFO ] After 782ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :22
Incomplete random walk after 1000000 steps, including 13448 resets, run finished after 28692 ms. (steps per millisecond=34 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 238 resets, run finished after 582 ms. (steps per millisecond=171 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 725 resets, run finished after 814 ms. (steps per millisecond=122 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 726 resets, run finished after 617 ms. (steps per millisecond=162 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 238 resets, run finished after 470 ms. (steps per millisecond=212 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 231 resets, run finished after 467 ms. (steps per millisecond=214 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 233 resets, run finished after 572 ms. (steps per millisecond=174 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 243 resets, run finished after 591 ms. (steps per millisecond=169 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 249 resets, run finished after 603 ms. (steps per millisecond=165 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 228 resets, run finished after 596 ms. (steps per millisecond=167 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 234 resets, run finished after 587 ms. (steps per millisecond=170 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 245 resets, run finished after 591 ms. (steps per millisecond=169 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100000 steps, including 241 resets, run finished after 595 ms. (steps per millisecond=168 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 239 resets, run finished after 591 ms. (steps per millisecond=169 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 236 resets, run finished after 590 ms. (steps per millisecond=169 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 248 resets, run finished after 593 ms. (steps per millisecond=168 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 247 resets, run finished after 594 ms. (steps per millisecond=168 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 240 resets, run finished after 582 ms. (steps per millisecond=171 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 228 resets, run finished after 592 ms. (steps per millisecond=168 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 231 resets, run finished after 600 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 251 resets, run finished after 613 ms. (steps per millisecond=163 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 227 resets, run finished after 601 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 233 resets, run finished after 614 ms. (steps per millisecond=162 ) properties (out of 22) seen :0
Interrupted probabilistic random walk after 24228079 steps, run timeout after 123001 ms. (steps per millisecond=196 ) properties seen :{}
Probabilistic random walk after 24228079 steps, saw 2941857 distinct states, run finished after 123001 ms. (steps per millisecond=196 ) properties seen :0
Running SMT prover for 22 properties.
[2023-03-09 21:00:36] [INFO ] Invariant cache hit.
[2023-03-09 21:00:37] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 21:00:37] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2023-03-09 21:00:37] [INFO ] After 339ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2023-03-09 21:00:37] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 21:00:37] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 104 ms returned sat
[2023-03-09 21:00:38] [INFO ] After 857ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2023-03-09 21:00:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:00:39] [INFO ] After 762ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :22
[2023-03-09 21:00:39] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2023-03-09 21:00:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-09 21:00:40] [INFO ] After 1864ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 1401 ms.
[2023-03-09 21:00:41] [INFO ] After 4510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :22
Parikh walk visited 18 properties in 32561 ms.
Support contains 8 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 27 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 13 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-09 21:01:14] [INFO ] Invariant cache hit.
[2023-03-09 21:01:14] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-09 21:01:14] [INFO ] Invariant cache hit.
[2023-03-09 21:01:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:01:14] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
[2023-03-09 21:01:14] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-09 21:01:14] [INFO ] Invariant cache hit.
[2023-03-09 21:01:15] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 682 ms. Remains : 312/312 places, 254/254 transitions.
Incomplete random walk after 100000 steps, including 1354 resets, run finished after 1597 ms. (steps per millisecond=62 ) properties (out of 8) seen :4
Running SMT prover for 4 properties.
[2023-03-09 21:01:16] [INFO ] Invariant cache hit.
[2023-03-09 21:01:16] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:01:16] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2023-03-09 21:01:16] [INFO ] After 168ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2023-03-09 21:01:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:01:16] [INFO ] After 10ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :4
[2023-03-09 21:01:16] [INFO ] After 88ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-09 21:01:16] [INFO ] After 339ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :4
Incomplete random walk after 10000 steps, including 139 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1614006 steps, run timeout after 3001 ms. (steps per millisecond=537 ) properties seen :{}
Probabilistic random walk after 1614006 steps, saw 226315 distinct states, run finished after 3001 ms. (steps per millisecond=537 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 21:01:20] [INFO ] Invariant cache hit.
[2023-03-09 21:01:20] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:01:20] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2023-03-09 21:01:20] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:01:20] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:01:20] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 113 ms returned sat
[2023-03-09 21:01:20] [INFO ] After 262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:01:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:01:20] [INFO ] After 22ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:01:20] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2023-03-09 21:01:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-09 21:01:20] [INFO ] After 129ms 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 21:01:20] [INFO ] After 598ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 2554 steps, including 2 resets, run visited all 1 properties in 9 ms. (steps per millisecond=283 )
Parikh walk visited 1 properties in 8 ms.
Finished random walk after 461 steps, including 7 resets, run visited all 1 properties in 3 ms. (steps per millisecond=153 )
Finished random walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Incomplete random walk after 10000 steps, including 134 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 20 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1620778 steps, run timeout after 3001 ms. (steps per millisecond=540 ) properties seen :{}
Probabilistic random walk after 1620778 steps, saw 227388 distinct states, run finished after 3001 ms. (steps per millisecond=540 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 21:01:23] [INFO ] Invariant cache hit.
[2023-03-09 21:01:23] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:01:23] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2023-03-09 21:01:23] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:01:23] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:01:24] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 114 ms returned sat
[2023-03-09 21:01:24] [INFO ] After 265ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:01:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:01:24] [INFO ] After 15ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:01:24] [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 16 ms.
[2023-03-09 21:01:24] [INFO ] After 499ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 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 312 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 311 transition count 253
Applied a total of 2 rules in 43 ms. Remains 311 /312 variables (removed 1) and now considering 253/254 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 311/312 places, 253/254 transitions.
Incomplete random walk after 10000 steps, including 139 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 23 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1639992 steps, run timeout after 3001 ms. (steps per millisecond=546 ) properties seen :{}
Probabilistic random walk after 1639992 steps, saw 230051 distinct states, run finished after 3001 ms. (steps per millisecond=546 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 253 rows 311 cols
[2023-03-09 21:01:27] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-09 21:01:27] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:01:27] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:01:27] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:01:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:01:27] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 27 ms returned sat
[2023-03-09 21:01:27] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:01:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:01:27] [INFO ] After 56ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:01:27] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 0 ms to minimize.
[2023-03-09 21:01:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-03-09 21:01:27] [INFO ] After 157ms 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 21:01:27] [INFO ] After 385ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 8 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 11 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2023-03-09 21:01:27] [INFO ] Invariant cache hit.
[2023-03-09 21:01:28] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-09 21:01:28] [INFO ] Invariant cache hit.
[2023-03-09 21:01:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:01:28] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2023-03-09 21:01:28] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 21:01:28] [INFO ] Invariant cache hit.
[2023-03-09 21:01:28] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 710 ms. Remains : 311/311 places, 253/253 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 311 transition count 253
Applied a total of 1 rules in 16 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 253 rows 311 cols
[2023-03-09 21:01:28] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-09 21:01:28] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:01:28] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2023-03-09 21:01:28] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:01:28] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:01:28] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 28 ms returned sat
[2023-03-09 21:01:28] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:01:29] [INFO ] After 155ms 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 21:01:29] [INFO ] After 256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 136 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1581812 steps, run timeout after 3001 ms. (steps per millisecond=527 ) properties seen :{}
Probabilistic random walk after 1581812 steps, saw 221311 distinct states, run finished after 3001 ms. (steps per millisecond=527 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-09 21:01:32] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-09 21:01:32] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned sat
[2023-03-09 21:01:32] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2023-03-09 21:01:32] [INFO ] After 267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:01:32] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:01:32] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 101 ms returned sat
[2023-03-09 21:01:32] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:01:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:01:32] [INFO ] After 16ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:01:32] [INFO ] After 37ms 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 21:01:32] [INFO ] After 500ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 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 312 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 311 transition count 253
Applied a total of 2 rules in 24 ms. Remains 311 /312 variables (removed 1) and now considering 253/254 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 311/312 places, 253/254 transitions.
Incomplete random walk after 10000 steps, including 135 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 22 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1641505 steps, run timeout after 3001 ms. (steps per millisecond=546 ) properties seen :{}
Probabilistic random walk after 1641505 steps, saw 230280 distinct states, run finished after 3001 ms. (steps per millisecond=546 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 253 rows 311 cols
[2023-03-09 21:01:35] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-09 21:01:35] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:01:36] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:01:36] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:01:36] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:01:36] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 27 ms returned sat
[2023-03-09 21:01:36] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:01:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:01:36] [INFO ] After 11ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:01:36] [INFO ] After 39ms 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 21:01:36] [INFO ] After 274ms 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 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 8 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 8 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2023-03-09 21:01:36] [INFO ] Invariant cache hit.
[2023-03-09 21:01:36] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-09 21:01:36] [INFO ] Invariant cache hit.
[2023-03-09 21:01:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:01:36] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
[2023-03-09 21:01:36] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 21:01:36] [INFO ] Invariant cache hit.
[2023-03-09 21:01:37] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 713 ms. Remains : 311/311 places, 253/253 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 311 transition count 253
Applied a total of 1 rules in 21 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 253 rows 311 cols
[2023-03-09 21:01:37] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-09 21:01:37] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:01:37] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:01:37] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:01:37] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:01:37] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 28 ms returned sat
[2023-03-09 21:01:37] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:01:37] [INFO ] After 189ms 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 21:01:37] [INFO ] After 297ms 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 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1577374 steps, run timeout after 3001 ms. (steps per millisecond=525 ) properties seen :{}
Probabilistic random walk after 1577374 steps, saw 220745 distinct states, run finished after 3001 ms. (steps per millisecond=525 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-09 21:01:40] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-09 21:01:40] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:01:40] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-09 21:01:40] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:01:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:01:40] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 30 ms returned sat
[2023-03-09 21:01:41] [INFO ] After 398ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:01:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:01:41] [INFO ] After 17ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:01:41] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2023-03-09 21:01:41] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2023-03-09 21:01:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 142 ms
[2023-03-09 21:01:41] [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 12 ms.
[2023-03-09 21:01:41] [INFO ] After 672ms 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 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 311 transition count 253
Applied a total of 1 rules in 14 ms. Remains 311 /312 variables (removed 1) and now considering 253/254 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 311/312 places, 253/254 transitions.
Incomplete random walk after 10000 steps, including 134 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 24 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1615388 steps, run timeout after 3001 ms. (steps per millisecond=538 ) properties seen :{}
Probabilistic random walk after 1615388 steps, saw 226525 distinct states, run finished after 3001 ms. (steps per millisecond=538 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 253 rows 311 cols
[2023-03-09 21:01:44] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-09 21:01:44] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:01:44] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:01:44] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:01:44] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:01:44] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 27 ms returned sat
[2023-03-09 21:01:44] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:01:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:01:44] [INFO ] After 24ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:01:44] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-09 21:01:44] [INFO ] After 294ms 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 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 6 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 7 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2023-03-09 21:01:44] [INFO ] Invariant cache hit.
[2023-03-09 21:01:44] [INFO ] Implicit Places using invariants in 181 ms returned []
[2023-03-09 21:01:44] [INFO ] Invariant cache hit.
[2023-03-09 21:01:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:01:45] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
[2023-03-09 21:01:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 21:01:45] [INFO ] Invariant cache hit.
[2023-03-09 21:01:45] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 841 ms. Remains : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 7 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-09 21:01:45] [INFO ] Invariant cache hit.
[2023-03-09 21:01:45] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:01:45] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:01:45] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:01:45] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:01:45] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 92 ms returned sat
[2023-03-09 21:01:46] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:01:46] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2023-03-09 21:01:46] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 0 ms to minimize.
[2023-03-09 21:01:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 159 ms
[2023-03-09 21:01:46] [INFO ] After 400ms 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 21:01:46] [INFO ] After 566ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Applied a total of 0 rules in 12 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-09 21:01:46] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-09 21:01:46] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:01:46] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2023-03-09 21:01:46] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 21:01:46] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:01:46] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 42 ms returned sat
[2023-03-09 21:01:46] [INFO ] After 411ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 21:01:47] [INFO ] After 579ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 146 ms.
[2023-03-09 21:01:47] [INFO ] After 937ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Unable to solve all queries for examination QuasiLiveness. Remains :4 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 4 properties from file /home/mcc/execution/QuasiLiveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 465704 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DES (PT), instance 50a
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: 314 places, 271 transitions, 1306 arcs.
(potential((tk(P221)>=1) & (tk(P219)>=1)))
(potential((tk(P287)>=1) & (tk(P283)>=1) & (tk(P279)>=1) & (tk(P275)>=1) & (tk(P273)>=1) & (tk(P277)>=1) & (tk(P281)>=1) & (tk(P285)>=1)))
(potential((tk(P291)>=1) & (tk(P289)>=1)))
(potential((tk(P300)>=1) & (tk(P298)>=1)))
(potential((tk(P304)>=1) & (tk(P302)>=1)))
(potential((tk(P314)>=1) & (tk(P312)>=1)))
(potential((tk(P1)>=1)))
(potential((tk(P225)>=1) & (tk(P223)>=1)))
(potential((tk(P206)>=1)))
(potential((tk(P204)>=1)))
(potential((tk(P202)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P3)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P4)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P5)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P6)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P7)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P8)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P9)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P10)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P11)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P12)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P13)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P14)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P15)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P16)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P17)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P18)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P19)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P20)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P21)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P22)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P23)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P24)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P25)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P26)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P27)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P28)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P29)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P30)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P31)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P32)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P33)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P34)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P35)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P36)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P37)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P38)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P39)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P40)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P41)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P42)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P43)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P44)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P45)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P46)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P47)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P48)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P49)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P50)>=1)))
(potential((tk(P233)>=1) & (tk(P235)>=1) & (tk(P2)>=1)))
(potential((tk(P52)>=1) & (tk(P310)>=1)))
(potential((tk(P53)>=1) & (tk(P310)>=1)))
(potential((tk(P54)>=1) & (tk(P310)>=1)))
(potential((tk(P55)>=1) & (tk(P310)>=1)))
(potential((tk(P56)>=1) & (tk(P310)>=1)))
(potential((tk(P57)>=1) & (tk(P310)>=1)))
(potential((tk(P58)>=1) & (tk(P310)>=1)))
(potential((tk(P59)>=1) & (tk(P310)>=1)))
(potential((tk(P60)>=1) & (tk(P310)>=1)))
(potential((tk(P61)>=1) & (tk(P310)>=1)))
(potential((tk(P62)>=1) & (tk(P310)>=1)))
(potential((tk(P63)>=1) & (tk(P310)>=1)))
(potential((tk(P64)>=1) & (tk(P310)>=1)))
(potential((tk(P65)>=1) & (tk(P310)>=1)))
(potential((tk(P66)>=1) & (tk(P310)>=1)))
(potential((tk(P67)>=1) & (tk(P310)>=1)))
(potential((tk(P68)>=1) & (tk(P310)>=1)))
(potential((tk(P69)>=1) & (tk(P310)>=1)))
(potential((tk(P70)>=1) & (tk(P310)>=1)))
(potential((tk(P71)>=1) & (tk(P310)>=1)))
(potential((tk(P72)>=1) & (tk(P310)>=1)))
(potential((tk(P73)>=1) & (tk(P310)>=1)))
(potential((tk(P74)>=1) & (tk(P310)>=1)))
(potential((tk(P75)>=1) & (tk(P310)>=1)))
(potential((tk(P76)>=1) & (tk(P310)>=1)))
(potential((tk(P77)>=1) & (tk(P310)>=1)))
(potential((tk(P78)>=1) & (tk(P310)>=1)))
(potential((tk(P79)>=1) & (tk(P310)>=1)))
(potential((tk(P80)>=1) & (tk(P310)>=1)))
(potential((tk(P81)>=1) & (tk(P310)>=1)))
(potential((tk(P82)>=1) & (tk(P310)>=1)))
(potential((tk(P83)>=1) & (tk(P310)>=1)))
(potential((tk(P84)>=1) & (tk(P310)>=1)))
(potential((tk(P85)>=1) & (tk(P310)>=1)))
(potential((tk(P86)>=1) & (tk(P310)>=1)))
(potential((tk(P87)>=1) & (tk(P310)>=1)))
(potential((tk(P88)>=1) & (tk(P310)>=1)))
(potential((tk(P89)>=1) & (tk(P310)>=1)))
(potential((tk(P90)>=1) & (tk(P310)>=1)))
(potential((tk(P91)>=1) & (tk(P310)>=1)))
(potential((tk(P92)>=1) & (tk(P310)>=1)))
(potential((tk(P93)>=1) & (tk(P310)>=1)))
(potential((tk(P94)>=1) & (tk(P310)>=1)))
(potential((tk(P95)>=1) & (tk(P310)>=1)))
(potential((tk(P96)>=1) & (tk(P310)>=1)))
(potential((tk(P97)>=1) & (tk(P310)>=1)))
(potential((tk(P98)>=1) & (tk(P310)>=1)))
(potential((tk(P99)>=1) & (tk(P310)>=1)))
(potential((tk(P100)>=1) & (tk(P310)>=1)))
(potential((tk(P51)>=1) & (tk(P310)>=1)))
(potential((tk(P152)>=1) & (tk(P205)>=1)))
(potential((tk(P153)>=1) & (tk(P205)>=1)))
(potential((tk(P154)>=1) & (tk(P205)>=1)))
(potential((tk(P155)>=1) & (tk(P205)>=1)))
(potential((tk(P156)>=1) & (tk(P205)>=1)))
(potential((tk(P157)>=1) & (tk(P205)>=1)))
(potential((tk(P158)>=1) & (tk(P205)>=1)))
(potential((tk(P159)>=1) & (tk(P205)>=1)))
(potential((tk(P160)>=1) & (tk(P205)>=1)))
(potential((tk(P161)>=1) & (tk(P205)>=1)))
(potential((tk(P162)>=1) & (tk(P205)>=1)))
(potential((tk(P163)>=1) & (tk(P205)>=1)))
(potential((tk(P164)>=1) & (tk(P205)>=1)))
(potential((tk(P165)>=1) & (tk(P205)>=1)))
(potential((tk(P166)>=1) & (tk(P205)>=1)))
(potential((tk(P167)>=1) & (tk(P205)>=1)))
(potential((tk(P168)>=1) & (tk(P205)>=1)))
(potential((tk(P169)>=1) & (tk(P205)>=1)))
(potential((tk(P170)>=1) & (tk(P205)>=1)))
(potential((tk(P171)>=1) & (tk(P205)>=1)))
(potential((tk(P172)>=1) & (tk(P205)>=1)))
(potential((tk(P173)>=1) & (tk(P205)>=1)))
(potential((tk(P174)>=1) & (tk(P205)>=1)))
(potential((tk(P175)>=1) & (tk(P205)>=1)))
(potential((tk(P176)>=1) & (tk(P205)>=1)))
(potential((tk(P177)>=1) & (tk(P205)>=1)))
(potential((tk(P178)>=1) & (tk(P205)>=1)))
(potential((tk(P179)>=1) & (tk(P205)>=1)))
(potential((tk(P180)>=1) & (tk(P205)>=1)))
(potential((tk(P181)>=1) & (tk(P205)>=1)))
(potential((tk(P182)>=1) & (tk(P205)>=1)))
(potential((tk(P183)>=1) & (tk(P205)>=1)))
(potential((tk(P184)>=1) & (tk(P205)>=1)))
(potential((tk(P185)>=1) & (tk(P205)>=1)))
(potential((tk(P186)>=1) & (tk(P205)>=1)))
(potential((tk(P187)>=1) & (tk(P205)>=1)))
(potential((tk(P188)>=1) & (tk(P205)>=1)))
(potential((tk(P189)>=1) & (tk(P205)>=1)))
(potential((tk(P190)>=1) & (tk(P205)>=1)))
(potential((tk(P191)>=1) & (tk(P205)>=1)))
(potential((tk(P192)>=1) & (tk(P205)>=1)))
(potential((tk(P193)>=1) & (tk(P205)>=1)))
(potential((tk(P194)>=1) & (tk(P205)>=1)))
(potential((tk(P195)>=1) & (tk(P205)>=1)))
(potential((tk(P196)>=1) & (tk(P205)>=1)))
(potential((tk(P197)>=1) & (tk(P205)>=1)))
(potential((tk(P198)>=1) & (tk(P205)>=1)))
(potential((tk(P199)>=1) & (tk(P205)>=1)))
(potential((tk(P200)>=1) & (tk(P205)>=1)))
(potential((tk(P151)>=1) & (tk(P205)>=1)))
(potential((tk(P101)>=1) & (tk(P230)>=1)))
(potential((tk(P150)>=1) & (tk(P230)>=1)))
(potential((tk(P149)>=1) & (tk(P230)>=1)))
(potential((tk(P148)>=1) & (tk(P230)>=1)))
(potential((tk(P147)>=1) & (tk(P230)>=1)))
(potential((tk(P146)>=1) & (tk(P230)>=1)))
(potential((tk(P145)>=1) & (tk(P230)>=1)))
(potential((tk(P144)>=1) & (tk(P230)>=1)))
(potential((tk(P143)>=1) & (tk(P230)>=1)))
(potential((tk(P142)>=1) & (tk(P230)>=1)))
(potential((tk(P141)>=1) & (tk(P230)>=1)))
(potential((tk(P140)>=1) & (tk(P230)>=1)))
(potential((tk(P139)>=1) & (tk(P230)>=1)))
(potential((tk(P138)>=1) & (tk(P230)>=1)))
(potential((tk(P137)>=1) & (tk(P230)>=1)))
(potential((tk(P136)>=1) & (tk(P230)>=1)))
(potential((tk(P135)>=1) & (tk(P230)>=1)))
(potential((tk(P134)>=1) & (tk(P230)>=1)))
(potential((tk(P133)>=1) & (tk(P230)>=1)))
(potential((tk(P132)>=1) & (tk(P230)>=1)))
(potential((tk(P131)>=1) & (tk(P230)>=1)))
(potential((tk(P130)>=1) & (tk(P230)>=1)))
(potential((tk(P129)>=1) & (tk(P230)>=1)))
(potential((tk(P128)>=1) & (tk(P230)>=1)))
(potential((tk(P127)>=1) & (tk(P230)>=1)))
(potential((tk(P126)>=1) & (tk(P230)>=1)))
(potential((tk(P125)>=1) & (tk(P230)>=1)))
(potential((tk(P124)>=1) & (tk(P230)>=1)))
(potential((tk(P123)>=1) & (tk(P230)>=1)))
(potential((tk(P122)>=1) & (tk(P230)>=1)))
(potential((tk(P121)>=1) & (tk(P230)>=1)))
(potential((tk(P120)>=1) & (tk(P230)>=1)))
(potential((tk(P119)>=1) & (tk(P230)>=1)))
(potential((tk(P118)>=1) & (tk(P230)>=1)))
(potential((tk(P117)>=1) & (tk(P230)>=1)))
(potential((tk(P116)>=1) & (tk(P230)>=1)))
(potential((tk(P115)>=1) & (tk(P230)>=1)))
(potential((tk(P114)>=1) & (tk(P230)>=1)))
(potential((tk(P113)>=1) & (tk(P230)>=1)))
(potential((tk(P112)>=1) & (tk(P230)>=1)))
(potential((tk(P111)>=1) & (tk(P230)>=1)))
(potential((tk(P110)>=1) & (tk(P230)>=1)))
(potential((tk(P109)>=1) & (tk(P230)>=1)))
(potential((tk(P108)>=1) & (tk(P230)>=1)))
(potential((tk(P107)>=1) & (tk(P230)>=1)))
(potential((tk(P106)>=1) & (tk(P230)>=1)))
(potential((tk(P105)>=1) & (tk(P230)>=1)))
(potential((tk(P104)>=1) & (tk(P230)>=1)))
(potential((tk(P103)>=1) & (tk(P230)>=1)))
(potential((tk(P102)>=1) & (tk(P230)>=1)))
(potential((tk(P206)>=1) & (tk(P228)>=1)))
(potential((tk(P206)>=1) & (tk(P228)>=1)))
(potential((tk(P206)>=1) & (tk(P228)>=1)))
(potential((tk(P206)>=1) & (tk(P228)>=1)))
(potential((tk(P206)>=1) & (tk(P228)>=1)))
(potential((tk(P202)>=1) & (tk(P215)>=1)))
(potential((tk(P202)>=1) & (tk(P215)>=1)))
(potential((tk(P204)>=1) & (tk(P224)>=1)))
(potential((tk(P204)>=1) & (tk(P224)>=1)))
(potential((tk(P209)>=1) & (tk(P294)>=1)))
(potential((tk(P209)>=1) & (tk(P294)>=1)))
(potential((tk(P209)>=1) & (tk(P294)>=1)))
(potential((tk(P214)>=1) & (tk(P288)>=1)))
(potential((tk(P211)>=1) & (tk(P305)>=1)))
(potential((tk(P211)>=1) & (tk(P305)>=1)))
(potential((tk(P211)>=1) & (tk(P305)>=1)))
(potential((tk(P234)>=1) & (tk(P306)>=1)))
(potential((tk(P232)>=1) & (tk(P295)>=1)))
(potential((tk(P309)>=1) & (tk(P313)>=1)))
(potential((tk(P296)>=1) & (tk(P311)>=1)))
(potential((tk(P296)>=1) & (tk(P237)>=1) & (tk(P239)>=1)))
(potential((tk(P292)>=1) & (tk(P297)>=1)))
(potential((tk(P296)>=1) & (tk(P237)>=1) & (tk(P239)>=1)))
(potential((tk(P292)>=1) & (tk(P301)>=1)))
(potential((tk(P253)>=1) & (tk(P249)>=1) & (tk(P245)>=1) & (tk(P241)>=1) & (tk(P243)>=1) & (tk(P247)>=1) & (tk(P251)>=1) & (tk(P255)>=1) & (tk(P236)>=1)))
(potential((tk(P238)>=1) & (tk(P308)>=1)))
(potential((tk(P309)>=1) & (tk(P299)>=1)))
(potential((tk(P309)>=1) & (tk(P303)>=1)))
(potential((tk(P238)>=1) & (tk(P307)>=1)))
(potential((tk(P309)>=1) & (tk(P299)>=1)))
(potential((tk(P309)>=1) & (tk(P303)>=1)))
(potential((tk(P270)>=1) & (tk(P286)>=1)))
(potential((tk(P266)>=1) & (tk(P282)>=1)))
(potential((tk(P262)>=1) & (tk(P278)>=1)))
(potential((tk(P258)>=1) & (tk(P274)>=1)))
(potential((tk(P256)>=1) & (tk(P272)>=1)))
(potential((tk(P260)>=1) & (tk(P276)>=1)))
(potential((tk(P264)>=1) & (tk(P280)>=1)))
(potential((tk(P268)>=1) & (tk(P284)>=1)))
(potential((tk(P252)>=1) & (tk(P269)>=1)))
(potential((tk(P248)>=1) & (tk(P265)>=1)))
(potential((tk(P244)>=1) & (tk(P261)>=1)))
(potential((tk(P240)>=1) & (tk(P257)>=1)))
(potential((tk(P242)>=1) & (tk(P259)>=1)))
(potential((tk(P246)>=1) & (tk(P263)>=1)))
(potential((tk(P250)>=1) & (tk(P267)>=1)))
(potential((tk(P254)>=1) & (tk(P271)>=1)))
(potential((tk(P290)>=1) & (tk(P293)>=1)))
(potential((tk(P225)>=1) & (tk(P223)>=1) & (tk(P213)>=1)))
(potential((tk(P213)>=1) & (tk(P220)>=1)))
(potential((tk(P217)>=1) & (tk(P231)>=1)))
(potential((tk(P217)>=1) & (tk(P218)>=1)))
(potential((tk(P229)>=1) & (tk(P227)>=1) & (tk(P222)>=1)))
(potential((tk(P229)>=1) & (tk(P227)>=1) & (tk(P222)>=1)))
(potential((tk(P229)>=1) & (tk(P227)>=1) & (tk(P222)>=1)))
(potential((tk(P229)>=1) & (tk(P227)>=1) & (tk(P222)>=1)))
(potential((tk(P229)>=1) & (tk(P227)>=1) & (tk(P222)>=1)))
(potential((tk(P216)>=1) & (tk(P226)>=1)))
(potential((tk(P225)>=1) & (tk(P223)>=1)))
(potential((tk(P217)>=1)))
(potential((tk(P210)>=1) & (tk(P207)>=1) & (tk(P201)>=1) & (tk(P203)>=1) & (tk(P208)>=1) & (tk(P212)>=1)))
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 13625208 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16162040 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-50a"
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-50a, 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-167814499400297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50a.tgz
mv DES-PT-50a 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 ;