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-171683779500522.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-040A, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r365-tall-171683779500522
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 12 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 17:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 17:59 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 256K 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 1716917087811

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-040A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
QuasiLiveness PT
Running Version 202405141337
[2024-05-28 17:24:49] [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:24:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:24:49] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2024-05-28 17:24:49] [INFO ] Transformed 563 places.
[2024-05-28 17:24:49] [INFO ] Transformed 763 transitions.
[2024-05-28 17:24:49] [INFO ] Found NUPN structural information;
[2024-05-28 17:24:49] [INFO ] Parsed PT model containing 563 places and 763 transitions and 3680 arcs in 243 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Applied a total of 2 rules in 64 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
// Phase 1: matrix 762 rows 562 cols
[2024-05-28 17:24:49] [INFO ] Computed 161 invariants in 39 ms
[2024-05-28 17:24:50] [INFO ] Implicit Places using invariants in 564 ms returned []
[2024-05-28 17:24:50] [INFO ] Invariant cache hit.
[2024-05-28 17:24:50] [INFO ] Implicit Places using invariants and state equation in 682 ms returned []
Implicit Place search using SMT with State Equation took 1280 ms to find 0 implicit places.
Running 761 sub problems to find dead transitions.
[2024-05-28 17:24:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 561/561 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 2 (OVERLAPS) 1/562 variables, 161/722 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-05-28 17:25:10] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 39 ms to minimize.
[2024-05-28 17:25:10] [INFO ] Deduced a trap composed of 7 places in 473 ms of which 17 ms to minimize.
[2024-05-28 17:25:10] [INFO ] Deduced a trap composed of 8 places in 257 ms of which 3 ms to minimize.
[2024-05-28 17:25:11] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 5 ms to minimize.
[2024-05-28 17:25:11] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 2 ms to minimize.
[2024-05-28 17:25:11] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 4 ms to minimize.
[2024-05-28 17:25:11] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 3 ms to minimize.
[2024-05-28 17:25:11] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 2 ms to minimize.
[2024-05-28 17:25:11] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 2 ms to minimize.
[2024-05-28 17:25:12] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 2 ms to minimize.
[2024-05-28 17:25:12] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
[2024-05-28 17:25:12] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 2 ms to minimize.
[2024-05-28 17:25:12] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 2 ms to minimize.
[2024-05-28 17:25:12] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 2 ms to minimize.
[2024-05-28 17:25:13] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 2 ms to minimize.
[2024-05-28 17:25:13] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 2 ms to minimize.
[2024-05-28 17:25:13] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:25:13] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 2 ms to minimize.
[2024-05-28 17:25:13] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 3 ms to minimize.
[2024-05-28 17:25:13] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 20/743 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-05-28 17:25:14] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 3 ms to minimize.
[2024-05-28 17:25:14] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 3 ms to minimize.
[2024-05-28 17:25:14] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 2 ms to minimize.
[2024-05-28 17:25:14] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 2 ms to minimize.
[2024-05-28 17:25:15] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 2 ms to minimize.
[2024-05-28 17:25:15] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-05-28 17:25:15] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 2 ms to minimize.
[2024-05-28 17:25:15] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 2 ms to minimize.
[2024-05-28 17:25:15] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 2 ms to minimize.
[2024-05-28 17:25:15] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-28 17:25:15] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 2 ms to minimize.
[2024-05-28 17:25:16] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 2 ms to minimize.
[2024-05-28 17:25:16] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 2 ms to minimize.
[2024-05-28 17:25:16] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-28 17:25:16] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 5 ms to minimize.
[2024-05-28 17:25:16] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 2 ms to minimize.
[2024-05-28 17:25:16] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
[2024-05-28 17:25:17] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-28 17:25:17] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 2 ms to minimize.
[2024-05-28 17:25:17] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 20/763 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-05-28 17:25:18] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 3 ms to minimize.
[2024-05-28 17:25:18] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 2 ms to minimize.
[2024-05-28 17:25:18] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 2 ms to minimize.
[2024-05-28 17:25:18] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 2 ms to minimize.
[2024-05-28 17:25:18] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 2 ms to minimize.
[2024-05-28 17:25:19] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 2 ms to minimize.
[2024-05-28 17:25:19] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 2 ms to minimize.
[2024-05-28 17:25:19] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 2 ms to minimize.
[2024-05-28 17:25:19] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-28 17:25:19] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 3 ms to minimize.
[2024-05-28 17:25:19] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 3 ms to minimize.
[2024-05-28 17:25:20] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-05-28 17:25:20] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 3 ms to minimize.
[2024-05-28 17:25:20] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 2 ms to minimize.
[2024-05-28 17:25:20] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 2 ms to minimize.
[2024-05-28 17:25:20] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-28 17:25:20] [INFO ] Deduced a trap composed of 36 places in 170 ms of which 2 ms to minimize.
[2024-05-28 17:25:21] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 3 ms to minimize.
[2024-05-28 17:25:21] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 2 ms to minimize.
SMT process timed out in 30453ms, After SMT, problems are : Problem set: 0 solved, 761 unsolved
Search for dead transitions found 0 dead transitions in 30482ms
Starting structural reductions in LIVENESS mode, iteration 1 : 562/563 places, 762/763 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 31869 ms. Remains : 562/563 places, 762/763 transitions.
Discarding 240 transitions out of 762. Remains 522
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (72 resets) in 3812 ms. (10 steps per ms) remains 1/521 properties
BEST_FIRST walk for 40002 steps (8 resets) in 345 ms. (115 steps per ms) remains 1/1 properties
[2024-05-28 17:25:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/11 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:25:22] [INFO ] Flatten gal took : 166 ms
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:25:22] [INFO ] Flatten gal took : 77 ms
[2024-05-28 17:25:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3986678626190021404.gal : 53 ms
[2024-05-28 17:25:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2844413293329707182.prop : 1 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/ReachabilityCardinality3986678626190021404.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2844413293329707182.prop' '--nowitness' '--gen-order' 'FOLLOW'
At refinement iteration 5 (OVERLAPS) 551/562 variables, 158/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved

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 ...328
Loading property file /tmp/ReachabilityCardinality2844413293329707182.prop.
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 551/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :3 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 206
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :206 after 1274
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1274 after 57748
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :57748 after 628365
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :628365 after 6.55089e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6.55089e+06 after 6.06166e+08
[2024-05-28 17:25:23] [INFO ] Deduced a trap composed of 11 places in 657 ms of which 1 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6.06166e+08 after 5.72653e+10
[2024-05-28 17:25:23] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 2 ms to minimize.
[2024-05-28 17:25:24] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 1 ms to minimize.
[2024-05-28 17:25:24] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 1 ms to minimize.
[2024-05-28 17:25:24] [INFO ] Deduced a trap composed of 11 places in 287 ms of which 1 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5.72653e+10 after 5.56325e+12
[2024-05-28 17:25:24] [INFO ] Deduced a trap composed of 7 places in 266 ms of which 1 ms to minimize.
[2024-05-28 17:25:25] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2024-05-28 17:25:25] [INFO ] Deduced a trap composed of 10 places in 226 ms of which 1 ms to minimize.
[2024-05-28 17:25:25] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:25:25] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 10/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 762/1324 variables, 562/1295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:25:26] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :5.56325e+12 after 6.0254e+15
[2024-05-28 17:25:26] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 23 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1324 variables, 2/1297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1324 variables, 0/1297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1324 variables, 0/1297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 1297 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3646 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/11 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 551/562 variables, 158/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 551/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 12/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:25:26] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 1 ms to minimize.
[2024-05-28 17:25:26] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 3 ms to minimize.
[2024-05-28 17:25:26] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2024-05-28 17:25:27] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 1 ms to minimize.
[2024-05-28 17:25:27] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-28 17:25:27] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-28 17:25:27] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:25:27] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-28 17:25:27] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-28 17:25:27] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-05-28 17:25:27] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 11/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/562 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 762/1324 variables, 562/1308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1324 variables, 1/1309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:25:27] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 2 ms to minimize.
[2024-05-28 17:25:28] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 2 ms to minimize.
[2024-05-28 17:25:28] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-05-28 17:25:28] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1324 variables, 4/1313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1324 variables, 0/1313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1324 variables, 0/1313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 1313 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2049 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 27/27 constraints]
After SMT, in 5749ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 180 ms.
Support contains 3 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Partial Free-agglomeration rule applied 82 times.
Drop transitions (Partial Free agglomeration) removed 82 transitions
Iterating global reduction 0 with 82 rules applied. Total rules applied 82 place count 562 transition count 762
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 83 place count 561 transition count 761
Applied a total of 83 rules in 220 ms. Remains 561 /562 variables (removed 1) and now considering 761/762 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 561/562 places, 761/762 transitions.
RANDOM walk for 12018 steps (24 resets) in 253 ms. (47 steps per ms) remains 0/1 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 522 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 39751 ms.

BK_STOP 1716917128931

--------------------
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-040A"
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-040A, 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-171683779500522"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-040A.tgz
mv ShieldRVs-PT-040A 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 ;