Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r114-tall-174876422500339.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 IBM5964-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876422500339
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 12K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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 6.1K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 22K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 171K 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

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME IBM5964-PT-none-LTLCardinality-00
FORMULA_NAME IBM5964-PT-none-LTLCardinality-01
FORMULA_NAME IBM5964-PT-none-LTLCardinality-02
FORMULA_NAME IBM5964-PT-none-LTLCardinality-03
FORMULA_NAME IBM5964-PT-none-LTLCardinality-04
FORMULA_NAME IBM5964-PT-none-LTLCardinality-05
FORMULA_NAME IBM5964-PT-none-LTLCardinality-06
FORMULA_NAME IBM5964-PT-none-LTLCardinality-07
FORMULA_NAME IBM5964-PT-none-LTLCardinality-08
FORMULA_NAME IBM5964-PT-none-LTLCardinality-09
FORMULA_NAME IBM5964-PT-none-LTLCardinality-10
FORMULA_NAME IBM5964-PT-none-LTLCardinality-11
FORMULA_NAME IBM5964-PT-none-LTLCardinality-12
FORMULA_NAME IBM5964-PT-none-LTLCardinality-13
FORMULA_NAME IBM5964-PT-none-LTLCardinality-14
FORMULA_NAME IBM5964-PT-none-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748835583968

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM5964-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-02 03:39:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 03:39:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 03:39:45] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2025-06-02 03:39:45] [INFO ] Transformed 263 places.
[2025-06-02 03:39:45] [INFO ] Transformed 139 transitions.
[2025-06-02 03:39:45] [INFO ] Parsed PT model containing 263 places and 139 transitions and 541 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA IBM5964-PT-none-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 139/139 transitions.
Ensure Unique test removed 113 places
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 142 transition count 139
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 127 place count 136 transition count 133
Iterating global reduction 1 with 6 rules applied. Total rules applied 133 place count 136 transition count 133
Applied a total of 133 rules in 45 ms. Remains 136 /263 variables (removed 127) and now considering 133/139 (removed 6) transitions.
// Phase 1: matrix 133 rows 136 cols
[2025-06-02 03:39:45] [INFO ] Computed 9 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:46] [INFO ] Implicit Places using invariants in 232 ms returned []
[2025-06-02 03:39:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:46] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2025-06-02 03:39:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 132 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
At refinement iteration 4 (OVERLAPS) 133/268 variables, 135/144 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 0/144 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 1/269 variables, 1/145 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/145 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/269 variables, 0/145 constraints. Problems are: Problem set: 108 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 145 constraints, problems are : Problem set: 108 solved, 24 unsolved in 3269 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 108 solved, 24 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 1/1 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 1/26 variables, 2/3 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 25/51 variables, 26/29 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 14/43 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/43 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 5/56 variables, 3/46 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 10/56 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 6/62 variables, 3/59 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/62 variables, 0/59 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 8/70 variables, 4/63 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/70 variables, 0/63 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 14 (OVERLAPS) 8/78 variables, 1/64 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/78 variables, 0/64 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 16 (OVERLAPS) 1/79 variables, 1/65 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/79 variables, 0/65 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 18 (OVERLAPS) 8/87 variables, 10/75 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/87 variables, 0/75 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 20 (OVERLAPS) 2/89 variables, 1/76 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/89 variables, 0/76 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 22 (OVERLAPS) 3/92 variables, 1/77 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/92 variables, 0/77 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 24 (OVERLAPS) 5/97 variables, 3/80 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/97 variables, 1/81 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/97 variables, 0/81 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 27 (OVERLAPS) 5/102 variables, 2/83 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/102 variables, 0/83 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 29 (OVERLAPS) 7/109 variables, 3/86 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/109 variables, 0/86 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 31 (OVERLAPS) 12/121 variables, 4/90 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/121 variables, 0/90 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 33 (OVERLAPS) 15/136 variables, 7/97 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/136 variables, 0/97 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 35 (OVERLAPS) 11/147 variables, 6/103 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/147 variables, 0/103 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 37 (OVERLAPS) 10/157 variables, 5/108 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/157 variables, 0/108 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 39 (OVERLAPS) 12/169 variables, 6/114 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/169 variables, 0/114 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 41 (OVERLAPS) 4/173 variables, 1/115 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/173 variables, 0/115 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 43 (OVERLAPS) 15/188 variables, 10/125 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/188 variables, 2/127 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/188 variables, 0/127 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 46 (OVERLAPS) 18/206 variables, 9/136 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/206 variables, 0/136 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 48 (OVERLAPS) 18/224 variables, 9/145 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/224 variables, 0/145 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 50 (OVERLAPS) 16/240 variables, 8/153 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/240 variables, 0/153 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 52 (OVERLAPS) 11/251 variables, 6/159 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/251 variables, 0/159 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 54 (OVERLAPS) 9/260 variables, 5/164 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/260 variables, 0/164 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 56 (OVERLAPS) 6/266 variables, 3/167 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/266 variables, 0/167 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 58 (OVERLAPS) 3/269 variables, 2/169 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/269 variables, 0/169 constraints. Problems are: Problem set: 108 solved, 24 unsolved
At refinement iteration 60 (OVERLAPS) 0/269 variables, 0/169 constraints. Problems are: Problem set: 108 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 169 constraints, problems are : Problem set: 108 solved, 24 unsolved in 6362 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 24/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9670ms problems are : Problem set: 108 solved, 24 unsolved
Search for dead transitions found 108 dead transitions in 9688ms
Found 108 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 108 transitions
Dead transitions reduction (with SMT) removed 108 transitions
Starting structural reductions in LTL mode, iteration 1 : 136/263 places, 25/139 transitions.
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 51 transition count 23
Deduced a syphon composed of 25 places in 0 ms
Applied a total of 87 rules in 1 ms. Remains 51 /136 variables (removed 85) and now considering 23/25 (removed 2) transitions.
// Phase 1: matrix 23 rows 51 cols
[2025-06-02 03:39:55] [INFO ] Computed 28 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:55] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-02 03:39:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:56] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 51/263 places, 23/139 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10336 ms. Remains : 51/263 places, 23/139 transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Support contains 7 out of 26 places after structural reductions.
FORMULA IBM5964-PT-none-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 03:39:56] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2025-06-02 03:39:56] [INFO ] Flatten gal took : 22 ms
[2025-06-02 03:39:56] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA IBM5964-PT-none-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 03:39:56] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:39:56] [INFO ] Input system was already deterministic with 23 transitions.
Support contains 6 out of 26 places (down from 7) after GAL structural reductions.
RANDOM walk for 40003 steps (852 resets) in 509 ms. (78 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (228 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
// Phase 1: matrix 23 rows 26 cols
[2025-06-02 03:39:56] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/23 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp1 is UNSAT
After SMT solving in domain Real declared 43/49 variables, and 26 constraints, problems are : Problem set: 1 solved, 0 unsolved in 38 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 23/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 3 simplifications.
FORMULA IBM5964-PT-none-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 26 stabilizing places and 23 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 26 transition count 23
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(p0))))'
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 23/23 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 25 transition count 22
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 25 transition count 22
Applied a total of 2 rules in 3 ms. Remains 25 /26 variables (removed 1) and now considering 22/23 (removed 1) transitions.
// Phase 1: matrix 22 rows 25 cols
[2025-06-02 03:39:56] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:56] [INFO ] Implicit Places using invariants in 33 ms returned [5, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/26 places, 22/23 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 21 transition count 20
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 21 transition count 20
Applied a total of 4 rules in 1 ms. Remains 21 /23 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 21 cols
[2025-06-02 03:39:56] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:56] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-02 03:39:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:56] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 21/26 places, 20/23 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 99 ms. Remains : 21/26 places, 20/23 transitions.
Stuttering acceptance computed with spot in 324 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : IBM5964-PT-none-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 11 steps with 2 reset in 3 ms.
FORMULA IBM5964-PT-none-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM5964-PT-none-LTLCardinality-10 finished in 506 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 23/23 transitions.
Graph (complete) has 33 edges and 26 vertex of which 19 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 18 transition count 15
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 16 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 15 transition count 14
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 7 place count 15 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 15 place count 11 transition count 10
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 10 transition count 9
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 10 transition count 9
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 8 transition count 7
Ensure Unique test removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 21 place count 6 transition count 7
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 22 place count 5 transition count 6
Iterating global reduction 4 with 1 rules applied. Total rules applied 23 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 24 place count 4 transition count 5
Applied a total of 24 rules in 14 ms. Remains 4 /26 variables (removed 22) and now considering 5/23 (removed 18) transitions.
// Phase 1: matrix 5 rows 4 cols
[2025-06-02 03:39:57] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:57] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-06-02 03:39:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:57] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:39:57] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-02 03:39:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/9 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 34 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/9 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/9 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 40 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 79ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 79ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/26 places, 5/23 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 147 ms. Remains : 4/26 places, 5/23 transitions.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : IBM5964-PT-none-LTLCardinality-13
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA IBM5964-PT-none-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM5964-PT-none-LTLCardinality-13 finished in 208 ms.
All properties solved by simple procedures.
Total runtime 11949 ms.

BK_STOP 1748835597330

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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 LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="IBM5964-PT-none"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is IBM5964-PT-none, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-tall-174876422500339"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IBM5964-PT-none.tgz
mv IBM5964-PT-none execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;