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.r246-tall-171654351700488.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 itstools
Input is NeoElection-COL-7, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654351700488
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 11K Apr 11 19:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 11 19:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 11 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 11 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 21:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 11 21:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 20:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 20:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:41 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 108K May 18 16:43 model.pnml

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

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

no data necessary for post analysis


=== Now, execution of the tool begins

BK_START 1716684317019

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-7
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
StateSpace COL
Running Version 202405141337
[2024-05-26 00:45:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StateSpace, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 00:45:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 00:45:18] [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-26 00:45:18] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 00:45:18] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 603 ms
[2024-05-26 00:45:18] [INFO ] Detected 6 constant HL places corresponding to 3552 PT places.
[2024-05-26 00:45:18] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 7128 PT places and 22272.0 transition bindings in 30 ms.
[2024-05-26 00:45:19] [INFO ] Unfolded HLPN to a Petri net with 7128 places and 12460 transitions 70880 arcs in 169 ms.
[2024-05-26 00:45:19] [INFO ] Unfolded 0 HLPN properties in 0 ms.
Deduced a syphon composed of 6688 places in 33 ms
Reduce places removed 6737 places and 11850 transitions.
Reduce places removed 8 places and 0 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 383/383 places, 610/610 transitions.
[2024-05-26 00:45:19] [INFO ] Redundant transitions in 38 ms returned []
Running 603 sub problems to find dead transitions.
[2024-05-26 00:45:19] [INFO ] Flow matrix only has 574 transitions (discarded 36 similar events)
// Phase 1: matrix 574 rows 383 cols
[2024-05-26 00:45:19] [INFO ] Computed 104 invariants in 26 ms
[2024-05-26 00:45:19] [INFO ] State equation strengthened by 126 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/334 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 2 (OVERLAPS) 49/383 variables, 56/62 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 42/104 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-26 00:45:30] [INFO ] Deduced a trap composed of 7 places in 212 ms of which 22 ms to minimize.
[2024-05-26 00:45:30] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 3 ms to minimize.
[2024-05-26 00:45:31] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 3 ms to minimize.
[2024-05-26 00:45:31] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 3 ms to minimize.
[2024-05-26 00:45:31] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 2 ms to minimize.
[2024-05-26 00:45:31] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 2 ms to minimize.
[2024-05-26 00:45:31] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 2 ms to minimize.
[2024-05-26 00:45:31] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 2 ms to minimize.
[2024-05-26 00:45:31] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 2 ms to minimize.
[2024-05-26 00:45:32] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 2 ms to minimize.
[2024-05-26 00:45:32] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 2 ms to minimize.
[2024-05-26 00:45:32] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 2 ms to minimize.
[2024-05-26 00:45:32] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 3 ms to minimize.
[2024-05-26 00:45:32] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 2 ms to minimize.
[2024-05-26 00:45:32] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 2 ms to minimize.
[2024-05-26 00:45:32] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 2 ms to minimize.
[2024-05-26 00:45:32] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 2 ms to minimize.
[2024-05-26 00:45:33] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 2 ms to minimize.
[2024-05-26 00:45:33] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 2 ms to minimize.
[2024-05-26 00:45:33] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-26 00:45:33] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 2 ms to minimize.
[2024-05-26 00:45:33] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 2 ms to minimize.
[2024-05-26 00:45:33] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 2 ms to minimize.
[2024-05-26 00:45:33] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 2 ms to minimize.
[2024-05-26 00:45:34] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 2 ms to minimize.
[2024-05-26 00:45:34] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 2 ms to minimize.
[2024-05-26 00:45:34] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 2 ms to minimize.
[2024-05-26 00:45:34] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 2 ms to minimize.
[2024-05-26 00:45:34] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 2 ms to minimize.
[2024-05-26 00:45:34] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 2 ms to minimize.
[2024-05-26 00:45:34] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 2 ms to minimize.
[2024-05-26 00:45:35] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 2 ms to minimize.
[2024-05-26 00:45:35] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 2 ms to minimize.
[2024-05-26 00:45:35] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 3 ms to minimize.
[2024-05-26 00:45:35] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 5 ms to minimize.
[2024-05-26 00:45:35] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 2 ms to minimize.
[2024-05-26 00:45:35] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 2 ms to minimize.
[2024-05-26 00:45:35] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 2 ms to minimize.
[2024-05-26 00:45:36] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 3 ms to minimize.
[2024-05-26 00:45:36] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-26 00:45:36] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 2 ms to minimize.
[2024-05-26 00:45:36] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 3 ms to minimize.
[2024-05-26 00:45:36] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 2 ms to minimize.
[2024-05-26 00:45:36] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 2 ms to minimize.
[2024-05-26 00:45:37] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 2 ms to minimize.
[2024-05-26 00:45:37] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 2 ms to minimize.
[2024-05-26 00:45:37] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 2 ms to minimize.
[2024-05-26 00:45:37] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 2 ms to minimize.
[2024-05-26 00:45:37] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 2 ms to minimize.
[2024-05-26 00:45:37] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 2 ms to minimize.
[2024-05-26 00:45:37] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 3 ms to minimize.
[2024-05-26 00:45:37] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 2 ms to minimize.
[2024-05-26 00:45:38] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 2 ms to minimize.
[2024-05-26 00:45:38] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 3 ms to minimize.
[2024-05-26 00:45:38] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 2 ms to minimize.
[2024-05-26 00:45:38] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 2 ms to minimize.
[2024-05-26 00:45:38] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 2 ms to minimize.
[2024-05-26 00:45:38] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 1 ms to minimize.
[2024-05-26 00:45:38] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 2 ms to minimize.
[2024-05-26 00:45:38] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-26 00:45:42] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 2 ms to minimize.
[2024-05-26 00:45:42] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 2 ms to minimize.
[2024-05-26 00:45:42] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 1 ms to minimize.
[2024-05-26 00:45:43] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 2 ms to minimize.
[2024-05-26 00:45:43] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 2 ms to minimize.
[2024-05-26 00:45:43] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 2 ms to minimize.
[2024-05-26 00:45:43] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 1 ms to minimize.
[2024-05-26 00:45:43] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
[2024-05-26 00:45:43] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 2 ms to minimize.
[2024-05-26 00:45:43] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 2 ms to minimize.
[2024-05-26 00:45:43] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 2 ms to minimize.
[2024-05-26 00:45:43] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 2 ms to minimize.
[2024-05-26 00:45:44] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 2 ms to minimize.
[2024-05-26 00:45:44] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 2 ms to minimize.
[2024-05-26 00:45:44] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 2 ms to minimize.
[2024-05-26 00:45:44] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 1 ms to minimize.
[2024-05-26 00:45:44] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-26 00:45:44] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2024-05-26 00:45:44] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
[2024-05-26 00:45:44] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-26 00:45:44] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 1 ms to minimize.
[2024-05-26 00:45:45] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 2 ms to minimize.
[2024-05-26 00:45:45] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 2 ms to minimize.
[2024-05-26 00:45:45] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-05-26 00:45:45] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2024-05-26 00:45:45] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2024-05-26 00:45:45] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2024-05-26 00:45:45] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 1 ms to minimize.
[2024-05-26 00:45:45] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 2 ms to minimize.
[2024-05-26 00:45:45] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-26 00:45:45] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-05-26 00:45:45] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-05-26 00:45:45] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-05-26 00:45:45] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2024-05-26 00:45:46] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-05-26 00:45:46] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-26 00:45:46] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-26 00:45:46] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-26 00:45:46] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-26 00:45:46] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-26 00:45:46] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2024-05-26 00:45:46] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2024-05-26 00:45:46] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2024-05-26 00:45:46] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2024-05-26 00:45:47] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2024-05-26 00:45:47] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-05-26 00:45:47] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2024-05-26 00:45:47] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-26 00:45:47] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-05-26 00:45:47] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-26 00:45:47] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-26 00:45:47] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-05-26 00:45:47] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-05-26 00:45:48] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-26 00:45:48] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-26 00:45:48] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-26 00:45:48] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-26 00:45:49] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-26 00:45:49] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-26 00:45:49] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 383/957 variables, and 224 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/383 constraints, ReadFeed: 0/126 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 0 solved, 603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/334 variables, 94/100 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 3 (OVERLAPS) 49/383 variables, 56/156 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 42/198 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 26/224 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-26 00:45:54] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 3 ms to minimize.
[2024-05-26 00:45:54] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-26 00:45:54] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2024-05-26 00:45:54] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-05-26 00:45:54] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2024-05-26 00:45:54] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-26 00:45:55] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-26 00:45:55] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-26 00:45:55] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-26 00:45:55] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-26 00:45:56] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-26 00:45:58] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-26 00:45:58] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2024-05-26 00:45:59] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-26 00:45:59] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2024-05-26 00:45:59] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2024-05-26 00:45:59] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-05-26 00:45:59] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2024-05-26 00:45:59] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 2 ms to minimize.
[2024-05-26 00:45:59] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-26 00:46:04] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2024-05-26 00:46:04] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-05-26 00:46:04] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 2 ms to minimize.
[2024-05-26 00:46:04] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-05-26 00:46:04] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2024-05-26 00:46:04] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-26 00:46:04] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2024-05-26 00:46:04] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-05-26 00:46:04] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2024-05-26 00:46:04] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-26 00:46:04] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
[2024-05-26 00:46:05] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
[2024-05-26 00:46:05] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 1 ms to minimize.
[2024-05-26 00:46:05] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
[2024-05-26 00:46:05] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 2 ms to minimize.
[2024-05-26 00:46:05] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 2 ms to minimize.
[2024-05-26 00:46:05] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 17/261 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 9 (OVERLAPS) 574/957 variables, 383/644 constraints. Problems are: Problem set: 6 solved, 597 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/957 variables, 126/770 constraints. Problems are: Problem set: 6 solved, 597 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/957 variables, 597/1367 constraints. Problems are: Problem set: 6 solved, 597 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 957/957 variables, and 1367 constraints, problems are : Problem set: 6 solved, 597 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 383/383 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 597/603 constraints, Known Traps: 157/157 constraints]
After SMT, in 61036ms problems are : Problem set: 6 solved, 597 unsolved
Search for dead transitions found 6 dead transitions in 61067ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in STATESPACE mode, iteration 1 : 383/383 places, 604/610 transitions.
[2024-05-26 00:46:20] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in STATESPACE mode , in 2 iterations and 61220 ms. Remains : 383/383 places, 604/610 transitions.
Final net has 383 places and 604 transitions.
[2024-05-26 00:46:20] [INFO ] Flatten gal took : 140 ms
[2024-05-26 00:46:20] [INFO ] Applying decomposition
[2024-05-26 00:46:20] [INFO ] Flatten gal took : 65 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18331274918938963957.txt' '-o' '/tmp/graph18331274918938963957.bin' '-w' '/tmp/graph18331274918938963957.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18331274918938963957.bin' '-l' '-1' '-v' '-w' '/tmp/graph18331274918938963957.weights' '-q' '0' '-e' '0.001'
[2024-05-26 00:46:20] [INFO ] Decomposing Gal with order
[2024-05-26 00:46:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 00:46:21] [INFO ] Removed a total of 41 redundant transitions.
[2024-05-26 00:46:21] [INFO ] Flatten gal took : 89 ms
[2024-05-26 00:46:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 8 ms.
[2024-05-26 00:46:21] [INFO ] Time to serialize gal into /tmp/StateSpace10552718751227948804.gal : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace10552718751227948804.gal' '-t' 'CGAL' '--stats'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...220
ITS-tools command line returned an error code 137
[2024-05-26 00:54:33] [INFO ] Applying decomposition
[2024-05-26 00:54:33] [INFO ] Flatten gal took : 79 ms
[2024-05-26 00:54:33] [INFO ] Decomposing Gal with order
[2024-05-26 00:54:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 00:54:33] [INFO ] Removed a total of 2009 redundant transitions.
[2024-05-26 00:54:33] [INFO ] Flatten gal took : 72 ms
[2024-05-26 00:54:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2024-05-26 00:54:33] [INFO ] Time to serialize gal into /tmp/StateSpace17568084157060661750.gal : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace17568084157060661750.gal' '-t' 'CGAL' '--stats'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...220
ITS-tools command line returned an error code 137
[2024-05-26 01:01:27] [INFO ] Flatten gal took : 34 ms
[2024-05-26 01:01:27] [INFO ] Input system was already deterministic with 604 transitions.
[2024-05-26 01:01:27] [INFO ] Transformed 383 places.
[2024-05-26 01:01:27] [INFO ] Transformed 604 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-26 01:01:27] [INFO ] Time to serialize gal into /tmp/StateSpace15835778752168432302.gal : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace15835778752168432302.gal' '-t' 'CGAL' '--stats' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...286
Successfully loaded order from file /home/mcc/execution/model.ord
ITS-tools command line returned an error code 137
Total runtime 1536454 ms.

BK_STOP 1716685854674

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StateSpace = StateSpace ]]
+ [[ -f modelMain.xml ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="NeoElection-COL-7"
export BK_EXAMINATION="StateSpace"
export BK_TOOL="itstools"
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 itstools"
echo " Input is NeoElection-COL-7, examination is StateSpace"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r246-tall-171654351700488"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-7.tgz
mv NeoElection-COL-7 execution
cd execution
if [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "UpperBounds" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] || [ "StateSpace" = "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 [ "StateSpace" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StateSpace" != "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 "StateSpace.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StateSpace.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StateSpace.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 '' StateSpace.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] ; then
echo "FORMULA_NAME StateSpace"
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 ;