Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r365-tall-171683779500502.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ShieldRVs-PT-020A, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r365-tall-171683779500502
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 12 18:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 12 18:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 17:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 12 17:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 127K May 18 16:43 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 1716916897832

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldRVs-PT-020A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
QuasiLiveness PT
Running Version 202405141337
[2024-05-28 17:21:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-28 17:21:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:21:39] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2024-05-28 17:21:39] [INFO ] Transformed 283 places.
[2024-05-28 17:21:39] [INFO ] Transformed 383 transitions.
[2024-05-28 17:21:39] [INFO ] Found NUPN structural information;
[2024-05-28 17:21:39] [INFO ] Parsed PT model containing 283 places and 383 transitions and 1840 arcs in 216 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 283/283 places, 383/383 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 282 transition count 382
Applied a total of 2 rules in 49 ms. Remains 282 /283 variables (removed 1) and now considering 382/383 (removed 1) transitions.
// Phase 1: matrix 382 rows 282 cols
[2024-05-28 17:21:39] [INFO ] Computed 81 invariants in 25 ms
[2024-05-28 17:21:39] [INFO ] Implicit Places using invariants in 405 ms returned []
[2024-05-28 17:21:39] [INFO ] Invariant cache hit.
[2024-05-28 17:21:40] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 885 ms to find 0 implicit places.
Running 381 sub problems to find dead transitions.
[2024-05-28 17:21:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 281/281 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (OVERLAPS) 1/282 variables, 81/362 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-05-28 17:21:46] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 26 ms to minimize.
[2024-05-28 17:21:46] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 2 ms to minimize.
[2024-05-28 17:21:46] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:21:46] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-28 17:21:46] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-28 17:21:46] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-05-28 17:21:46] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-05-28 17:21:46] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-28 17:21:46] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-05-28 17:21:46] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2024-05-28 17:21:46] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-05-28 17:21:47] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2024-05-28 17:21:47] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 2 ms to minimize.
[2024-05-28 17:21:47] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:21:47] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:21:47] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2024-05-28 17:21:47] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-05-28 17:21:47] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-28 17:21:47] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-05-28 17:21:47] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 20/383 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-05-28 17:21:47] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 2 ms to minimize.
[2024-05-28 17:21:48] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2024-05-28 17:21:48] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-28 17:21:48] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-28 17:21:48] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 2 ms to minimize.
[2024-05-28 17:21:48] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-05-28 17:21:48] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:21:48] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-05-28 17:21:48] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
[2024-05-28 17:21:48] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-28 17:21:48] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-28 17:21:49] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-05-28 17:21:49] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2024-05-28 17:21:49] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 2 ms to minimize.
[2024-05-28 17:21:49] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2024-05-28 17:21:49] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 2 ms to minimize.
[2024-05-28 17:21:49] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2024-05-28 17:21:49] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 2 ms to minimize.
[2024-05-28 17:21:49] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-28 17:21:49] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 20/403 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-05-28 17:21:50] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 1 ms to minimize.
[2024-05-28 17:21:50] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-28 17:21:50] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-28 17:21:50] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-05-28 17:21:50] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 1 ms to minimize.
[2024-05-28 17:21:50] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 2 ms to minimize.
[2024-05-28 17:21:50] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-28 17:21:51] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 2 ms to minimize.
[2024-05-28 17:21:51] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
[2024-05-28 17:21:51] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 1 ms to minimize.
[2024-05-28 17:21:51] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 2 ms to minimize.
[2024-05-28 17:21:51] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 2 ms to minimize.
[2024-05-28 17:21:51] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
[2024-05-28 17:21:51] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 2 ms to minimize.
[2024-05-28 17:21:51] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-28 17:21:51] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 2 ms to minimize.
[2024-05-28 17:21:51] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2024-05-28 17:21:52] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 2 ms to minimize.
[2024-05-28 17:21:52] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-28 17:21:52] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 20/423 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-05-28 17:21:54] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2024-05-28 17:21:54] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 1 ms to minimize.
[2024-05-28 17:21:54] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 1 ms to minimize.
[2024-05-28 17:21:54] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-28 17:21:54] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 2 ms to minimize.
[2024-05-28 17:21:55] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
[2024-05-28 17:21:55] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 2 ms to minimize.
[2024-05-28 17:21:55] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-28 17:21:55] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2024-05-28 17:21:55] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-05-28 17:21:55] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
[2024-05-28 17:21:55] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-28 17:21:55] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 2 ms to minimize.
[2024-05-28 17:21:55] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 1 ms to minimize.
[2024-05-28 17:21:55] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 2 ms to minimize.
[2024-05-28 17:21:55] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-28 17:21:56] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 2 ms to minimize.
[2024-05-28 17:21:56] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 1 ms to minimize.
[2024-05-28 17:21:56] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 2 ms to minimize.
[2024-05-28 17:21:56] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 20/443 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-05-28 17:21:56] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-28 17:21:57] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 1 ms to minimize.
[2024-05-28 17:21:57] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 1 ms to minimize.
[2024-05-28 17:21:57] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 1 ms to minimize.
[2024-05-28 17:21:57] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 1 ms to minimize.
[2024-05-28 17:21:57] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 2 ms to minimize.
[2024-05-28 17:21:57] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 2 ms to minimize.
[2024-05-28 17:21:58] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 1 ms to minimize.
[2024-05-28 17:21:58] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-28 17:21:58] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
[2024-05-28 17:21:58] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 2 ms to minimize.
[2024-05-28 17:21:58] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 2 ms to minimize.
[2024-05-28 17:21:58] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 2 ms to minimize.
[2024-05-28 17:21:59] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-28 17:21:59] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-28 17:21:59] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-28 17:21:59] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 17/460 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-05-28 17:22:00] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2024-05-28 17:22:00] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 1 ms to minimize.
[2024-05-28 17:22:00] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-28 17:22:01] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2024-05-28 17:22:01] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 2 ms to minimize.
[2024-05-28 17:22:01] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 2 ms to minimize.
[2024-05-28 17:22:01] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 2 ms to minimize.
[2024-05-28 17:22:01] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 1 ms to minimize.
[2024-05-28 17:22:02] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 9/469 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-05-28 17:22:05] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
[2024-05-28 17:22:05] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 1 ms to minimize.
[2024-05-28 17:22:05] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-28 17:22:06] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 4/473 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 12 (OVERLAPS) 382/664 variables, 282/755 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 664/664 variables, and 755 constraints, problems are : Problem set: 0 solved, 381 unsolved in 30029 ms.
Refiners :[Domain max(s): 282/282 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 110/110 constraints]
Escalating to Integer solving :Problem set: 0 solved, 381 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 281/281 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (OVERLAPS) 1/282 variables, 81/362 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 110/473 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 6 (OVERLAPS) 382/664 variables, 282/755 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/664 variables, 381/1136 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-05-28 17:22:20] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-28 17:22:22] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/664 variables, 2/1138 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-05-28 17:22:33] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-28 17:22:36] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-28 17:22:37] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2024-05-28 17:22:37] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-28 17:22:38] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-28 17:22:39] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-28 17:22:39] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 17:22:39] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-05-28 17:22:39] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 664/664 variables, and 1147 constraints, problems are : Problem set: 0 solved, 381 unsolved in 30025 ms.
Refiners :[Domain max(s): 282/282 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 121/121 constraints]
After SMT, in 60245ms problems are : Problem set: 0 solved, 381 unsolved
Search for dead transitions found 0 dead transitions in 60266ms
Starting structural reductions in LIVENESS mode, iteration 1 : 282/283 places, 382/383 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 61229 ms. Remains : 282/283 places, 382/383 transitions.
Discarding 120 transitions out of 382. Remains 262
Initial state reduction rules removed 1 formulas.
[2024-05-28 17:22:41] [INFO ] Flatten gal took : 142 ms
[2024-05-28 17:22:41] [INFO ] Flatten gal took : 77 ms
[2024-05-28 17:22:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13586119223195994670.gal : 35 ms
[2024-05-28 17:22:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3600146040990674553.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13586119223195994670.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3600146040990674553.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality3600146040990674553.prop.
RANDOM walk for 40000 steps (144 resets) in 2845 ms. (14 steps per ms) remains 0/261 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 262 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 62339 ms.

BK_STOP 1716916961512

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="ShieldRVs-PT-020A"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
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-5568"
echo " Executing tool itstools"
echo " Input is ShieldRVs-PT-020A, 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 r365-tall-171683779500502"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-020A.tgz
mv ShieldRVs-PT-020A execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;