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.r268-smll-171654406700024.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 ParamProductionCell-PT-1, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654406700024
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K 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.0K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 20:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 12 20:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 12 20:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 12 20:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 174K 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 1716652030125

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-1
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-05-25 15:47:11] [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-25 15:47:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:47:12] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2024-05-25 15:47:12] [INFO ] Transformed 231 places.
[2024-05-25 15:47:12] [INFO ] Transformed 202 transitions.
[2024-05-25 15:47:12] [INFO ] Found NUPN structural information;
[2024-05-25 15:47:12] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 378 ms.
Starting structural reductions in STATESPACE mode, iteration 0 : 231/231 places, 202/202 transitions.
[2024-05-25 15:47:12] [INFO ] Redundant transitions in 15 ms returned []
Running 201 sub problems to find dead transitions.
// Phase 1: matrix 202 rows 231 cols
[2024-05-25 15:47:12] [INFO ] Computed 59 invariants in 26 ms
[2024-05-25 15:47:12] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 229/229 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 34/263 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 23/286 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-25 15:47:14] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 42 ms to minimize.
[2024-05-25 15:47:14] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 3 ms to minimize.
[2024-05-25 15:47:15] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
[2024-05-25 15:47:15] [INFO ] Deduced a trap composed of 55 places in 94 ms of which 2 ms to minimize.
[2024-05-25 15:47:15] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 2 ms to minimize.
[2024-05-25 15:47:15] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 3 ms to minimize.
[2024-05-25 15:47:15] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
[2024-05-25 15:47:15] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 2 ms to minimize.
[2024-05-25 15:47:15] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
[2024-05-25 15:47:15] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 5 ms to minimize.
[2024-05-25 15:47:15] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 2 ms to minimize.
[2024-05-25 15:47:16] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 2 ms to minimize.
[2024-05-25 15:47:16] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 2 ms to minimize.
[2024-05-25 15:47:16] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-25 15:47:16] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-05-25 15:47:16] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:47:16] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:47:16] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:47:16] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-25 15:47:16] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 20/306 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-25 15:47:18] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 3 ms to minimize.
[2024-05-25 15:47:18] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 3 ms to minimize.
[2024-05-25 15:47:18] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 3 ms to minimize.
[2024-05-25 15:47:18] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-05-25 15:47:19] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 2 ms to minimize.
[2024-05-25 15:47:19] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 3 ms to minimize.
[2024-05-25 15:47:19] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 2 ms to minimize.
[2024-05-25 15:47:19] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2024-05-25 15:47:19] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 2 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
[2024-05-25 15:47:19] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 2 ms to minimize.
[2024-05-25 15:47:19] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2024-05-25 15:47:19] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 2 ms to minimize.
[2024-05-25 15:47:19] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 2 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
[2024-05-25 15:47:19] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD92 is UNSAT
[2024-05-25 15:47:20] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 5 ms to minimize.
[2024-05-25 15:47:20] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 2 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
[2024-05-25 15:47:20] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 2 ms to minimize.
[2024-05-25 15:47:20] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 2 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
[2024-05-25 15:47:20] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 2 ms to minimize.
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD149 is UNSAT
[2024-05-25 15:47:20] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 3 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 20/326 constraints. Problems are: Problem set: 30 solved, 171 unsolved
[2024-05-25 15:47:22] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 2 ms to minimize.
[2024-05-25 15:47:22] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-05-25 15:47:22] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
[2024-05-25 15:47:22] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:47:22] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:47:22] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:47:22] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 7/333 constraints. Problems are: Problem set: 30 solved, 171 unsolved
[2024-05-25 15:47:24] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:47:24] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 2/335 constraints. Problems are: Problem set: 30 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/335 constraints. Problems are: Problem set: 30 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 1/230 variables, 1/336 constraints. Problems are: Problem set: 30 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 1/337 constraints. Problems are: Problem set: 30 solved, 171 unsolved
[2024-05-25 15:47:28] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:47:28] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 2/339 constraints. Problems are: Problem set: 30 solved, 171 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 0/339 constraints. Problems are: Problem set: 30 solved, 171 unsolved
At refinement iteration 12 (OVERLAPS) 1/231 variables, 1/340 constraints. Problems are: Problem set: 30 solved, 171 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 1/341 constraints. Problems are: Problem set: 30 solved, 171 unsolved
[2024-05-25 15:47:32] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 2 ms to minimize.
[2024-05-25 15:47:33] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 2 ms to minimize.
Problem TDEAD94 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
[2024-05-25 15:47:34] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 2 ms to minimize.
[2024-05-25 15:47:34] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 2 ms to minimize.
Problem TDEAD150 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/231 variables, 4/345 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/231 variables, 0/345 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 16 (OVERLAPS) 202/433 variables, 231/576 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/433 variables, 68/644 constraints. Problems are: Problem set: 40 solved, 161 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 (/ 1.0 4.0))
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 (/ 1.0 4.0))
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 (/ 1.0 4.0))
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 (/ 3.0 4.0))
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 (/ 1.0 4.0))
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 (/ 3.0 4.0))
(s44 (/ 1.0 4.0))
(s45 (/ 3.0 4.0))
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 433/433 variables, and 644 constraints, problems are : Problem set: 40 solved, 161 unsolved in 30032 ms.
Refiners :[Domain max(s): 231/231 constraints, Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 231/231 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 40 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 205/205 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 28/233 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 16/249 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 26/275 constraints. Problems are: Problem set: 40 solved, 161 unsolved
[2024-05-25 15:47:43] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:47:43] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-05-25 15:47:44] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-25 15:47:44] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:47:44] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:47:44] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 6/281 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/281 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 25/230 variables, 7/288 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 25/313 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 7/320 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 25/345 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/345 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 11 (OVERLAPS) 1/231 variables, 1/346 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 1/347 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 4/351 constraints. Problems are: Problem set: 40 solved, 161 unsolved
[2024-05-25 15:47:48] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/231 variables, 1/352 constraints. Problems are: Problem set: 40 solved, 161 unsolved
[2024-05-25 15:47:49] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 2 ms to minimize.
[2024-05-25 15:47:49] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/231 variables, 2/354 constraints. Problems are: Problem set: 40 solved, 161 unsolved
[2024-05-25 15:47:51] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/231 variables, 1/355 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/231 variables, 0/355 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 18 (OVERLAPS) 202/433 variables, 231/586 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/433 variables, 68/654 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/433 variables, 161/815 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/433 variables, 0/815 constraints. Problems are: Problem set: 40 solved, 161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 433/433 variables, and 815 constraints, problems are : Problem set: 40 solved, 161 unsolved in 30016 ms.
Refiners :[Domain max(s): 231/231 constraints, Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 231/231 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 161/201 constraints, Known Traps: 65/65 constraints]
After SMT, in 60327ms problems are : Problem set: 40 solved, 161 unsolved
Search for dead transitions found 40 dead transitions in 60357ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in STATESPACE mode, iteration 1 : 231/231 places, 162/202 transitions.
Reduce places removed 24 places and 0 transitions.
Starting structural reductions in STATESPACE mode, iteration 2 : 207/231 places, 162/202 transitions.
Finished structural reductions in STATESPACE mode , in 2 iterations and 60560 ms. Remains : 207/231 places, 162/202 transitions.
Final net has 207 places and 162 transitions.
[2024-05-25 15:48:13] [INFO ] Flatten gal took : 93 ms
[2024-05-25 15:48:13] [INFO ] Applying decomposition
[2024-05-25 15:48:13] [INFO ] Flatten gal took : 26 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/graph8937228260680172463.txt' '-o' '/tmp/graph8937228260680172463.bin' '-w' '/tmp/graph8937228260680172463.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8937228260680172463.bin' '-l' '-1' '-v' '-w' '/tmp/graph8937228260680172463.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:48:13] [INFO ] Decomposing Gal with order
[2024-05-25 15:48:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:48:13] [INFO ] Removed a total of 39 redundant transitions.
[2024-05-25 15:48:13] [INFO ] Flatten gal took : 89 ms
[2024-05-25 15:48:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 11 ms.
[2024-05-25 15:48:13] [INFO ] Time to serialize gal into /tmp/StateSpace10563081937651569509.gal : 14 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/StateSpace10563081937651569509.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
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,25632,0.110011,6236,623,34,4681,245,568,3600,51,452,0
Total reachable state count : 25632

Max variable value : 1
STATE_SPACE MAX_TOKEN_IN_PLACE 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 36
STATE_SPACE MAX_TOKEN_PER_MARKING 36 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 25632
STATE_SPACE STATES 25632 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 61961 ms.

BK_STOP 1716652093847

--------------------
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="ParamProductionCell-PT-1"
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 ParamProductionCell-PT-1, 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 r268-smll-171654406700024"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-1.tgz
mv ParamProductionCell-PT-1 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 ;