Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r114-tall-174876422500329.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 IBM319-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-174876422500329
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 768K
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K 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.2K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K 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 184K 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 IBM319-PT-none-CTLCardinality-2023-12
FORMULA_NAME IBM319-PT-none-CTLCardinality-2023-13
FORMULA_NAME IBM319-PT-none-CTLCardinality-2023-14
FORMULA_NAME IBM319-PT-none-CTLCardinality-2023-15
FORMULA_NAME IBM319-PT-none-CTLCardinality-2025-00
FORMULA_NAME IBM319-PT-none-CTLCardinality-2025-01
FORMULA_NAME IBM319-PT-none-CTLCardinality-2025-02
FORMULA_NAME IBM319-PT-none-CTLCardinality-2025-03
FORMULA_NAME IBM319-PT-none-CTLCardinality-2025-04
FORMULA_NAME IBM319-PT-none-CTLCardinality-2025-05
FORMULA_NAME IBM319-PT-none-CTLCardinality-2025-06
FORMULA_NAME IBM319-PT-none-CTLCardinality-2025-07
FORMULA_NAME IBM319-PT-none-CTLCardinality-2025-08
FORMULA_NAME IBM319-PT-none-CTLCardinality-2025-09
FORMULA_NAME IBM319-PT-none-CTLCardinality-2025-10
FORMULA_NAME IBM319-PT-none-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748834742481

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM319-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-02 03:25:43] [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:25:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 03:25:44] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2025-06-02 03:25:44] [INFO ] Transformed 253 places.
[2025-06-02 03:25:44] [INFO ] Transformed 178 transitions.
[2025-06-02 03:25:44] [INFO ] Found NUPN structural information;
[2025-06-02 03:25:44] [INFO ] Parsed PT model containing 253 places and 178 transitions and 526 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Initial state reduction rules removed 1 formulas.
FORMULA IBM319-PT-none-CTLCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 76 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 178/178 transitions.
Ensure Unique test removed 67 places
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 179 transition count 178
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 81 place count 172 transition count 171
Iterating global reduction 1 with 7 rules applied. Total rules applied 88 place count 172 transition count 171
Applied a total of 88 rules in 39 ms. Remains 172 /253 variables (removed 81) and now considering 171/178 (removed 7) transitions.
// Phase 1: matrix 171 rows 172 cols
[2025-06-02 03:25:44] [INFO ] Computed 13 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:25:44] [INFO ] Implicit Places using invariants in 264 ms returned []
[2025-06-02 03:25:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:25:44] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2025-06-02 03:25:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 171/341 variables, 170/183 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Problem TDEAD19 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD166 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/343 variables, 2/185 constraints. Problems are: Problem set: 8 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/185 constraints. Problems are: Problem set: 8 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 0/343 variables, 0/185 constraints. Problems are: Problem set: 8 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 185 constraints, problems are : Problem set: 8 solved, 162 unsolved in 16492 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 162 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 11/11 constraints. Problems are: Problem set: 8 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/11 constraints. Problems are: Problem set: 8 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 2/160 variables, 2/13 constraints. Problems are: Problem set: 8 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/13 constraints. Problems are: Problem set: 8 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 164/324 variables, 160/173 constraints. Problems are: Problem set: 8 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 153/326 constraints. Problems are: Problem set: 8 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/326 constraints. Problems are: Problem set: 8 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 9/333 variables, 7/333 constraints. Problems are: Problem set: 8 solved, 162 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 9/342 constraints. Problems are: Problem set: 8 solved, 162 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/342 constraints. Problems are: Problem set: 8 solved, 162 unsolved
At refinement iteration 10 (OVERLAPS) 4/337 variables, 2/344 constraints. Problems are: Problem set: 8 solved, 162 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/343 variables, and 344 constraints, problems are : Problem set: 8 solved, 162 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 169/172 constraints, PredecessorRefiner: 162/170 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46579ms problems are : Problem set: 8 solved, 162 unsolved
Search for dead transitions found 8 dead transitions in 46592ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in LTL mode, iteration 1 : 172/253 places, 163/178 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 164 transition count 163
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 163 transition count 162
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 163 transition count 162
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 10 rules in 10 ms. Remains 163 /172 variables (removed 9) and now considering 162/163 (removed 1) transitions.
// Phase 1: matrix 162 rows 163 cols
[2025-06-02 03:26:31] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:26:31] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-02 03:26:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:26:31] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 163/253 places, 162/178 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47409 ms. Remains : 163/253 places, 162/178 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Support contains 75 out of 162 places after structural reductions.
[2025-06-02 03:26:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-02 03:26:31] [INFO ] Flatten gal took : 32 ms
FORMULA IBM319-PT-none-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 03:26:31] [INFO ] Flatten gal took : 23 ms
[2025-06-02 03:26:31] [INFO ] Input system was already deterministic with 162 transitions.
Support contains 71 out of 162 places (down from 75) after GAL structural reductions.
RANDOM walk for 40000 steps (812 resets) in 1556 ms. (25 steps per ms) remains 1/54 properties
BEST_FIRST walk for 40001 steps (486 resets) in 366 ms. (108 steps per ms) remains 1/1 properties
// Phase 1: matrix 162 rows 162 cols
[2025-06-02 03:26:32] [INFO ] Computed 13 invariants in 3 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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/28 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/56 variables, 28/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/64 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/73 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/84 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/84 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 15/99 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/99 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/99 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 17/116 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/116 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/116 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 16/132 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/132 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/134 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/134 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 15/149 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/149 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/149 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 10/159 variables, 6/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/159 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/159 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 8/167 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/167 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 8/175 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/175 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 10/185 variables, 5/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/185 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/185 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp42 is UNSAT
After SMT solving in domain Real declared 197/324 variables, and 109 constraints, problems are : Problem set: 1 solved, 0 unsolved in 180 ms.
Refiners :[Generalized P Invariants (flows): 10/13 constraints, State Equation: 99/162 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 188ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2025-06-02 03:26:32] [INFO ] Flatten gal took : 9 ms
[2025-06-02 03:26:32] [INFO ] Flatten gal took : 9 ms
[2025-06-02 03:26:32] [INFO ] Input system was already deterministic with 162 transitions.
Support contains 68 out of 162 places (down from 69) after GAL structural reductions.
Computed a total of 162 stabilizing places and 162 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 162 transition count 162
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 162/162 transitions.
Ensure Unique test removed 9 places
Reduce places removed 13 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 148 transition count 162
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 22 place count 140 transition count 154
Iterating global reduction 1 with 8 rules applied. Total rules applied 30 place count 140 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 140 transition count 153
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 138 transition count 151
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 138 transition count 151
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 136 transition count 149
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 136 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 135 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 135 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 134 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 134 transition count 147
Applied a total of 43 rules in 27 ms. Remains 134 /162 variables (removed 28) and now considering 147/162 (removed 15) transitions.
// Phase 1: matrix 147 rows 134 cols
[2025-06-02 03:26:32] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:26:32] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-02 03:26:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:26:32] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2025-06-02 03:26:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/280 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 1/281 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/281 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 136 constraints, problems are : Problem set: 0 solved, 146 unsolved in 10110 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/280 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 146/281 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/281 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/281 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 282 constraints, problems are : Problem set: 0 solved, 146 unsolved in 21908 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32034ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 32037ms
Starting structural reductions in LTL mode, iteration 1 : 134/162 places, 147/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32227 ms. Remains : 134/162 places, 147/162 transitions.
[2025-06-02 03:27:05] [INFO ] Flatten gal took : 10 ms
[2025-06-02 03:27:05] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:27:05] [INFO ] Input system was already deterministic with 147 transitions.
[2025-06-02 03:27:05] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:27:05] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:27:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality4073085868163864443.gal : 4 ms
[2025-06-02 03:27:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality17372597923242939064.ctl : 4 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/CTLCardinality4073085868163864443.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17372597923242939064.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,2038,0.044849,4616,2,418,5,2458,6,0,679,2097,0


Converting to forward existential form...Done !
original formula: EG(AX(!(E((A((callToTask_s00002956_inputCriterion_s00001053_used==1) U (callToTask_s00002929_inputCriterion_s00001053_used==0)) * (callTo...259
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!(E((!((E(!((callToTask_s00002929_inputCriterion_s00001053_used==0)) U (!((callToTask_s0000295...453
Reverse transition relation is NOT exact ! Due to transitions t31, t41, t42, t43, t44, t45, t132, t142, Intersection with reachable at each step enabled. ...203
(forward)formula 0,1,0.938686,38968,1,0,684,192573,332,441,3498,219231,852
FORMULA IBM319-PT-none-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 162/162 transitions.
Ensure Unique test removed 9 places
Reduce places removed 11 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 150 transition count 162
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 20 place count 142 transition count 154
Iterating global reduction 1 with 8 rules applied. Total rules applied 28 place count 142 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 142 transition count 153
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 31 place count 140 transition count 151
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 140 transition count 151
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 35 place count 138 transition count 149
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 138 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 137 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 137 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 136 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 136 transition count 147
Applied a total of 41 rules in 22 ms. Remains 136 /162 variables (removed 26) and now considering 147/162 (removed 15) transitions.
// Phase 1: matrix 147 rows 136 cols
[2025-06-02 03:27:06] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:27:06] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-02 03:27:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:27:06] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2025-06-02 03:27:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/280 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 3/283 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/283 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 139 constraints, problems are : Problem set: 0 solved, 146 unsolved in 11107 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/280 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 144/279 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 3/283 variables, 3/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 2/285 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (OVERLAPS) 0/283 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 285 constraints, problems are : Problem set: 0 solved, 146 unsolved in 25424 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36550ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 36552ms
Starting structural reductions in LTL mode, iteration 1 : 136/162 places, 147/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36757 ms. Remains : 136/162 places, 147/162 transitions.
[2025-06-02 03:27:42] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:27:42] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:27:42] [INFO ] Input system was already deterministic with 147 transitions.
[2025-06-02 03:27:42] [INFO ] Flatten gal took : 7 ms
[2025-06-02 03:27:42] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:27:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality14442060385739088611.gal : 2 ms
[2025-06-02 03:27:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality17189373424399249195.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/CTLCardinality14442060385739088611.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17189373424399249195.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,2041,0.034535,4952,2,495,5,3381,6,0,682,3506,0


Converting to forward existential form...Done !
original formula: EX(!(A(A(((callToTask_s00002063_input_s00001052!=1) * E((callToTask_s00002960_output_s00001077==0) U (callToTask_s00002667_inputCriterion...355
=> equivalent forward existential formula: ((([((FwdU((FwdU(EY(Init),!((endNode_s00001057_input_default==1))) * !((endNode_s00001057_input_default==1))),!(...1321
Hit Full ! (commute/partial/dont) 146/0/1
Hit Full ! (commute/partial/dont) 142/2/5
Reverse transition relation is NOT exact ! Due to transitions t41, t42, t43, t44, t45, t132, t142, Intersection with reachable at each step enabled. (dest...198
Hit Full ! (commute/partial/dont) 146/0/1
(forward)formula 0,1,0.389518,20360,1,0,314,66677,344,151,3800,78610,454
FORMULA IBM319-PT-none-CTLCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 162/162 places, 162/162 transitions.
Graph (complete) has 188 edges and 162 vertex of which 104 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.1 ms
Discarding 58 places :
Also discarding 58 output transitions
Drop transitions (Output transitions of discarded places.) removed 58 transitions
Ensure Unique test removed 7 places
Reduce places removed 8 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 96 transition count 38
Reduce places removed 65 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 73 rules applied. Total rules applied 139 place count 31 transition count 30
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 144 place count 26 transition count 30
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 144 place count 26 transition count 21
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 19 rules applied. Total rules applied 163 place count 16 transition count 21
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 165 place count 15 transition count 20
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 167 place count 14 transition count 19
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 167 place count 14 transition count 17
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 172 place count 11 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 174 place count 10 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 175 place count 10 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 178 place count 10 transition count 12
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 180 place count 9 transition count 11
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 182 place count 8 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 183 place count 7 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 184 place count 7 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 185 place count 7 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 186 place count 6 transition count 8
Applied a total of 186 rules in 17 ms. Remains 6 /162 variables (removed 156) and now considering 8/162 (removed 154) transitions.
// Phase 1: matrix 8 rows 6 cols
[2025-06-02 03:27:43] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:27:43] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-02 03:27:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:27:43] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:27:43] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 03:27:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 6 constraints, problems are : Problem set: 0 solved, 6 unsolved in 53 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/14 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 12 constraints, problems are : Problem set: 0 solved, 6 unsolved in 51 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 107ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 107ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/162 places, 8/162 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 169 ms. Remains : 6/162 places, 8/162 transitions.
[2025-06-02 03:27:43] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:27:43] [INFO ] Flatten gal took : 0 ms
[2025-06-02 03:27:43] [INFO ] Input system was already deterministic with 8 transitions.
[2025-06-02 03:27:43] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:27:43] [INFO ] Flatten gal took : 0 ms
[2025-06-02 03:27:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality15122666674435066769.gal : 1 ms
[2025-06-02 03:27:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality15368117077769402537.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/CTLCardinality15122666674435066769.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15368117077769402537.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,7,0.002213,3660,2,12,5,56,6,0,31,42,0


Converting to forward existential form...Done !
original formula: EG(((callToTask_s00002044_inputCriterion_s00001053_used==0)||(join_s00001163_input_s00001128==1)))
=> equivalent forward existential formula: [FwdG(Init,((callToTask_s00002044_inputCriterion_s00001053_used==0)||(join_s00001163_input_s00001128==1)))] != F...159
Hit Full ! (commute/partial/dont) 4/0/4
(forward)formula 0,1,0.003506,3916,1,0,13,158,18,3,141,161,13
FORMULA IBM319-PT-none-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 162/162 transitions.
Ensure Unique test removed 8 places
Reduce places removed 12 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 149 transition count 162
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 21 place count 141 transition count 154
Iterating global reduction 1 with 8 rules applied. Total rules applied 29 place count 141 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 141 transition count 153
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 139 transition count 151
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 139 transition count 151
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 137 transition count 149
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 137 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 136 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 136 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 135 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 135 transition count 147
Applied a total of 42 rules in 13 ms. Remains 135 /162 variables (removed 27) and now considering 147/162 (removed 15) transitions.
// Phase 1: matrix 147 rows 135 cols
[2025-06-02 03:27:43] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:27:43] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-02 03:27:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:27:43] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2025-06-02 03:27:43] [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, 3/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/281 variables, 134/137 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 1/282 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/282 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 138 constraints, problems are : Problem set: 0 solved, 146 unsolved in 11192 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/281 variables, 134/137 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 146/283 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/282 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/282 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 284 constraints, problems are : Problem set: 0 solved, 146 unsolved in 22337 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33545ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 33546ms
Starting structural reductions in LTL mode, iteration 1 : 135/162 places, 147/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33733 ms. Remains : 135/162 places, 147/162 transitions.
[2025-06-02 03:28:17] [INFO ] Flatten gal took : 11 ms
[2025-06-02 03:28:17] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:28:17] [INFO ] Input system was already deterministic with 147 transitions.
[2025-06-02 03:28:17] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:28:17] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:28:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality1643382680622651096.gal : 1 ms
[2025-06-02 03:28:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality10077786639239742361.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/CTLCardinality1643382680622651096.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10077786639239742361.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,2038,0.036999,5064,2,514,5,3764,6,0,683,4281,0


Converting to forward existential form...Done !
original formula: AX(((A(!(((callToTask_s00002044_inputCriterion_s00001053_used==0)||(callToTask_s00002929_output_s00001077==1))) U AF((callToTask_s0000296...541
=> equivalent forward existential formula: ((([FwdG((FwdU(EY(Init),!(!(EG(!((callToTask_s00002964_input_s00001066==1)))))) * !(!(((callToTask_s00002044_inp...900
Reverse transition relation is NOT exact ! Due to transitions t31, t41, t42, t43, t44, t45, t132, t142, Intersection with reachable at each step enabled. ...203
(forward)formula 0,0,1.19581,52212,1,0,849,277361,335,557,3519,290156,1067
FORMULA IBM319-PT-none-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 162/162 transitions.
Ensure Unique test removed 9 places
Reduce places removed 12 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 149 transition count 162
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 20 place count 142 transition count 155
Iterating global reduction 1 with 7 rules applied. Total rules applied 27 place count 142 transition count 155
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 141 transition count 154
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 141 transition count 154
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 140 transition count 153
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 140 transition count 153
Applied a total of 31 rules in 6 ms. Remains 140 /162 variables (removed 22) and now considering 153/162 (removed 9) transitions.
// Phase 1: matrix 153 rows 140 cols
[2025-06-02 03:28:18] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:28:18] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-02 03:28:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:28:18] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2025-06-02 03:28:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 153/291 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 2/293 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/293 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 142 constraints, problems are : Problem set: 0 solved, 152 unsolved in 11337 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 153/291 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 148/288 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (OVERLAPS) 2/293 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 4/294 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 0/293 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 294 constraints, problems are : Problem set: 0 solved, 152 unsolved in 25510 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36864ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 36866ms
Starting structural reductions in LTL mode, iteration 1 : 140/162 places, 153/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37037 ms. Remains : 140/162 places, 153/162 transitions.
[2025-06-02 03:28:55] [INFO ] Flatten gal took : 8 ms
[2025-06-02 03:28:55] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:28:55] [INFO ] Input system was already deterministic with 153 transitions.
[2025-06-02 03:28:55] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:28:55] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:28:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality15595119447069058939.gal : 3 ms
[2025-06-02 03:28:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality13855344522969303394.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/CTLCardinality15595119447069058939.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13855344522969303394.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,2056,0.035673,4908,2,501,5,2927,6,0,707,2535,0


Converting to forward existential form...Done !
original formula: (AX(A(AF((AF((merge_s00002239_input_s00001068==1)) * (callToTask_s00001168_input_s00001068==1))) U (decision_s00002055_input_s00001052==1...221
=> equivalent forward existential formula: (([FwdG((FwdU(EY(Init),!((decision_s00002055_input_s00001052==1))) * !((decision_s00002055_input_s00001052==1)))...417
Hit Full ! (commute/partial/dont) 151/0/2
(forward)formula 0,0,0.281395,16300,1,0,143,58239,21,6,3158,53317,139
FORMULA IBM319-PT-none-CTLCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 162/162 places, 162/162 transitions.
Graph (complete) has 188 edges and 162 vertex of which 139 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.1 ms
Discarding 23 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Ensure Unique test removed 8 places
Reduce places removed 9 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 130 transition count 57
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 91 rules applied. Total rules applied 178 place count 45 transition count 51
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 183 place count 41 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 184 place count 40 transition count 50
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 184 place count 40 transition count 35
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 31 rules applied. Total rules applied 215 place count 24 transition count 35
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 217 place count 23 transition count 34
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 219 place count 22 transition count 33
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 219 place count 22 transition count 31
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 224 place count 19 transition count 31
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 226 place count 18 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 227 place count 18 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 233 place count 18 transition count 23
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 234 place count 18 transition count 22
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 236 place count 17 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 237 place count 16 transition count 21
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 3 Pre rules applied. Total rules applied 237 place count 16 transition count 18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 243 place count 13 transition count 18
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 244 place count 13 transition count 18
Applied a total of 244 rules in 12 ms. Remains 13 /162 variables (removed 149) and now considering 18/162 (removed 144) transitions.
// Phase 1: matrix 18 rows 13 cols
[2025-06-02 03:28:55] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:28:55] [INFO ] Implicit Places using invariants in 18 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 19 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 12/162 places, 18/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 32 ms. Remains : 12/162 places, 18/162 transitions.
[2025-06-02 03:28:55] [INFO ] Flatten gal took : 0 ms
[2025-06-02 03:28:55] [INFO ] Flatten gal took : 0 ms
[2025-06-02 03:28:55] [INFO ] Input system was already deterministic with 18 transitions.
[2025-06-02 03:28:55] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:28:55] [INFO ] Flatten gal took : 0 ms
[2025-06-02 03:28:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality1573486148141154740.gal : 0 ms
[2025-06-02 03:28:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality3910189434454285597.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/CTLCardinality1573486148141154740.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3910189434454285597.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,17,0.002726,3768,2,28,5,123,6,0,63,109,0


Converting to forward existential form...Done !
original formula: EG((AG(((callToTask_s00002931_input_s00001066==1)&&(callToTask_s00002953_input_s00001052==0))) + AF(AG((callToTask_s00002957_output_s0000...167
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !(((callToTask_s00002931_input_s00001066==1)&&(callToTask_s00002953_input_s00001052==0)))...240
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t7, t12, t14, t16, Intersection with reachable at each step enabled. (destroyed/reve...186
dead was empty
(forward)formula 0,0,0.006516,4152,1,0,53,754,62,23,348,815,67
FORMULA IBM319-PT-none-CTLCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 162/162 transitions.
Ensure Unique test removed 9 places
Reduce places removed 13 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 148 transition count 162
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 22 place count 140 transition count 154
Iterating global reduction 1 with 8 rules applied. Total rules applied 30 place count 140 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 140 transition count 153
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 138 transition count 151
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 138 transition count 151
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 136 transition count 149
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 136 transition count 149
Applied a total of 39 rules in 6 ms. Remains 136 /162 variables (removed 26) and now considering 149/162 (removed 13) transitions.
// Phase 1: matrix 149 rows 136 cols
[2025-06-02 03:28:55] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:28:55] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-02 03:28:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:28:56] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Running 148 sub problems to find dead transitions.
[2025-06-02 03:28:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 149/284 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 1/285 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 138 constraints, problems are : Problem set: 0 solved, 148 unsolved in 11157 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 149/284 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 148/285 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (OVERLAPS) 1/285 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 286 constraints, problems are : Problem set: 0 solved, 148 unsolved in 22060 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33230ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 33232ms
Starting structural reductions in LTL mode, iteration 1 : 136/162 places, 149/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33431 ms. Remains : 136/162 places, 149/162 transitions.
[2025-06-02 03:29:29] [INFO ] Flatten gal took : 8 ms
[2025-06-02 03:29:29] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:29:29] [INFO ] Input system was already deterministic with 149 transitions.
[2025-06-02 03:29:29] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:29:29] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:29:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality11408469617920590124.gal : 1 ms
[2025-06-02 03:29:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality4474582594198871019.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/CTLCardinality11408469617920590124.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4474582594198871019.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,2044,0.033539,4836,2,465,5,2845,6,0,689,2584,0


Converting to forward existential form...Done !
original formula: AX(AF((merge_s00001160_activated==1)))
=> equivalent forward existential formula: [FwdG(EY(Init),!((merge_s00001160_activated==1)))] = FALSE
Hit Full ! (commute/partial/dont) 147/0/2
(forward)formula 0,0,0.294723,16868,1,0,140,59472,19,4,3078,60099,138
FORMULA IBM319-PT-none-CTLCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 162/162 places, 162/162 transitions.
Graph (complete) has 188 edges and 162 vertex of which 76 are kept as prefixes of interest. Removing 86 places using SCC suffix rule.1 ms
Discarding 86 places :
Also discarding 87 output transitions
Drop transitions (Output transitions of discarded places.) removed 87 transitions
Ensure Unique test removed 5 places
Reduce places removed 6 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 70 transition count 26
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 55 rules applied. Total rules applied 104 place count 24 transition count 17
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 110 place count 18 transition count 17
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 110 place count 18 transition count 9
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 128 place count 8 transition count 9
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 130 place count 7 transition count 8
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 132 place count 6 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 132 place count 6 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 137 place count 3 transition count 5
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 138 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 138 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 140 place count 2 transition count 3
Applied a total of 140 rules in 4 ms. Remains 2 /162 variables (removed 160) and now considering 3/162 (removed 159) transitions.
// Phase 1: matrix 3 rows 2 cols
[2025-06-02 03:29:29] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:29:29] [INFO ] Implicit Places using invariants in 13 ms returned []
[2025-06-02 03:29:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:29:29] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:29:29] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2025-06-02 03:29:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5/5 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 21 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2/5 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/5 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 49ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2/162 places, 3/162 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 89 ms. Remains : 2/162 places, 3/162 transitions.
[2025-06-02 03:29:29] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:29:29] [INFO ] Flatten gal took : 0 ms
[2025-06-02 03:29:29] [INFO ] Input system was already deterministic with 3 transitions.
[2025-06-02 03:29:29] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:29:29] [INFO ] Flatten gal took : 0 ms
[2025-06-02 03:29:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality195384918368613535.gal : 0 ms
[2025-06-02 03:29:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality8615833809219002031.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/CTLCardinality195384918368613535.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8615833809219002031.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 -...282
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,3,0.001547,3660,2,4,5,13,6,0,11,9,0


Converting to forward existential form...Done !
original formula: EG((merge_s00002239_input_s00001068==0))
=> equivalent forward existential formula: [FwdG(Init,(merge_s00002239_input_s00001068==0))] != FALSE
Hit Full ! (commute/partial/dont) 1/0/2
(forward)formula 0,1,0.002038,3916,1,0,9,28,18,3,51,30,9
FORMULA IBM319-PT-none-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 162/162 places, 162/162 transitions.
Graph (complete) has 188 edges and 162 vertex of which 148 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Ensure Unique test removed 9 places
Reduce places removed 10 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 138 transition count 64
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 92 rules applied. Total rules applied 180 place count 52 transition count 58
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 186 place count 48 transition count 56
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 188 place count 46 transition count 56
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 188 place count 46 transition count 42
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 29 rules applied. Total rules applied 217 place count 31 transition count 42
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 219 place count 30 transition count 41
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 221 place count 29 transition count 40
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 221 place count 29 transition count 38
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 226 place count 26 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 228 place count 25 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 233 place count 25 transition count 32
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 234 place count 25 transition count 31
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 236 place count 24 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 237 place count 23 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 237 place count 23 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 239 place count 22 transition count 29
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 241 place count 22 transition count 29
Applied a total of 241 rules in 20 ms. Remains 22 /162 variables (removed 140) and now considering 29/162 (removed 133) transitions.
// Phase 1: matrix 29 rows 22 cols
[2025-06-02 03:29:29] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:29:29] [INFO ] Implicit Places using invariants in 20 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 21 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 21/162 places, 29/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 44 ms. Remains : 21/162 places, 29/162 transitions.
[2025-06-02 03:29:29] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:29:29] [INFO ] Flatten gal took : 0 ms
[2025-06-02 03:29:29] [INFO ] Input system was already deterministic with 29 transitions.
[2025-06-02 03:29:29] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:29:29] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:29:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality14645195267524244292.gal : 1 ms
[2025-06-02 03:29:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality11124932349615120956.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/CTLCardinality14645195267524244292.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11124932349615120956.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,30,0.004482,3872,2,49,5,256,6,0,109,177,0


Converting to forward existential form...Done !
original formula: EG((AF(((callToTask_s00002950_output_s00001077==0)||(decision_s00001126_input_s00001052==1))) + EG(!(E((((callToTask_s00002952_input_s000...340
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(((callToTask_s00002950_output_s00001077==0)||(decision_s00001126_input_s00001052==1))))) + EG...389
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t10, t17, t22, t26, Intersection with reachable at each step enabled. (destroyed/rev...187
(forward)formula 0,1,0.015888,4384,1,0,97,3142,90,60,629,3474,136
FORMULA IBM319-PT-none-CTLCardinality-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 162/162 transitions.
Ensure Unique test removed 9 places
Reduce places removed 13 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 148 transition count 162
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 22 place count 140 transition count 154
Iterating global reduction 1 with 8 rules applied. Total rules applied 30 place count 140 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 140 transition count 153
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 138 transition count 151
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 138 transition count 151
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 136 transition count 149
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 136 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 135 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 135 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 134 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 134 transition count 147
Applied a total of 43 rules in 9 ms. Remains 134 /162 variables (removed 28) and now considering 147/162 (removed 15) transitions.
// Phase 1: matrix 147 rows 134 cols
[2025-06-02 03:29:29] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:29:29] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-02 03:29:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:29:30] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2025-06-02 03:29:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/280 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 1/281 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/281 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 136 constraints, problems are : Problem set: 0 solved, 146 unsolved in 10566 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/280 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 146/281 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/281 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/281 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 282 constraints, problems are : Problem set: 0 solved, 146 unsolved in 21826 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32400ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 32401ms
Starting structural reductions in LTL mode, iteration 1 : 134/162 places, 147/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32584 ms. Remains : 134/162 places, 147/162 transitions.
[2025-06-02 03:30:02] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:30:02] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:30:02] [INFO ] Input system was already deterministic with 147 transitions.
[2025-06-02 03:30:02] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:30:02] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:30:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality6313765863728225947.gal : 1 ms
[2025-06-02 03:30:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality14678687925931074418.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/CTLCardinality6313765863728225947.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14678687925931074418.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,2038,0.032322,4668,2,418,5,2458,6,0,679,2097,0


Converting to forward existential form...Done !
original formula: AX(EG(((callToTask_s00002667_inputCriterion_s00001053_used==1) + EG((callToTask_s00002929_inputCriterion_s00001053_used==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(((callToTask_s00002667_inputCriterion_s00001053_used==1) + EG((callToTask_s00002929_inputCrite...192
Reverse transition relation is NOT exact ! Due to transitions t31, t41, t42, t43, t44, t45, t132, t142, Intersection with reachable at each step enabled. ...203
(forward)formula 0,1,0.502356,25032,1,0,415,111789,319,229,3490,120603,586
FORMULA IBM319-PT-none-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 162/162 transitions.
Ensure Unique test removed 9 places
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 150 transition count 162
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 18 place count 144 transition count 156
Iterating global reduction 1 with 6 rules applied. Total rules applied 24 place count 144 transition count 156
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 143 transition count 155
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 143 transition count 155
Applied a total of 26 rules in 6 ms. Remains 143 /162 variables (removed 19) and now considering 155/162 (removed 7) transitions.
// Phase 1: matrix 155 rows 143 cols
[2025-06-02 03:30:02] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:30:03] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-02 03:30:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:30:03] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 154 sub problems to find dead transitions.
[2025-06-02 03:30:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 155/296 variables, 141/144 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (OVERLAPS) 2/298 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (OVERLAPS) 0/298 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 146 constraints, problems are : Problem set: 0 solved, 154 unsolved in 11638 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 155/296 variables, 141/144 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 152/296 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (OVERLAPS) 2/298 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 8 (OVERLAPS) 0/298 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 300 constraints, problems are : Problem set: 0 solved, 154 unsolved in 25912 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37566ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 37573ms
Starting structural reductions in LTL mode, iteration 1 : 143/162 places, 155/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37745 ms. Remains : 143/162 places, 155/162 transitions.
[2025-06-02 03:30:40] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:30:40] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:30:40] [INFO ] Input system was already deterministic with 155 transitions.
[2025-06-02 03:30:40] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:30:40] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:30:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality17676555691333958945.gal : 1 ms
[2025-06-02 03:30:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality17357992762362689580.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/CTLCardinality17676555691333958945.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17357992762362689580.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,2062,0.05072,4948,2,530,5,3171,6,0,721,2991,0


Converting to forward existential form...Done !
original formula: (EG((AG(((decision_s00003020_activated==0)||(callToProcess_s00002121_output_s00001077==1))) + AX(((merge_s00002239_input_s00001129==0)||(...753
=> equivalent forward existential formula: ([FwdG(Init,(!(E(TRUE U !(((decision_s00003020_activated==0)||(callToProcess_s00002121_output_s00001077==1))))) ...844
Reverse transition relation is NOT exact ! Due to transitions t42, t43, t44, t45, t46, t140, t150, Intersection with reachable at each step enabled. (dest...198
(forward)formula 0,1,0.527285,24920,1,0,430,92137,339,269,3985,113527,575
FORMULA IBM319-PT-none-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 162/162 places, 162/162 transitions.
Graph (complete) has 188 edges and 162 vertex of which 150 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Ensure Unique test removed 9 places
Reduce places removed 10 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 140 transition count 66
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 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 1 with 90 rules applied. Total rules applied 178 place count 53 transition count 63
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 183 place count 51 transition count 60
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 186 place count 48 transition count 60
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 186 place count 48 transition count 44
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 33 rules applied. Total rules applied 219 place count 31 transition count 44
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 221 place count 30 transition count 43
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 223 place count 29 transition count 42
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 223 place count 29 transition count 40
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 228 place count 26 transition count 40
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 232 place count 24 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 233 place count 24 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 238 place count 24 transition count 32
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 239 place count 24 transition count 31
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 241 place count 23 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 242 place count 22 transition count 30
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 242 place count 22 transition count 28
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 246 place count 20 transition count 28
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 248 place count 20 transition count 28
Applied a total of 248 rules in 14 ms. Remains 20 /162 variables (removed 142) and now considering 28/162 (removed 134) transitions.
// Phase 1: matrix 28 rows 20 cols
[2025-06-02 03:30:41] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:30:41] [INFO ] Implicit Places using invariants in 18 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 18 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 19/162 places, 28/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 34 ms. Remains : 19/162 places, 28/162 transitions.
[2025-06-02 03:30:41] [INFO ] Flatten gal took : 2 ms
[2025-06-02 03:30:41] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:30:41] [INFO ] Input system was already deterministic with 28 transitions.
[2025-06-02 03:30:41] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:30:41] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:30:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality7045253067400508067.gal : 1 ms
[2025-06-02 03:30:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality6953630292396694099.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/CTLCardinality7045253067400508067.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6953630292396694099.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,28,0.004901,3856,2,47,5,241,6,0,100,200,0


Converting to forward existential form...Done !
original formula: (AF(!(A((((callToProcess_s00002499_input_s00001052==0)||(callToTask_s00002932_input_s00001066==1))||(callToTask_s00002950_output_s0000107...325
=> equivalent forward existential formula: ([FwdG(Init,!(!(!((E(!((callToTask_s00002957_output_s00001077==1)) U (!((((callToProcess_s00002499_input_s000010...523
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t12, t17, t21, t25, Intersection with reachable at each step enabled. (destroyed...191
dead was empty
(forward)formula 0,1,0.017072,4752,1,0,106,3068,89,60,577,3240,152
FORMULA IBM319-PT-none-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 162/162 transitions.
Ensure Unique test removed 9 places
Reduce places removed 13 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 148 transition count 162
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 21 place count 141 transition count 155
Iterating global reduction 1 with 7 rules applied. Total rules applied 28 place count 141 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 141 transition count 154
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 140 transition count 153
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 140 transition count 153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 139 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 139 transition count 152
Applied a total of 33 rules in 10 ms. Remains 139 /162 variables (removed 23) and now considering 152/162 (removed 10) transitions.
// Phase 1: matrix 152 rows 139 cols
[2025-06-02 03:30:41] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:30:41] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-02 03:30:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:30:41] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 151 sub problems to find dead transitions.
[2025-06-02 03:30:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (OVERLAPS) 152/290 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (OVERLAPS) 1/291 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (OVERLAPS) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 141 constraints, problems are : Problem set: 0 solved, 151 unsolved in 11515 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (OVERLAPS) 152/290 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 151/291 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (OVERLAPS) 1/291 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 292 constraints, problems are : Problem set: 0 solved, 151 unsolved in 23823 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35345ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 35346ms
Starting structural reductions in LTL mode, iteration 1 : 139/162 places, 152/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35525 ms. Remains : 139/162 places, 152/162 transitions.
[2025-06-02 03:31:16] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:31:16] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:31:16] [INFO ] Input system was already deterministic with 152 transitions.
[2025-06-02 03:31:16] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:31:16] [INFO ] Flatten gal took : 3 ms
[2025-06-02 03:31:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality9060414232818399648.gal : 1 ms
[2025-06-02 03:31:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality16959687770972568345.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/CTLCardinality9060414232818399648.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16959687770972568345.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,2053,0.038944,4876,2,478,5,3028,6,0,704,2866,0


Converting to forward existential form...Done !
original formula: (AG(((EX((callToTask_s00002931_input_s00001066==1)) + EF((callToTask_s00002960_input_s00001052==1))) + EX((callToTask_s00002044_inputCrit...610
=> equivalent forward existential formula: [(((FwdU((Init * !(E(EG((((!(((merge_s00002241_activated==0)||(callToProcess_s00002944_output_s00001054==1))) * ...691
Reverse transition relation is NOT exact ! Due to transitions t31, t41, t42, t43, t44, t45, t137, t147, Intersection with reachable at each step enabled. ...203
(forward)formula 0,1,0.67299,34500,1,0,519,185284,343,272,3886,169932,698
FORMULA IBM319-PT-none-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 162/162 transitions.
Ensure Unique test removed 8 places
Reduce places removed 11 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 150 transition count 162
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 18 place count 144 transition count 156
Iterating global reduction 1 with 6 rules applied. Total rules applied 24 place count 144 transition count 156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 144 transition count 155
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 142 transition count 153
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 142 transition count 153
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 31 place count 140 transition count 151
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 140 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 139 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 139 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 138 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 138 transition count 149
Applied a total of 37 rules in 10 ms. Remains 138 /162 variables (removed 24) and now considering 149/162 (removed 13) transitions.
// Phase 1: matrix 149 rows 138 cols
[2025-06-02 03:31:17] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:31:17] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-02 03:31:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:31:17] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 148 sub problems to find dead transitions.
[2025-06-02 03:31:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 149/285 variables, 136/139 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 2/287 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 0/287 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 141 constraints, problems are : Problem set: 0 solved, 148 unsolved in 11202 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 149/285 variables, 136/139 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 146/285 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (OVERLAPS) 2/287 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (OVERLAPS) 0/287 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 289 constraints, problems are : Problem set: 0 solved, 148 unsolved in 25150 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36363ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 36364ms
Starting structural reductions in LTL mode, iteration 1 : 138/162 places, 149/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36539 ms. Remains : 138/162 places, 149/162 transitions.
[2025-06-02 03:31:54] [INFO ] Flatten gal took : 3 ms
[2025-06-02 03:31:54] [INFO ] Flatten gal took : 3 ms
[2025-06-02 03:31:54] [INFO ] Input system was already deterministic with 149 transitions.
[2025-06-02 03:31:54] [INFO ] Flatten gal took : 3 ms
[2025-06-02 03:31:54] [INFO ] Flatten gal took : 3 ms
[2025-06-02 03:31:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality14636619524719487767.gal : 0 ms
[2025-06-02 03:31:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality10887656333135471196.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/CTLCardinality14636619524719487767.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10887656333135471196.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,2179,0.035502,4732,2,446,5,2728,6,0,695,2143,0


Converting to forward existential form...Done !
original formula: EG(((AX(((callToTask_s00002955_inputCriterion_s00001053_used==0)||((merge_s00001162_input_s00001068==0)&&(callToTask_s00001852_inputCrite...549
=> equivalent forward existential formula: [FwdG(Init,((!(EX(!(((callToTask_s00002955_inputCriterion_s00001053_used==0)||((merge_s00001162_input_s00001068=...610
Reverse transition relation is NOT exact ! Due to transitions t31, t41, t42, t43, t44, t134, t144, Intersection with reachable at each step enabled. (dest...198
(forward)formula 0,1,0.531983,26748,1,0,482,107309,331,310,3855,130373,632
FORMULA IBM319-PT-none-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-06-02 03:31:54] [INFO ] Flatten gal took : 7 ms
[2025-06-02 03:31:54] [INFO ] Flatten gal took : 3 ms
Total runtime 370776 ms.

BK_STOP 1748835114775

--------------------
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="IBM319-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 IBM319-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-174876422500329"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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