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.r364-tall-171683778300632.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 greatspnxred
Input is ShieldRVt-PT-040A, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r364-tall-171683778300632
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K 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 Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 23:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 11 23:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 22:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 11 22:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 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 109K 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 1716917180052

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldRVt-PT-040A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 17:26:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-28 17:26:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:26:21] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-05-28 17:26:21] [INFO ] Transformed 323 places.
[2024-05-28 17:26:21] [INFO ] Transformed 323 transitions.
[2024-05-28 17:26:21] [INFO ] Found NUPN structural information;
[2024-05-28 17:26:21] [INFO ] Parsed PT model containing 323 places and 323 transitions and 1366 arcs in 197 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 323/323 places, 323/323 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 322
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 322 transition count 321
Applied a total of 3 rules in 51 ms. Remains 322 /323 variables (removed 1) and now considering 321/323 (removed 2) transitions.
// Phase 1: matrix 321 rows 322 cols
[2024-05-28 17:26:21] [INFO ] Computed 161 invariants in 30 ms
[2024-05-28 17:26:21] [INFO ] Implicit Places using invariants in 405 ms returned [315]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 437 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 321/323 places, 321/323 transitions.
Applied a total of 0 rules in 8 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 514 ms. Remains : 321/323 places, 321/323 transitions.
Discarding 159 transitions out of 321. Remains 162
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (8 resets) in 2174 ms. (18 steps per ms) remains 90/161 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 90/90 properties
// Phase 1: matrix 321 rows 321 cols
[2024-05-28 17:26:23] [INFO ] Computed 160 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 186/186 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 11/197 variables, 98/284 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 11/295 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 124/321 variables, 62/357 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 124/481 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 321/642 variables, 321/802 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/642 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/642 variables, and 802 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5020 ms.
Refiners :[Domain max(s): 321/321 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 186/186 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 11/197 variables, 98/284 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 11/295 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 124/321 variables, 62/357 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 124/481 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 321/642 variables, 321/802 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/642 variables, 90/892 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/642 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (OVERLAPS) 0/642 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 642/642 variables, and 892 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5008 ms.
Refiners :[Domain max(s): 321/321 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
After SMT, in 10119ms problems are : Problem set: 0 solved, 90 unsolved
Fused 90 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 186 out of 321 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 321/321 places, 321/321 transitions.
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 321 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 321 transition count 303
Applied a total of 36 rules in 78 ms. Remains 321 /321 variables (removed 0) and now considering 303/321 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 321/321 places, 303/321 transitions.
RANDOM walk for 4000000 steps (8 resets) in 60985 ms. (65 steps per ms) remains 45/90 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1687 ms. (236 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1560 ms. (256 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1214 ms. (329 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1198 ms. (333 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1187 ms. (336 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1187 ms. (336 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1189 ms. (336 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1178 ms. (339 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1577 ms. (253 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1916 ms. (208 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1626 ms. (245 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1518 ms. (263 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1223 ms. (326 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1207 ms. (331 steps per ms) remains 39/45 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1285 ms. (311 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1675 ms. (238 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1654 ms. (241 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1659 ms. (240 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1748 ms. (228 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1812 ms. (220 steps per ms) remains 36/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1810 ms. (220 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1390 ms. (287 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1188 ms. (336 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1167 ms. (342 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1159 ms. (344 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1165 ms. (343 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1175 ms. (340 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1202 ms. (332 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1189 ms. (336 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1191 ms. (335 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1184 ms. (337 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1184 ms. (337 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1191 ms. (335 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1534 ms. (260 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1607 ms. (248 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1167 ms. (342 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1180 ms. (338 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1170 ms. (341 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1148 ms. (348 steps per ms) remains 36/36 properties
// Phase 1: matrix 303 rows 321 cols
[2024-05-28 17:27:05] [INFO ] Computed 160 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 13/91 variables, 45/123 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 13/136 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 230/321 variables, 115/251 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 230/481 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 303/624 variables, 321/802 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/624 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (OVERLAPS) 0/624 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 624/624 variables, and 802 constraints, problems are : Problem set: 0 solved, 36 unsolved in 1980 ms.
Refiners :[Domain max(s): 321/321 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 13/91 variables, 45/123 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 13/136 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 230/321 variables, 115/251 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 230/481 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 303/624 variables, 321/802 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/624 variables, 36/838 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/624 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 11 (OVERLAPS) 0/624 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 624/624 variables, and 838 constraints, problems are : Problem set: 0 solved, 36 unsolved in 2266 ms.
Refiners :[Domain max(s): 321/321 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 4280ms problems are : Problem set: 0 solved, 36 unsolved
Fused 36 Parikh solutions to 35 different solutions.
Parikh walk visited 0 properties in 7060 ms.
Support contains 78 out of 321 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 321/321 places, 303/303 transitions.
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 321 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 321 transition count 291
Applied a total of 24 rules in 38 ms. Remains 321 /321 variables (removed 0) and now considering 291/303 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 321/321 places, 291/303 transitions.
RANDOM walk for 4000000 steps (8 resets) in 30902 ms. (129 steps per ms) remains 1/36 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 10437 ms. (383 steps per ms) remains 1/1 properties
// Phase 1: matrix 291 rows 321 cols
[2024-05-28 17:27:28] [INFO ] Computed 160 invariants in 2 ms
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) 4/7 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 314/321 variables, 157/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 314/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 291/612 variables, 321/802 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/612 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/612 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 612/612 variables, and 802 constraints, problems are : Problem set: 0 solved, 1 unsolved in 180 ms.
Refiners :[Domain max(s): 321/321 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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) 4/7 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 314/321 variables, 157/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 314/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 291/612 variables, 321/802 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/612 variables, 1/803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/612 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/612 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 612/612 variables, and 803 constraints, problems are : Problem set: 0 solved, 1 unsolved in 209 ms.
Refiners :[Domain max(s): 321/321 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 402ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 270 ms.
Support contains 3 out of 321 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 321/321 places, 291/291 transitions.
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 321 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 321 transition count 282
Applied a total of 18 rules in 41 ms. Remains 321 /321 variables (removed 0) and now considering 282/291 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 321/321 places, 282/291 transitions.
RANDOM walk for 3270859 steps (6 resets) in 17963 ms. (182 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 162 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 73603 ms.
ITS solved all properties within timeout

BK_STOP 1716917254934

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML

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="ShieldRVt-PT-040A"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is ShieldRVt-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 r364-tall-171683778300632"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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