Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r276-smll-171654416000134.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is Peterson-COL-3, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-171654416000134
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.3K Apr 12 02:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 12 02:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 02:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 12 02:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 02:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 02:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 02:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 02:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 43K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1716816338756

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Peterson-COL-3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 13:25:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-27 13:25:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 13:25:41] [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.
[2024-05-27 13:25:42] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 13:25:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1309 ms
[2024-05-27 13:25:42] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 256 PT places and 396.0 transition bindings in 41 ms.
[2024-05-27 13:25:42] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 8 ms.
[2024-05-27 13:25:42] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
[2024-05-27 13:25:42] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions 1112 arcs in 64 ms.
[2024-05-27 13:25:42] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2024-05-27 13:25:42] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions 1112 arcs in 21 ms.
[2024-05-27 13:25:42] [INFO ] Unfolded 14 HLPN properties in 0 ms.
[2024-05-27 13:25:42] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 0 ms.
[2024-05-27 13:25:42] [INFO ] Skeletonized 14 HLPN properties in 2 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(4), Tour(3), Process(4)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 3)]] 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.
[2024-05-27 13:25:43] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions 1112 arcs in 44 ms.
[2024-05-27 13:25:43] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Deduced a syphon composed of 12 places in 5 ms
Reduce places removed 12 places and 24 transitions.
Built sparse matrix representations for Structural reductions in 4 ms.17769KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 244/244 places, 332/332 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 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 82 ms. Remains : 244/244 places, 332/332 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 244/244 places, 332/332 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 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-27 13:25:43] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-27 13:25:43] [INFO ] Computed 15 invariants in 42 ms
[2024-05-27 13:25:43] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-27 13:25:43] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-27 13:25:43] [INFO ] Invariant cache hit.
[2024-05-27 13:25:44] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-27 13:25:44] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 869 ms to find 0 implicit places.
[2024-05-27 13:25:44] [INFO ] Redundant transitions in 32 ms returned []
Running 328 sub problems to find dead transitions.
[2024-05-27 13:25:44] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-27 13:25:44] [INFO ] Invariant cache hit.
[2024-05-27 13:25:44] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 13:25:48] [INFO ] Deduced a trap composed of 12 places in 259 ms of which 47 ms to minimize.
[2024-05-27 13:25:48] [INFO ] Deduced a trap composed of 22 places in 203 ms of which 4 ms to minimize.
[2024-05-27 13:25:48] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2024-05-27 13:25:48] [INFO ] Deduced a trap composed of 56 places in 192 ms of which 4 ms to minimize.
[2024-05-27 13:25:48] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 4 ms to minimize.
[2024-05-27 13:25:49] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 4 ms to minimize.
[2024-05-27 13:25:49] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 4 ms to minimize.
[2024-05-27 13:25:49] [INFO ] Deduced a trap composed of 56 places in 108 ms of which 2 ms to minimize.
[2024-05-27 13:25:49] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 3 ms to minimize.
[2024-05-27 13:25:49] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 2 ms to minimize.
[2024-05-27 13:25:49] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 3 ms to minimize.
[2024-05-27 13:25:49] [INFO ] Deduced a trap composed of 62 places in 181 ms of which 4 ms to minimize.
[2024-05-27 13:25:49] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 2 ms to minimize.
[2024-05-27 13:25:50] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-05-27 13:25:50] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 3 ms to minimize.
[2024-05-27 13:25:50] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 2 ms to minimize.
[2024-05-27 13:25:50] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-05-27 13:25:50] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 3 ms to minimize.
[2024-05-27 13:25:50] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 4 ms to minimize.
[2024-05-27 13:25:51] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 13:25:51] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 2 ms to minimize.
[2024-05-27 13:25:51] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 3 ms to minimize.
[2024-05-27 13:25:51] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 2 ms to minimize.
[2024-05-27 13:25:51] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 2 ms to minimize.
[2024-05-27 13:25:51] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-27 13:25:51] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2024-05-27 13:25:51] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 2 ms to minimize.
[2024-05-27 13:25:51] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 2 ms to minimize.
[2024-05-27 13:25:52] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 2 ms to minimize.
[2024-05-27 13:25:52] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2024-05-27 13:25:52] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-27 13:25:52] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
[2024-05-27 13:25:52] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-05-27 13:25:52] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-27 13:25:53] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 2 ms to minimize.
[2024-05-27 13:25:53] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 2 ms to minimize.
[2024-05-27 13:25:53] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 2 ms to minimize.
[2024-05-27 13:25:53] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 2 ms to minimize.
[2024-05-27 13:25:53] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 1 ms to minimize.
[2024-05-27 13:25:53] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 13:25:55] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 2 ms to minimize.
[2024-05-27 13:25:56] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 3 ms to minimize.
[2024-05-27 13:25:56] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 2 ms to minimize.
[2024-05-27 13:25:56] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 2 ms to minimize.
[2024-05-27 13:25:56] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 1 ms to minimize.
[2024-05-27 13:25:56] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 2 ms to minimize.
[2024-05-27 13:25:56] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 2 ms to minimize.
[2024-05-27 13:25:57] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 3 ms to minimize.
[2024-05-27 13:25:57] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 3 ms to minimize.
[2024-05-27 13:25:57] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 4 ms to minimize.
[2024-05-27 13:25:58] [INFO ] Deduced a trap composed of 61 places in 126 ms of which 5 ms to minimize.
[2024-05-27 13:25:58] [INFO ] Deduced a trap composed of 53 places in 122 ms of which 2 ms to minimize.
[2024-05-27 13:25:58] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 2 ms to minimize.
[2024-05-27 13:25:58] [INFO ] Deduced a trap composed of 49 places in 162 ms of which 3 ms to minimize.
[2024-05-27 13:25:59] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 3 ms to minimize.
[2024-05-27 13:25:59] [INFO ] Deduced a trap composed of 68 places in 140 ms of which 3 ms to minimize.
[2024-05-27 13:25:59] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 3 ms to minimize.
[2024-05-27 13:26:00] [INFO ] Deduced a trap composed of 69 places in 156 ms of which 4 ms to minimize.
[2024-05-27 13:26:00] [INFO ] Deduced a trap composed of 87 places in 131 ms of which 4 ms to minimize.
[2024-05-27 13:26:00] [INFO ] Deduced a trap composed of 51 places in 171 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 13:26:02] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 3 ms to minimize.
[2024-05-27 13:26:02] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 3 ms to minimize.
[2024-05-27 13:26:03] [INFO ] Deduced a trap composed of 73 places in 173 ms of which 3 ms to minimize.
[2024-05-27 13:26:03] [INFO ] Deduced a trap composed of 97 places in 160 ms of which 3 ms to minimize.
[2024-05-27 13:26:03] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 3 ms to minimize.
[2024-05-27 13:26:04] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 3 ms to minimize.
[2024-05-27 13:26:04] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 3 ms to minimize.
[2024-05-27 13:26:04] [INFO ] Deduced a trap composed of 54 places in 134 ms of which 2 ms to minimize.
[2024-05-27 13:26:05] [INFO ] Deduced a trap composed of 54 places in 143 ms of which 3 ms to minimize.
[2024-05-27 13:26:05] [INFO ] Deduced a trap composed of 61 places in 123 ms of which 3 ms to minimize.
[2024-05-27 13:26:05] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 4 ms to minimize.
[2024-05-27 13:26:05] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 4 ms to minimize.
[2024-05-27 13:26:06] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 2 ms to minimize.
[2024-05-27 13:26:06] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 2 ms to minimize.
[2024-05-27 13:26:06] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 2 ms to minimize.
[2024-05-27 13:26:07] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 3 ms to minimize.
[2024-05-27 13:26:07] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 3 ms to minimize.
[2024-05-27 13:26:07] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 2 ms to minimize.
[2024-05-27 13:26:07] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 19/90 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 13:26:10] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-27 13:26:11] [INFO ] Deduced a trap composed of 57 places in 112 ms of which 2 ms to minimize.
[2024-05-27 13:26:11] [INFO ] Deduced a trap composed of 61 places in 129 ms of which 3 ms to minimize.
[2024-05-27 13:26:11] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 3 ms to minimize.
[2024-05-27 13:26:11] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 2 ms to minimize.
[2024-05-27 13:26:11] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.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 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/552 variables, and 96 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 7/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 85/85 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 85/96 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 13:26:17] [INFO ] Deduced a trap composed of 84 places in 153 ms of which 3 ms to minimize.
[2024-05-27 13:26:18] [INFO ] Deduced a trap composed of 45 places in 160 ms of which 3 ms to minimize.
[2024-05-27 13:26:19] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 3 ms to minimize.
[2024-05-27 13:26:19] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 3 ms to minimize.
[2024-05-27 13:26:19] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 3 ms to minimize.
[2024-05-27 13:26:20] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 6/102 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 13:26:22] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 2 ms to minimize.
[2024-05-27 13:26:23] [INFO ] Deduced a trap composed of 101 places in 129 ms of which 2 ms to minimize.
[2024-05-27 13:26:24] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 4 ms to minimize.
[2024-05-27 13:26:25] [INFO ] Deduced a trap composed of 49 places in 149 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 13:26:27] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 3 ms to minimize.
[2024-05-27 13:26:27] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 4/244 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 13:26:39] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 3 ms to minimize.
[2024-05-27 13:26:40] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 328 unsolved
SMT process timed out in 60308ms, After SMT, problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60343ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 61303 ms. Remains : 244/244 places, 332/332 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2233 ms (no deadlock found). (steps per millisecond=559 )
Random directed walk for 1250002 steps, including 0 resets, run took 1572 ms (no deadlock found). (steps per millisecond=795 )
[2024-05-27 13:26:48] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-27 13:26:48] [INFO ] Invariant cache hit.
[2024-05-27 13:26:48] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2024-05-27 13:26:48] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned unsat
[2024-05-27 13:26:48] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions 1112 arcs in 13 ms.
[2024-05-27 13:26:48] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 12 places in 4 ms
Reduce places removed 12 places and 24 transitions.
RANDOM walk for 40000 steps (8 resets) in 862 ms. (46 steps per ms) remains 1/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 1/1 properties
[2024-05-27 13:26:48] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-27 13:26:48] [INFO ] Invariant cache hit.
[2024-05-27 13:26:48] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 216/228 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/232 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 308/540 variables, 232/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 57/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/552 variables, 12/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/552 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/552 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 316 constraints, problems are : Problem set: 0 solved, 1 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 216/228 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/232 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 308/540 variables, 232/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 57/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/552 variables, 12/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 13:26:49] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 3 ms to minimize.
[2024-05-27 13:26:49] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 3 ms to minimize.
[2024-05-27 13:26:50] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 3/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/552 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 13:26:50] [INFO ] Deduced a trap composed of 52 places in 140 ms of which 3 ms to minimize.
[2024-05-27 13:26:50] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-05-27 13:26:50] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/552 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/552 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/552 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 552/552 variables, and 323 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1411 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 1745ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 101 ms.
Support contains 12 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 244 transition count 242
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 154 transition count 242
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 180 place count 154 transition count 191
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 282 place count 103 transition count 191
Applied a total of 282 rules in 57 ms. Remains 103 /244 variables (removed 141) and now considering 191/332 (removed 141) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 103/244 places, 191/332 transitions.
RANDOM walk for 4000000 steps (8 resets) in 9507 ms. (420 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3928 ms. (1018 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 33 steps, run visited all 1 properties in 8 ms. (steps per millisecond=4 )
Probabilistic random walk after 33 steps, saw 29 distinct states, run finished after 13 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 12 places in 1 ms
Reduce places removed 12 places and 24 transitions.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 24 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 73375 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Peterson-COL-3

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.322

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 256
TRANSITIONS: 356
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 1112
UNFOLDING TIME: 0.321

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.079
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 1.088
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: 878
MODEL NAME: /home/mcc/execution/model
256 places, 356 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.
Building monolithic NSF...

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//
++ 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 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-3"
export BK_EXAMINATION="Liveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is Peterson-COL-3, 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 r276-smll-171654416000134"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-3.tgz
mv Peterson-COL-3 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;