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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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 23K 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 19K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 12 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 20:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 20:32 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 149K 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 1716762386862

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-0
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
Liveness PT
Running Version 202405141337
[2024-05-26 22:26:29] [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:26:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 22:26:29] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2024-05-26 22:26:29] [INFO ] Transformed 198 places.
[2024-05-26 22:26:29] [INFO ] Transformed 176 transitions.
[2024-05-26 22:26:29] [INFO ] Found NUPN structural information;
[2024-05-26 22:26:29] [INFO ] Parsed PT model containing 198 places and 176 transitions and 730 arcs in 564 ms.
Built sparse matrix representations for Structural reductions in 11 ms.18114KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 198/198 places, 176/176 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 53 ms. Remains 198 /198 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 87 ms. Remains : 198/198 places, 176/176 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 198/198 places, 176/176 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 37 ms. Remains 198 /198 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 198 cols
[2024-05-26 22:26:30] [INFO ] Computed 49 invariants in 35 ms
[2024-05-26 22:26:30] [INFO ] Implicit Places using invariants in 651 ms returned []
[2024-05-26 22:26:30] [INFO ] Invariant cache hit.
[2024-05-26 22:26:31] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-26 22:26:31] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 1154 ms to find 0 implicit places.
[2024-05-26 22:26:31] [INFO ] Redundant transitions in 12 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-26 22:26:31] [INFO ] Invariant cache hit.
[2024-05-26 22:26:31] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 30/226 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 17/243 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-26 22:26:33] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 36 ms to minimize.
[2024-05-26 22:26:34] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 4 ms to minimize.
[2024-05-26 22:26:34] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 3 ms to minimize.
[2024-05-26 22:26:34] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 4 ms to minimize.
[2024-05-26 22:26:34] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 3 ms to minimize.
[2024-05-26 22:26:34] [INFO ] Deduced a trap composed of 56 places in 116 ms of which 3 ms to minimize.
[2024-05-26 22:26:34] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 3 ms to minimize.
[2024-05-26 22:26:34] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 3 ms to minimize.
[2024-05-26 22:26:35] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-26 22:26:35] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 2 ms to minimize.
[2024-05-26 22:26:35] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 3 ms to minimize.
[2024-05-26 22:26:35] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 3 ms to minimize.
[2024-05-26 22:26:35] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 3 ms to minimize.
[2024-05-26 22:26:35] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 3 ms to minimize.
[2024-05-26 22:26:35] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 3 ms to minimize.
[2024-05-26 22:26:35] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 2 ms to minimize.
[2024-05-26 22:26:35] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 3 ms to minimize.
[2024-05-26 22:26:36] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 2 ms to minimize.
[2024-05-26 22:26:36] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 3 ms to minimize.
[2024-05-26 22:26:36] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 20/263 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-26 22:26:37] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-26 22:26:38] [INFO ] Deduced a trap composed of 67 places in 148 ms of which 3 ms to minimize.
[2024-05-26 22:26:38] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2024-05-26 22:26:38] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 2 ms to minimize.
[2024-05-26 22:26:38] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 2 ms to minimize.
[2024-05-26 22:26:38] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 2 ms to minimize.
[2024-05-26 22:26:38] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 2 ms to minimize.
[2024-05-26 22:26:39] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 2 ms to minimize.
[2024-05-26 22:26:39] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
[2024-05-26 22:26:39] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
[2024-05-26 22:26:39] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
[2024-05-26 22:26:39] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 2 ms to minimize.
[2024-05-26 22:26:39] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 1 ms to minimize.
[2024-05-26 22:26:39] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 3 ms to minimize.
[2024-05-26 22:26:39] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 8 ms to minimize.
[2024-05-26 22:26:39] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-05-26 22:26:40] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-26 22:26:40] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 2 ms to minimize.
[2024-05-26 22:26:40] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-05-26 22:26:40] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 20/283 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-26 22:26:41] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-26 22:26:41] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 2 ms to minimize.
[2024-05-26 22:26:41] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-26 22:26:41] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-26 22:26:41] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-26 22:26:41] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-26 22:26:42] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 7/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-26 22:26:44] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-26 22:26:47] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 2/198 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 176/374 variables, 198/494 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/374 variables, 59/553 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 374/374 variables, and 553 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30027 ms.
Refiners :[Domain max(s): 198/198 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 198/198 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 30/226 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 17/243 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 49/292 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 2/198 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-26 22:27:05] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 176/374 variables, 198/495 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 59/554 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 175/729 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 13 (OVERLAPS) 0/374 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 729 constraints, problems are : Problem set: 0 solved, 175 unsolved in 29815 ms.
Refiners :[Domain max(s): 198/198 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 198/198 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 50/50 constraints]
After SMT, in 60090ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 60118ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 61346 ms. Remains : 198/198 places, 176/176 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2253 ms (no deadlock found). (steps per millisecond=554 )
Random directed walk for 1250000 steps, including 0 resets, run took 1538 ms (no deadlock found). (steps per millisecond=812 )
[2024-05-26 22:27:35] [INFO ] Invariant cache hit.
[2024-05-26 22:27:35] [INFO ] [Real]Absence check using 32 positive place invariants in 39 ms returned sat
[2024-05-26 22:27:35] [INFO ] [Real]Absence check using 32 positive and 17 generalized place invariants in 53 ms returned sat
[2024-05-26 22:27:36] [INFO ] [Real]Absence check using state equation in 571 ms returned sat
[2024-05-26 22:27:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 22:27:36] [INFO ] [Nat]Absence check using 32 positive place invariants in 24 ms returned sat
[2024-05-26 22:27:36] [INFO ] [Nat]Absence check using 32 positive and 17 generalized place invariants in 25 ms returned sat
[2024-05-26 22:27:36] [INFO ] [Nat]Absence check using state equation in 384 ms returned sat
[2024-05-26 22:27:36] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-26 22:27:36] [INFO ] [Nat]Added 59 Read/Feed constraints in 33 ms returned sat
[2024-05-26 22:27:36] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 ms to minimize.
[2024-05-26 22:27:36] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 2 ms to minimize.
[2024-05-26 22:27:37] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
[2024-05-26 22:27:37] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 14 ms to minimize.
[2024-05-26 22:27:37] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 5 ms to minimize.
[2024-05-26 22:27:37] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 2 ms to minimize.
[2024-05-26 22:27:37] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 13 ms to minimize.
[2024-05-26 22:27:37] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 2 ms to minimize.
[2024-05-26 22:27:37] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 2 ms to minimize.
[2024-05-26 22:27:37] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 2 ms to minimize.
[2024-05-26 22:27:37] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 2 ms to minimize.
[2024-05-26 22:27:38] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-26 22:27:38] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2024-05-26 22:27:38] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 2 ms to minimize.
[2024-05-26 22:27:38] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 3 ms to minimize.
[2024-05-26 22:27:38] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-05-26 22:27:38] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2024-05-26 22:27:38] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-26 22:27:38] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-05-26 22:27:38] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2024-05-26 22:27:38] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-05-26 22:27:39] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 3 ms to minimize.
[2024-05-26 22:27:39] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
[2024-05-26 22:27:39] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 2 ms to minimize.
[2024-05-26 22:27:39] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 2 ms to minimize.
[2024-05-26 22:27:39] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-26 22:27:39] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 3 ms to minimize.
[2024-05-26 22:27:39] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 3 ms to minimize.
[2024-05-26 22:27:40] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 3 ms to minimize.
[2024-05-26 22:27:40] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 2 ms to minimize.
[2024-05-26 22:27:40] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 3 ms to minimize.
[2024-05-26 22:27:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 31 trap constraints in 3794 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 198/198 places, 176/176 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 198 transition count 164
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 186 transition count 164
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 20 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 62 place count 166 transition count 146
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 62 place count 166 transition count 145
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 65 place count 164 transition count 145
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 162 transition count 144
Applied a total of 68 rules in 69 ms. Remains 162 /198 variables (removed 36) and now considering 144/176 (removed 32) transitions.
// Phase 1: matrix 144 rows 162 cols
[2024-05-26 22:27:40] [INFO ] Computed 45 invariants in 6 ms
[2024-05-26 22:27:41] [INFO ] Implicit Places using invariants in 527 ms returned [11, 12, 13, 14, 18, 24, 27, 28, 31, 32, 36, 37, 47, 50, 51, 57, 60, 61, 73, 74, 76, 89, 90, 92, 94, 95, 133, 134, 136, 138, 139]
[2024-05-26 22:27:41] [INFO ] Actually due to overlaps returned [76, 74, 73, 31, 36, 50, 60, 89, 90, 92, 133, 134, 136, 13, 14, 18, 24, 32, 37, 51, 61, 94, 95, 138, 139]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 531 ms to find 25 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 137/198 places, 144/176 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 137 transition count 131
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 124 transition count 131
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 26 place count 124 transition count 127
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 34 place count 120 transition count 127
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 120 place count 77 transition count 84
Applied a total of 120 rules in 17 ms. Remains 77 /137 variables (removed 60) and now considering 84/144 (removed 60) transitions.
// Phase 1: matrix 84 rows 77 cols
[2024-05-26 22:27:41] [INFO ] Computed 20 invariants in 1 ms
[2024-05-26 22:27:41] [INFO ] Implicit Places using invariants in 199 ms returned [11, 12, 19, 20, 29, 34]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 214 ms to find 6 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 71/198 places, 84/176 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 66 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 65 transition count 78
Applied a total of 12 rules in 6 ms. Remains 65 /71 variables (removed 6) and now considering 78/84 (removed 6) transitions.
// Phase 1: matrix 78 rows 65 cols
[2024-05-26 22:27:41] [INFO ] Computed 14 invariants in 1 ms
[2024-05-26 22:27:41] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-26 22:27:41] [INFO ] Invariant cache hit.
[2024-05-26 22:27:41] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-26 22:27:41] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 3 : 65/198 places, 78/176 transitions.
Finished structural reductions in LIVENESS mode , in 3 iterations and 1295 ms. Remains : 65/198 places, 78/176 transitions.
Initial state reduction rules removed 1 formulas.
RANDOM walk for 4968 steps (0 resets) in 1012 ms. (4 steps per ms) remains 0/77 properties
[2024-05-26 22:27:42] [INFO ] Flatten gal took : 83 ms
[2024-05-26 22:27:42] [INFO ] Flatten gal took : 27 ms
[2024-05-26 22:27:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5348292677942760405.gal : 13 ms
[2024-05-26 22:27:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7644768374513168630.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/ReachabilityCardinality5348292677942760405.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7644768374513168630.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

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 ...328
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 78 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 198/198 places, 176/176 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 198 transition count 164
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 186 transition count 164
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 20 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 62 place count 166 transition count 146
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 62 place count 166 transition count 145
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 65 place count 164 transition count 145
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 162 transition count 144
Applied a total of 68 rules in 15 ms. Remains 162 /198 variables (removed 36) and now considering 144/176 (removed 32) transitions.
// Phase 1: matrix 144 rows 162 cols
[2024-05-26 22:27:42] [INFO ] Computed 45 invariants in 8 ms
[2024-05-26 22:27:42] [INFO ] Implicit Places using invariants in 283 ms returned [11, 12, 13, 14, 18, 24, 27, 28, 31, 32, 36, 37, 47, 50, 51, 57, 60, 61, 73, 74, 76, 89, 90, 92, 94, 95, 133, 134, 136, 138, 139]
[2024-05-26 22:27:42] [INFO ] Actually due to overlaps returned [76, 74, 73, 31, 36, 50, 60, 89, 90, 92, 133, 134, 136, 13, 14, 18, 24, 32, 37, 51, 61, 94, 95, 138, 139]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 285 ms to find 25 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 137/198 places, 144/176 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 137 transition count 131
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 124 transition count 131
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 26 place count 124 transition count 127
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 34 place count 120 transition count 127
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 120 place count 77 transition count 84
Applied a total of 120 rules in 8 ms. Remains 77 /137 variables (removed 60) and now considering 84/144 (removed 60) transitions.
// Phase 1: matrix 84 rows 77 cols
[2024-05-26 22:27:42] [INFO ] Computed 20 invariants in 0 ms
[2024-05-26 22:27:42] [INFO ] Implicit Places using invariants in 91 ms returned [11, 12, 19, 20, 29, 34]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 94 ms to find 6 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 71/198 places, 84/176 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 66 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 65 transition count 78
Applied a total of 12 rules in 4 ms. Remains 65 /71 variables (removed 6) and now considering 78/84 (removed 6) transitions.
// Phase 1: matrix 78 rows 65 cols
[2024-05-26 22:27:42] [INFO ] Computed 14 invariants in 1 ms
[2024-05-26 22:27:42] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-26 22:27:42] [INFO ] Invariant cache hit.
[2024-05-26 22:27:43] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-26 22:27:43] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 3 : 65/198 places, 78/176 transitions.
Finished structural reductions in LIVENESS mode , in 3 iterations and 642 ms. Remains : 65/198 places, 78/176 transitions.
Net is quasi-live, checking if it is reversible to establish liveness.
[2024-05-26 22:27:43] [INFO ] Flatten gal took : 17 ms
[2024-05-26 22:27:43] [INFO ] Flatten gal took : 15 ms
[2024-05-26 22:27:43] [INFO ] Time to serialize gal into /tmp/CTLFireability6063104316511609904.gal : 4 ms
[2024-05-26 22:27:43] [INFO ] Time to serialize properties into /tmp/CTLFireability12590092187587085981.ctl : 2 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/CTLFireability6063104316511609904.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12590092187587085981.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 -...284
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,7928,0.095344,6304,2,1105,5,12577,6,0,341,12066,0


Converting to forward existential form...Done !
original formula: AG(EF(((((((((ch_A1P_free==1)&&(ch_TA1_full==0))&&((ch_A2D_free==1)&&(ch_PA2_full==0)))&&(((swivel==1)&&(press_at_upper_pos==0))&&((press...1479
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((((ch_A1P_free==1)&&(ch_TA1_full==0))&&((ch_A2D_free==1)&&(ch_PA2_full==0)))...1539
Reverse transition relation is NOT exact ! Due to transitions TL_rot_Cstop.TL_rot_Pstop.TL_lower_Pstart, TU_rot_Cstop.TU_rot_Pstop.TU_lift_Pstart, A2U_rot1...1539
(forward)formula 0,1,1.09557,26888,1,0,231,134790,177,128,2230,90260,284
Formula is TRUE !

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

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 75233 ms.

BK_STOP 1716762464388

--------------------
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-0"
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-0, 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-171654416500009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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