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.r070-smll-174854076400192.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 DES-PT-20b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-smll-174854076400192
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 91K May 29 14:32 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 1748653953164

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DES-PT-20b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-31 01:12:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-05-31 01:12:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 01:12:35] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2025-05-31 01:12:35] [INFO ] Transformed 360 places.
[2025-05-31 01:12:35] [INFO ] Transformed 311 transitions.
[2025-05-31 01:12:35] [INFO ] Found NUPN structural information;
[2025-05-31 01:12:35] [INFO ] Parsed PT model containing 360 places and 311 transitions and 987 arcs in 461 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 360/360 places, 311/311 transitions.
Reduce places removed 3 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 357 transition count 288
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 49 place count 334 transition count 288
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 49 place count 334 transition count 279
Deduced a syphon composed of 9 places in 5 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 67 place count 325 transition count 279
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 6 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 182 rules applied. Total rules applied 249 place count 234 transition count 188
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 257 place count 230 transition count 204
Applied a total of 257 rules in 247 ms. Remains 230 /360 variables (removed 130) and now considering 204/311 (removed 107) transitions.
// Phase 1: matrix 204 rows 230 cols
[2025-05-31 01:12:36] [INFO ] Computed 62 invariants in 55 ms
[2025-05-31 01:12:37] [INFO ] Implicit Places using invariants in 1146 ms returned [115]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1263 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 229/360 places, 204/311 transitions.
Applied a total of 0 rules in 8 ms. Remains 229 /229 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1561 ms. Remains : 229/360 places, 204/311 transitions.
Discarding 45 transitions out of 204. Remains 159
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (1355 resets) in 3179 ms. (12 steps per ms) remains 68/158 properties
BEST_FIRST walk for 4004 steps (18 resets) in 47 ms. (83 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (20 resets) in 49 ms. (80 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (21 resets) in 20 ms. (190 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (21 resets) in 40 ms. (97 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (22 resets) in 28 ms. (138 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (21 resets) in 38 ms. (102 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (19 resets) in 17 ms. (222 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (21 resets) in 25 ms. (153 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (20 resets) in 22 ms. (174 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (21 resets) in 23 ms. (166 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (21 resets) in 16 ms. (235 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (22 resets) in 99 ms. (40 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (20 resets) in 19 ms. (200 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (20 resets) in 32 ms. (121 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (23 resets) in 18 ms. (210 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (22 resets) in 17 ms. (222 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (23 resets) in 23 ms. (166 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (15 resets) in 19 ms. (200 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (18 resets) in 33 ms. (117 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (15 resets) in 19 ms. (200 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (17 resets) in 18 ms. (210 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (14 resets) in 34 ms. (114 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (15 resets) in 62 ms. (63 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (16 resets) in 21 ms. (181 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (16 resets) in 25 ms. (153 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (17 resets) in 38 ms. (102 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (17 resets) in 18 ms. (210 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (18 resets) in 19 ms. (200 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (15 resets) in 41 ms. (95 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (14 resets) in 16 ms. (235 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (15 resets) in 34 ms. (114 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (15 resets) in 19 ms. (200 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (16 resets) in 25 ms. (154 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (14 resets) in 17 ms. (222 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (18 resets) in 39 ms. (100 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (15 resets) in 23 ms. (166 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (18 resets) in 20 ms. (190 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (17 resets) in 21 ms. (182 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (16 resets) in 18 ms. (210 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (16 resets) in 17 ms. (222 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (17 resets) in 20 ms. (190 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (17 resets) in 17 ms. (222 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (17 resets) in 20 ms. (190 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (19 resets) in 22 ms. (174 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (19 resets) in 19 ms. (200 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (12 resets) in 24 ms. (160 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (17 resets) in 18 ms. (210 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (18 resets) in 19 ms. (200 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (17 resets) in 25 ms. (154 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (17 resets) in 17 ms. (222 steps per ms) remains 68/68 properties
// Phase 1: matrix 204 rows 229 cols
[2025-05-31 01:12:39] [INFO ] Computed 61 invariants in 13 ms
[2025-05-31 01:12:39] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 20/96 variables, 6/82 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (OVERLAPS) 65/161 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 65/192 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 57/218 variables, 27/219 constraints. Problems are: Problem set: 0 solved, 68 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 57/276 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 11 (OVERLAPS) 5/223 variables, 3/279 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 5/284 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/223 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 14 (OVERLAPS) 204/427 variables, 223/507 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/427 variables, 6/513 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2025-05-31 01:12:43] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 14 ms to minimize.
[2025-05-31 01:12:44] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 4 ms to minimize.
[2025-05-31 01:12:44] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.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 1.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 1.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 1.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 1.0)
(s88 1.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 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 1.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 1.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.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 1.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 427/433 variables, and 516 constraints, problems are : Problem set: 0 solved, 68 unsolved in 5028 ms.
Refiners :[Domain max(s): 223/229 constraints, Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 223/229 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 20/96 variables, 6/82 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (OVERLAPS) 65/161 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 65/192 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 57/218 variables, 27/219 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 57/276 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 12 (OVERLAPS) 5/223 variables, 3/281 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/223 variables, 5/286 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/223 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 16 (OVERLAPS) 204/427 variables, 223/510 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/427 variables, 6/516 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/427 variables, 20/536 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2025-05-31 01:12:49] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 427/433 variables, and 537 constraints, problems are : Problem set: 0 solved, 68 unsolved in 5010 ms.
Refiners :[Domain max(s): 223/229 constraints, Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 223/229 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 20/68 constraints, Known Traps: 4/4 constraints]
After SMT, in 10216ms problems are : Problem set: 0 solved, 68 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 76 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 204/204 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 229 transition count 203
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 212 transition count 166
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 212 transition count 166
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 45 place count 212 transition count 156
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 45 place count 212 transition count 153
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 51 place count 209 transition count 153
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 55 place count 205 transition count 149
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 205 transition count 149
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 63 place count 205 transition count 145
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 65 place count 204 transition count 145
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 204 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 67 place count 203 transition count 144
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 68 place count 203 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 69 place count 202 transition count 143
Applied a total of 69 rules in 93 ms. Remains 202 /229 variables (removed 27) and now considering 143/204 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 202/229 places, 143/204 transitions.
RANDOM walk for 4000000 steps (184012 resets) in 34539 ms. (115 steps per ms) remains 64/68 properties
BEST_FIRST walk for 400004 steps (3819 resets) in 1197 ms. (333 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (4474 resets) in 1166 ms. (342 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (4495 resets) in 946 ms. (422 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (4471 resets) in 1058 ms. (377 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (4475 resets) in 954 ms. (418 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (4460 resets) in 960 ms. (416 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (4421 resets) in 950 ms. (420 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (4478 resets) in 948 ms. (421 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (4444 resets) in 943 ms. (423 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (4447 resets) in 953 ms. (419 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (4483 resets) in 957 ms. (417 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400001 steps (4450 resets) in 943 ms. (423 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (4502 resets) in 960 ms. (416 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (4444 resets) in 944 ms. (423 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (4458 resets) in 949 ms. (421 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (4469 resets) in 942 ms. (424 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400002 steps (3573 resets) in 868 ms. (460 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (3603 resets) in 862 ms. (463 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (3542 resets) in 851 ms. (469 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (3488 resets) in 880 ms. (454 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400002 steps (3545 resets) in 857 ms. (466 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (3538 resets) in 862 ms. (463 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (3537 resets) in 858 ms. (465 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (3525 resets) in 860 ms. (464 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (3598 resets) in 874 ms. (457 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (3555 resets) in 874 ms. (457 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400001 steps (3620 resets) in 1198 ms. (333 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (3463 resets) in 1153 ms. (346 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (3507 resets) in 1085 ms. (368 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (3543 resets) in 855 ms. (467 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400002 steps (3830 resets) in 940 ms. (425 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (3831 resets) in 908 ms. (440 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (3728 resets) in 908 ms. (440 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (3727 resets) in 900 ms. (443 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (3771 resets) in 908 ms. (440 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (3816 resets) in 908 ms. (440 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (3862 resets) in 938 ms. (425 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (3778 resets) in 930 ms. (429 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (3845 resets) in 929 ms. (430 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (3833 resets) in 913 ms. (437 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (3744 resets) in 970 ms. (411 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (3822 resets) in 913 ms. (437 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (3845 resets) in 912 ms. (438 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (3792 resets) in 905 ms. (441 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (3847 resets) in 918 ms. (435 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (3746 resets) in 910 ms. (439 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (3814 resets) in 907 ms. (440 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (3821 resets) in 913 ms. (437 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400002 steps (3863 resets) in 918 ms. (435 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (3837 resets) in 906 ms. (441 steps per ms) remains 64/64 properties
Finished probabilistic random walk after 443585 steps, run visited all 64 properties in 3605 ms. (steps per millisecond=123 )
Probabilistic random walk after 443585 steps, saw 104332 distinct states, run finished after 3612 ms. (steps per millisecond=122 ) properties seen :64
Able to resolve query QuasiLiveness after proving 159 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 39693 ms.
ITS solved all properties within timeout

BK_STOP 1748653994972

--------------------
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="DES-PT-20b"
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 DES-PT-20b, 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 r070-smll-174854076400192"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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