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.r356-tall-171683761900808.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 ShieldRVs-PT-020A, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761900808
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K 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 3.6K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 12 18:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 12 18:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 17:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 12 17:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 127K 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 1717045745126

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-020A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-05-30 05:09:06] [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-30 05:09:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 05:09:06] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2024-05-30 05:09:06] [INFO ] Transformed 283 places.
[2024-05-30 05:09:06] [INFO ] Transformed 383 transitions.
[2024-05-30 05:09:06] [INFO ] Found NUPN structural information;
[2024-05-30 05:09:06] [INFO ] Parsed PT model containing 283 places and 383 transitions and 1840 arcs in 195 ms.
Starting structural reductions in STATESPACE mode, iteration 0 : 283/283 places, 383/383 transitions.
[2024-05-30 05:09:06] [INFO ] Redundant transitions in 203 ms returned [123]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 381 sub problems to find dead transitions.
// Phase 1: matrix 382 rows 283 cols
[2024-05-30 05:09:06] [INFO ] Computed 81 invariants in 20 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 282/282 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (OVERLAPS) 1/283 variables, 81/363 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-05-30 05:09:12] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 13 ms to minimize.
[2024-05-30 05:09:12] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-05-30 05:09:12] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2024-05-30 05:09:12] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-30 05:09:13] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2024-05-30 05:09:13] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-30 05:09:13] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2024-05-30 05:09:13] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-30 05:09:13] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-05-30 05:09:13] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
[2024-05-30 05:09:13] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-30 05:09:13] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-30 05:09:13] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-30 05:09:13] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2024-05-30 05:09:13] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-30 05:09:13] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-30 05:09:14] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-30 05:09:14] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-30 05:09:14] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-05-30 05:09:14] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 20/384 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-05-30 05:09:14] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-30 05:09:14] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-05-30 05:09:14] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-05-30 05:09:14] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2024-05-30 05:09:14] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-05-30 05:09:15] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-30 05:09:15] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-30 05:09:15] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
[2024-05-30 05:09:15] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-30 05:09:15] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 3 ms to minimize.
[2024-05-30 05:09:15] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2024-05-30 05:09:15] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-05-30 05:09:15] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-30 05:09:15] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-05-30 05:09:15] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-05-30 05:09:15] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-30 05:09:16] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2024-05-30 05:09:16] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-05-30 05:09:16] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-05-30 05:09:16] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 20/404 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-05-30 05:09:16] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 2 ms to minimize.
[2024-05-30 05:09:16] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-05-30 05:09:16] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-30 05:09:16] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-30 05:09:17] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-05-30 05:09:17] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-05-30 05:09:17] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 2 ms to minimize.
[2024-05-30 05:09:17] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-30 05:09:17] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2024-05-30 05:09:17] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-05-30 05:09:17] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-30 05:09:17] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-05-30 05:09:17] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
[2024-05-30 05:09:17] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-05-30 05:09:17] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-30 05:09:18] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-30 05:09:18] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 9 ms to minimize.
[2024-05-30 05:09:18] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-30 05:09:18] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-30 05:09:18] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 20/424 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-05-30 05:09:20] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-05-30 05:09:20] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 2 ms to minimize.
[2024-05-30 05:09:20] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2024-05-30 05:09:20] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-05-30 05:09:20] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-30 05:09:20] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-30 05:09:21] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2024-05-30 05:09:21] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 2 ms to minimize.
[2024-05-30 05:09:21] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-05-30 05:09:21] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-30 05:09:21] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 1 ms to minimize.
[2024-05-30 05:09:21] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 1 ms to minimize.
[2024-05-30 05:09:21] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
[2024-05-30 05:09:21] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-05-30 05:09:21] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-30 05:09:21] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2024-05-30 05:09:22] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 2 ms to minimize.
[2024-05-30 05:09:22] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-30 05:09:22] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-30 05:09:22] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 20/444 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-05-30 05:09:22] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-05-30 05:09:22] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-30 05:09:23] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-05-30 05:09:23] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2024-05-30 05:09:23] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-30 05:09:23] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-30 05:09:23] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-30 05:09:23] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 2 ms to minimize.
[2024-05-30 05:09:23] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 2 ms to minimize.
[2024-05-30 05:09:23] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-05-30 05:09:23] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-30 05:09:23] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-05-30 05:09:23] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-30 05:09:24] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2024-05-30 05:09:24] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 2 ms to minimize.
[2024-05-30 05:09:24] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-30 05:09:24] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-30 05:09:24] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 2 ms to minimize.
[2024-05-30 05:09:24] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-30 05:09:24] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-05-30 05:09:25] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-30 05:09:25] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-30 05:09:25] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-05-30 05:09:25] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2024-05-30 05:09:25] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 2 ms to minimize.
[2024-05-30 05:09:25] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2024-05-30 05:09:25] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-05-30 05:09:26] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-30 05:09:26] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-30 05:09:26] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 2 ms to minimize.
[2024-05-30 05:09:26] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2024-05-30 05:09:26] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2024-05-30 05:09:26] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-30 05:09:26] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
[2024-05-30 05:09:26] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
[2024-05-30 05:09:26] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-30 05:09:26] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
[2024-05-30 05:09:27] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-05-30 05:09:27] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-30 05:09:27] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-05-30 05:09:29] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-05-30 05:09:29] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-30 05:09:29] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2024-05-30 05:09:30] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2024-05-30 05:09:30] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
[2024-05-30 05:09:30] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-30 05:09:30] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-05-30 05:09:30] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-30 05:09:31] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 9/493 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 12 (OVERLAPS) 382/665 variables, 283/776 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 665/665 variables, and 776 constraints, problems are : Problem set: 0 solved, 381 unsolved in 30023 ms.
Refiners :[Domain max(s): 283/283 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 129/129 constraints]
Escalating to Integer solving :Problem set: 0 solved, 381 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 282/282 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (OVERLAPS) 1/283 variables, 81/363 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 129/493 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-05-30 05:09:39] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2024-05-30 05:09:39] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-05-30 05:09:39] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-05-30 05:09:40] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-30 05:09:40] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2024-05-30 05:09:40] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 6/499 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-05-30 05:09:42] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-05-30 05:09:44] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 9 (OVERLAPS) 382/665 variables, 283/784 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/665 variables, 381/1165 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-05-30 05:09:55] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-30 05:09:57] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-30 05:09:59] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-30 05:10:01] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-30 05:10:02] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-30 05:10:04] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 2 ms to minimize.
[2024-05-30 05:10:06] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 665/665 variables, and 1172 constraints, problems are : Problem set: 0 solved, 381 unsolved in 30030 ms.
Refiners :[Domain max(s): 283/283 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 144/144 constraints]
After SMT, in 60308ms problems are : Problem set: 0 solved, 381 unsolved
Search for dead transitions found 0 dead transitions in 60327ms
Starting structural reductions in STATESPACE mode, iteration 1 : 283/283 places, 382/383 transitions.
Finished structural reductions in STATESPACE mode , in 2 iterations and 60667 ms. Remains : 283/283 places, 382/383 transitions.
Final net has 283 places and 382 transitions.
[2024-05-30 05:10:07] [INFO ] Flatten gal took : 75 ms
[2024-05-30 05:10:07] [INFO ] Applying decomposition
[2024-05-30 05:10:07] [INFO ] Flatten gal took : 33 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/graph4413672668246814092.txt' '-o' '/tmp/graph4413672668246814092.bin' '-w' '/tmp/graph4413672668246814092.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4413672668246814092.bin' '-l' '-1' '-v' '-w' '/tmp/graph4413672668246814092.weights' '-q' '0' '-e' '0.001'
[2024-05-30 05:10:07] [INFO ] Decomposing Gal with order
[2024-05-30 05:10:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 05:10:07] [INFO ] Removed a total of 415 redundant transitions.
[2024-05-30 05:10:07] [INFO ] Flatten gal took : 75 ms
[2024-05-30 05:10:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 432 labels/synchronizations in 21 ms.
[2024-05-30 05:10:07] [INFO ] Time to serialize gal into /tmp/StateSpace6984844235700143993.gal : 7 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/StateSpace6984844235700143993.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 ...219
ITS-tools command line returned an error code 137
[2024-05-30 05:23:01] [INFO ] Applying decomposition
[2024-05-30 05:23:01] [INFO ] Flatten gal took : 25 ms
[2024-05-30 05:23:01] [INFO ] Decomposing Gal with order
[2024-05-30 05:23:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 05:23:01] [INFO ] Removed a total of 415 redundant transitions.
[2024-05-30 05:23:01] [INFO ] Flatten gal took : 43 ms
[2024-05-30 05:23:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 236 labels/synchronizations in 7 ms.
[2024-05-30 05:23:01] [INFO ] Time to serialize gal into /tmp/StateSpace774186703222503495.gal : 4 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/StateSpace774186703222503495.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 ...218
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,7.19359e+39,22.6125,527492,7497,28,919168,343,530,2.31424e+06,29,442,0
Total reachable state count : 7193592354493326218434635165242924990464

Max variable value : 1
STATE_SPACE MAX_TOKEN_IN_PLACE 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 81
STATE_SPACE MAX_TOKEN_PER_MARKING 81 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 7193592354493326218197825082077481876011
STATE_SPACE STATES 7193592354493326218197825082077481876011 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 857714 ms.

BK_STOP 1717046604099

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="ShieldRVs-PT-020A"
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 ShieldRVs-PT-020A, 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 r356-tall-171683761900808"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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