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.r154-tall-174876825500359.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 Peterson-COL-5, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r154-tall-174876825500359
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 45K 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 Liveness

=== Now, execution of the tool begins

BK_START 1748843529251

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Peterson-COL-5
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 05:52:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-02 05:52:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:52:10] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-02 05:52:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 05:52:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 542 ms
[2025-06-02 05:52:11] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 864 PT places and 1398.0 transition bindings in 19 ms.
[2025-06-02 05:52:11] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 4 ms.
[2025-06-02 05:52:11] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
[2025-06-02 05:52:11] [INFO ] Unfolded HLPN to a Petri net with 864 places and 1302 transitions 4068 arcs in 46 ms.
[2025-06-02 05:52:11] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2025-06-02 05:52:11] [INFO ] Unfolded HLPN to a Petri net with 864 places and 1302 transitions 4068 arcs in 21 ms.
[2025-06-02 05:52:11] [INFO ] Unfolded 14 HLPN properties in 1 ms.
[2025-06-02 05:52:11] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 0 ms.
[2025-06-02 05:52:11] [INFO ] Skeletonized 14 HLPN properties in 1 ms.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
Domain [Process(6), Tour(5), Process(6)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 5)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2025-06-02 05:52:11] [INFO ] Unfolded HLPN to a Petri net with 864 places and 1302 transitions 4068 arcs in 24 ms.
[2025-06-02 05:52:11] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Deduced a syphon composed of 30 places in 10 ms
Reduce places removed 30 places and 60 transitions.
Built sparse matrix representations for Structural reductions in 8 ms.18629KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 54 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 65 ms. Remains : 834/834 places, 1242/1242 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 38 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2025-06-02 05:52:11] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2025-06-02 05:52:11] [INFO ] Computed 23 invariants in 31 ms
[2025-06-02 05:52:11] [INFO ] Implicit Places using invariants in 328 ms returned []
[2025-06-02 05:52:11] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2025-06-02 05:52:11] [INFO ] Invariant cache hit.
[2025-06-02 05:52:12] [INFO ] State equation strengthened by 205 read => feed constraints.
[2025-06-02 05:52:12] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 847 ms to find 0 implicit places.
[2025-06-02 05:52:12] [INFO ] Redundant transitions in 61 ms returned []
Running 1236 sub problems to find dead transitions.
[2025-06-02 05:52:12] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2025-06-02 05:52:12] [INFO ] Invariant cache hit.
[2025-06-02 05:52:12] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
[2025-06-02 05:52:28] [INFO ] Deduced a trap composed of 30 places in 395 ms of which 46 ms to minimize.
[2025-06-02 05:52:28] [INFO ] Deduced a trap composed of 18 places in 338 ms of which 6 ms to minimize.
[2025-06-02 05:52:29] [INFO ] Deduced a trap composed of 41 places in 319 ms of which 6 ms to minimize.
[2025-06-02 05:52:29] [INFO ] Deduced a trap composed of 75 places in 261 ms of which 5 ms to minimize.
[2025-06-02 05:52:29] [INFO ] Deduced a trap composed of 43 places in 267 ms of which 5 ms to minimize.
[2025-06-02 05:52:29] [INFO ] Deduced a trap composed of 61 places in 240 ms of which 4 ms to minimize.
[2025-06-02 05:52:30] [INFO ] Deduced a trap composed of 41 places in 264 ms of which 5 ms to minimize.
[2025-06-02 05:52:30] [INFO ] Deduced a trap composed of 80 places in 225 ms of which 4 ms to minimize.
[2025-06-02 05:52:30] [INFO ] Deduced a trap composed of 27 places in 221 ms of which 4 ms to minimize.
[2025-06-02 05:52:30] [INFO ] Deduced a trap composed of 14 places in 216 ms of which 5 ms to minimize.
[2025-06-02 05:52:31] [INFO ] Deduced a trap composed of 26 places in 226 ms of which 5 ms to minimize.
[2025-06-02 05:52:31] [INFO ] Deduced a trap composed of 45 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:52:31] [INFO ] Deduced a trap composed of 49 places in 220 ms of which 4 ms to minimize.
[2025-06-02 05:52:32] [INFO ] Deduced a trap composed of 18 places in 238 ms of which 4 ms to minimize.
[2025-06-02 05:52:32] [INFO ] Deduced a trap composed of 30 places in 256 ms of which 5 ms to minimize.
[2025-06-02 05:52:32] [INFO ] Deduced a trap composed of 43 places in 253 ms of which 5 ms to minimize.
[2025-06-02 05:52:32] [INFO ] Deduced a trap composed of 26 places in 241 ms of which 4 ms to minimize.
[2025-06-02 05:52:33] [INFO ] Deduced a trap composed of 41 places in 248 ms of which 4 ms to minimize.
[2025-06-02 05:52:33] [INFO ] Deduced a trap composed of 40 places in 253 ms of which 4 ms to minimize.
[2025-06-02 05:52:33] [INFO ] Deduced a trap composed of 22 places in 212 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
[2025-06-02 05:52:34] [INFO ] Deduced a trap composed of 107 places in 244 ms of which 4 ms to minimize.
[2025-06-02 05:52:34] [INFO ] Deduced a trap composed of 43 places in 250 ms of which 4 ms to minimize.
[2025-06-02 05:52:34] [INFO ] Deduced a trap composed of 104 places in 244 ms of which 4 ms to minimize.
[2025-06-02 05:52:35] [INFO ] Deduced a trap composed of 100 places in 220 ms of which 4 ms to minimize.
[2025-06-02 05:52:35] [INFO ] Deduced a trap composed of 108 places in 225 ms of which 4 ms to minimize.
[2025-06-02 05:52:35] [INFO ] Deduced a trap composed of 69 places in 221 ms of which 5 ms to minimize.
[2025-06-02 05:52:35] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:52:36] [INFO ] Deduced a trap composed of 22 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:52:36] [INFO ] Deduced a trap composed of 41 places in 253 ms of which 5 ms to minimize.
[2025-06-02 05:52:36] [INFO ] Deduced a trap composed of 93 places in 253 ms of which 4 ms to minimize.
[2025-06-02 05:52:37] [INFO ] Deduced a trap composed of 214 places in 186 ms of which 3 ms to minimize.
[2025-06-02 05:52:37] [INFO ] Deduced a trap composed of 134 places in 219 ms of which 3 ms to minimize.
[2025-06-02 05:52:37] [INFO ] Deduced a trap composed of 82 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:52:37] [INFO ] Deduced a trap composed of 82 places in 188 ms of which 4 ms to minimize.
[2025-06-02 05:52:38] [INFO ] Deduced a trap composed of 56 places in 207 ms of which 4 ms to minimize.
[2025-06-02 05:52:38] [INFO ] Deduced a trap composed of 88 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:52:38] [INFO ] Deduced a trap composed of 48 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:52:38] [INFO ] Deduced a trap composed of 56 places in 160 ms of which 3 ms to minimize.
[2025-06-02 05:52:38] [INFO ] Deduced a trap composed of 82 places in 205 ms of which 4 ms to minimize.
[2025-06-02 05:52:39] [INFO ] Deduced a trap composed of 48 places in 210 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.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 1.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.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 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 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/828 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 828/1956 variables, and 57 constraints, problems are : Problem set: 0 solved, 1236 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 11/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/834 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 1236/1236 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
[2025-06-02 05:52:44] [INFO ] Deduced a trap composed of 54 places in 271 ms of which 5 ms to minimize.
[2025-06-02 05:52:44] [INFO ] Deduced a trap composed of 51 places in 233 ms of which 4 ms to minimize.
[2025-06-02 05:52:45] [INFO ] Deduced a trap composed of 82 places in 228 ms of which 4 ms to minimize.
[2025-06-02 05:52:45] [INFO ] Deduced a trap composed of 132 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:52:45] [INFO ] Deduced a trap composed of 48 places in 154 ms of which 3 ms to minimize.
[2025-06-02 05:52:45] [INFO ] Deduced a trap composed of 56 places in 108 ms of which 2 ms to minimize.
[2025-06-02 05:52:46] [INFO ] Deduced a trap composed of 30 places in 251 ms of which 5 ms to minimize.
[2025-06-02 05:52:46] [INFO ] Deduced a trap composed of 26 places in 250 ms of which 4 ms to minimize.
[2025-06-02 05:52:46] [INFO ] Deduced a trap composed of 26 places in 264 ms of which 5 ms to minimize.
[2025-06-02 05:52:47] [INFO ] Deduced a trap composed of 30 places in 242 ms of which 4 ms to minimize.
[2025-06-02 05:52:47] [INFO ] Deduced a trap composed of 30 places in 242 ms of which 4 ms to minimize.
[2025-06-02 05:52:48] [INFO ] Deduced a trap composed of 20 places in 251 ms of which 4 ms to minimize.
[2025-06-02 05:52:48] [INFO ] Deduced a trap composed of 56 places in 219 ms of which 4 ms to minimize.
[2025-06-02 05:52:48] [INFO ] Deduced a trap composed of 11 places in 238 ms of which 4 ms to minimize.
[2025-06-02 05:52:48] [INFO ] Deduced a trap composed of 11 places in 244 ms of which 4 ms to minimize.
[2025-06-02 05:52:49] [INFO ] Deduced a trap composed of 36 places in 257 ms of which 4 ms to minimize.
[2025-06-02 05:52:49] [INFO ] Deduced a trap composed of 44 places in 222 ms of which 7 ms to minimize.
[2025-06-02 05:52:49] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 2 ms to minimize.
[2025-06-02 05:52:50] [INFO ] Deduced a trap composed of 52 places in 256 ms of which 4 ms to minimize.
[2025-06-02 05:52:50] [INFO ] Deduced a trap composed of 28 places in 225 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/828 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
[2025-06-02 05:52:51] [INFO ] Deduced a trap composed of 124 places in 238 ms of which 4 ms to minimize.
[2025-06-02 05:52:51] [INFO ] Deduced a trap composed of 75 places in 230 ms of which 3 ms to minimize.
[2025-06-02 05:52:51] [INFO ] Deduced a trap composed of 108 places in 110 ms of which 2 ms to minimize.
[2025-06-02 05:52:52] [INFO ] Deduced a trap composed of 56 places in 244 ms of which 4 ms to minimize.
[2025-06-02 05:52:52] [INFO ] Deduced a trap composed of 45 places in 272 ms of which 5 ms to minimize.
[2025-06-02 05:52:53] [INFO ] Deduced a trap composed of 19 places in 266 ms of which 5 ms to minimize.
[2025-06-02 05:52:53] [INFO ] Deduced a trap composed of 76 places in 259 ms of which 4 ms to minimize.
[2025-06-02 05:52:53] [INFO ] Deduced a trap composed of 60 places in 253 ms of which 4 ms to minimize.
[2025-06-02 05:52:54] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 5 ms to minimize.
[2025-06-02 05:52:54] [INFO ] Deduced a trap composed of 11 places in 241 ms of which 4 ms to minimize.
[2025-06-02 05:52:54] [INFO ] Deduced a trap composed of 11 places in 220 ms of which 4 ms to minimize.
[2025-06-02 05:52:56] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 3 ms to minimize.
[2025-06-02 05:52:56] [INFO ] Deduced a trap composed of 37 places in 184 ms of which 3 ms to minimize.
[2025-06-02 05:52:56] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 4 ms to minimize.
[2025-06-02 05:52:56] [INFO ] Deduced a trap composed of 28 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:52:57] [INFO ] Deduced a trap composed of 63 places in 152 ms of which 2 ms to minimize.
[2025-06-02 05:52:57] [INFO ] Deduced a trap composed of 63 places in 152 ms of which 2 ms to minimize.
[2025-06-02 05:52:58] [INFO ] Deduced a trap composed of 63 places in 146 ms of which 2 ms to minimize.
[2025-06-02 05:52:58] [INFO ] Deduced a trap composed of 122 places in 144 ms of which 3 ms to minimize.
[2025-06-02 05:52:58] [INFO ] Deduced a trap composed of 63 places in 140 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/828 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
[2025-06-02 05:52:59] [INFO ] Deduced a trap composed of 47 places in 247 ms of which 5 ms to minimize.
[2025-06-02 05:53:00] [INFO ] Deduced a trap composed of 108 places in 213 ms of which 4 ms to minimize.
[2025-06-02 05:53:00] [INFO ] Deduced a trap composed of 71 places in 200 ms of which 4 ms to minimize.
[2025-06-02 05:53:00] [INFO ] Deduced a trap composed of 248 places in 243 ms of which 5 ms to minimize.
[2025-06-02 05:53:01] [INFO ] Deduced a trap composed of 183 places in 240 ms of which 4 ms to minimize.
[2025-06-02 05:53:01] [INFO ] Deduced a trap composed of 77 places in 201 ms of which 4 ms to minimize.
[2025-06-02 05:53:01] [INFO ] Deduced a trap composed of 53 places in 212 ms of which 4 ms to minimize.
[2025-06-02 05:53:02] [INFO ] Deduced a trap composed of 15 places in 256 ms of which 4 ms to minimize.
[2025-06-02 05:53:02] [INFO ] Deduced a trap composed of 49 places in 206 ms of which 4 ms to minimize.
[2025-06-02 05:53:02] [INFO ] Deduced a trap composed of 19 places in 197 ms of which 4 ms to minimize.
[2025-06-02 05:53:03] [INFO ] Deduced a trap composed of 44 places in 211 ms of which 4 ms to minimize.
[2025-06-02 05:53:03] [INFO ] Deduced a trap composed of 71 places in 177 ms of which 3 ms to minimize.
[2025-06-02 05:53:05] [INFO ] Deduced a trap composed of 66 places in 157 ms of which 3 ms to minimize.
[2025-06-02 05:53:06] [INFO ] Deduced a trap composed of 70 places in 160 ms of which 3 ms to minimize.
[2025-06-02 05:53:06] [INFO ] Deduced a trap composed of 70 places in 191 ms of which 3 ms to minimize.
[2025-06-02 05:53:06] [INFO ] Deduced a trap composed of 71 places in 190 ms of which 3 ms to minimize.
[2025-06-02 05:53:06] [INFO ] Deduced a trap composed of 63 places in 171 ms of which 3 ms to minimize.
[2025-06-02 05:53:06] [INFO ] Deduced a trap composed of 37 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:53:07] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 3 ms to minimize.
[2025-06-02 05:53:08] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/828 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
[2025-06-02 05:53:09] [INFO ] Deduced a trap composed of 75 places in 237 ms of which 5 ms to minimize.
[2025-06-02 05:53:10] [INFO ] Deduced a trap composed of 170 places in 256 ms of which 5 ms to minimize.
[2025-06-02 05:53:11] [INFO ] Deduced a trap composed of 140 places in 276 ms of which 4 ms to minimize.
[2025-06-02 05:53:11] [INFO ] Deduced a trap composed of 52 places in 218 ms of which 3 ms to minimize.
[2025-06-02 05:53:11] [INFO ] Deduced a trap composed of 76 places in 175 ms of which 4 ms to minimize.
[2025-06-02 05:53:12] [INFO ] Deduced a trap composed of 140 places in 170 ms of which 4 ms to minimize.
[2025-06-02 05:53:12] [INFO ] Deduced a trap composed of 52 places in 172 ms of which 3 ms to minimize.
[2025-06-02 05:53:12] [INFO ] Deduced a trap composed of 52 places in 170 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 828/1956 variables, and 125 constraints, problems are : Problem set: 0 solved, 1236 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 11/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/834 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 0/1236 constraints, Known Traps: 108/108 constraints]
After SMT, in 60528ms problems are : Problem set: 0 solved, 1236 unsolved
Search for dead transitions found 0 dead transitions in 60569ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 61540 ms. Remains : 834/834 places, 1242/1242 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1963 ms (no deadlock found). (steps per millisecond=636 )
Random directed walk for 1250000 steps, including 0 resets, run took 2209 ms (no deadlock found). (steps per millisecond=565 )
[2025-06-02 05:53:17] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2025-06-02 05:53:17] [INFO ] Invariant cache hit.
[2025-06-02 05:53:17] [INFO ] [Real]Absence check using 17 positive place invariants in 40 ms returned sat
[2025-06-02 05:53:17] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 17 ms returned unsat
[2025-06-02 05:53:17] [INFO ] Unfolded HLPN to a Petri net with 864 places and 1302 transitions 4068 arcs in 13 ms.
[2025-06-02 05:53:17] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 30 places in 3 ms
Reduce places removed 30 places and 60 transitions.
RANDOM walk for 40000 steps (8 resets) in 693 ms. (57 steps per ms) remains 1/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 323 ms. (123 steps per ms) remains 1/1 properties
[2025-06-02 05:53:18] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2025-06-02 05:53:18] [INFO ] Invariant cache hit.
[2025-06-02 05:53:18] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 768/798 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/798 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/804 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/804 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1122/1926 variables, 804/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1926 variables, 205/1027 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1926 variables, 0/1027 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/1956 variables, 30/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1956 variables, 5/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1956 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1956 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1956/1956 variables, and 1062 constraints, problems are : Problem set: 0 solved, 1 unsolved in 691 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 834/834 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 768/798 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/798 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/804 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/804 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1122/1926 variables, 804/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1926 variables, 205/1027 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1926 variables, 1/1028 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1926 variables, 0/1028 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 30/1956 variables, 30/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1956 variables, 5/1063 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:53:19] [INFO ] Deduced a trap composed of 24 places in 232 ms of which 4 ms to minimize.
[2025-06-02 05:53:19] [INFO ] Deduced a trap composed of 22 places in 214 ms of which 4 ms to minimize.
[2025-06-02 05:53:20] [INFO ] Deduced a trap composed of 180 places in 283 ms of which 5 ms to minimize.
[2025-06-02 05:53:20] [INFO ] Deduced a trap composed of 45 places in 217 ms of which 4 ms to minimize.
[2025-06-02 05:53:20] [INFO ] Deduced a trap composed of 48 places in 218 ms of which 4 ms to minimize.
[2025-06-02 05:53:20] [INFO ] Deduced a trap composed of 11 places in 250 ms of which 4 ms to minimize.
[2025-06-02 05:53:21] [INFO ] Deduced a trap composed of 176 places in 198 ms of which 4 ms to minimize.
[2025-06-02 05:53:21] [INFO ] Deduced a trap composed of 176 places in 227 ms of which 5 ms to minimize.
[2025-06-02 05:53:21] [INFO ] Deduced a trap composed of 20 places in 245 ms of which 4 ms to minimize.
[2025-06-02 05:53:21] [INFO ] Deduced a trap composed of 20 places in 246 ms of which 4 ms to minimize.
[2025-06-02 05:53:22] [INFO ] Deduced a trap composed of 71 places in 223 ms of which 4 ms to minimize.
[2025-06-02 05:53:22] [INFO ] Deduced a trap composed of 200 places in 223 ms of which 4 ms to minimize.
[2025-06-02 05:53:22] [INFO ] Deduced a trap composed of 131 places in 219 ms of which 4 ms to minimize.
[2025-06-02 05:53:22] [INFO ] Deduced a trap composed of 78 places in 203 ms of which 4 ms to minimize.
[2025-06-02 05:53:23] [INFO ] Deduced a trap composed of 175 places in 207 ms of which 4 ms to minimize.
[2025-06-02 05:53:23] [INFO ] Deduced a trap composed of 180 places in 205 ms of which 4 ms to minimize.
[2025-06-02 05:53:23] [INFO ] Deduced a trap composed of 19 places in 208 ms of which 4 ms to minimize.
[2025-06-02 05:53:23] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 4 ms to minimize.
SMT process timed out in 5874ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 834 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 834 transition count 892
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 484 transition count 892
Performed 185 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 185 Pre rules applied. Total rules applied 700 place count 484 transition count 707
Deduced a syphon composed of 185 places in 2 ms
Reduce places removed 185 places and 0 transitions.
Iterating global reduction 2 with 370 rules applied. Total rules applied 1070 place count 299 transition count 707
Applied a total of 1070 rules in 96 ms. Remains 299 /834 variables (removed 535) and now considering 707/1242 (removed 535) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 299/834 places, 707/1242 transitions.
RANDOM walk for 4000000 steps (8 resets) in 10242 ms. (390 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4790 ms. (834 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 61 steps, run visited all 1 properties in 19 ms. (steps per millisecond=3 )
Probabilistic random walk after 61 steps, saw 55 distinct states, run finished after 22 ms. (steps per millisecond=2 ) properties seen :1
Able to resolve query QuasiLiveness after proving 14 properties.
Net is quasi-live, checking if it is reversible to establish liveness.
Net is conservative; using simplified expression for initial state.
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 60 transitions.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 60 transitions.
Unable to solve all queries for examination Liveness. Remains :14 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 14 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 77610 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Peterson-COL-5

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 11
TRANSITIONS: 14
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 7
COLOR VARS: 3
ARCS: 42
LOADING TIME: 0.138

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 864
TRANSITIONS: 1302
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 4068
UNFOLDING TIME: 0.192

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.063
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 0.551
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 940
MODEL NAME: /home/mcc/execution/model
864 places, 1302 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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 Liveness -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="Peterson-COL-5"
export BK_EXAMINATION="Liveness"
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 Peterson-COL-5, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r154-tall-174876825500359"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-5.tgz
mv Peterson-COL-5 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;