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.r512-smll-171654407100210.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 ltsminxred
Input is Peterson-COL-3, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407100210
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-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 6.5K May 18 16:43 GenericPropertiesVerdict.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

here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-COL-3-CTLFireability-2024-00
FORMULA_NAME Peterson-COL-3-CTLFireability-2024-01
FORMULA_NAME Peterson-COL-3-CTLFireability-2024-02
FORMULA_NAME Peterson-COL-3-CTLFireability-2024-03
FORMULA_NAME Peterson-COL-3-CTLFireability-2024-04
FORMULA_NAME Peterson-COL-3-CTLFireability-2024-05
FORMULA_NAME Peterson-COL-3-CTLFireability-2024-06
FORMULA_NAME Peterson-COL-3-CTLFireability-2024-07
FORMULA_NAME Peterson-COL-3-CTLFireability-2024-08
FORMULA_NAME Peterson-COL-3-CTLFireability-2024-09
FORMULA_NAME Peterson-COL-3-CTLFireability-2024-10
FORMULA_NAME Peterson-COL-3-CTLFireability-2024-11
FORMULA_NAME Peterson-COL-3-CTLFireability-2024-12
FORMULA_NAME Peterson-COL-3-CTLFireability-2024-13
FORMULA_NAME Peterson-COL-3-CTLFireability-2024-14
FORMULA_NAME Peterson-COL-3-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717257522327

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:58:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:58:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:58:45] [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-06-01 15:58:45] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 15:58:46] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1263 ms
[2024-06-01 15:58:46] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 256 PT places and 396.0 transition bindings in 39 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 30 ms.
[2024-06-01 15:58:46] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 8 ms.
[2024-06-01 15:58:46] [INFO ] Skeletonized 8 HLPN properties in 4 ms. Removed 8 properties that had guard overlaps.
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 5 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 376 steps (0 resets) in 28 ms. (12 steps per ms) remains 0/7 properties
[2024-06-01 15:58:46] [INFO ] Flatten gal took : 27 ms
[2024-06-01 15:58:46] [INFO ] Flatten gal took : 5 ms
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-06-01 15:58:46] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions 1112 arcs in 72 ms.
[2024-06-01 15:58:47] [INFO ] Unfolded 16 HLPN properties in 2 ms.
Deduced a syphon composed of 12 places in 4 ms
Reduce places removed 12 places and 24 transitions.
Support contains 244 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 15 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-06-01 15:58:47] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-06-01 15:58:47] [INFO ] Computed 15 invariants in 26 ms
[2024-06-01 15:58:47] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-06-01 15:58:47] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-06-01 15:58:47] [INFO ] Invariant cache hit.
[2024-06-01 15:58:47] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 15:58:47] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-06-01 15:58:47] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-06-01 15:58:47] [INFO ] Invariant cache hit.
[2024-06-01 15:58:47] [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-06-01 15:58:51] [INFO ] Deduced a trap composed of 12 places in 265 ms of which 47 ms to minimize.
[2024-06-01 15:58:51] [INFO ] Deduced a trap composed of 22 places in 212 ms of which 5 ms to minimize.
[2024-06-01 15:58:51] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:58:52] [INFO ] Deduced a trap composed of 56 places in 266 ms of which 6 ms to minimize.
[2024-06-01 15:58:52] [INFO ] Deduced a trap composed of 16 places in 234 ms of which 4 ms to minimize.
[2024-06-01 15:58:52] [INFO ] Deduced a trap composed of 20 places in 222 ms of which 4 ms to minimize.
[2024-06-01 15:58:52] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
[2024-06-01 15:58:52] [INFO ] Deduced a trap composed of 56 places in 124 ms of which 3 ms to minimize.
[2024-06-01 15:58:52] [INFO ] Deduced a trap composed of 49 places in 95 ms of which 3 ms to minimize.
[2024-06-01 15:58:53] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-06-01 15:58:53] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
[2024-06-01 15:58:53] [INFO ] Deduced a trap composed of 62 places in 132 ms of which 3 ms to minimize.
[2024-06-01 15:58:53] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
[2024-06-01 15:58:53] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 3 ms to minimize.
[2024-06-01 15:58:53] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 3 ms to minimize.
[2024-06-01 15:58:53] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 3 ms to minimize.
[2024-06-01 15:58:54] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 3 ms to minimize.
[2024-06-01 15:58:54] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2024-06-01 15:58:54] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-06-01 15:58:54] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 15:58:54] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 2 ms to minimize.
[2024-06-01 15:58:54] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 2 ms to minimize.
[2024-06-01 15:58:54] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 2 ms to minimize.
[2024-06-01 15:58:54] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 2 ms to minimize.
[2024-06-01 15:58:54] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:58:54] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 2 ms to minimize.
[2024-06-01 15:58:55] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:58:55] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 2 ms to minimize.
[2024-06-01 15:58:55] [INFO ] Deduced a trap composed of 56 places in 120 ms of which 3 ms to minimize.
[2024-06-01 15:58:55] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 2 ms to minimize.
[2024-06-01 15:58:55] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 3 ms to minimize.
[2024-06-01 15:58:55] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 3 ms to minimize.
[2024-06-01 15:58:55] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 3 ms to minimize.
[2024-06-01 15:58:56] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 3 ms to minimize.
[2024-06-01 15:58:56] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 5 ms to minimize.
[2024-06-01 15:58:56] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 3 ms to minimize.
[2024-06-01 15:58:56] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 3 ms to minimize.
[2024-06-01 15:58:56] [INFO ] Deduced a trap composed of 52 places in 131 ms of which 3 ms to minimize.
[2024-06-01 15:58:56] [INFO ] Deduced a trap composed of 52 places in 106 ms of which 3 ms to minimize.
[2024-06-01 15:58:57] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 15:59:00] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 3 ms to minimize.
[2024-06-01 15:59:01] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 3 ms to minimize.
[2024-06-01 15:59:01] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
[2024-06-01 15:59:01] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 2 ms to minimize.
[2024-06-01 15:59:01] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 2 ms to minimize.
[2024-06-01 15:59:01] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 3 ms to minimize.
[2024-06-01 15:59:02] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 3 ms to minimize.
[2024-06-01 15:59:02] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 2 ms to minimize.
[2024-06-01 15:59:02] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 3 ms to minimize.
[2024-06-01 15:59:02] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 3 ms to minimize.
[2024-06-01 15:59:03] [INFO ] Deduced a trap composed of 61 places in 128 ms of which 3 ms to minimize.
[2024-06-01 15:59:03] [INFO ] Deduced a trap composed of 53 places in 128 ms of which 3 ms to minimize.
[2024-06-01 15:59:03] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 3 ms to minimize.
[2024-06-01 15:59:04] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 3 ms to minimize.
[2024-06-01 15:59:04] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 3 ms to minimize.
[2024-06-01 15:59:04] [INFO ] Deduced a trap composed of 68 places in 147 ms of which 4 ms to minimize.
[2024-06-01 15:59:04] [INFO ] Deduced a trap composed of 52 places in 132 ms of which 3 ms to minimize.
[2024-06-01 15:59:05] [INFO ] Deduced a trap composed of 69 places in 134 ms of which 3 ms to minimize.
[2024-06-01 15:59:05] [INFO ] Deduced a trap composed of 87 places in 147 ms of which 3 ms to minimize.
[2024-06-01 15:59:05] [INFO ] Deduced a trap composed of 51 places in 165 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 15:59:07] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 3 ms to minimize.
[2024-06-01 15:59:07] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 4 ms to minimize.
[2024-06-01 15:59:08] [INFO ] Deduced a trap composed of 73 places in 182 ms of which 3 ms to minimize.
[2024-06-01 15:59:08] [INFO ] Deduced a trap composed of 97 places in 162 ms of which 4 ms to minimize.
[2024-06-01 15:59:09] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 3 ms to minimize.
[2024-06-01 15:59:09] [INFO ] Deduced a trap composed of 70 places in 93 ms of which 2 ms to minimize.
[2024-06-01 15:59:09] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 3 ms to minimize.
[2024-06-01 15:59:10] [INFO ] Deduced a trap composed of 54 places in 132 ms of which 3 ms to minimize.
[2024-06-01 15:59:10] [INFO ] Deduced a trap composed of 54 places in 132 ms of which 3 ms to minimize.
[2024-06-01 15:59:10] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 3 ms to minimize.
[2024-06-01 15:59:10] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 3 ms to minimize.
[2024-06-01 15:59:10] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 3 ms to minimize.
[2024-06-01 15:59:11] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 2 ms to minimize.
[2024-06-01 15:59:11] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 3 ms to minimize.
[2024-06-01 15:59:12] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-06-01 15:59:12] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 2 ms to minimize.
[2024-06-01 15:59:12] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 2 ms to minimize.
[2024-06-01 15:59:12] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 2 ms to minimize.
[2024-06-01 15:59:12] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 19/90 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 15:59:15] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 2 ms to minimize.
[2024-06-01 15:59:16] [INFO ] Deduced a trap composed of 57 places in 104 ms of which 3 ms to minimize.
[2024-06-01 15:59:16] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 2 ms to minimize.
[2024-06-01 15:59:17] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 2 ms to minimize.
[2024-06-01 15:59:17] [INFO ] Deduced a trap composed of 70 places in 113 ms of which 3 ms to minimize.
[2024-06-01 15:59:17] [INFO ] Deduced a trap composed of 78 places in 119 ms of which 3 ms to minimize.
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 30042 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-06-01 15:59:22] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 3 ms to minimize.
[2024-06-01 15:59:22] [INFO ] Deduced a trap composed of 45 places in 153 ms of which 3 ms to minimize.
[2024-06-01 15:59:23] [INFO ] Deduced a trap composed of 72 places in 143 ms of which 3 ms to minimize.
[2024-06-01 15:59:23] [INFO ] Deduced a trap composed of 76 places in 121 ms of which 3 ms to minimize.
[2024-06-01 15:59:24] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 3 ms to minimize.
[2024-06-01 15:59:24] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 6/102 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 15:59:27] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 2 ms to minimize.
[2024-06-01 15:59:28] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 3 ms to minimize.
[2024-06-01 15:59:29] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 4 ms to minimize.
[2024-06-01 15:59:29] [INFO ] Deduced a trap composed of 49 places in 146 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-06-01 15:59:31] [INFO ] Deduced a trap composed of 69 places in 103 ms of which 3 ms to minimize.
[2024-06-01 15:59:32] [INFO ] Deduced a trap composed of 62 places in 95 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-06-01 15:59:45] [INFO ] Deduced a trap composed of 34 places in 188 ms of which 4 ms to minimize.
[2024-06-01 15:59:45] [INFO ] Deduced a trap composed of 73 places in 146 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 328 unsolved
(s31 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 1)
(s30 0)
(s31 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 244/552 variables, and 114 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 0/328 constraints, Known Traps: 99/99 constraints]
After SMT, in 60303ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60345ms
Finished structural reductions in LTL mode , in 1 iterations and 61174 ms. Remains : 244/244 places, 332/332 transitions.
Support contains 244 out of 244 places after structural reductions.
[2024-06-01 15:59:48] [INFO ] Flatten gal took : 93 ms
[2024-06-01 15:59:48] [INFO ] Flatten gal took : 79 ms
[2024-06-01 15:59:49] [INFO ] Input system was already deterministic with 332 transitions.
Reduction of identical properties reduced properties to check from 36 to 30
RANDOM walk for 40000 steps (8 resets) in 2637 ms. (15 steps per ms) remains 2/30 properties
BEST_FIRST walk for 40004 steps (8 resets) in 334 ms. (119 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1610 ms. (24 steps per ms) remains 2/2 properties
[2024-06-01 15:59:50] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-06-01 15:59:50] [INFO ] Invariant cache hit.
[2024-06-01 15:59:50] [INFO ] State equation strengthened by 57 read => feed constraints.
Problem AtomicPropp24 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 116/240 variables, 8/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 4/244 variables, 4/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 308/552 variables, 244/259 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 57/316 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 0/316 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/552 variables, 0/316 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 316 constraints, problems are : Problem set: 1 solved, 1 unsolved in 254 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: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 216/228 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/232 variables, 4/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 308/540 variables, 232/244 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 57/301 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 1/302 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 0/302 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/552 variables, 12/314 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 3/317 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 15:59:51] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 3 ms to minimize.
[2024-06-01 15:59:51] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 3 ms to minimize.
[2024-06-01 15:59:51] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 3/320 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/552 variables, 0/320 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 15:59:51] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 2 ms to minimize.
[2024-06-01 15:59:51] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-06-01 15:59:52] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/552 variables, 3/323 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/552 variables, 0/323 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/552 variables, 0/323 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 552/552 variables, and 323 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1083 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/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 1477ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 79 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 67 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 68 ms. Remains : 103/244 places, 191/332 transitions.
RANDOM walk for 36676 steps (8 resets) in 448 ms. (81 steps per ms) remains 0/1 properties
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-06-01 15:59:52] [INFO ] Flatten gal took : 37 ms
[2024-06-01 15:59:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Peterson-COL-3-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:59:52] [INFO ] Flatten gal took : 44 ms
[2024-06-01 15:59:52] [INFO ] Input system was already deterministic with 332 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 244 transition count 331
Reduce places removed 1 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 13 rules applied. Total rules applied 14 place count 243 transition count 319
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 26 place count 231 transition count 319
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 32 place count 228 transition count 316
Applied a total of 32 rules in 43 ms. Remains 228 /244 variables (removed 16) and now considering 316/332 (removed 16) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44 ms. Remains : 228/244 places, 316/332 transitions.
[2024-06-01 15:59:52] [INFO ] Flatten gal took : 23 ms
[2024-06-01 15:59:52] [INFO ] Flatten gal took : 24 ms
[2024-06-01 15:59:52] [INFO ] Input system was already deterministic with 316 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 244 transition count 329
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 241 transition count 329
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 6 place count 241 transition count 321
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 22 place count 233 transition count 321
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 40 place count 224 transition count 312
Applied a total of 40 rules in 44 ms. Remains 224 /244 variables (removed 20) and now considering 312/332 (removed 20) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 224/244 places, 312/332 transitions.
[2024-06-01 15:59:53] [INFO ] Flatten gal took : 18 ms
[2024-06-01 15:59:53] [INFO ] Flatten gal took : 18 ms
[2024-06-01 15:59:53] [INFO ] Input system was already deterministic with 312 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 18 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 15:59:53] [INFO ] Flatten gal took : 21 ms
[2024-06-01 15:59:53] [INFO ] Flatten gal took : 17 ms
[2024-06-01 15:59:53] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 15:59:53] [INFO ] Flatten gal took : 16 ms
[2024-06-01 15:59:53] [INFO ] Flatten gal took : 17 ms
[2024-06-01 15:59:53] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 15:59:53] [INFO ] Flatten gal took : 16 ms
[2024-06-01 15:59:53] [INFO ] Flatten gal took : 14 ms
[2024-06-01 15:59:53] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 15:59:53] [INFO ] Flatten gal took : 14 ms
[2024-06-01 15:59:53] [INFO ] Flatten gal took : 14 ms
[2024-06-01 15:59:53] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 15:59:53] [INFO ] Flatten gal took : 13 ms
[2024-06-01 15:59:53] [INFO ] Flatten gal took : 14 ms
[2024-06-01 15:59:53] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 15:59:53] [INFO ] Flatten gal took : 13 ms
[2024-06-01 15:59:53] [INFO ] Flatten gal took : 15 ms
[2024-06-01 15:59:53] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 15:59:53] [INFO ] Flatten gal took : 21 ms
[2024-06-01 15:59:53] [INFO ] Flatten gal took : 24 ms
[2024-06-01 15:59:53] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 15:59:53] [INFO ] Flatten gal took : 19 ms
[2024-06-01 15:59:53] [INFO ] Flatten gal took : 22 ms
[2024-06-01 15:59:53] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 15:59:53] [INFO ] Flatten gal took : 20 ms
[2024-06-01 15:59:53] [INFO ] Flatten gal took : 22 ms
[2024-06-01 15:59:53] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 6 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 15:59:53] [INFO ] Flatten gal took : 16 ms
[2024-06-01 15:59:53] [INFO ] Flatten gal took : 16 ms
[2024-06-01 15:59:53] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 6 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 15:59:54] [INFO ] Flatten gal took : 15 ms
[2024-06-01 15:59:54] [INFO ] Flatten gal took : 16 ms
[2024-06-01 15:59:54] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 15:59:54] [INFO ] Flatten gal took : 10 ms
[2024-06-01 15:59:54] [INFO ] Flatten gal took : 10 ms
[2024-06-01 15:59:54] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 15:59:54] [INFO ] Flatten gal took : 10 ms
[2024-06-01 15:59:54] [INFO ] Flatten gal took : 10 ms
[2024-06-01 15:59:54] [INFO ] Input system was already deterministic with 332 transitions.
[2024-06-01 15:59:54] [INFO ] Flatten gal took : 22 ms
[2024-06-01 15:59:54] [INFO ] Flatten gal took : 23 ms
[2024-06-01 15:59:54] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 29 ms.
[2024-06-01 15:59:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 244 places, 332 transitions and 1016 arcs took 7 ms.
Total runtime 69688 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : Peterson-COL-3-CTLFireability-2024-00
Could not compute solution for formula : Peterson-COL-3-CTLFireability-2024-01
Could not compute solution for formula : Peterson-COL-3-CTLFireability-2024-02
Could not compute solution for formula : Peterson-COL-3-CTLFireability-2024-03
Could not compute solution for formula : Peterson-COL-3-CTLFireability-2024-04
Could not compute solution for formula : Peterson-COL-3-CTLFireability-2024-05
Could not compute solution for formula : Peterson-COL-3-CTLFireability-2024-06
Could not compute solution for formula : Peterson-COL-3-CTLFireability-2024-07
Could not compute solution for formula : Peterson-COL-3-CTLFireability-2024-09
Could not compute solution for formula : Peterson-COL-3-CTLFireability-2024-10
Could not compute solution for formula : Peterson-COL-3-CTLFireability-2024-11
Could not compute solution for formula : Peterson-COL-3-CTLFireability-2024-12
Could not compute solution for formula : Peterson-COL-3-CTLFireability-2024-13
Could not compute solution for formula : Peterson-COL-3-CTLFireability-2024-14
Could not compute solution for formula : Peterson-COL-3-CTLFireability-2024-15

BK_STOP 1717257595082

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name Peterson-COL-3-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/838/ctl_0_
ctl formula name Peterson-COL-3-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/838/ctl_1_
ctl formula name Peterson-COL-3-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/838/ctl_2_
ctl formula name Peterson-COL-3-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/838/ctl_3_
ctl formula name Peterson-COL-3-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/838/ctl_4_
ctl formula name Peterson-COL-3-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/838/ctl_5_
ctl formula name Peterson-COL-3-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/838/ctl_6_
ctl formula name Peterson-COL-3-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/838/ctl_7_
ctl formula name Peterson-COL-3-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/838/ctl_8_
ctl formula name Peterson-COL-3-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/838/ctl_9_
ctl formula name Peterson-COL-3-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/838/ctl_10_
ctl formula name Peterson-COL-3-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/838/ctl_11_
ctl formula name Peterson-COL-3-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/838/ctl_12_
ctl formula name Peterson-COL-3-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/838/ctl_13_
ctl formula name Peterson-COL-3-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/838/ctl_14_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 ltsminxred"
echo " Input is Peterson-COL-3, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r512-smll-171654407100210"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;