Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r114-tall-174876422500337.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876422500337
=====================================================================

--------------------
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-CTLCardinality-2023-12
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2023-13
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2023-14
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2023-15
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2025-00
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2025-01
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2025-02
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2025-03
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2025-04
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2025-05
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2025-06
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2025-07
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2025-08
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2025-09
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2025-10
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748835554678

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
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
CTLCardinality PT
Running Version 202505121319
[2025-06-02 03:39:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 03:39:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 03:39:16] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2025-06-02 03:39:16] [INFO ] Transformed 263 places.
[2025-06-02 03:39:16] [INFO ] Transformed 139 transitions.
[2025-06-02 03:39:16] [INFO ] Parsed PT model containing 263 places and 139 transitions and 541 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Support contains 108 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 92 places
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 166 transition count 139
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 102 place count 161 transition count 134
Iterating global reduction 1 with 5 rules applied. Total rules applied 107 place count 161 transition count 134
Applied a total of 107 rules in 33 ms. Remains 161 /263 variables (removed 102) and now considering 134/139 (removed 5) transitions.
// Phase 1: matrix 134 rows 161 cols
[2025-06-02 03:39:16] [INFO ] Computed 31 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:16] [INFO ] Implicit Places using invariants in 259 ms returned []
[2025-06-02 03:39:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:16] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2025-06-02 03:39:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Problem TDEAD133 is UNSAT
At refinement iteration 2 (OVERLAPS) 3/159 variables, 2/29 constraints. Problems are: Problem set: 1 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 2/31 constraints. Problems are: Problem set: 1 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/31 constraints. Problems are: Problem set: 1 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 TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 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 TDEAD95 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 TDEAD118 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
At refinement iteration 5 (OVERLAPS) 134/293 variables, 159/190 constraints. Problems are: Problem set: 111 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/190 constraints. Problems are: Problem set: 111 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 2/295 variables, 2/192 constraints. Problems are: Problem set: 111 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 0/192 constraints. Problems are: Problem set: 111 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 0/295 variables, 0/192 constraints. Problems are: Problem set: 111 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 192 constraints, problems are : Problem set: 111 solved, 22 unsolved in 3871 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 111 solved, 22 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 4/4 constraints. Problems are: Problem set: 111 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 111 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 2/6 constraints. Problems are: Problem set: 111 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 111 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 82/109 variables, 2/8 constraints. Problems are: Problem set: 111 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 111 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 21/130 variables, 19/27 constraints. Problems are: Problem set: 111 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/27 constraints. Problems are: Problem set: 111 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 112/242 variables, 130/157 constraints. Problems are: Problem set: 111 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 19/176 constraints. Problems are: Problem set: 111 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/176 constraints. Problems are: Problem set: 111 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 14/256 variables, 8/184 constraints. Problems are: Problem set: 111 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/256 variables, 3/187 constraints. Problems are: Problem set: 111 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/256 variables, 0/187 constraints. Problems are: Problem set: 111 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 12/268 variables, 7/194 constraints. Problems are: Problem set: 111 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/268 variables, 1/195 constraints. Problems are: Problem set: 111 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/268 variables, 0/195 constraints. Problems are: Problem set: 111 solved, 22 unsolved
At refinement iteration 17 (OVERLAPS) 8/276 variables, 1/196 constraints. Problems are: Problem set: 111 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/276 variables, 0/196 constraints. Problems are: Problem set: 111 solved, 22 unsolved
At refinement iteration 19 (OVERLAPS) 2/278 variables, 2/198 constraints. Problems are: Problem set: 111 solved, 22 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/278 variables, 0/198 constraints. Problems are: Problem set: 111 solved, 22 unsolved
At refinement iteration 21 (OVERLAPS) 12/290 variables, 13/211 constraints. Problems are: Problem set: 111 solved, 22 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/290 variables, 0/211 constraints. Problems are: Problem set: 111 solved, 22 unsolved
At refinement iteration 23 (OVERLAPS) 4/294 variables, 2/213 constraints. Problems are: Problem set: 111 solved, 22 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/294 variables, 0/213 constraints. Problems are: Problem set: 111 solved, 22 unsolved
At refinement iteration 25 (OVERLAPS) 1/295 variables, 1/214 constraints. Problems are: Problem set: 111 solved, 22 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/295 variables, 0/214 constraints. Problems are: Problem set: 111 solved, 22 unsolved
At refinement iteration 27 (OVERLAPS) 0/295 variables, 0/214 constraints. Problems are: Problem set: 111 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 214 constraints, problems are : Problem set: 111 solved, 22 unsolved in 3485 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 22/133 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7406ms problems are : Problem set: 111 solved, 22 unsolved
Search for dead transitions found 111 dead transitions in 7423ms
Found 111 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 111 transitions
Dead transitions reduction (with SMT) removed 111 transitions
Starting structural reductions in LTL mode, iteration 1 : 161/263 places, 23/139 transitions.
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 121 transition count 22
Deduced a syphon composed of 92 places in 0 ms
Applied a total of 41 rules in 2 ms. Remains 121 /161 variables (removed 40) and now considering 22/23 (removed 1) transitions.
// Phase 1: matrix 22 rows 121 cols
[2025-06-02 03:39:24] [INFO ] Computed 99 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:24] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-02 03:39:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:24] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 121/263 places, 22/139 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8069 ms. Remains : 121/263 places, 22/139 transitions.
Deduced a syphon composed of 92 places in 0 ms
Reduce places removed 92 places and 0 transitions.
Support contains 8 out of 29 places after structural reductions.
FORMULA IBM5964-PT-none-CTLCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 03:39:24] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2025-06-02 03:39:24] [INFO ] Flatten gal took : 17 ms
[2025-06-02 03:39:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA IBM5964-PT-none-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 03:39:24] [INFO ] Flatten gal took : 3 ms
[2025-06-02 03:39:24] [INFO ] Input system was already deterministic with 22 transitions.
Support contains 6 out of 29 places (down from 8) after GAL structural reductions.
FORMULA IBM5964-PT-none-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40001 steps (823 resets) in 567 ms. (70 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (255 resets) in 207 ms. (192 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (240 resets) in 206 ms. (193 steps per ms) remains 2/2 properties
// Phase 1: matrix 22 rows 29 cols
[2025-06-02 03:39:24] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 20/23 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/24 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/26 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 9 (OVERLAPS) 19/45 variables, 26/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/45 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/50 variables, 2/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/50 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Real declared 51/51 variables, and 36 constraints, problems are : Problem set: 2 solved, 0 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 4 simplifications.
[2025-06-02 03:39:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-02 03:39:24] [INFO ] Flatten gal took : 4 ms
FORMULA IBM5964-PT-none-CTLCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 03:39:24] [INFO ] Flatten gal took : 2 ms
[2025-06-02 03:39:24] [INFO ] Input system was already deterministic with 22 transitions.
Support contains 2 out of 29 places (down from 4) after GAL structural reductions.
FORMULA IBM5964-PT-none-CTLCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 29 stabilizing places and 22 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 29 transition count 22
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in SI_CTL mode, iteration 0 : 29/29 places, 22/22 transitions.
Graph (complete) has 38 edges and 29 vertex of which 24 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 20 transition count 12
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 15 transition count 12
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 11 place count 15 transition count 7
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 21 place count 10 transition count 7
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 9 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 8 transition count 6
Ensure Unique test removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 26 place count 6 transition count 6
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 27 place count 5 transition count 4
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 5 transition count 4
Applied a total of 28 rules in 11 ms. Remains 5 /29 variables (removed 24) and now considering 4/22 (removed 18) transitions.
// Phase 1: matrix 4 rows 5 cols
[2025-06-02 03:39:24] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:24] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-06-02 03:39:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:25] [INFO ] Implicit Places using invariants and state equation in 18 ms returned [1, 4]
Discarding 2 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 37 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 3/29 places, 3/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 3/3 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 49 ms. Remains : 3/29 places, 3/22 transitions.
[2025-06-02 03:39:25] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:39:25] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:39:25] [INFO ] Input system was already deterministic with 3 transitions.
[2025-06-02 03:39:25] [INFO ] Flatten gal took : 0 ms
[2025-06-02 03:39:25] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:39:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality5848605436472427109.gal : 1 ms
[2025-06-02 03:39:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality4799323444878285902.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5848605436472427109.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4799323444878285902.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,16,0.011419,3616,2,8,5,46,6,0,15,35,0


Converting to forward existential form...Done !
original formula: AF(EG((callToProcess_s00002538_input_s00000952<=0)))
=> equivalent forward existential formula: [FwdG(Init,!(EG((callToProcess_s00002538_input_s00000952<=0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...161
(forward)formula 0,1,0.013993,3872,1,0,33,147,28,19,70,211,39
FORMULA IBM5964-PT-none-CTLCardinality-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 22/22 transitions.
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 24 transition count 21
Applied a total of 6 rules in 1 ms. Remains 24 /29 variables (removed 5) and now considering 21/22 (removed 1) transitions.
// Phase 1: matrix 21 rows 24 cols
[2025-06-02 03:39:26] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:26] [INFO ] Implicit Places using invariants in 23 ms returned [5, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 24 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/29 places, 21/22 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 20 transition count 19
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 20 transition count 19
Applied a total of 4 rules in 2 ms. Remains 20 /22 variables (removed 2) and now considering 19/21 (removed 2) transitions.
// Phase 1: matrix 19 rows 20 cols
[2025-06-02 03:39:26] [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:26] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-02 03:39:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:26] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 20/29 places, 19/22 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 76 ms. Remains : 20/29 places, 19/22 transitions.
[2025-06-02 03:39:26] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:39:26] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:39:26] [INFO ] Input system was already deterministic with 19 transitions.
[2025-06-02 03:39:26] [INFO ] Flatten gal took : 2 ms
[2025-06-02 03:39:26] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:39:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality3384418324933501356.gal : 1 ms
[2025-06-02 03:39:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality12022882192379327318.ctl : 0 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3384418324933501356.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12022882192379327318.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7035,0.01338,4044,2,208,5,1720,6,0,101,1804,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.01364,4044,1,0,6,1720,7,1,126,1804,1
FORMULA IBM5964-PT-none-CTLCardinality-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 22/22 transitions.
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 24 transition count 21
Applied a total of 6 rules in 1 ms. Remains 24 /29 variables (removed 5) and now considering 21/22 (removed 1) transitions.
// Phase 1: matrix 21 rows 24 cols
[2025-06-02 03:39:26] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:26] [INFO ] Implicit Places using invariants in 24 ms returned [5, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/29 places, 21/22 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 20 transition count 19
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 20 transition count 19
Applied a total of 4 rules in 2 ms. Remains 20 /22 variables (removed 2) and now considering 19/21 (removed 2) transitions.
// Phase 1: matrix 19 rows 20 cols
[2025-06-02 03:39:26] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:26] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-02 03:39:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:26] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 20/29 places, 19/22 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78 ms. Remains : 20/29 places, 19/22 transitions.
[2025-06-02 03:39:26] [INFO ] Flatten gal took : 2 ms
[2025-06-02 03:39:26] [INFO ] Flatten gal took : 2 ms
[2025-06-02 03:39:26] [INFO ] Input system was already deterministic with 19 transitions.
[2025-06-02 03:39:26] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:39:26] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:39:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality18032721222224797917.gal : 1 ms
[2025-06-02 03:39:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality15550852226861888614.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18032721222224797917.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15550852226861888614.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7035,0.008006,4044,2,208,5,1720,6,0,101,1804,0


Converting to forward existential form...Done !
original formula: A((!(EX(AX(FALSE))) + EX((callToProcess_s00002538_input_s00000952>=1))) U EF(!(EF((fork_s00001537_activated_s00000993>=1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U !(E(TRUE U (fork_s00001537_activated_s00000993>=1)))))))) * !(E(!(E(TRUE U !(E(TRUE U ...362
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t5, t7, Intersection with reachable at each step enabled. (destroyed/reverse/interse...175
(forward)formula 0,1,0.060798,6732,1,0,92,16625,64,29,565,17953,103
FORMULA IBM5964-PT-none-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-06-02 03:39:26] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:39:26] [INFO ] Flatten gal took : 2 ms
Total runtime 10651 ms.

BK_STOP 1748835566717

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="CTLCardinality"
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 CTLCardinality"
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-174876422500337"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;