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.r277-smll-171654416600019.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-2, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r277-smll-171654416600019
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 768K
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K 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.0K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 20K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 20:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 12 20:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 12 20:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 133K Apr 12 20:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1716762647062

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ParamProductionCell-PT-2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
Liveness PT
Running Version 202405141337
[2024-05-26 22:30:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-26 22:30:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 22:30:50] [INFO ] Load time of PNML (sax parser for PT used): 309 ms
[2024-05-26 22:30:50] [INFO ] Transformed 231 places.
[2024-05-26 22:30:50] [INFO ] Transformed 202 transitions.
[2024-05-26 22:30:50] [INFO ] Found NUPN structural information;
[2024-05-26 22:30:50] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 592 ms.
Built sparse matrix representations for Structural reductions in 11 ms.19108KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 231/231 places, 202/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 58 ms. Remains 231 /231 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 94 ms. Remains : 231/231 places, 202/202 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 231/231 places, 202/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 27 ms. Remains 231 /231 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 231 cols
[2024-05-26 22:30:50] [INFO ] Computed 59 invariants in 35 ms
[2024-05-26 22:30:51] [INFO ] Implicit Places using invariants in 541 ms returned []
[2024-05-26 22:30:51] [INFO ] Invariant cache hit.
[2024-05-26 22:30:51] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-26 22:30:51] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 1114 ms to find 0 implicit places.
[2024-05-26 22:30:51] [INFO ] Redundant transitions in 14 ms returned []
Running 200 sub problems to find dead transitions.
[2024-05-26 22:30:51] [INFO ] Invariant cache hit.
[2024-05-26 22:30:51] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 227/227 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 32/259 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 22/281 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-26 22:30:54] [INFO ] Deduced a trap composed of 10 places in 315 ms of which 46 ms to minimize.
[2024-05-26 22:30:55] [INFO ] Deduced a trap composed of 22 places in 204 ms of which 4 ms to minimize.
[2024-05-26 22:30:55] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 3 ms to minimize.
[2024-05-26 22:30:55] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 4 ms to minimize.
[2024-05-26 22:30:55] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 3 ms to minimize.
[2024-05-26 22:30:55] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 3 ms to minimize.
[2024-05-26 22:30:55] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 4 ms to minimize.
[2024-05-26 22:30:55] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-26 22:30:56] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 3 ms to minimize.
[2024-05-26 22:30:56] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 3 ms to minimize.
[2024-05-26 22:30:56] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 2 ms to minimize.
[2024-05-26 22:30:56] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 3 ms to minimize.
[2024-05-26 22:30:56] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 3 ms to minimize.
[2024-05-26 22:30:56] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 3 ms to minimize.
[2024-05-26 22:30:56] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 3 ms to minimize.
[2024-05-26 22:30:57] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-05-26 22:30:57] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-26 22:30:57] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 3 ms to minimize.
[2024-05-26 22:30:57] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 3 ms to minimize.
[2024-05-26 22:30:57] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 20/301 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-26 22:30:59] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 3 ms to minimize.
[2024-05-26 22:30:59] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 3 ms to minimize.
[2024-05-26 22:31:00] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 3 ms to minimize.
[2024-05-26 22:31:00] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
[2024-05-26 22:31:00] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 2 ms to minimize.
[2024-05-26 22:31:00] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 3 ms to minimize.
[2024-05-26 22:31:00] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 3 ms to minimize.
[2024-05-26 22:31:00] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 3 ms to minimize.
[2024-05-26 22:31:01] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 3 ms to minimize.
[2024-05-26 22:31:01] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 3 ms to minimize.
[2024-05-26 22:31:01] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-26 22:31:01] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
[2024-05-26 22:31:01] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 2 ms to minimize.
[2024-05-26 22:31:01] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-05-26 22:31:02] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 5 ms to minimize.
[2024-05-26 22:31:02] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 2 ms to minimize.
[2024-05-26 22:31:02] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 2 ms to minimize.
[2024-05-26 22:31:02] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-05-26 22:31:02] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 1 ms to minimize.
[2024-05-26 22:31:02] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 20/321 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-26 22:31:04] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2024-05-26 22:31:04] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 2 ms to minimize.
[2024-05-26 22:31:04] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 2 ms to minimize.
[2024-05-26 22:31:05] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-26 22:31:05] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-05-26 22:31:05] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 6/327 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-26 22:31:06] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-05-26 22:31:06] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-26 22:31:10] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (OVERLAPS) 3/230 variables, 3/333 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 3/336 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-26 22:31:18] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 2 ms to minimize.
[2024-05-26 22:31:18] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 3 ms to minimize.
[2024-05-26 22:31:19] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 4 ms to minimize.
[2024-05-26 22:31:19] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 2 ms to minimize.
[2024-05-26 22:31:19] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-26 22:31:20] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 6/343 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 230/433 variables, and 343 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30037 ms.
Refiners :[Domain max(s): 230/231 constraints, Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/231 constraints, ReadFeed: 0/68 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 227/227 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 32/259 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 22/281 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 54/335 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 3/230 variables, 3/338 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 3/341 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 10 (OVERLAPS) 1/231 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-26 22:31:30] [INFO ] Deduced a trap composed of 62 places in 120 ms of which 3 ms to minimize.
[2024-05-26 22:31:30] [INFO ] Deduced a trap composed of 69 places in 133 ms of which 4 ms to minimize.
[2024-05-26 22:31:31] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 14 (OVERLAPS) 202/433 variables, 231/579 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/433 variables, 68/647 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/433 variables, 200/847 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 433/433 variables, and 847 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30019 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: 200/200 constraints, Known Traps: 58/58 constraints]
After SMT, in 60281ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 60334ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 61527 ms. Remains : 231/231 places, 202/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2528 ms (no deadlock found). (steps per millisecond=494 )
Random directed walk for 1250001 steps, including 0 resets, run took 2139 ms (no deadlock found). (steps per millisecond=584 )
[2024-05-26 22:31:56] [INFO ] Invariant cache hit.
[2024-05-26 22:31:57] [INFO ] [Real]Absence check using 35 positive place invariants in 69 ms returned sat
[2024-05-26 22:31:57] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 223 ms returned sat
[2024-05-26 22:31:58] [INFO ] [Real]Absence check using state equation in 1472 ms returned sat
[2024-05-26 22:31:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 22:31:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 31 ms returned sat
[2024-05-26 22:31:59] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 37 ms returned sat
[2024-05-26 22:32:00] [INFO ] [Nat]Absence check using state equation in 1073 ms returned sat
[2024-05-26 22:32:00] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-26 22:32:00] [INFO ] [Nat]Added 68 Read/Feed constraints in 46 ms returned sat
[2024-05-26 22:32:00] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 3 ms to minimize.
[2024-05-26 22:32:00] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 3 ms to minimize.
[2024-05-26 22:32:00] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 3 ms to minimize.
[2024-05-26 22:32:01] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 4 ms to minimize.
[2024-05-26 22:32:01] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 4 ms to minimize.
[2024-05-26 22:32:01] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 4 ms to minimize.
[2024-05-26 22:32:01] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 3 ms to minimize.
[2024-05-26 22:32:01] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 4 ms to minimize.
[2024-05-26 22:32:02] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 3 ms to minimize.
[2024-05-26 22:32:02] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 3 ms to minimize.
[2024-05-26 22:32:02] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
[2024-05-26 22:32:02] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 3 ms to minimize.
[2024-05-26 22:32:02] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 3 ms to minimize.
[2024-05-26 22:32:03] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 3 ms to minimize.
[2024-05-26 22:32:03] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 2 ms to minimize.
[2024-05-26 22:32:03] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 3 ms to minimize.
[2024-05-26 22:32:03] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 3 ms to minimize.
[2024-05-26 22:32:03] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 4 ms to minimize.
[2024-05-26 22:32:04] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 3 ms to minimize.
[2024-05-26 22:32:04] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 3 ms to minimize.
[2024-05-26 22:32:04] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 4 ms to minimize.
[2024-05-26 22:32:05] [INFO ] Deduced a trap composed of 74 places in 132 ms of which 3 ms to minimize.
[2024-05-26 22:32:05] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 3 ms to minimize.
[2024-05-26 22:32:05] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 2 ms to minimize.
[2024-05-26 22:32:05] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 3 ms to minimize.
[2024-05-26 22:32:06] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 4 ms to minimize.
[2024-05-26 22:32:06] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 4 ms to minimize.
[2024-05-26 22:32:06] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 4 ms to minimize.
[2024-05-26 22:32:06] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 3 ms to minimize.
[2024-05-26 22:32:06] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-05-26 22:32:07] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 2 ms to minimize.
[2024-05-26 22:32:07] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 2 ms to minimize.
[2024-05-26 22:32:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 32 trap constraints in 7088 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 231/231 places, 202/202 transitions.
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 231 transition count 188
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 217 transition count 188
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 64 place count 199 transition count 170
Applied a total of 64 rules in 66 ms. Remains 199 /231 variables (removed 32) and now considering 170/202 (removed 32) transitions.
// Phase 1: matrix 170 rows 199 cols
[2024-05-26 22:32:07] [INFO ] Computed 59 invariants in 10 ms
[2024-05-26 22:32:08] [INFO ] Implicit Places using invariants in 721 ms returned [15, 16, 17, 18, 22, 28, 31, 32, 35, 36, 40, 41, 51, 54, 55, 61, 64, 65, 77, 78, 80, 93, 94, 96, 98, 99, 137, 138, 140, 142, 143, 168, 169, 172, 173, 178, 179, 181, 190]
[2024-05-26 22:32:08] [INFO ] Actually due to overlaps returned [80, 78, 77, 35, 40, 54, 64, 93, 94, 96, 137, 138, 140, 172, 173, 181, 17, 18, 22, 28, 36, 41, 55, 65, 178, 179, 190, 98, 99, 142, 143, 168, 169]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 731 ms to find 33 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 166/231 places, 170/202 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 166 transition count 151
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 147 transition count 151
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 38 place count 147 transition count 147
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 46 place count 143 transition count 147
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 144 place count 94 transition count 98
Applied a total of 144 rules in 31 ms. Remains 94 /166 variables (removed 72) and now considering 98/170 (removed 72) transitions.
// Phase 1: matrix 98 rows 94 cols
[2024-05-26 22:32:08] [INFO ] Computed 26 invariants in 2 ms
[2024-05-26 22:32:08] [INFO ] Implicit Places using invariants in 249 ms returned [15, 16, 23, 24, 33, 38]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 251 ms to find 6 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 88/231 places, 98/202 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 84 transition count 94
Applied a total of 8 rules in 5 ms. Remains 84 /88 variables (removed 4) and now considering 94/98 (removed 4) transitions.
// Phase 1: matrix 94 rows 84 cols
[2024-05-26 22:32:08] [INFO ] Computed 20 invariants in 2 ms
[2024-05-26 22:32:08] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-26 22:32:08] [INFO ] Invariant cache hit.
[2024-05-26 22:32:08] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-26 22:32:09] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 3 : 84/231 places, 94/202 transitions.
Finished structural reductions in LIVENESS mode , in 3 iterations and 1680 ms. Remains : 84/231 places, 94/202 transitions.
Initial state reduction rules removed 2 formulas.
RANDOM walk for 12688 steps (2 resets) in 1249 ms. (10 steps per ms) remains 0/92 properties
[2024-05-26 22:32:09] [INFO ] Flatten gal took : 80 ms
[2024-05-26 22:32:09] [INFO ] Flatten gal took : 33 ms
[2024-05-26 22:32:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14389516516596815433.gal : 15 ms
[2024-05-26 22:32:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6581339601493240693.prop : 1 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/ReachabilityCardinality14389516516596815433.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6581339601493240693.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 94 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 231/231 places, 202/202 transitions.
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 231 transition count 188
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 217 transition count 188
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 64 place count 199 transition count 170
Applied a total of 64 rules in 16 ms. Remains 199 /231 variables (removed 32) and now considering 170/202 (removed 32) transitions.
// Phase 1: matrix 170 rows 199 cols
[2024-05-26 22:32:09] [INFO ] Computed 59 invariants in 8 ms
[2024-05-26 22:32:10] [INFO ] Implicit Places using invariants in 493 ms returned [15, 16, 17, 18, 22, 28, 31, 32, 35, 36, 40, 41, 51, 54, 55, 61, 64, 65, 77, 78, 80, 93, 94, 96, 98, 99, 137, 138, 140, 142, 143, 168, 169, 172, 173, 178, 179, 181, 190]
[2024-05-26 22:32:10] [INFO ] Actually due to overlaps returned [80, 78, 77, 35, 40, 54, 64, 93, 94, 96, 137, 138, 140, 172, 173, 181, 17, 18, 22, 28, 36, 41, 55, 65, 178, 179, 190, 98, 99, 142, 143, 168, 169]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 496 ms to find 33 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 166/231 places, 170/202 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 166 transition count 151
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 147 transition count 151
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 38 place count 147 transition count 147
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 46 place count 143 transition count 147
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 144 place count 94 transition count 98
Applied a total of 144 rules in 16 ms. Remains 94 /166 variables (removed 72) and now considering 98/170 (removed 72) transitions.
// Phase 1: matrix 98 rows 94 cols
[2024-05-26 22:32:10] [INFO ] Computed 26 invariants in 1 ms
[2024-05-26 22:32:10] [INFO ] Implicit Places using invariants in 186 ms returned [15, 16, 23, 24, 33, 38]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 187 ms to find 6 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 88/231 places, 98/202 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 84 transition count 94
Applied a total of 8 rules in 5 ms. Remains 84 /88 variables (removed 4) and now considering 94/98 (removed 4) transitions.
// Phase 1: matrix 94 rows 84 cols
[2024-05-26 22:32:10] [INFO ] Computed 20 invariants in 2 ms
[2024-05-26 22:32:10] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-26 22:32:10] [INFO ] Invariant cache hit.
[2024-05-26 22:32:10] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-26 22:32:11] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 3 : 84/231 places, 94/202 transitions.
Finished structural reductions in LIVENESS mode , in 3 iterations and 1293 ms. Remains : 84/231 places, 94/202 transitions.
Net is quasi-live, checking if it is reversible to establish liveness.
[2024-05-26 22:32:11] [INFO ] Flatten gal took : 29 ms
[2024-05-26 22:32:11] [INFO ] Flatten gal took : 23 ms
[2024-05-26 22:32:11] [INFO ] Time to serialize gal into /tmp/CTLFireability11965253733582808366.gal : 63 ms
[2024-05-26 22:32:11] [INFO ] Time to serialize properties into /tmp/CTLFireability11063303119731073274.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11965253733582808366.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11063303119731073274.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8382,0.123597,5384,2,1538,5,8152,6,0,433,6601,0


Converting to forward existential form...Done !
original formula: AG(EF(((((((((ch_DC_full==1)&&(ch_DC_free==0))&&((ch_CF_free==0)&&(ch_CF_full==1)))&&(((ch_A1P_free==1)&&(ch_TA1_full==0))&&((ch_A2D_full...1917
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((((ch_DC_full==1)&&(ch_DC_free==0))&&((ch_CF_free==0)&&(ch_CF_full==1)))&&((...1977
Reverse transition relation is NOT exact ! Due to transitions deposit_belt_lock_input_area.deposit_belt_lock_output_area.DB_trans_Pstart, feed_belt_lock_in...1645
(forward)formula 0,1,0.991416,24860,1,0,260,112123,209,142,2809,75475,312
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query Liveness after proving 1 properties.
FORMULA Liveness TRUE TECHNIQUES RANDOM_WALK DECISION_DIAGRAMS TOPOLOGICAL QUASI_LIVE_REVERSIBLE INITIAL_STATE
Total runtime 82649 ms.

BK_STOP 1716762732385

--------------------
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
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ParamProductionCell-PT-2, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r277-smll-171654416600019"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-2.tgz
mv ParamProductionCell-PT-2 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;