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-171683779500537.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 ShieldRVs-PT-050B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r530-tall-171683779500537
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K 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.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 17:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 17:19 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 625K 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 1717227994159

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldRVs-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:46:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 07:46:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:46:35] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2024-06-01 07:46:35] [INFO ] Transformed 2003 places.
[2024-06-01 07:46:35] [INFO ] Transformed 2253 transitions.
[2024-06-01 07:46:35] [INFO ] Found NUPN structural information;
[2024-06-01 07:46:35] [INFO ] Parsed PT model containing 2003 places and 2253 transitions and 7200 arcs in 314 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 2003/2003 places, 2253/2253 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2003 transition count 2052
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1802 transition count 2052
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 402 place count 1802 transition count 1802
Deduced a syphon composed of 250 places in 21 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 902 place count 1552 transition count 1802
Performed 800 Post agglomeration using F-continuation condition.Transition count delta: 800
Deduced a syphon composed of 800 places in 2 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 2502 place count 752 transition count 1002
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 2502 rules in 339 ms. Remains 752 /2003 variables (removed 1251) and now considering 1002/2253 (removed 1251) transitions.
// Phase 1: matrix 1002 rows 752 cols
[2024-06-01 07:46:36] [INFO ] Computed 201 invariants in 25 ms
[2024-06-01 07:46:36] [INFO ] Implicit Places using invariants in 609 ms returned []
[2024-06-01 07:46:36] [INFO ] Invariant cache hit.
[2024-06-01 07:46:37] [INFO ] Implicit Places using invariants and state equation in 804 ms returned []
Implicit Place search using SMT with State Equation took 1441 ms to find 0 implicit places.
Running 1001 sub problems to find dead transitions.
[2024-06-01 07:46:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/751 variables, 751/751 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/751 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
At refinement iteration 2 (OVERLAPS) 1/752 variables, 201/952 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
(s104 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0timeout
)
(s105 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/752 variables, 1/953 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 752/1754 variables, and 953 constraints, problems are : Problem set: 0 solved, 1001 unsolved in 30041 ms.
Refiners :[Domain max(s): 752/752 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 0/752 constraints, PredecessorRefiner: 1001/1001 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1001 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/751 variables, 751/751 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/751 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
At refinement iteration 2 (OVERLAPS) 1/752 variables, 201/952 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/752 variables, 1/953 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-06-01 07:47:19] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 9 ms to minimize.
[2024-06-01 07:47:19] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 15 ms to minimize.
[2024-06-01 07:47:19] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 4 ms to minimize.
[2024-06-01 07:47:19] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:47:20] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 0 ms to minimize.
[2024-06-01 07:47:20] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 11 ms to minimize.
[2024-06-01 07:47:20] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 1 ms to minimize.
[2024-06-01 07:47:20] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:47:20] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 1 ms to minimize.
[2024-06-01 07:47:20] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 1 ms to minimize.
[2024-06-01 07:47:20] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 9 ms to minimize.
[2024-06-01 07:47:21] [INFO ] Deduced a trap composed of 14 places in 200 ms of which 1 ms to minimize.
[2024-06-01 07:47:21] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 1 ms to minimize.
[2024-06-01 07:47:21] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:47:21] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:47:21] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:47:21] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:47:21] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:47:21] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:47:22] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/752 variables, 20/973 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-06-01 07:47:22] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:47:22] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:47:22] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:47:22] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:47:22] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:47:22] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:47:22] [INFO ] Deduced a trap composed of 102 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:47:23] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:47:23] [INFO ] Deduced a trap composed of 103 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:47:23] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:47:23] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:47:23] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:47:23] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:47:23] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 5 ms to minimize.
[2024-06-01 07:47:23] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:47:23] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:47:23] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:47:24] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:47:24] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:47:24] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/752 variables, 20/993 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-06-01 07:47:24] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:47:24] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:47:24] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:47:25] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:47:25] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:47:25] [INFO ] Deduced a trap composed of 104 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:47:25] [INFO ] Deduced a trap composed of 103 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:47:25] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:47:25] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:47:25] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:47:25] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:47:25] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:47:25] [INFO ] Deduced a trap composed of 108 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:47:25] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:47:26] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:47:26] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 4 ms to minimize.
[2024-06-01 07:47:26] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:47:26] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:47:26] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:47:26] [INFO ] Deduced a trap composed of 96 places in 73 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/752 variables, 20/1013 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-06-01 07:47:27] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:47:27] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:47:27] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:47:27] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:47:27] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:47:27] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:47:27] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:47:27] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:47:27] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:47:27] [INFO ] Deduced a trap composed of 105 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:47:28] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:47:28] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:47:28] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:47:28] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:47:28] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:47:28] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:47:28] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:47:28] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:47:28] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:47:28] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 20/1033 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-06-01 07:47:29] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:47:29] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:47:29] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:47:30] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:47:30] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:47:30] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:47:30] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:47:30] [INFO ] Deduced a trap composed of 95 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:47:30] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:47:30] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:47:30] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:47:30] [INFO ] Deduced a trap composed of 93 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:47:30] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:47:30] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:47:31] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:47:31] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:47:31] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:47:31] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:47:31] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:47:31] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 20/1053 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-06-01 07:47:32] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:47:32] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:47:32] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:47:32] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:47:32] [INFO ] Deduced a trap composed of 94 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:47:32] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:47:33] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:47:33] [INFO ] Deduced a trap composed of 92 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:47:33] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 0 ms to minimize.
[2024-06-01 07:47:33] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:47:33] [INFO ] Deduced a trap composed of 97 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:47:33] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:47:33] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:47:33] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:47:33] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:47:33] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:47:33] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:47:33] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:47:34] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:47:34] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/752 variables, 20/1073 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2024-06-01 07:47:34] [INFO ] Deduced a trap composed of 97 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:47:35] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:47:35] [INFO ] Deduced a trap composed of 97 places in 90 ms of which 5 ms to minimize.
[2024-06-01 07:47:35] [INFO ] Deduced a trap composed of 97 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:47:35] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:47:35] [INFO ] Deduced a trap composed of 96 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:47:35] [INFO ] Deduced a trap composed of 89 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:47:35] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:47:35] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:47:36] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:47:36] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:47:36] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:47:36] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:47:36] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:47:36] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:47:36] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:47:36] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:47:36] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:47:37] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:47:37] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/752 variables, 20/1093 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 752/1754 variables, and 1093 constraints, problems are : Problem set: 0 solved, 1001 unsolved in 30023 ms.
Refiners :[Domain max(s): 752/752 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 0/752 constraints, PredecessorRefiner: 0/1001 constraints, Known Traps: 140/140 constraints]
After SMT, in 60627ms problems are : Problem set: 0 solved, 1001 unsolved
Search for dead transitions found 0 dead transitions in 60665ms
Starting structural reductions in LIVENESS mode, iteration 1 : 752/2003 places, 1002/2253 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 62477 ms. Remains : 752/2003 places, 1002/2253 transitions.
Discarding 300 transitions out of 1002. Remains 702
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (58 resets) in 4348 ms. (9 steps per ms) remains 4/701 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 3/3 properties
[2024-06-01 07:47:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 27/36 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 27/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 716/752 variables, 192/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/752 variables, 716/953 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:47:40] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:47:40] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 4 ms to minimize.
[2024-06-01 07:47:40] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:47:40] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:47:40] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:47:41] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:47:41] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:47:41] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:47:41] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:47:41] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:47:41] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:47:42] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:47:42] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:47:42] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:47:42] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:47:42] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:47:42] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:47:42] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:47:43] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:47:43] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 20/973 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:47:43] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:47:43] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:47:43] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:47:43] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:47:43] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:47:43] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:47:43] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:47:44] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:47:44] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:47:44] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:47:44] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:47:44] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-06-01 07:47:44] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:47:44] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 14/987 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/752 variables, 0/987 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 5041ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1002/1002 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 702 transition count 952
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 702 transition count 952
Partial Free-agglomeration rule applied 100 times.
Drop transitions (Partial Free agglomeration) removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 200 place count 702 transition count 952
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 201 place count 701 transition count 951
Applied a total of 201 rules in 239 ms. Remains 701 /752 variables (removed 51) and now considering 951/1002 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 239 ms. Remains : 701/752 places, 951/1002 transitions.
RANDOM walk for 48111 steps (81 resets) in 465 ms. (103 steps per ms) remains 0/3 properties
Able to resolve query QuasiLiveness after proving 702 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 69760 ms.
ITS solved all properties within timeout

BK_STOP 1717228065184

--------------------
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="ShieldRVs-PT-050B"
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 ShieldRVs-PT-050B, 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-171683779500537"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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