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-171683777800402.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 ShieldPPPt-PT-030A, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r364-tall-171683777800402
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.1K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 15:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 170K Apr 11 15:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 15:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 11 15:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 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 201K 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 1716914020252

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldPPPt-PT-030A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 16:33:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-28 16:33:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 16:33:41] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2024-05-28 16:33:41] [INFO ] Transformed 753 places.
[2024-05-28 16:33:41] [INFO ] Transformed 543 transitions.
[2024-05-28 16:33:41] [INFO ] Found NUPN structural information;
[2024-05-28 16:33:41] [INFO ] Parsed PT model containing 753 places and 543 transitions and 2166 arcs in 251 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 753/753 places, 543/543 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 753 transition count 542
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 12 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 5 place count 751 transition count 540
Applied a total of 5 rules in 67 ms. Remains 751 /753 variables (removed 2) and now considering 540/543 (removed 3) transitions.
// Phase 1: matrix 540 rows 751 cols
[2024-05-28 16:33:41] [INFO ] Computed 331 invariants in 27 ms
[2024-05-28 16:33:42] [INFO ] Implicit Places using invariants in 682 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 712 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 750/753 places, 540/543 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 750 transition count 538
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 748 transition count 538
Applied a total of 4 rules in 22 ms. Remains 748 /750 variables (removed 2) and now considering 538/540 (removed 2) transitions.
// Phase 1: matrix 538 rows 748 cols
[2024-05-28 16:33:42] [INFO ] Computed 330 invariants in 5 ms
[2024-05-28 16:33:42] [INFO ] Implicit Places using invariants in 438 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 440 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 746/753 places, 538/543 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 744 transition count 536
Applied a total of 4 rules in 21 ms. Remains 744 /746 variables (removed 2) and now considering 536/538 (removed 2) transitions.
// Phase 1: matrix 536 rows 744 cols
[2024-05-28 16:33:42] [INFO ] Computed 328 invariants in 6 ms
[2024-05-28 16:33:43] [INFO ] Implicit Places using invariants in 403 ms returned []
[2024-05-28 16:33:43] [INFO ] Invariant cache hit.
[2024-05-28 16:33:44] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 1054 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 3 : 744/753 places, 536/543 transitions.
Finished structural reductions in LIVENESS mode , in 3 iterations and 2335 ms. Remains : 744/753 places, 536/543 transitions.
Discarding 119 transitions out of 536. Remains 417
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (8 resets) in 2976 ms. (13 steps per ms) remains 229/416 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 229/229 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 229/229 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 229/229 properties
BEST_FIRST walk for 404 steps (8 resets) in 21 ms. (18 steps per ms) remains 229/229 properties
BEST_FIRST walk for 404 steps (8 resets) in 39 ms. (10 steps per ms) remains 229/229 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 229/229 properties
BEST_FIRST walk for 402 steps (8 resets) in 19 ms. (20 steps per ms) remains 229/229 properties
BEST_FIRST walk for 403 steps (8 resets) in 23 ms. (16 steps per ms) remains 229/229 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 229/229 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 229/229 properties
BEST_FIRST walk for 403 steps (8 resets) in 22 ms. (17 steps per ms) remains 229/229 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 229/229 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 229/229 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 229/229 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 229/229 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 229/229 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 229/229 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 229/229 properties
BEST_FIRST walk for 401 steps (8 resets) in 11 ms. (33 steps per ms) remains 229/229 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 229/229 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 229/229 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 229/229 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 229/229 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 229/229 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 229/229 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 229/229 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 229/229 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 229/229 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 229/229 properties
BEST_FIRST walk for 401 steps (8 resets) in 8 ms. (44 steps per ms) remains 229/229 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 229/229 properties
BEST_FIRST walk for 401 steps (8 resets) in 9 ms. (40 steps per ms) remains 229/229 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 229/229 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 229/229 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 229/229 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 229/229 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 229/229 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 229/229 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 229/229 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 229/229 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 229/229 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 229/229 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 229/229 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 229/229 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 229/229 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 229/229 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 229/229 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 229/229 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 229/229 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 229/229 properties
[2024-05-28 16:33:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 412/412 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 13/425 variables, 187/599 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 13/612 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 1.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 1.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 1.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 1.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 1.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 1.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 1.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 1.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 1.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 timeout
0.0)
(s207 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 425/1280 variables, and 612 constraints, problems are : Problem set: 0 solved, 229 unsolved in 5018 ms.
Refiners :[Domain max(s): 425/744 constraints, Positive P Invariants (semi-flows): 187/328 constraints, State Equation: 0/744 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 412/412 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 13/425 variables, 187/599 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 13/612 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 319/744 variables, 141/753 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/744 variables, 319/1072 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 744/1280 variables, and 1072 constraints, problems are : Problem set: 0 solved, 229 unsolved in 5009 ms.
Refiners :[Domain max(s): 744/744 constraints, Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 0/744 constraints, PredecessorRefiner: 0/229 constraints, Known Traps: 0/0 constraints]
After SMT, in 10168ms problems are : Problem set: 0 solved, 229 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 412 out of 744 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 744/744 places, 536/536 transitions.
Partial Free-agglomeration rule applied 51 times.
Drop transitions (Partial Free agglomeration) removed 51 transitions
Iterating global reduction 0 with 51 rules applied. Total rules applied 51 place count 744 transition count 536
Applied a total of 51 rules in 73 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 744/744 places, 536/536 transitions.
RANDOM walk for 4000000 steps (8 resets) in 56168 ms. (71 steps per ms) remains 43/229 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1662 ms. (240 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1597 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1589 ms. (251 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1560 ms. (256 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1543 ms. (259 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1562 ms. (255 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1584 ms. (252 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1609 ms. (248 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1588 ms. (251 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1585 ms. (252 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1552 ms. (257 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1535 ms. (260 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1554 ms. (257 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1547 ms. (258 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1541 ms. (259 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1526 ms. (261 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1534 ms. (260 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1545 ms. (258 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2073 ms. (192 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1750 ms. (228 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1580 ms. (253 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1559 ms. (256 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1565 ms. (255 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1577 ms. (253 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1645 ms. (243 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1535 ms. (260 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1561 ms. (256 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1563 ms. (255 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1703 ms. (234 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1537 ms. (260 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1535 ms. (260 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1529 ms. (261 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1562 ms. (255 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1547 ms. (258 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1548 ms. (258 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1563 ms. (255 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1590 ms. (251 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2189 ms. (182 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1586 ms. (252 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1593 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1603 ms. (249 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1592 ms. (251 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1563 ms. (255 steps per ms) remains 43/43 properties
// Phase 1: matrix 536 rows 744 cols
[2024-05-28 16:34:30] [INFO ] Computed 328 invariants in 3 ms
[2024-05-28 16:34:30] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 19/100 variables, 44/125 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 19/144 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (OVERLAPS) 644/744 variables, 284/428 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/744 variables, 644/1072 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/744 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 536/1280 variables, 744/1816 constraints. Problems are: Problem set: 0 solved, 43 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1280 variables, 14/1830 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1280 variables, 0/1830 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (OVERLAPS) 0/1280 variables, 0/1830 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1280/1280 variables, and 1830 constraints, problems are : Problem set: 0 solved, 43 unsolved in 3344 ms.
Refiners :[Domain max(s): 744/744 constraints, Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 744/744 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 19/100 variables, 44/125 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 19/144 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (OVERLAPS) 644/744 variables, 284/428 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/744 variables, 644/1072 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/744 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 536/1280 variables, 744/1816 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1280 variables, 14/1830 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1280 variables, 43/1873 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1280 variables, 0/1873 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 12 (OVERLAPS) 0/1280 variables, 0/1873 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1280/1280 variables, and 1873 constraints, problems are : Problem set: 0 solved, 43 unsolved in 5747 ms.
Refiners :[Domain max(s): 744/744 constraints, Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 744/744 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 9129ms problems are : Problem set: 0 solved, 43 unsolved
Fused 43 Parikh solutions to 41 different solutions.
Parikh walk visited 3 properties in 14550 ms.
Support contains 75 out of 744 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 744/744 places, 536/536 transitions.
Partial Free-agglomeration rule applied 54 times.
Drop transitions (Partial Free agglomeration) removed 54 transitions
Iterating global reduction 0 with 54 rules applied. Total rules applied 54 place count 744 transition count 536
Applied a total of 54 rules in 64 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 744/744 places, 536/536 transitions.
RANDOM walk for 1492664 steps (3 resets) in 15004 ms. (99 steps per ms) remains 0/40 properties
Able to resolve query QuasiLiveness after proving 417 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 79093 ms.
ITS solved all properties within timeout

BK_STOP 1716914100536

--------------------
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="ShieldPPPt-PT-030A"
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 ShieldPPPt-PT-030A, 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-171683777800402"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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