Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r147-tall-174876819600229.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is ParamProductionCell-PT-1, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r147-tall-174876819600229
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 174K May 29 14:32 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 1748809826977

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-1
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
Liveness PT
Running Version 202505121319
[2025-06-01 20:30:28] [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]
[2025-06-01 20:30:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 20:30:28] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2025-06-01 20:30:28] [INFO ] Transformed 231 places.
[2025-06-01 20:30:28] [INFO ] Transformed 202 transitions.
[2025-06-01 20:30:28] [INFO ] Found NUPN structural information;
[2025-06-01 20:30:28] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 162 ms.
Built sparse matrix representations for Structural reductions in 6 ms.20479KB 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 31 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 43 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 11 ms. Remains 231 /231 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 231 cols
[2025-06-01 20:30:28] [INFO ] Computed 59 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 20:30:28] [INFO ] Implicit Places using invariants in 276 ms returned []
[2025-06-01 20:30:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 20:30:28] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-01 20:30:28] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 20:30:28] [INFO ] Redundant transitions in 6 ms returned []
Running 201 sub problems to find dead transitions.
[2025-06-01 20:30:29] [INFO ] Invariant cache hit.
[2025-06-01 20:30:29] [INFO ] State equation strengthened by 68 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 229/229 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 34/263 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 23/286 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:30] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:30] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:30] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:30] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:30] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:30] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:30] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:30] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:30] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:31] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:31] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:31] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:31] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:31] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:31] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:31] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:31] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:31] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:31] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:31] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 11 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD130 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 20/306 constraints. Problems are: Problem set: 8 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:33] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:33] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:34] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:34] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 7 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:34] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 14 ms to minimize.
Problem TDEAD73 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:34] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:34] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 11 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:34] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:34] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 10 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:34] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:35] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:35] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:35] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 12 ms to minimize.
Problem TDEAD125 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:35] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 5 ms to minimize.
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:35] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 9 ms to minimize.
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD149 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:35] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 6 ms to minimize.
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:35] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:35] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:36] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:36] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 6 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 20/326 constraints. Problems are: Problem set: 30 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:37] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:37] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:38] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:38] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 4/330 constraints. Problems are: Problem set: 30 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:39] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 1/331 constraints. Problems are: Problem set: 30 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/331 constraints. Problems are: Problem set: 30 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 1/230 variables, 1/332 constraints. Problems are: Problem set: 30 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 1/333 constraints. Problems are: Problem set: 30 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:46] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:46] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:46] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:47] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:47] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 5/338 constraints. Problems are: Problem set: 30 solved, 171 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 0/338 constraints. Problems are: Problem set: 30 solved, 171 unsolved
At refinement iteration 12 (OVERLAPS) 1/231 variables, 1/339 constraints. Problems are: Problem set: 30 solved, 171 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 1/340 constraints. Problems are: Problem set: 30 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:53] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 13 ms to minimize.
Problem TDEAD94 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:53] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 15 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD150 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:54] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 13 ms to minimize.
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:30:54] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 8 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/231 variables, 4/344 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/231 variables, 0/344 constraints. Problems are: Problem set: 40 solved, 161 unsolved
SMT process timed out in 30087ms, After SMT, problems are : Problem set: 40 solved, 161 unsolved
Search for dead transitions found 40 dead transitions in 30094ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 231/231 places, 162/202 transitions.
Computed a total of 24 stabilizing places and 0 stable transitions
Graph (complete) has 643 edges and 231 vertex of which 207 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
Discarding 24 places :
Also discarding 0 output 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 1 rules in 13 ms. Remains 207 /231 variables (removed 24) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 207 cols
[2025-06-01 20:30:59] [INFO ] Computed 59 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 20:30:59] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-01 20:30:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 20:30:59] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-01 20:30:59] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 207/231 places, 162/202 transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 30881 ms. Remains : 207/231 places, 162/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1527 ms (no deadlock found). (steps per millisecond=818 )
Random directed walk for 1250000 steps, including 0 resets, run took 1316 ms (no deadlock found). (steps per millisecond=949 )
[2025-06-01 20:31:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-01 20:31:02] [INFO ] [Real]Absence check using 35 positive place invariants in 105 ms returned sat
[2025-06-01 20:31:03] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 701 ms returned sat
[2025-06-01 20:31:09] [INFO ] [Real]Absence check using state equation in 6447 ms returned sat
[2025-06-01 20:31:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-01 20:31:09] [INFO ] [Nat]Absence check using 35 positive place invariants in 25 ms returned sat
[2025-06-01 20:31:09] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 68 ms returned sat
[2025-06-01 20:31:10] [INFO ] [Nat]Absence check using state equation in 720 ms returned sat
[2025-06-01 20:31:10] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-01 20:31:10] [INFO ] [Nat]Added 48 Read/Feed constraints in 21 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:10] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:10] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:10] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:10] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:10] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:10] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:10] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:11] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:11] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:11] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:11] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:11] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:11] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:12] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:12] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:12] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:12] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:12] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:12] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:12] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:13] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:13] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:13] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 7 ms to minimize.
[2025-06-01 20:31:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 23 trap constraints in 3110 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 24 ms. Remains 199 /231 variables (removed 32) and now considering 170/202 (removed 32) transitions.
// Phase 1: matrix 170 rows 199 cols
[2025-06-01 20:31:13] [INFO ] Computed 59 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 20:31:13] [INFO ] Implicit Places using invariants in 451 ms returned [1, 2, 9, 14, 15, 16, 17, 18, 22, 28, 31, 32, 35, 36, 40, 41, 51, 54, 55, 61, 64, 65, 71, 77, 78, 80, 93, 94, 96, 98, 99, 122, 137, 138, 140, 142, 143, 166, 168, 169, 172, 173, 178, 179, 181, 190]
[2025-06-01 20:31:13] [INFO ] Actually due to overlaps returned [80, 78, 77, 14, 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 34 places :
Implicit Place search using SMT only with invariants took 454 ms to find 34 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 165/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 165 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 146 transition count 151
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 38 place count 146 transition count 143
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 54 place count 138 transition count 143
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 152 place count 89 transition count 94
Applied a total of 152 rules in 15 ms. Remains 89 /165 variables (removed 76) and now considering 94/170 (removed 76) transitions.
// Phase 1: matrix 94 rows 89 cols
[2025-06-01 20:31:14] [INFO ] Computed 25 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 20:31:14] [INFO ] Implicit Places using invariants in 92 ms returned [1, 2, 9, 14, 15, 22, 23, 32, 37, 42, 61, 76]
[2025-06-01 20:31:14] [INFO ] Actually due to overlaps returned [9, 42, 61, 1, 2, 14, 15, 22, 23, 37, 76]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 93 ms to find 11 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 78/231 places, 94/202 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 73 transition count 89
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 72 transition count 88
Applied a total of 12 rules in 4 ms. Remains 72 /78 variables (removed 6) and now considering 88/94 (removed 6) transitions.
// Phase 1: matrix 88 rows 72 cols
[2025-06-01 20:31:14] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 20:31:14] [INFO ] Implicit Places using invariants in 55 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 3 : 71/231 places, 88/202 transitions.
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 2 place count 70 transition count 87
Applied a total of 2 rules in 2 ms. Remains 70 /71 variables (removed 1) and now considering 87/88 (removed 1) transitions.
// Phase 1: matrix 87 rows 70 cols
[2025-06-01 20:31:14] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 20:31:14] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-01 20:31:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 20:31:14] [INFO ] State equation strengthened by 67 read => feed constraints.
[2025-06-01 20:31:14] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 4 : 70/231 places, 87/202 transitions.
Finished structural reductions in LIVENESS mode , in 4 iterations and 848 ms. Remains : 70/231 places, 87/202 transitions.
Initial state reduction rules removed 1 formulas.
[2025-06-01 20:31:14] [INFO ] Flatten gal took : 33 ms
[2025-06-01 20:31:14] [INFO ] Flatten gal took : 11 ms
[2025-06-01 20:31:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10162584218355198526.gal : 5 ms
[2025-06-01 20:31:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14559297302205893935.prop : 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10162584218355198526.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14559297302205893935.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (8 resets) in 1278 ms. (31 steps per ms) remains 24/86 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14559297302205893935.prop.
Reachability property qltransition_79 is true.
Reachability property qltransition_78 is true.
Reachability property qltransition_36 is true.
SDD proceeding with computation,83 properties remain. new max is 2
SDD size :1 after 4
Reachability property qltransition_35 is true.
SDD proceeding with computation,82 properties remain. new max is 2
SDD size :4 after 5
Reachability property qltransition_84 is true.
Reachability property qltransition_77 is true.
Reachability property qltransition_33 is true.
SDD proceeding with computation,79 properties remain. new max is 2
SDD size :5 after 8
BEST_FIRST walk for 4000 steps (8 resets) in 106 ms. (37 steps per ms) remains 24/24 properties
Reachability property qltransition_75 is true.
Reachability property qltransition_31 is true.
SDD proceeding with computation,77 properties remain. new max is 2
SDD size :8 after 10
Reachability property qltransition_76 is true.
Reachability property qltransition_32 is true.
SDD proceeding with computation,75 properties remain. new max is 2
SDD size :10 after 12
Reachability property qltransition_37 is true.
SDD proceeding with computation,74 properties remain. new max is 2
SDD size :12 after 13
Reachability property qltransition_46 is true.
Reachability property qltransition_10 is true.
Reachability property qltransition_9 is true.
SDD proceeding with computation,71 properties remain. new max is 2
SDD size :13 after 16
Reachability property qltransition_82 is true.
SDD proceeding with computation,70 properties remain. new max is 2
SDD size :16 after 17
Reachability property qltransition_44 is true.
Reachability property qltransition_6 is true.
SDD proceeding with computation,68 properties remain. new max is 2
SDD size :17 after 19
Reachability property qltransition_5 is true.
SDD proceeding with computation,67 properties remain. new max is 2
SDD size :19 after 20
Reachability property qltransition_63 is true.
Reachability property qltransition_43 is true.
Reachability property qltransition_23 is true.
SDD proceeding with computation,64 properties remain. new max is 2
SDD size :21 after 23
Reachability property qltransition_67 is true.
Reachability property qltransition_66 is true.
Reachability property qltransition_24 is true.
SDD proceeding with computation,61 properties remain. new max is 2
SDD size :23 after 26
Reachability property qltransition_81 is true.
Reachability property qltransition_25 is true.
SDD proceeding with computation,59 properties remain. new max is 2
SDD size :26 after 28
Reachability property qltransition_71 is true.
Reachability property qltransition_68 is true.
Reachability property qltransition_26 is true.
Reachability property qltransition_3 is true.
SDD proceeding with computation,55 properties remain. new max is 2
SDD size :28 after 31
Reachability property qltransition_74 is true.
Reachability property qltransition_30 is true.
Reachability property qltransition_29 is true.
SDD proceeding with computation,52 properties remain. new max is 2
SDD size :31 after 34
Reachability property qltransition_80 is true.
SDD proceeding with computation,51 properties remain. new max is 2
SDD size :34 after 35
Reachability property qltransition_1 is true.
SDD proceeding with computation,50 properties remain. new max is 2
SDD size :35 after 36
Reachability property qltransition_39 is true.
Reachability property qltransition_38 is true.
Reachability property qltransition_0 is true.
SDD proceeding with computation,47 properties remain. new max is 2
SDD size :36 after 39
Reachability property qltransition_58 is true.
Reachability property qltransition_55 is true.
Reachability property qltransition_17 is true.
SDD proceeding with computation,44 properties remain. new max is 2
SDD size :39 after 42
Reachability property qltransition_19 is true.
SDD proceeding with computation,43 properties remain. new max is 2
SDD size :42 after 43
Reachability property qltransition_83 is true.
Reachability property qltransition_60 is true.
Reachability property qltransition_20 is true.
SDD proceeding with computation,40 properties remain. new max is 2
SDD size :43 after 46
Reachability property qltransition_52 is true.
Reachability property qltransition_49 is true.
Reachability property qltransition_13 is true.
Reachability property qltransition_2 is true.
SDD proceeding with computation,36 properties remain. new max is 2
SDD size :46 after 49
Reachability property qltransition_14 is true.
SDD proceeding with computation,35 properties remain. new max is 2
SDD size :49 after 50
Reachability property qltransition_86 is true.
Reachability property qltransition_53 is true.
Reachability property qltransition_15 is true.
SDD proceeding with computation,32 properties remain. new max is 2
SDD size :50 after 53
Reachability property qltransition_45 is true.
Reachability property qltransition_7 is true.
SDD proceeding with computation,30 properties remain. new max is 2
SDD size :53 after 55
Reachability property qltransition_85 is true.
Reachability property qltransition_40 is true.
Reachability property qltransition_8 is true.
SDD proceeding with computation,27 properties remain. new max is 2
SDD size :55 after 68
SDD proceeding with computation,27 properties remain. new max is 4
SDD size :68 after 77
SDD proceeding with computation,27 properties remain. new max is 8
SDD size :77 after 79
SDD proceeding with computation,27 properties remain. new max is 16
SDD size :79 after 94
Reachability property qltransition_42 is true.
Reachability property qltransition_41 is true.
Reachability property qltransition_4 is true.
SDD proceeding with computation,24 properties remain. new max is 16
SDD size :94 after 388
SDD proceeding with computation,24 properties remain. new max is 32
SDD size :465 after 475
SDD proceeding with computation,24 properties remain. new max is 64
SDD size :481 after 495
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,505,0.065263,6396,2,508,102,4638,30,0,411,1564,0
Total reachable state count : 505

Verifying 86 reachability properties.
Reachability property qltransition_0 is true.
BEST_FIRST walk for 4001 steps (8 resets) in 54 ms. (72 steps per ms) remains 24/24 properties

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_0,1,0.065839,6524,2,71,102,4638,31,0,417,1564,0
Reachability property qltransition_1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_1,1,0.066337,6652,2,71,102,4638,32,0,422,1564,0
Reachability property qltransition_2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_2,1,0.066569,6652,2,71,102,4638,33,0,427,1564,0
Reachability property qltransition_3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_3,92,0.066844,6652,2,320,102,4638,34,0,432,1564,0
Reachability property qltransition_4 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_4,92,0.067082,6652,2,320,102,4638,35,0,437,1564,0
Reachability property qltransition_5 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_5,3,0.067269,6652,2,91,102,4638,36,0,442,1564,0
Reachability property qltransition_6 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_6,3,0.067448,6652,2,91,102,4638,37,0,447,1564,0
Reachability property qltransition_7 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_7,2,0.06764,6652,2,85,102,4638,38,0,452,1564,0
Reachability property qltransition_8 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_8,2,0.067824,6652,2,85,102,4638,39,0,457,1564,0
Reachability property qltransition_9 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_9,3,0.068028,6652,2,91,102,4638,40,0,462,1564,0
Reachability property qltransition_10 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_10,3,0.068218,6652,2,91,102,4638,41,0,467,1564,0
Reachability property qltransition_11 does not hold.
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
ITS tools runner thread asked to quit. Dying gracefully.
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 31 ms. (125 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 39 ms. (100 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
FORMULA Liveness FALSE TECHNIQUES QUASILIVENESS_TEST
Total runtime 46929 ms.

BK_STOP 1748809875095

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-1"
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-5832"
echo " Executing tool itstools"
echo " Input is ParamProductionCell-PT-1, 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 r147-tall-174876819600229"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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