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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K 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 4.0K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:56 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:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 02:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 02:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 12 01:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 01:27 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 136K 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 1717228432124

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldRVt-PT-050A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:53:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 07:53:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:53:53] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-06-01 07:53:53] [INFO ] Transformed 403 places.
[2024-06-01 07:53:53] [INFO ] Transformed 403 transitions.
[2024-06-01 07:53:53] [INFO ] Found NUPN structural information;
[2024-06-01 07:53:53] [INFO ] Parsed PT model containing 403 places and 403 transitions and 1706 arcs in 192 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 403/403 places, 403/403 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 403 transition count 402
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 1 with 2 rules applied. Total rules applied 3 place count 402 transition count 401
Applied a total of 3 rules in 55 ms. Remains 402 /403 variables (removed 1) and now considering 401/403 (removed 2) transitions.
// Phase 1: matrix 401 rows 402 cols
[2024-06-01 07:53:53] [INFO ] Computed 201 invariants in 28 ms
[2024-06-01 07:53:53] [INFO ] Implicit Places using invariants in 403 ms returned [395]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 431 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 401/403 places, 401/403 transitions.
Applied a total of 0 rules in 9 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 511 ms. Remains : 401/403 places, 401/403 transitions.
Discarding 199 transitions out of 401. Remains 202
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (8 resets) in 2453 ms. (16 steps per ms) remains 151/201 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 151/151 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 151/151 properties
BEST_FIRST walk for 401 steps (8 resets) in 10 ms. (36 steps per ms) remains 151/151 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 151/151 properties
BEST_FIRST walk for 401 steps (8 resets) in 14 ms. (26 steps per ms) remains 151/151 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 151/151 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 151/151 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 151/151 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 151/151 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 151/151 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 151/151 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 151/151 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 151/151 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 151/151 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 151/151 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 151/151 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 151/151 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 151/151 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 151/151 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 151/151 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 151/151 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 151/151 properties
BEST_FIRST walk for 403 steps (8 resets) in 21 ms. (18 steps per ms) remains 151/151 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 151/151 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 151/151 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 151/151 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 151/151 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 151/151 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 151/151 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 151/151 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 151/151 properties
BEST_FIRST walk for 401 steps (8 resets) in 8 ms. (44 steps per ms) remains 151/151 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 151/151 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 151/151 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 151/151 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 151/151 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 151/151 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 151/151 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 151/151 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 151/151 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 151/151 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 151/151 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 151/151 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 151/151 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 151/151 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 151/151 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 151/151 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 151/151 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 151/151 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 151/151 properties
// Phase 1: matrix 401 rows 401 cols
[2024-06-01 07:53:55] [INFO ] Computed 200 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (OVERLAPS) 5/311 variables, 155/461 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 5/466 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (OVERLAPS) 90/401 variables, 45/511 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 90/601 constraints. Problems are: Problem set: 0 solved, 151 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 401/802 variables, and 601 constraints, problems are : Problem set: 0 solved, 151 unsolved in 5027 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/401 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (OVERLAPS) 5/311 variables, 155/461 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 5/466 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (OVERLAPS) 90/401 variables, 45/511 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 90/601 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (OVERLAPS) 401/802 variables, 401/1002 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/802 variables, 151/1153 constraints. Problems are: Problem set: 0 solved, 151 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 802/802 variables, and 1153 constraints, problems are : Problem set: 0 solved, 151 unsolved in 5019 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints]
After SMT, in 10172ms problems are : Problem set: 0 solved, 151 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 306 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 401/401 transitions.
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 401 transition count 401
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 401 transition count 388
Applied a total of 26 rules in 43 ms. Remains 401 /401 variables (removed 0) and now considering 388/401 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 401/401 places, 388/401 transitions.
RANDOM walk for 4000000 steps (8 resets) in 56190 ms. (71 steps per ms) remains 74/151 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1506 ms. (265 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1501 ms. (266 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1501 ms. (266 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1508 ms. (265 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1517 ms. (263 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1501 ms. (266 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1505 ms. (265 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1519 ms. (263 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1506 ms. (265 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1515 ms. (263 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1506 ms. (265 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1527 ms. (261 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1522 ms. (262 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1527 ms. (261 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1518 ms. (263 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1512 ms. (264 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1509 ms. (264 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1509 ms. (264 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1490 ms. (268 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1488 ms. (268 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1516 ms. (263 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1506 ms. (265 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1500 ms. (266 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1512 ms. (264 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1519 ms. (263 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1504 ms. (265 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1517 ms. (263 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1521 ms. (262 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1515 ms. (263 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1507 ms. (265 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1503 ms. (265 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1510 ms. (264 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1495 ms. (267 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1488 ms. (268 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1505 ms. (265 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1482 ms. (269 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1489 ms. (268 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1478 ms. (270 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1511 ms. (264 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1521 ms. (262 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1501 ms. (266 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1505 ms. (265 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1517 ms. (263 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1501 ms. (266 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1513 ms. (264 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1497 ms. (267 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1507 ms. (265 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1498 ms. (266 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1514 ms. (264 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1508 ms. (265 steps per ms) remains 74/74 properties
// Phase 1: matrix 388 rows 401 cols
[2024-06-01 07:54:41] [INFO ] Computed 200 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 154/154 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 13/167 variables, 83/237 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 13/250 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 234/401 variables, 117/367 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 234/601 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 388/789 variables, 401/1002 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/789 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/789 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 789/789 variables, and 1002 constraints, problems are : Problem set: 0 solved, 74 unsolved in 5004 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 154/154 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 13/167 variables, 83/237 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 13/250 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 234/401 variables, 117/367 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 234/601 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 388/789 variables, 401/1002 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/789 variables, 74/1076 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/789 variables, 0/1076 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (OVERLAPS) 0/789 variables, 0/1076 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 789/789 variables, and 1076 constraints, problems are : Problem set: 0 solved, 74 unsolved in 5359 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 10417ms problems are : Problem set: 0 solved, 74 unsolved
Finished Parikh walk after 12627 steps, including 964 resets, run visited all 1 properties in 73 ms. (steps per millisecond=172 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 74 properties in 16853 ms.
Able to resolve query QuasiLiveness after proving 202 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 75235 ms.
ITS solved all properties within timeout

BK_STOP 1717228508582

--------------------
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-050A"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldRVt-PT-050A, 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 r530-tall-171683779800642"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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