Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r162-smll-177961107700083.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
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 r162-smll-177961107700083
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 11K Mar 7 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Mar 7 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 7 17:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 7 17:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.3K Mar 15 11:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 11:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Mar 15 11:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Mar 7 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Mar 7 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Mar 7 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 7 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 11:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 15 11:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 171K Mar 3 18:30 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 1779723081107

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 202604301425
[2026-05-25 15:31:22] [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]
[2026-05-25 15:31:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 15:31:23] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2026-05-25 15:31:23] [INFO ] Transformed 263 places.
[2026-05-25 15:31:23] [INFO ] Transformed 139 transitions.
[2026-05-25 15:31:23] [INFO ] Parsed PT model containing 263 places and 139 transitions and 541 arcs in 287 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA IBM5964-PT-none-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 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 115 places
Reduce places removed 123 places and 0 transitions.
Iterating post reduction 0 with 123 rules applied. Total rules applied 123 place count 140 transition count 139
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 129 place count 134 transition count 133
Iterating global reduction 1 with 6 rules applied. Total rules applied 135 place count 134 transition count 133
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 136 place count 133 transition count 132
Iterating global reduction 1 with 1 rules applied. Total rules applied 137 place count 133 transition count 132
Applied a total of 137 rules in 77 ms. Remains 133 /263 variables (removed 130) and now considering 132/139 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9787782027632914537.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7787912762240102884.kers'
[2026-05-25 15:31:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9787782027632914537.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7787912762240102884.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 132 rows 131 cols 285 entries
Finished phase 1 with 121 SingleSign rule and 5 generalized
[2026-05-25 15:31:23] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7787912762240102884.kers
Total runtime 2 ms.
[2026-05-25 15:31:23] [INFO ] Implicit Places using invariants in 360 ms returned [28, 109]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 410 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 131/263 places, 132/139 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 129 transition count 130
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 129 transition count 130
Applied a total of 4 rules in 13 ms. Remains 129 /131 variables (removed 2) and now considering 130/132 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16237200748298121288.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14396023080956886439.kers'
[2026-05-25 15:31:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16237200748298121288.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14396023080956886439.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 130 rows 127 cols 277 entries
Finished phase 1 with 120 SingleSign rule and 4 generalized
[2026-05-25 15:31:24] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14396023080956886439.kers
Total runtime 1 ms.
[2026-05-25 15:31:24] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-25 15:31:24] [INFO ] Invariant cache hit.
[2026-05-25 15:31:24] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 129/263 places, 130/139 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 933 ms. Remains : 129/263 places, 130/139 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 130/130 transitions.
Applied a total of 0 rules in 6 ms. Remains 129 /129 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2026-05-25 15:31:24] [INFO ] Invariant cache hit.
[2026-05-25 15:31:24] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-25 15:31:24] [INFO ] Invariant cache hit.
[2026-05-25 15:31:24] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2026-05-25 15:31:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 129 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 TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 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 TDEAD94 is UNSAT
Problem TDEAD95 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 TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
At refinement iteration 4 (OVERLAPS) 130/258 variables, 128/133 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/133 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 1/259 variables, 1/134 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/134 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/259 variables, 0/134 constraints. Problems are: Problem set: 108 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 134 constraints, problems are : Problem set: 108 solved, 21 unsolved in 4815 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 108 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 22/43 variables, 21/22 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 13/35 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/35 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 5/48 variables, 3/38 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 8/46 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/46 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 6/54 variables, 3/49 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/54 variables, 0/49 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 8/62 variables, 4/53 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/62 variables, 0/53 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 13 (OVERLAPS) 8/70 variables, 1/54 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/70 variables, 0/54 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 15 (OVERLAPS) 8/78 variables, 9/63 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/78 variables, 0/63 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 17 (OVERLAPS) 2/80 variables, 1/64 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/80 variables, 0/64 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 19 (OVERLAPS) 3/83 variables, 1/65 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/83 variables, 0/65 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 21 (OVERLAPS) 4/87 variables, 2/67 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/87 variables, 0/67 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 23 (OVERLAPS) 6/93 variables, 2/69 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/93 variables, 0/69 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 25 (OVERLAPS) 8/101 variables, 4/73 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/101 variables, 0/73 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 27 (OVERLAPS) 12/113 variables, 4/77 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/113 variables, 0/77 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 29 (OVERLAPS) 16/129 variables, 8/85 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/129 variables, 1/86 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/129 variables, 0/86 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 32 (OVERLAPS) 11/140 variables, 6/92 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/140 variables, 0/92 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 34 (OVERLAPS) 10/150 variables, 5/97 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/150 variables, 0/97 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 36 (OVERLAPS) 13/163 variables, 6/103 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/163 variables, 0/103 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 38 (OVERLAPS) 4/167 variables, 1/104 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/167 variables, 0/104 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 40 (OVERLAPS) 14/181 variables, 9/113 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/181 variables, 0/113 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 42 (OVERLAPS) 18/199 variables, 8/121 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/199 variables, 0/121 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 44 (OVERLAPS) 21/220 variables, 11/132 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/220 variables, 1/133 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/220 variables, 0/133 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 47 (OVERLAPS) 15/235 variables, 9/142 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/235 variables, 0/142 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 49 (OVERLAPS) 9/244 variables, 5/147 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/244 variables, 0/147 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 51 (OVERLAPS) 8/252 variables, 4/151 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/252 variables, 0/151 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 53 (OVERLAPS) 6/258 variables, 3/154 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/258 variables, 0/154 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 55 (OVERLAPS) 1/259 variables, 1/155 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/259 variables, 0/155 constraints. Problems are: Problem set: 108 solved, 21 unsolved
At refinement iteration 57 (OVERLAPS) 0/259 variables, 0/155 constraints. Problems are: Problem set: 108 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 155 constraints, problems are : Problem set: 108 solved, 21 unsolved in 7053 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 21/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11984ms problems are : Problem set: 108 solved, 21 unsolved
Search for dead transitions found 108 dead transitions in 12030ms
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 : 129/129 places, 22/130 transitions.
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 61 transition count 21
Deduced a syphon composed of 39 places in 0 ms
Applied a total of 69 rules in 3 ms. Remains 61 /129 variables (removed 68) and now considering 21/22 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-118651063773663785.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18193643331654348440.kers'
[2026-05-25 15:31:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-118651063773663785.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18193643331654348440.kers]
Culling trivial invariants: removing 39 columns.
Culled 39 columns in 0 ms.
// Phase 1: matrix 21 rows 22 cols 48 entries
Finished phase 1 with 20 SingleSign rule and 1 generalized
[2026-05-25 15:31:36] [INFO ] Computed 40 invariants in 0 ms
Computed 40 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18193643331654348440.kers
Total runtime 1 ms.
[2026-05-25 15:31:36] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-25 15:31:36] [INFO ] Invariant cache hit.
[2026-05-25 15:31:37] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 61/129 places, 21/130 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12582 ms. Remains : 61/129 places, 21/130 transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Support contains 2 out of 22 places after structural reductions.
FORMULA IBM5964-PT-none-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 15:31:37] [INFO ] Initial state reduction rules for LTL removed 6 formulas.
[2026-05-25 15:31:37] [INFO ] Flatten gal took : 35 ms
FORMULA IBM5964-PT-none-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 15:31:37] [INFO ] Flatten gal took : 9 ms
[2026-05-25 15:31:37] [INFO ] Input system was already deterministic with 21 transitions.
RANDOM walk for 40002 steps (839 resets) in 790 ms. (50 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (287 resets) in 241 ms. (165 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11867594162447287486.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5455472877375648929.kers'
[2026-05-25 15:31:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11867594162447287486.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5455472877375648929.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 21 rows 22 cols 48 entries
Finished phase 1 with 20 SingleSign rule and 1 generalized
[2026-05-25 15:31:37] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5455472877375648929.kers
Total runtime 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) 17/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Real declared 35/43 variables, and 19 constraints, problems are : Problem set: 1 solved, 0 unsolved in 37 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 18/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA IBM5964-PT-none-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
FORMULA IBM5964-PT-none-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 22 stabilizing places and 21 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 21
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
All properties solved by simple procedures.
Total runtime 14840 ms.

BK_STOP 1779723097856

--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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-5973"
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 r162-smll-177961107700083"
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 ;