Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r224-tall-174902010000287.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is SieveSingleMsgMbox-PT-d2m06, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-174902010000287
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 1.1M May 29 14:33 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 1749107421141

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SieveSingleMsgMbox-PT-d2m06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-05 07:10:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-05 07:10:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 07:10:22] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2025-06-05 07:10:22] [INFO ] Transformed 2398 places.
[2025-06-05 07:10:22] [INFO ] Transformed 1954 transitions.
[2025-06-05 07:10:22] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 281 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 2398/2398 places, 1954/1954 transitions.
Reduce places removed 2009 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 2837 rules applied. Total rules applied 2837 place count 389 transition count 1126
Applied a total of 2837 rules in 65 ms. Remains 389 /2398 variables (removed 2009) and now considering 1126/1954 (removed 828) transitions.
// Phase 1: matrix 1126 rows 389 cols
[2025-06-05 07:10:22] [INFO ] Computed 5 invariants in 49 ms
[2025-06-05 07:10:23] [INFO ] Implicit Places using invariants in 501 ms returned []
[2025-06-05 07:10:23] [INFO ] Invariant cache hit.
[2025-06-05 07:10:23] [INFO ] State equation strengthened by 846 read => feed constraints.
[2025-06-05 07:10:25] [INFO ] Implicit Places using invariants and state equation in 2626 ms returned []
Implicit Place search using SMT with State Equation took 3158 ms to find 0 implicit places.
Running 1125 sub problems to find dead transitions.
[2025-06-05 07:10:26] [INFO ] Invariant cache hit.
[2025-06-05 07:10:26] [INFO ] State equation strengthened by 846 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1125 unsolved
[2025-06-05 07:10:44] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 21 ms to minimize.
[2025-06-05 07:10:45] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1125 unsolved
[2025-06-05 07:10:52] [INFO ] Deduced a trap composed of 103 places in 123 ms of which 2 ms to minimize.
[2025-06-05 07:10:52] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 3 ms to minimize.
[2025-06-05 07:10:52] [INFO ] Deduced a trap composed of 52 places in 116 ms of which 2 ms to minimize.
[2025-06-05 07:10:52] [INFO ] Deduced a trap composed of 48 places in 114 ms of which 3 ms to minimize.
[2025-06-05 07:10:53] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1125 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 388/1515 variables, and 11 constraints, problems are : Problem set: 0 solved, 1125 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/389 constraints, ReadFeed: 0/846 constraints, PredecessorRefiner: 1125/1125 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1125 unsolved
At refinement iteration 4 (OVERLAPS) 1/389 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1125 unsolved
[2025-06-05 07:11:16] [INFO ] Deduced a trap composed of 44 places in 177 ms of which 3 ms to minimize.
[2025-06-05 07:11:17] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 2 ms to minimize.
[2025-06-05 07:11:17] [INFO ] Deduced a trap composed of 109 places in 177 ms of which 2 ms to minimize.
[2025-06-05 07:11:17] [INFO ] Deduced a trap composed of 115 places in 124 ms of which 2 ms to minimize.
[2025-06-05 07:11:17] [INFO ] Deduced a trap composed of 115 places in 126 ms of which 2 ms to minimize.
[2025-06-05 07:11:17] [INFO ] Deduced a trap composed of 120 places in 138 ms of which 2 ms to minimize.
[2025-06-05 07:11:17] [INFO ] Deduced a trap composed of 114 places in 140 ms of which 2 ms to minimize.
[2025-06-05 07:11:18] [INFO ] Deduced a trap composed of 115 places in 146 ms of which 2 ms to minimize.
[2025-06-05 07:11:18] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 2 ms to minimize.
[2025-06-05 07:11:18] [INFO ] Deduced a trap composed of 111 places in 133 ms of which 2 ms to minimize.
[2025-06-05 07:11:18] [INFO ] Deduced a trap composed of 110 places in 143 ms of which 2 ms to minimize.
[2025-06-05 07:11:18] [INFO ] Deduced a trap composed of 109 places in 122 ms of which 2 ms to minimize.
[2025-06-05 07:11:18] [INFO ] Deduced a trap composed of 119 places in 139 ms of which 3 ms to minimize.
[2025-06-05 07:11:19] [INFO ] Deduced a trap composed of 145 places in 144 ms of which 2 ms to minimize.
[2025-06-05 07:11:19] [INFO ] Deduced a trap composed of 105 places in 120 ms of which 2 ms to minimize.
[2025-06-05 07:11:19] [INFO ] Deduced a trap composed of 111 places in 106 ms of which 2 ms to minimize.
[2025-06-05 07:11:19] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 3 ms to minimize.
[2025-06-05 07:11:19] [INFO ] Deduced a trap composed of 196 places in 127 ms of which 2 ms to minimize.
[2025-06-05 07:11:19] [INFO ] Deduced a trap composed of 110 places in 112 ms of which 2 ms to minimize.
[2025-06-05 07:11:19] [INFO ] Deduced a trap composed of 199 places in 110 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 1125 unsolved
[2025-06-05 07:11:21] [INFO ] Deduced a trap composed of 151 places in 88 ms of which 1 ms to minimize.
[2025-06-05 07:11:21] [INFO ] Deduced a trap composed of 151 places in 104 ms of which 2 ms to minimize.
[2025-06-05 07:11:21] [INFO ] Deduced a trap composed of 151 places in 107 ms of which 2 ms to minimize.
[2025-06-05 07:11:21] [INFO ] Deduced a trap composed of 156 places in 100 ms of which 2 ms to minimize.
[2025-06-05 07:11:28] [INFO ] Deduced a trap composed of 201 places in 127 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 1125 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/1515 variables, and 37 constraints, problems are : Problem set: 0 solved, 1125 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/389 constraints, ReadFeed: 0/846 constraints, PredecessorRefiner: 0/1125 constraints, Known Traps: 32/32 constraints]
After SMT, in 64691ms problems are : Problem set: 0 solved, 1125 unsolved
Search for dead transitions found 0 dead transitions in 64722ms
Starting structural reductions in LIVENESS mode, iteration 1 : 389/2398 places, 1126/1954 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 67981 ms. Remains : 389/2398 places, 1126/1954 transitions.
Discarding 748 transitions out of 1126. Remains 378
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (8849 resets) in 3080 ms. (12 steps per ms) remains 353/377 properties
BEST_FIRST walk for 404 steps (17 resets) in 13 ms. (28 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (17 resets) in 10 ms. (36 steps per ms) remains 353/353 properties
BEST_FIRST walk for 402 steps (14 resets) in 10 ms. (36 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (13 resets) in 27 ms. (14 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (15 resets) in 37 ms. (10 steps per ms) remains 353/353 properties
BEST_FIRST walk for 404 steps (19 resets) in 22 ms. (17 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (18 resets) in 71 ms. (5 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (14 resets) in 25 ms. (15 steps per ms) remains 353/353 properties
BEST_FIRST walk for 402 steps (19 resets) in 41 ms. (9 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (14 resets) in 16 ms. (23 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (15 resets) in 12 ms. (31 steps per ms) remains 353/353 properties
BEST_FIRST walk for 402 steps (20 resets) in 8 ms. (44 steps per ms) remains 353/353 properties
BEST_FIRST walk for 404 steps (22 resets) in 26 ms. (14 steps per ms) remains 353/353 properties
BEST_FIRST walk for 404 steps (20 resets) in 11 ms. (33 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (17 resets) in 10 ms. (36 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (20 resets) in 10 ms. (36 steps per ms) remains 353/353 properties
BEST_FIRST walk for 401 steps (14 resets) in 12 ms. (30 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (24 resets) in 29 ms. (13 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (16 resets) in 15 ms. (25 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (21 resets) in 12 ms. (31 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (14 resets) in 13 ms. (28 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (20 resets) in 10 ms. (36 steps per ms) remains 353/353 properties
BEST_FIRST walk for 402 steps (12 resets) in 9 ms. (40 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (16 resets) in 17 ms. (22 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (17 resets) in 11 ms. (33 steps per ms) remains 353/353 properties
BEST_FIRST walk for 404 steps (19 resets) in 12 ms. (31 steps per ms) remains 353/353 properties
BEST_FIRST walk for 402 steps (12 resets) in 39 ms. (10 steps per ms) remains 353/353 properties
BEST_FIRST walk for 402 steps (20 resets) in 10 ms. (36 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (17 resets) in 9 ms. (40 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (20 resets) in 8 ms. (44 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (24 resets) in 9 ms. (40 steps per ms) remains 353/353 properties
BEST_FIRST walk for 404 steps (17 resets) in 10 ms. (36 steps per ms) remains 353/353 properties
BEST_FIRST walk for 404 steps (14 resets) in 8 ms. (44 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (22 resets) in 9 ms. (40 steps per ms) remains 353/353 properties
BEST_FIRST walk for 401 steps (13 resets) in 8 ms. (44 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (19 resets) in 7 ms. (50 steps per ms) remains 353/353 properties
BEST_FIRST walk for 404 steps (18 resets) in 8 ms. (44 steps per ms) remains 353/353 properties
BEST_FIRST walk for 404 steps (19 resets) in 8 ms. (44 steps per ms) remains 353/353 properties
BEST_FIRST walk for 404 steps (12 resets) in 9 ms. (40 steps per ms) remains 353/353 properties
BEST_FIRST walk for 404 steps (16 resets) in 9 ms. (40 steps per ms) remains 353/353 properties
BEST_FIRST walk for 404 steps (18 resets) in 11 ms. (33 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (16 resets) in 8 ms. (44 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (18 resets) in 9 ms. (40 steps per ms) remains 353/353 properties
BEST_FIRST walk for 404 steps (13 resets) in 9 ms. (40 steps per ms) remains 353/353 properties
BEST_FIRST walk for 404 steps (18 resets) in 8 ms. (44 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (18 resets) in 10 ms. (36 steps per ms) remains 353/353 properties
BEST_FIRST walk for 402 steps (14 resets) in 12 ms. (30 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (22 resets) in 9 ms. (40 steps per ms) remains 353/353 properties
BEST_FIRST walk for 404 steps (20 resets) in 9 ms. (40 steps per ms) remains 353/353 properties
BEST_FIRST walk for 402 steps (14 resets) in 7 ms. (50 steps per ms) remains 353/353 properties
Probabilistic random walk after 100001 steps, saw 43578 distinct states, run finished after 2033 ms. (steps per millisecond=49 ) properties seen :220
[2025-06-05 07:11:34] [INFO ] Invariant cache hit.
[2025-06-05 07:11:34] [INFO ] State equation strengthened by 846 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 145/287 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 68/355 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2025-06-05 07:11:37] [INFO ] Deduced a trap composed of 104 places in 102 ms of which 2 ms to minimize.
[2025-06-05 07:11:37] [INFO ] Deduced a trap composed of 109 places in 118 ms of which 3 ms to minimize.
[2025-06-05 07:11:37] [INFO ] Deduced a trap composed of 109 places in 111 ms of which 5 ms to minimize.
[2025-06-05 07:11:38] [INFO ] Deduced a trap composed of 116 places in 117 ms of which 2 ms to minimize.
[2025-06-05 07:11:38] [INFO ] Deduced a trap composed of 109 places in 145 ms of which 2 ms to minimize.
[2025-06-05 07:11:38] [INFO ] Deduced a trap composed of 109 places in 123 ms of which 3 ms to minimize.
[2025-06-05 07:11:38] [INFO ] Deduced a trap composed of 196 places in 112 ms of which 2 ms to minimize.
[2025-06-05 07:11:38] [INFO ] Deduced a trap composed of 107 places in 114 ms of which 6 ms to minimize.
[2025-06-05 07:11:38] [INFO ] Deduced a trap composed of 101 places in 128 ms of which 2 ms to minimize.
[2025-06-05 07:11:38] [INFO ] Deduced a trap composed of 102 places in 108 ms of which 2 ms to minimize.
[2025-06-05 07:11:38] [INFO ] Deduced a trap composed of 201 places in 106 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 1.0)
(s292 1.0)
(s293 1.0)
(s298 1.0)
(s300 1.0)
(s302 1.0)
(s304 0.0)
(s306 1.0)
(s308 0.0)
(s310 0.0)
(s312 0.0)
(s314 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 355/1515 variables, and 16 constraints, problems are : Problem set: 0 solved, 133 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/389 constraints, ReadFeed: 0/846 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 145/287 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 68/355 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2025-06-05 07:11:41] [INFO ] Deduced a trap composed of 109 places in 102 ms of which 3 ms to minimize.
[2025-06-05 07:11:42] [INFO ] Deduced a trap composed of 109 places in 112 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 965/1320 variables, 355/373 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1320 variables, 685/1058 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1320/1515 variables, and 1093 constraints, problems are : Problem set: 0 solved, 133 unsolved in 5039 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 355/389 constraints, ReadFeed: 685/846 constraints, PredecessorRefiner: 35/133 constraints, Known Traps: 13/13 constraints]
After SMT, in 10549ms problems are : Problem set: 0 solved, 133 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 142 out of 389 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 389/389 places, 1126/1126 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 329 transition count 898
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 329 transition count 898
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 143 place count 329 transition count 875
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 179 place count 293 transition count 839
Iterating global reduction 1 with 36 rules applied. Total rules applied 215 place count 293 transition count 839
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 228 place count 293 transition count 826
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 241 place count 280 transition count 811
Iterating global reduction 2 with 13 rules applied. Total rules applied 254 place count 280 transition count 811
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 260 place count 280 transition count 805
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 263 place count 277 transition count 800
Iterating global reduction 3 with 3 rules applied. Total rules applied 266 place count 277 transition count 800
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 269 place count 274 transition count 797
Iterating global reduction 3 with 3 rules applied. Total rules applied 272 place count 274 transition count 797
Applied a total of 272 rules in 166 ms. Remains 274 /389 variables (removed 115) and now considering 797/1126 (removed 329) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 274/389 places, 797/1126 transitions.
RANDOM walk for 4000000 steps (897665 resets) in 50271 ms. (79 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (1920 resets) in 167 ms. (238 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (1879 resets) in 160 ms. (248 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (1899 resets) in 162 ms. (245 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (1889 resets) in 160 ms. (248 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (1857 resets) in 172 ms. (231 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (1922 resets) in 176 ms. (226 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (1945 resets) in 164 ms. (242 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (1893 resets) in 159 ms. (250 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (1926 resets) in 161 ms. (246 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (1832 resets) in 163 ms. (243 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (1904 resets) in 159 ms. (250 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (1874 resets) in 162 ms. (245 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (1951 resets) in 165 ms. (240 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (1880 resets) in 167 ms. (238 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (1874 resets) in 158 ms. (251 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (1873 resets) in 164 ms. (242 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (1874 resets) in 162 ms. (245 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (1913 resets) in 291 ms. (137 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (1891 resets) in 181 ms. (219 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (1894 resets) in 161 ms. (246 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (1871 resets) in 165 ms. (240 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (1826 resets) in 162 ms. (245 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (1895 resets) in 169 ms. (235 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (1915 resets) in 163 ms. (243 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (1927 resets) in 166 ms. (239 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (1878 resets) in 165 ms. (240 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (1854 resets) in 166 ms. (239 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (1921 resets) in 171 ms. (232 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (1883 resets) in 161 ms. (246 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (1881 resets) in 168 ms. (236 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (1950 resets) in 172 ms. (231 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (1906 resets) in 168 ms. (236 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (1927 resets) in 182 ms. (218 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (1813 resets) in 164 ms. (242 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (1901 resets) in 163 ms. (243 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (1892 resets) in 165 ms. (240 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (1882 resets) in 189 ms. (210 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (1907 resets) in 163 ms. (243 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (1877 resets) in 166 ms. (239 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (1930 resets) in 162 ms. (245 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (1867 resets) in 164 ms. (242 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (1926 resets) in 164 ms. (242 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (1824 resets) in 164 ms. (242 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (1942 resets) in 171 ms. (232 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (1909 resets) in 162 ms. (245 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (1903 resets) in 164 ms. (242 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (1815 resets) in 161 ms. (246 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (1920 resets) in 166 ms. (239 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (1901 resets) in 165 ms. (240 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (1911 resets) in 166 ms. (239 steps per ms) remains 133/133 properties
Probably explored full state space saw : 602452 states, properties seen :70
Probabilistic random walk after 1574762 steps, saw 602452 distinct states, run finished after 19963 ms. (steps per millisecond=78 ) properties seen :70
Explored full state space saw : 602470 states, properties seen :0
Exhaustive walk after 1574789 steps, saw 602470 distinct states, run finished after 16056 ms. (steps per millisecond=98 ) properties seen :0
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK EXHAUSTIVE_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 134479 ms.
ITS solved all properties within timeout

BK_STOP 1749107557047

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="SieveSingleMsgMbox-PT-d2m06"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is SieveSingleMsgMbox-PT-d2m06, 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 r224-tall-174902010000287"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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