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.r168-tall-174881266500169.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 PolyORBLF-COL-S02J04T06, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-174881266500169
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K 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.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K 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 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K 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.9K 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 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 154K 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 1748898197937

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-COL-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 21:03:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-02 21:03:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:03:19] [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 21:03:19] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 21:03:20] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 685 ms
[2025-06-02 21:03:20] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 476 PT places and 952.0 transition bindings in 25 ms.
[2025-06-02 21:03:20] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2025-06-02 21:03:20] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
[2025-06-02 21:03:20] [INFO ] Unfolded HLPN to a Petri net with 476 places and 920 transitions 4242 arcs in 32 ms.
[2025-06-02 21:03:20] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2025-06-02 21:03:20] [INFO ] Unfolded HLPN to a Petri net with 476 places and 920 transitions 4242 arcs in 17 ms.
[2025-06-02 21:03:20] [INFO ] Unfolded 65 HLPN properties in 1 ms.
[2025-06-02 21:03:20] [INFO ] Reduced 6 identical enabling conditions.
[2025-06-02 21:03:20] [INFO ] Reduced 24 identical enabling conditions.
[2025-06-02 21:03:20] [INFO ] Reduced 66 identical enabling conditions.
[2025-06-02 21:03:20] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 1 ms.
[2025-06-02 21:03:20] [INFO ] Skeletonized 65 HLPN properties in 2 ms.
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.
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2025-06-02 21:03:20] [INFO ] Unfolded HLPN to a Petri net with 476 places and 920 transitions 4242 arcs in 13 ms.
[2025-06-02 21:03:20] [INFO ] Unfolded 65 HLPN properties in 0 ms.
[2025-06-02 21:03:20] [INFO ] Reduced 6 identical enabling conditions.
[2025-06-02 21:03:20] [INFO ] Reduced 24 identical enabling conditions.
[2025-06-02 21:03:20] [INFO ] Reduced 66 identical enabling conditions.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Built sparse matrix representations for Structural reductions in 2 ms.32059KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 476/476 places, 824/824 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 55 ms. Remains 476 /476 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Running 822 sub problems to find dead transitions.
[2025-06-02 21:03:20] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2025-06-02 21:03:20] [INFO ] Computed 46 invariants in 58 ms
[2025-06-02 21:03:20] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2025-06-02 21:03:28] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 11 ms to minimize.
[2025-06-02 21:03:28] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 2 ms to minimize.
[2025-06-02 21:03:28] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 1 ms to minimize.
[2025-06-02 21:03:28] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 1 ms to minimize.
[2025-06-02 21:03:28] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 1 ms to minimize.
[2025-06-02 21:03:29] [INFO ] Deduced a trap composed of 249 places in 189 ms of which 4 ms to minimize.
[2025-06-02 21:03:29] [INFO ] Deduced a trap composed of 125 places in 164 ms of which 3 ms to minimize.
[2025-06-02 21:03:29] [INFO ] Deduced a trap composed of 153 places in 179 ms of which 3 ms to minimize.
[2025-06-02 21:03:29] [INFO ] Deduced a trap composed of 66 places in 48 ms of which 1 ms to minimize.
[2025-06-02 21:03:30] [INFO ] Deduced a trap composed of 273 places in 191 ms of which 4 ms to minimize.
[2025-06-02 21:03:30] [INFO ] Deduced a trap composed of 271 places in 357 ms of which 4 ms to minimize.
[2025-06-02 21:03:31] [INFO ] Deduced a trap composed of 283 places in 344 ms of which 3 ms to minimize.
[2025-06-02 21:03:31] [INFO ] Deduced a trap composed of 283 places in 200 ms of which 3 ms to minimize.
[2025-06-02 21:03:31] [INFO ] Deduced a trap composed of 248 places in 202 ms of which 3 ms to minimize.
[2025-06-02 21:03:37] [INFO ] Deduced a trap composed of 238 places in 182 ms of which 4 ms to minimize.
[2025-06-02 21:03:38] [INFO ] Deduced a trap composed of 223 places in 180 ms of which 3 ms to minimize.
[2025-06-02 21:03:38] [INFO ] Deduced a trap composed of 252 places in 177 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/1288 variables, and 59 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20069 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2025-06-02 21:03:47] [INFO ] Deduced a trap composed of 309 places in 183 ms of which 3 ms to minimize.
[2025-06-02 21:03:47] [INFO ] Deduced a trap composed of 314 places in 174 ms of which 3 ms to minimize.
[2025-06-02 21:03:47] [INFO ] Deduced a trap composed of 328 places in 179 ms of which 3 ms to minimize.
[2025-06-02 21:03:48] [INFO ] Deduced a trap composed of 317 places in 187 ms of which 4 ms to minimize.
[2025-06-02 21:03:49] [INFO ] Deduced a trap composed of 311 places in 181 ms of which 3 ms to minimize.
[2025-06-02 21:03:49] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
[2025-06-02 21:03:49] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:03:52] [INFO ] Deduced a trap composed of 59 places in 182 ms of which 3 ms to minimize.
[2025-06-02 21:03:53] [INFO ] Deduced a trap composed of 59 places in 182 ms of which 3 ms to minimize.
[2025-06-02 21:03:53] [INFO ] Deduced a trap composed of 254 places in 169 ms of which 2 ms to minimize.
[2025-06-02 21:03:53] [INFO ] Deduced a trap composed of 249 places in 177 ms of which 3 ms to minimize.
[2025-06-02 21:03:53] [INFO ] Deduced a trap composed of 242 places in 166 ms of which 3 ms to minimize.
[2025-06-02 21:03:55] [INFO ] Deduced a trap composed of 243 places in 142 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 13/72 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/1288 variables, and 72 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 30/30 constraints]
After SMT, in 41020ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 41058ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 41153 ms. Remains : 476/476 places, 824/824 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 476/476 places, 824/824 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 32 ms. Remains 476 /476 variables (removed 0) and now considering 824/824 (removed 0) transitions.
[2025-06-02 21:04:01] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2025-06-02 21:04:01] [INFO ] Invariant cache hit.
[2025-06-02 21:04:01] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-02 21:04:01] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2025-06-02 21:04:01] [INFO ] Invariant cache hit.
[2025-06-02 21:04:02] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 21:04:02] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2025-06-02 21:04:02] [INFO ] Redundant transitions in 48 ms returned []
Running 822 sub problems to find dead transitions.
[2025-06-02 21:04:02] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2025-06-02 21:04:02] [INFO ] Invariant cache hit.
[2025-06-02 21:04:02] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2025-06-02 21:04:09] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 1 ms to minimize.
[2025-06-02 21:04:09] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 1 ms to minimize.
[2025-06-02 21:04:09] [INFO ] Deduced a trap composed of 65 places in 39 ms of which 1 ms to minimize.
[2025-06-02 21:04:09] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 1 ms to minimize.
[2025-06-02 21:04:09] [INFO ] Deduced a trap composed of 66 places in 42 ms of which 1 ms to minimize.
[2025-06-02 21:04:10] [INFO ] Deduced a trap composed of 217 places in 166 ms of which 3 ms to minimize.
[2025-06-02 21:04:10] [INFO ] Deduced a trap composed of 133 places in 154 ms of which 3 ms to minimize.
[2025-06-02 21:04:11] [INFO ] Deduced a trap composed of 255 places in 189 ms of which 3 ms to minimize.
[2025-06-02 21:04:11] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 3 ms to minimize.
[2025-06-02 21:04:11] [INFO ] Deduced a trap composed of 279 places in 184 ms of which 4 ms to minimize.
[2025-06-02 21:04:11] [INFO ] Deduced a trap composed of 232 places in 184 ms of which 3 ms to minimize.
[2025-06-02 21:04:11] [INFO ] Deduced a trap composed of 280 places in 183 ms of which 3 ms to minimize.
[2025-06-02 21:04:12] [INFO ] Deduced a trap composed of 265 places in 176 ms of which 3 ms to minimize.
[2025-06-02 21:04:12] [INFO ] Deduced a trap composed of 254 places in 173 ms of which 3 ms to minimize.
[2025-06-02 21:04:12] [INFO ] Deduced a trap composed of 244 places in 173 ms of which 3 ms to minimize.
[2025-06-02 21:04:12] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 1 ms to minimize.
[2025-06-02 21:04:18] [INFO ] Deduced a trap composed of 58 places in 190 ms of which 3 ms to minimize.
[2025-06-02 21:04:18] [INFO ] Deduced a trap composed of 264 places in 184 ms of which 3 ms to minimize.
[2025-06-02 21:04:18] [INFO ] Deduced a trap composed of 321 places in 178 ms of which 3 ms to minimize.
[2025-06-02 21:04:19] [INFO ] Deduced a trap composed of 266 places in 184 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2025-06-02 21:04:19] [INFO ] Deduced a trap composed of 250 places in 185 ms of which 4 ms to minimize.
[2025-06-02 21:04:22] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 2 ms to minimize.
[2025-06-02 21:04:26] [INFO ] Deduced a trap composed of 240 places in 170 ms of which 3 ms to minimize.
[2025-06-02 21:04:26] [INFO ] Deduced a trap composed of 226 places in 168 ms of which 3 ms to minimize.
[2025-06-02 21:04:27] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 5.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 1.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 1.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 9.0)
(s123 1.0)
(s124 0.0)
(s125 1.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 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 (/ 2.0 3.0))
(s158 (/ 1.0 3.0))
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 (/ 1.0 3.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 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 (/ 2.0 3.0))
(s203 0.0)
(s204 0.0)
(s205 1.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 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s222 0.0)
(s223 0.0)
(s224 1.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 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.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 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.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 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 1.0)
(s299 1.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 8.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/1288 variables, and 67 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 25/67 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2025-06-02 21:04:38] [INFO ] Deduced a trap composed of 312 places in 166 ms of which 4 ms to minimize.
[2025-06-02 21:04:38] [INFO ] Deduced a trap composed of 301 places in 182 ms of which 10 ms to minimize.
[2025-06-02 21:04:38] [INFO ] Deduced a trap composed of 300 places in 160 ms of which 3 ms to minimize.
[2025-06-02 21:04:38] [INFO ] Deduced a trap composed of 242 places in 171 ms of which 3 ms to minimize.
[2025-06-02 21:04:39] [INFO ] Deduced a trap composed of 313 places in 172 ms of which 7 ms to minimize.
[2025-06-02 21:04:39] [INFO ] Deduced a trap composed of 288 places in 172 ms of which 3 ms to minimize.
[2025-06-02 21:04:39] [INFO ] Deduced a trap composed of 246 places in 165 ms of which 3 ms to minimize.
[2025-06-02 21:04:42] [INFO ] Deduced a trap composed of 224 places in 178 ms of which 3 ms to minimize.
[2025-06-02 21:04:42] [INFO ] Deduced a trap composed of 243 places in 172 ms of which 3 ms to minimize.
[2025-06-02 21:04:43] [INFO ] Deduced a trap composed of 239 places in 172 ms of which 4 ms to minimize.
[2025-06-02 21:04:43] [INFO ] Deduced a trap composed of 244 places in 170 ms of which 3 ms to minimize.
[2025-06-02 21:04:43] [INFO ] Deduced a trap composed of 238 places in 176 ms of which 2 ms to minimize.
[2025-06-02 21:04:43] [INFO ] Deduced a trap composed of 257 places in 175 ms of which 3 ms to minimize.
[2025-06-02 21:04:43] [INFO ] Deduced a trap composed of 250 places in 174 ms of which 3 ms to minimize.
[2025-06-02 21:04:46] [INFO ] Deduced a trap composed of 290 places in 168 ms of which 3 ms to minimize.
[2025-06-02 21:04:46] [INFO ] Deduced a trap composed of 239 places in 151 ms of which 2 ms to minimize.
[2025-06-02 21:04:46] [INFO ] Deduced a trap composed of 243 places in 154 ms of which 2 ms to minimize.
[2025-06-02 21:04:46] [INFO ] Deduced a trap composed of 236 places in 146 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 18/85 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2025-06-02 21:04:49] [INFO ] Deduced a trap composed of 247 places in 170 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/1288 variables, and 86 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 44/44 constraints]
After SMT, in 60859ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 60869ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 61491 ms. Remains : 476/476 places, 824/824 transitions.
Finished random walk after 8702 steps, including 0 resets, run found a deadlock after 34 ms. (steps per millisecond=255 )
FORMULA Liveness FALSE TECHNIQUES STRUCTURAL DEADLOCK_TEST
Total runtime 103710 ms.
ITS solved all properties within timeout

BK_STOP 1748898303081

--------------------
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="PolyORBLF-COL-S02J04T06"
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 PolyORBLF-COL-S02J04T06, 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 r168-tall-174881266500169"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J04T06.tgz
mv PolyORBLF-COL-S02J04T06 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 ;