Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028500449.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 CO4-PT-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028500449
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 132K 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 CO4-PT-10-CTLCardinality-2024-12
FORMULA_NAME CO4-PT-10-CTLCardinality-2024-13
FORMULA_NAME CO4-PT-10-CTLCardinality-2024-14
FORMULA_NAME CO4-PT-10-CTLCardinality-2024-15
FORMULA_NAME CO4-PT-10-CTLCardinality-2025-00
FORMULA_NAME CO4-PT-10-CTLCardinality-2025-01
FORMULA_NAME CO4-PT-10-CTLCardinality-2025-02
FORMULA_NAME CO4-PT-10-CTLCardinality-2025-03
FORMULA_NAME CO4-PT-10-CTLCardinality-2025-04
FORMULA_NAME CO4-PT-10-CTLCardinality-2025-05
FORMULA_NAME CO4-PT-10-CTLCardinality-2025-06
FORMULA_NAME CO4-PT-10-CTLCardinality-2025-07
FORMULA_NAME CO4-PT-10-CTLCardinality-2025-08
FORMULA_NAME CO4-PT-10-CTLCardinality-2025-09
FORMULA_NAME CO4-PT-10-CTLCardinality-2025-10
FORMULA_NAME CO4-PT-10-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748606579855

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-05-30 12:03:01] [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-05-30 12:03:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 12:03:01] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2025-05-30 12:03:01] [INFO ] Transformed 544 places.
[2025-05-30 12:03:01] [INFO ] Transformed 615 transitions.
[2025-05-30 12:03:01] [INFO ] Found NUPN structural information;
[2025-05-30 12:03:01] [INFO ] Parsed PT model containing 544 places and 615 transitions and 1338 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Deduced a syphon composed of 157 places in 9 ms
Reduce places removed 157 places and 177 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-10-CTLCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 64 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 438/438 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 377 transition count 436
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 63 place count 326 transition count 384
Iterating global reduction 1 with 51 rules applied. Total rules applied 114 place count 326 transition count 384
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 143 place count 297 transition count 355
Iterating global reduction 1 with 29 rules applied. Total rules applied 172 place count 297 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 174 place count 297 transition count 353
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 187 place count 284 transition count 340
Iterating global reduction 2 with 13 rules applied. Total rules applied 200 place count 284 transition count 340
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 208 place count 276 transition count 332
Iterating global reduction 2 with 8 rules applied. Total rules applied 216 place count 276 transition count 332
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 218 place count 276 transition count 330
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 219 place count 275 transition count 329
Iterating global reduction 3 with 1 rules applied. Total rules applied 220 place count 275 transition count 329
Applied a total of 220 rules in 103 ms. Remains 275 /387 variables (removed 112) and now considering 329/438 (removed 109) transitions.
// Phase 1: matrix 329 rows 275 cols
[2025-05-30 12:03:01] [INFO ] Computed 4 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:03:01] [INFO ] Implicit Places using invariants in 263 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 293 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 274/387 places, 329/438 transitions.
Applied a total of 0 rules in 5 ms. Remains 274 /274 variables (removed 0) and now considering 329/329 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 414 ms. Remains : 274/387 places, 329/438 transitions.
Support contains 64 out of 274 places after structural reductions.
[2025-05-30 12:03:01] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-05-30 12:03:01] [INFO ] Flatten gal took : 48 ms
FORMULA CO4-PT-10-CTLCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 12:03:01] [INFO ] Flatten gal took : 17 ms
[2025-05-30 12:03:02] [INFO ] Input system was already deterministic with 329 transitions.
Support contains 61 out of 274 places (down from 64) after GAL structural reductions.
FORMULA CO4-PT-10-CTLCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (41 resets) in 1751 ms. (22 steps per ms) remains 27/37 properties
BEST_FIRST walk for 4000 steps (23 resets) in 52 ms. (75 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (39 resets) in 40 ms. (97 steps per ms) remains 25/27 properties
BEST_FIRST walk for 4001 steps (28 resets) in 25 ms. (153 steps per ms) remains 22/25 properties
BEST_FIRST walk for 4003 steps (34 resets) in 15 ms. (250 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4001 steps (24 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (33 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (23 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (23 resets) in 37 ms. (105 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (15 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (28 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (30 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (28 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (37 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (39 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (16 resets) in 21 ms. (181 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4002 steps (23 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (28 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (24 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (29 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (36 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (31 resets) in 25 ms. (153 steps per ms) remains 20/20 properties
// Phase 1: matrix 329 rows 274 cols
[2025-05-30 12:03:02] [INFO ] Computed 3 invariants in 5 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 104/163 variables, 59/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 176/339 variables, 68/130 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 143/482 variables, 80/210 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 78/560 variables, 40/250 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 30/590 variables, 18/268 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/590 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 11/601 variables, 7/275 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/601 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 2/603 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/603 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 17 (OVERLAPS) 0/603 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 603/603 variables, and 277 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1621 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SMT process timed out in 7961ms, After SMT, problems are : Problem set: 0 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 329/329 transitions.
Graph (trivial) has 214 edges and 274 vertex of which 3 / 274 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 401 edges and 272 vertex of which 260 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.4 ms
Discarding 12 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 101 rules applied. Total rules applied 103 place count 260 transition count 216
Reduce places removed 89 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 103 rules applied. Total rules applied 206 place count 171 transition count 202
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 220 place count 157 transition count 202
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 220 place count 157 transition count 189
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 246 place count 144 transition count 189
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 249 place count 141 transition count 186
Iterating global reduction 3 with 3 rules applied. Total rules applied 252 place count 141 transition count 186
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 253 place count 140 transition count 185
Iterating global reduction 3 with 1 rules applied. Total rules applied 254 place count 140 transition count 185
Performed 30 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 314 place count 110 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 315 place count 110 transition count 152
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 317 place count 108 transition count 150
Iterating global reduction 4 with 2 rules applied. Total rules applied 319 place count 108 transition count 150
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 335 place count 100 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 337 place count 100 transition count 148
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 339 place count 98 transition count 144
Iterating global reduction 5 with 2 rules applied. Total rules applied 341 place count 98 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 342 place count 98 transition count 143
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 346 place count 98 transition count 139
Free-agglomeration rule applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 355 place count 98 transition count 130
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 364 place count 89 transition count 130
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 366 place count 89 transition count 128
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 368 place count 89 transition count 128
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 369 place count 89 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 370 place count 88 transition count 127
Applied a total of 370 rules in 117 ms. Remains 88 /274 variables (removed 186) and now considering 127/329 (removed 202) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 88/274 places, 127/329 transitions.
RANDOM walk for 38664 steps (391 resets) in 274 ms. (140 steps per ms) remains 0/20 properties
[2025-05-30 12:03:10] [INFO ] Flatten gal took : 15 ms
[2025-05-30 12:03:10] [INFO ] Flatten gal took : 14 ms
[2025-05-30 12:03:11] [INFO ] Input system was already deterministic with 329 transitions.
Computed a total of 14 stabilizing places and 16 stable transitions
Graph (complete) has 404 edges and 274 vertex of which 264 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 329/329 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 272 transition count 328
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 30 place count 245 transition count 300
Iterating global reduction 1 with 27 rules applied. Total rules applied 57 place count 245 transition count 300
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 245 transition count 299
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 72 place count 231 transition count 285
Iterating global reduction 2 with 14 rules applied. Total rules applied 86 place count 231 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 231 transition count 284
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 93 place count 225 transition count 278
Iterating global reduction 3 with 6 rules applied. Total rules applied 99 place count 225 transition count 278
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 100 place count 225 transition count 277
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 105 place count 220 transition count 272
Iterating global reduction 4 with 5 rules applied. Total rules applied 110 place count 220 transition count 272
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 112 place count 218 transition count 270
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 218 transition count 270
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 115 place count 217 transition count 269
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 217 transition count 269
Applied a total of 116 rules in 34 ms. Remains 217 /274 variables (removed 57) and now considering 269/329 (removed 60) transitions.
// Phase 1: matrix 269 rows 217 cols
[2025-05-30 12:03:11] [INFO ] Computed 3 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:03:11] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-05-30 12:03:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:03:11] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2025-05-30 12:03:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 269/486 variables, 217/220 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:17] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:17] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/486 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (OVERLAPS) 0/486 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 222 constraints, problems are : Problem set: 0 solved, 268 unsolved in 17704 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/486 variables, 217/222 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 268/490 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:35] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 491 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 47771ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 47773ms
Starting structural reductions in LTL mode, iteration 1 : 217/274 places, 269/329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48017 ms. Remains : 217/274 places, 269/329 transitions.
[2025-05-30 12:03:59] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:03:59] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:03:59] [INFO ] Input system was already deterministic with 269 transitions.
[2025-05-30 12:03:59] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:03:59] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:03:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality9280995457207827648.gal : 4 ms
[2025-05-30 12:03:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality17193098774646276417.ctl : 3 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/CTLCardinality9280995457207827648.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17193098774646276417.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,455134,0.113861,8068,2,1381,5,14472,6,0,1135,16054,0


Converting to forward existential form...Done !
original formula: E(((p212==0)||(p367==1)) U (A(((p357==0)||(p155==1)) U AG(A((p417==0) U ((p500==0)||(p475==1))))) + EF(!(A(!(((p401==0)||(p397==1))) U EX...166
=> equivalent forward existential formula: ([((FwdU(Init,((p212==0)||(p367==1))) * !(EG(!(!(E(TRUE U !(!((E(!(((p500==0)||(p475==1))) U (!((p417==0)) * !((...735
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t16, t17, t23, t31, t42, t45, t48, t49, t50, t52, t55, t102, t157, t158, ...291
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 264/0/5
(forward)formula 0,1,4.78121,166740,1,0,939,800148,585,595,6987,907775,1246
FORMULA CO4-PT-10-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 274/274 places, 329/329 transitions.
Graph (trivial) has 276 edges and 274 vertex of which 3 / 274 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 402 edges and 272 vertex of which 263 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 127 rules applied. Total rules applied 129 place count 262 transition count 190
Reduce places removed 127 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 130 rules applied. Total rules applied 259 place count 135 transition count 187
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 262 place count 132 transition count 187
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 262 place count 132 transition count 173
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 290 place count 118 transition count 173
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 297 place count 111 transition count 165
Iterating global reduction 3 with 7 rules applied. Total rules applied 304 place count 111 transition count 165
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 304 place count 111 transition count 163
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 308 place count 109 transition count 163
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 310 place count 107 transition count 161
Iterating global reduction 3 with 2 rules applied. Total rules applied 312 place count 107 transition count 161
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 313 place count 106 transition count 159
Iterating global reduction 3 with 1 rules applied. Total rules applied 314 place count 106 transition count 159
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 348 place count 89 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 350 place count 89 transition count 140
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 352 place count 87 transition count 138
Iterating global reduction 4 with 2 rules applied. Total rules applied 354 place count 87 transition count 138
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 4 with 2 rules applied. Total rules applied 356 place count 86 transition count 137
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 357 place count 86 transition count 136
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 365 place count 86 transition count 128
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 5 with 4 rules applied. Total rules applied 369 place count 86 transition count 124
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 373 place count 82 transition count 124
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 373 place count 82 transition count 123
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 375 place count 81 transition count 123
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 7 with 2 rules applied. Total rules applied 377 place count 80 transition count 122
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 378 place count 80 transition count 122
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 380 place count 78 transition count 120
Applied a total of 380 rules in 55 ms. Remains 78 /274 variables (removed 196) and now considering 120/329 (removed 209) transitions.
// Phase 1: matrix 120 rows 78 cols
[2025-05-30 12:04:04] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:04:04] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-05-30 12:04:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:04:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:04:04] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:04:04] [INFO ] Redundant transitions in 2 ms returned []
Running 110 sub problems to find dead transitions.
[2025-05-30 12:04:04] [INFO ] Invariant cache hit.
[2025-05-30 12:04:04] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 119/197 variables, 78/81 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 1/198 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 0/198 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 82 constraints, problems are : Problem set: 0 solved, 110 unsolved in 3696 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 78/78 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 119/197 variables, 78/81 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 110/191 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 1/198 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 192 constraints, problems are : Problem set: 0 solved, 110 unsolved in 5000 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 78/78 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8714ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 8715ms
Starting structural reductions in SI_CTL mode, iteration 1 : 78/274 places, 120/329 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8894 ms. Remains : 78/274 places, 120/329 transitions.
[2025-05-30 12:04:12] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:04:12] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:04:12] [INFO ] Input system was already deterministic with 120 transitions.
[2025-05-30 12:04:12] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:04:12] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:04:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3717929755058794545.gal : 6 ms
[2025-05-30 12:04:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15012339260238843900.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3717929755058794545.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15012339260238843900.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality15012339260238843900.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 20
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :20 after 35
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :35 after 57
Reachability property CO4-PT-10-CTLCardinality-2025-02 is true.
FORMULA CO4-PT-10-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,133,0.029288,4520,2,263,11,1757,6,0,424,1311,0
Total reachable state count : 133

Verifying 1 reachability properties.
Reachability property CO4-PT-10-CTLCardinality-2025-02 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CO4-PT-10-CTLCardinality-2025-02,1,0.030023,4776,2,79,11,1757,7,0,436,1311,0
RANDOM walk for 40000 steps (5474 resets) in 341 ms. (116 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1014 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3163 steps, run visited all 1 properties in 19 ms. (steps per millisecond=166 )
Probabilistic random walk after 3163 steps, saw 996 distinct states, run finished after 22 ms. (steps per millisecond=143 ) properties seen :1
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 329/329 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 272 transition count 328
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 28 place count 247 transition count 302
Iterating global reduction 1 with 25 rules applied. Total rules applied 53 place count 247 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 247 transition count 301
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 69 place count 232 transition count 286
Iterating global reduction 2 with 15 rules applied. Total rules applied 84 place count 232 transition count 286
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 232 transition count 285
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 93 place count 224 transition count 277
Iterating global reduction 3 with 8 rules applied. Total rules applied 101 place count 224 transition count 277
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 102 place count 224 transition count 276
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 108 place count 218 transition count 270
Iterating global reduction 4 with 6 rules applied. Total rules applied 114 place count 218 transition count 270
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 116 place count 216 transition count 268
Iterating global reduction 4 with 2 rules applied. Total rules applied 118 place count 216 transition count 268
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 119 place count 215 transition count 267
Iterating global reduction 4 with 1 rules applied. Total rules applied 120 place count 215 transition count 267
Applied a total of 120 rules in 17 ms. Remains 215 /274 variables (removed 59) and now considering 267/329 (removed 62) transitions.
// Phase 1: matrix 267 rows 215 cols
[2025-05-30 12:04:13] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:04:13] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-05-30 12:04:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:04:13] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2025-05-30 12:04:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 267/482 variables, 215/218 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:04:19] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:04:19] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:04:19] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (OVERLAPS) 0/482 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 221 constraints, problems are : Problem set: 0 solved, 266 unsolved in 17181 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (OVERLAPS) 267/482 variables, 215/221 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 266/487 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:04:41] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 488 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 47230ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 47231ms
Starting structural reductions in LTL mode, iteration 1 : 215/274 places, 267/329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47410 ms. Remains : 215/274 places, 267/329 transitions.
[2025-05-30 12:05:00] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:05:00] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:05:00] [INFO ] Input system was already deterministic with 267 transitions.
[2025-05-30 12:05:00] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:05:00] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:05:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality5790403600604641622.gal : 2 ms
[2025-05-30 12:05:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality8964759400202431784.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/CTLCardinality5790403600604641622.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8964759400202431784.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,411832,0.108699,8356,2,1538,5,15212,6,0,1125,16941,0


Converting to forward existential form...Done !
original formula: AG(EX((EX(((((p143==1)||(p320==0))||(p322==1)) * EF(((p302==0)||(p151==1))))) * (E((((p440==1)||(p218==0))||(p541==1)) U (p196==0)) + AG(...169
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((EX(((((p143==1)||(p320==0))||(p322==1)) * E(TRUE U ((p302==0)||(p151==1))))) * (E((((p...241
Reverse transition relation is NOT exact ! Due to transitions t0, t11, t12, t13, t14, t15, t16, t22, t30, t40, t42, t43, t44, t45, t46, t48, t53, t97, t109...323
(forward)formula 0,0,1.22271,44848,1,0,375,149958,563,242,6154,159783,572
FORMULA CO4-PT-10-CTLCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 274/274 places, 329/329 transitions.
Graph (trivial) has 277 edges and 274 vertex of which 3 / 274 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 402 edges and 272 vertex of which 262 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 126 rules applied. Total rules applied 128 place count 261 transition count 190
Reduce places removed 126 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 130 rules applied. Total rules applied 258 place count 135 transition count 186
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 262 place count 131 transition count 186
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 262 place count 131 transition count 171
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 292 place count 116 transition count 171
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 302 place count 106 transition count 160
Iterating global reduction 3 with 10 rules applied. Total rules applied 312 place count 106 transition count 160
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 312 place count 106 transition count 157
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 318 place count 103 transition count 157
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 322 place count 99 transition count 153
Iterating global reduction 3 with 4 rules applied. Total rules applied 326 place count 99 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 327 place count 99 transition count 152
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 328 place count 98 transition count 150
Iterating global reduction 4 with 1 rules applied. Total rules applied 329 place count 98 transition count 150
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 361 place count 82 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 363 place count 82 transition count 132
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 365 place count 80 transition count 130
Iterating global reduction 5 with 2 rules applied. Total rules applied 367 place count 80 transition count 130
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 369 place count 79 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 370 place count 79 transition count 128
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 377 place count 79 transition count 121
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 378 place count 79 transition count 120
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 380 place count 78 transition count 119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 381 place count 77 transition count 119
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 381 place count 77 transition count 118
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 383 place count 76 transition count 118
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 9 with 2 rules applied. Total rules applied 385 place count 75 transition count 117
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 386 place count 75 transition count 116
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 388 place count 73 transition count 114
Applied a total of 388 rules in 38 ms. Remains 73 /274 variables (removed 201) and now considering 114/329 (removed 215) transitions.
// Phase 1: matrix 114 rows 73 cols
[2025-05-30 12:05:01] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:05:01] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-05-30 12:05:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:05:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:05:01] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:05:01] [INFO ] Redundant transitions in 2 ms returned []
Running 104 sub problems to find dead transitions.
[2025-05-30 12:05:01] [INFO ] Invariant cache hit.
[2025-05-30 12:05:01] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 113/186 variables, 73/76 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 1/187 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 0/187 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 77 constraints, problems are : Problem set: 0 solved, 104 unsolved in 3231 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 113/186 variables, 73/76 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 104/180 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 1/187 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 0/187 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 181 constraints, problems are : Problem set: 0 solved, 104 unsolved in 4737 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7981ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 7982ms
Starting structural reductions in SI_CTL mode, iteration 1 : 73/274 places, 114/329 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8130 ms. Remains : 73/274 places, 114/329 transitions.
[2025-05-30 12:05:09] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:05:09] [INFO ] Flatten gal took : 3 ms
[2025-05-30 12:05:09] [INFO ] Input system was already deterministic with 114 transitions.
[2025-05-30 12:05:09] [INFO ] Flatten gal took : 3 ms
[2025-05-30 12:05:09] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:05:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality5971480644735224268.gal : 1 ms
[2025-05-30 12:05:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality12557053592607021933.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/CTLCardinality5971480644735224268.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12557053592607021933.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,10891,0.020039,4452,2,222,5,2145,6,0,398,2140,0


Converting to forward existential form...Done !
original formula: AF(EG(((p482==0)&&(p294==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(((p482==0)&&(p294==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t22, t37, t42, t72, Intersection with reachable at each step enabled. (destroyed/rev...189
(forward)formula 0,0,0.140106,10724,1,0,221,29717,253,138,2400,40374,349
FORMULA CO4-PT-10-CTLCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 329/329 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 272 transition count 328
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 30 place count 245 transition count 300
Iterating global reduction 1 with 27 rules applied. Total rules applied 57 place count 245 transition count 300
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 245 transition count 299
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 71 place count 232 transition count 286
Iterating global reduction 2 with 13 rules applied. Total rules applied 84 place count 232 transition count 286
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 232 transition count 285
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 92 place count 225 transition count 278
Iterating global reduction 3 with 7 rules applied. Total rules applied 99 place count 225 transition count 278
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 105 place count 219 transition count 272
Iterating global reduction 3 with 6 rules applied. Total rules applied 111 place count 219 transition count 272
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 218 transition count 271
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 218 transition count 271
Applied a total of 113 rules in 12 ms. Remains 218 /274 variables (removed 56) and now considering 271/329 (removed 58) transitions.
// Phase 1: matrix 271 rows 218 cols
[2025-05-30 12:05:10] [INFO ] Computed 3 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:05:10] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-05-30 12:05:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:05:10] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2025-05-30 12:05:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/218 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 271/489 variables, 218/221 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:16] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:16] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/489 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (OVERLAPS) 0/489 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 489/489 variables, and 223 constraints, problems are : Problem set: 0 solved, 270 unsolved in 17532 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/218 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/489 variables, 218/223 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/489 variables, 270/493 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/489 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 0/489 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 489/489 variables, and 493 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47576ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 47577ms
Starting structural reductions in LTL mode, iteration 1 : 218/274 places, 271/329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47757 ms. Remains : 218/274 places, 271/329 transitions.
[2025-05-30 12:05:57] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:05:57] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:05:57] [INFO ] Input system was already deterministic with 271 transitions.
[2025-05-30 12:05:57] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:05:57] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:05:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality14608914271947509879.gal : 1 ms
[2025-05-30 12:05:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality10992498244259913142.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/CTLCardinality14608914271947509879.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10992498244259913142.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,434968,0.098838,7996,2,1398,5,14671,6,0,1140,15526,0


Converting to forward existential form...Done !
original formula: EG(((EX((((p363==0)&&(p288==1))||(p518==0))) * AX(E((p458==0) U (p308==0)))) * EF(((p181==1)&&((p414==0)||(p380==1))))))
=> equivalent forward existential formula: [FwdG(Init,((EX((((p363==0)&&(p288==1))||(p518==0))) * !(EX(!(E((p458==0) U (p308==0)))))) * E(TRUE U ((p181==1)...193
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t16, t17, t23, t31, t40, t42, t43, t44, t45, t46, t49, t51, t54, t159, t1...301
(forward)formula 0,1,3.83126,139000,1,0,642,453657,575,418,6369,1.01206e+06,778
FORMULA CO4-PT-10-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 329/329 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 272 transition count 328
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 33 place count 242 transition count 297
Iterating global reduction 1 with 30 rules applied. Total rules applied 63 place count 242 transition count 297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 242 transition count 296
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 81 place count 225 transition count 279
Iterating global reduction 2 with 17 rules applied. Total rules applied 98 place count 225 transition count 279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 99 place count 225 transition count 278
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 108 place count 216 transition count 269
Iterating global reduction 3 with 9 rules applied. Total rules applied 117 place count 216 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 118 place count 216 transition count 268
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 125 place count 209 transition count 261
Iterating global reduction 4 with 7 rules applied. Total rules applied 132 place count 209 transition count 261
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 134 place count 207 transition count 259
Iterating global reduction 4 with 2 rules applied. Total rules applied 136 place count 207 transition count 259
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 137 place count 206 transition count 258
Iterating global reduction 4 with 1 rules applied. Total rules applied 138 place count 206 transition count 258
Applied a total of 138 rules in 23 ms. Remains 206 /274 variables (removed 68) and now considering 258/329 (removed 71) transitions.
// Phase 1: matrix 258 rows 206 cols
[2025-05-30 12:06:01] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:06:01] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-05-30 12:06:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:06:01] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2025-05-30 12:06:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/464 variables, 206/209 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:07] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:07] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 0/464 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 211 constraints, problems are : Problem set: 0 solved, 257 unsolved in 16387 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/464 variables, 206/211 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 257/468 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:28] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 469 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46429ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 46431ms
Starting structural reductions in LTL mode, iteration 1 : 206/274 places, 258/329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46626 ms. Remains : 206/274 places, 258/329 transitions.
[2025-05-30 12:06:48] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:06:48] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:06:48] [INFO ] Input system was already deterministic with 258 transitions.
[2025-05-30 12:06:48] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:06:48] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:06:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality4013194676684737638.gal : 1 ms
[2025-05-30 12:06:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality1028279856045224753.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/CTLCardinality4013194676684737638.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1028279856045224753.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,382516,0.096687,7732,2,1318,5,13625,6,0,1080,14596,0


Converting to forward existential form...Done !
original formula: EF(EX((p213==1)))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * (p213==1))] != FALSE
(forward)formula 0,1,0.121564,7988,1,0,8,13625,8,1,1711,14596,2
FORMULA CO4-PT-10-CTLCardinality-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 329/329 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 273 transition count 328
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 25 place count 250 transition count 305
Iterating global reduction 1 with 23 rules applied. Total rules applied 48 place count 250 transition count 305
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 62 place count 236 transition count 291
Iterating global reduction 1 with 14 rules applied. Total rules applied 76 place count 236 transition count 291
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 77 place count 236 transition count 290
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 84 place count 229 transition count 283
Iterating global reduction 2 with 7 rules applied. Total rules applied 91 place count 229 transition count 283
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 96 place count 224 transition count 278
Iterating global reduction 2 with 5 rules applied. Total rules applied 101 place count 224 transition count 278
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 103 place count 222 transition count 276
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 222 transition count 276
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 221 transition count 275
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 221 transition count 275
Applied a total of 107 rules in 11 ms. Remains 221 /274 variables (removed 53) and now considering 275/329 (removed 54) transitions.
// Phase 1: matrix 275 rows 221 cols
[2025-05-30 12:06:48] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:06:48] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-05-30 12:06:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:06:48] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2025-05-30 12:06:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (OVERLAPS) 275/495 variables, 220/223 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:55] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:55] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (OVERLAPS) 1/496 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 8 (OVERLAPS) 0/496 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 226 constraints, problems are : Problem set: 0 solved, 274 unsolved in 22203 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 275/495 variables, 220/225 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 273/498 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:17] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 495/496 variables, and 499 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 220/221 constraints, PredecessorRefiner: 273/274 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 52240ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 52241ms
Starting structural reductions in LTL mode, iteration 1 : 221/274 places, 275/329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52430 ms. Remains : 221/274 places, 275/329 transitions.
[2025-05-30 12:07:41] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:07:41] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:07:41] [INFO ] Input system was already deterministic with 275 transitions.
[2025-05-30 12:07:41] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:07:41] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:07:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality18280588885054606625.gal : 1 ms
[2025-05-30 12:07:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality9457626481765436768.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/CTLCardinality18280588885054606625.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9457626481765436768.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,596126,0.241593,13784,2,1475,5,33017,6,0,1154,50542,0


Converting to forward existential form...Done !
original formula: E((((E(EX((EX((p212==1)) + AX((p479==1)))) U EG(EF((p408==0)))) + (p536==0)) + ((p130==1) + !(A((p457==0) U ((p388==1)||(p115==0)))))) + ...257
=> equivalent forward existential formula: [FwdG(FwdU(Init,(((E(EX((EX((p212==1)) + !(EX(!((p479==1)))))) U EG(E(TRUE U (p408==0)))) + (p536==0)) + ((p130=...465
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t17, t23, t31, t40, t42, t43, t45, t46, t47, t51, t52, t54...310
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,13.2715,406320,1,0,1181,2.77346e+06,615,703,7540,2.27031e+06,1570
FORMULA CO4-PT-10-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 274/274 places, 329/329 transitions.
Graph (trivial) has 281 edges and 274 vertex of which 3 / 274 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 402 edges and 272 vertex of which 262 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 132 place count 261 transition count 186
Reduce places removed 130 places and 0 transitions.
Iterating post reduction 1 with 130 rules applied. Total rules applied 262 place count 131 transition count 186
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 262 place count 131 transition count 171
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 292 place count 116 transition count 171
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 302 place count 106 transition count 160
Iterating global reduction 2 with 10 rules applied. Total rules applied 312 place count 106 transition count 160
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 312 place count 106 transition count 157
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 318 place count 103 transition count 157
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 322 place count 99 transition count 153
Iterating global reduction 2 with 4 rules applied. Total rules applied 326 place count 99 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 327 place count 99 transition count 152
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 328 place count 98 transition count 150
Iterating global reduction 3 with 1 rules applied. Total rules applied 329 place count 98 transition count 150
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 361 place count 82 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 363 place count 82 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 365 place count 80 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 367 place count 80 transition count 130
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 4 with 2 rules applied. Total rules applied 369 place count 79 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 370 place count 79 transition count 128
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 379 place count 79 transition count 119
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 5 with 4 rules applied. Total rules applied 383 place count 79 transition count 115
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 387 place count 75 transition count 115
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 387 place count 75 transition count 114
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 389 place count 74 transition count 114
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 7 with 2 rules applied. Total rules applied 391 place count 73 transition count 113
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 393 place count 71 transition count 111
Applied a total of 393 rules in 46 ms. Remains 71 /274 variables (removed 203) and now considering 111/329 (removed 218) transitions.
// Phase 1: matrix 111 rows 71 cols
[2025-05-30 12:07:54] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:07:54] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-05-30 12:07:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:07:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:07:54] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:07:54] [INFO ] Redundant transitions in 2 ms returned []
Running 101 sub problems to find dead transitions.
[2025-05-30 12:07:54] [INFO ] Invariant cache hit.
[2025-05-30 12:07:54] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 110/181 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 1/182 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 0/182 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 75 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3251 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 110/181 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 101/175 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 1/182 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 176 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3926 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7201ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 7207ms
Starting structural reductions in SI_CTL mode, iteration 1 : 71/274 places, 111/329 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7436 ms. Remains : 71/274 places, 111/329 transitions.
[2025-05-30 12:08:01] [INFO ] Flatten gal took : 2 ms
[2025-05-30 12:08:01] [INFO ] Flatten gal took : 3 ms
[2025-05-30 12:08:01] [INFO ] Input system was already deterministic with 111 transitions.
[2025-05-30 12:08:01] [INFO ] Flatten gal took : 2 ms
[2025-05-30 12:08:01] [INFO ] Flatten gal took : 3 ms
[2025-05-30 12:08:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality5671890866713746264.gal : 1 ms
[2025-05-30 12:08:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality17786274194818410244.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/CTLCardinality5671890866713746264.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17786274194818410244.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,8911,0.019661,4436,2,216,5,1963,6,0,387,1787,0


Converting to forward existential form...Done !
original formula: EG((p232==0))
=> equivalent forward existential formula: [FwdG(Init,(p232==0))] != FALSE
Hit Full ! (commute/partial/dont) 109/0/2
(forward)formula 0,1,0.055811,6100,1,0,10,10831,19,4,1863,6695,8
FORMULA CO4-PT-10-CTLCardinality-2025-10 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 : 274/274 places, 329/329 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 273 transition count 329
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 243 transition count 298
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 243 transition count 298
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 243 transition count 297
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 79 place count 226 transition count 280
Iterating global reduction 2 with 17 rules applied. Total rules applied 96 place count 226 transition count 280
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 97 place count 226 transition count 279
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 106 place count 217 transition count 270
Iterating global reduction 3 with 9 rules applied. Total rules applied 115 place count 217 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 116 place count 217 transition count 269
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 123 place count 210 transition count 262
Iterating global reduction 4 with 7 rules applied. Total rules applied 130 place count 210 transition count 262
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 132 place count 208 transition count 260
Iterating global reduction 4 with 2 rules applied. Total rules applied 134 place count 208 transition count 260
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 135 place count 207 transition count 259
Iterating global reduction 4 with 1 rules applied. Total rules applied 136 place count 207 transition count 259
Applied a total of 136 rules in 13 ms. Remains 207 /274 variables (removed 67) and now considering 259/329 (removed 70) transitions.
// Phase 1: matrix 259 rows 207 cols
[2025-05-30 12:08:01] [INFO ] Computed 3 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:08:02] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-05-30 12:08:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:08:02] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2025-05-30 12:08:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 259/465 variables, 206/209 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:07] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:08] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 1/466 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (OVERLAPS) 0/466 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 212 constraints, problems are : Problem set: 0 solved, 258 unsolved in 19477 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 259/465 variables, 206/211 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 255/466 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:28] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 258 unsolved
SMT process timed out in 49513ms, After SMT, problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 49513ms
Starting structural reductions in LTL mode, iteration 1 : 207/274 places, 259/329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49800 ms. Remains : 207/274 places, 259/329 transitions.
[2025-05-30 12:08:51] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:08:51] [INFO ] Flatten gal took : 21 ms
[2025-05-30 12:08:51] [INFO ] Input system was already deterministic with 259 transitions.
[2025-05-30 12:08:51] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:08:51] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:08:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality4434334389446880882.gal : 1 ms
[2025-05-30 12:08:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality14004930999845804056.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/CTLCardinality4434334389446880882.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14004930999845804056.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,406654,0.104728,7748,2,1321,5,13829,6,0,1082,14799,0


Converting to forward existential form...Done !
original formula: EF((((p502!=0) + EF((p465!=0))) + (AX(FALSE) + AG((p260!=1)))))
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * (p502!=0))] != FALSE + [(FwdU(FwdU(Init,TRUE),TRUE) * (p465!=0))] != FALSE) + ([(FwdU(Init...251
(forward)formula 0,1,0.105801,8004,1,0,7,13829,8,1,1085,14799,1
FORMULA CO4-PT-10-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 274/274 places, 329/329 transitions.
Graph (trivial) has 281 edges and 274 vertex of which 3 / 274 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 402 edges and 272 vertex of which 262 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 131 place count 261 transition count 187
Reduce places removed 129 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 130 rules applied. Total rules applied 261 place count 132 transition count 186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 262 place count 131 transition count 186
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 262 place count 131 transition count 171
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 292 place count 116 transition count 171
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 302 place count 106 transition count 160
Iterating global reduction 3 with 10 rules applied. Total rules applied 312 place count 106 transition count 160
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 312 place count 106 transition count 157
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 318 place count 103 transition count 157
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 322 place count 99 transition count 153
Iterating global reduction 3 with 4 rules applied. Total rules applied 326 place count 99 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 327 place count 99 transition count 152
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 328 place count 98 transition count 150
Iterating global reduction 4 with 1 rules applied. Total rules applied 329 place count 98 transition count 150
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 361 place count 82 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 363 place count 82 transition count 132
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 365 place count 80 transition count 130
Iterating global reduction 5 with 2 rules applied. Total rules applied 367 place count 80 transition count 130
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 369 place count 79 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 370 place count 79 transition count 128
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 379 place count 79 transition count 119
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 6 with 4 rules applied. Total rules applied 383 place count 79 transition count 115
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 387 place count 75 transition count 115
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 387 place count 75 transition count 114
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 389 place count 74 transition count 114
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 8 with 2 rules applied. Total rules applied 391 place count 73 transition count 113
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 395 place count 73 transition count 113
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 397 place count 71 transition count 111
Applied a total of 397 rules in 32 ms. Remains 71 /274 variables (removed 203) and now considering 111/329 (removed 218) transitions.
// Phase 1: matrix 111 rows 71 cols
[2025-05-30 12:08:51] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:08:52] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-05-30 12:08:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:08:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:08:52] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:08:52] [INFO ] Redundant transitions in 2 ms returned []
Running 101 sub problems to find dead transitions.
[2025-05-30 12:08:52] [INFO ] Invariant cache hit.
[2025-05-30 12:08:52] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 110/181 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 1/182 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 0/182 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 75 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3063 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 110/181 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 101/175 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 1/182 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 176 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4374 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7446ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 7446ms
Starting structural reductions in SI_CTL mode, iteration 1 : 71/274 places, 111/329 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7619 ms. Remains : 71/274 places, 111/329 transitions.
[2025-05-30 12:08:59] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:08:59] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:08:59] [INFO ] Input system was already deterministic with 111 transitions.
[2025-05-30 12:08:59] [INFO ] Flatten gal took : 3 ms
[2025-05-30 12:08:59] [INFO ] Flatten gal took : 2 ms
[2025-05-30 12:08:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality15107246229687719967.gal : 0 ms
[2025-05-30 12:08:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality13272771711415016256.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/CTLCardinality15107246229687719967.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13272771711415016256.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,8911,0.0266,4444,2,230,5,2260,6,0,387,1962,0


Converting to forward existential form...Done !
original formula: AG(EF((p381==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p381==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t19, t32, t37, t67, t103, Intersection with reachable at each step enabled. (destroyed/r...191
(forward)formula 0,0,0.100719,7900,1,0,152,20756,242,78,2360,15189,231
FORMULA CO4-PT-10-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 329/329 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 272 transition count 328
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 26 place count 249 transition count 304
Iterating global reduction 1 with 23 rules applied. Total rules applied 49 place count 249 transition count 304
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 249 transition count 303
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 65 place count 234 transition count 288
Iterating global reduction 2 with 15 rules applied. Total rules applied 80 place count 234 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 234 transition count 287
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 88 place count 227 transition count 280
Iterating global reduction 3 with 7 rules applied. Total rules applied 95 place count 227 transition count 280
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 227 transition count 279
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 101 place count 222 transition count 274
Iterating global reduction 4 with 5 rules applied. Total rules applied 106 place count 222 transition count 274
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 107 place count 221 transition count 273
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 221 transition count 273
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 109 place count 220 transition count 272
Iterating global reduction 4 with 1 rules applied. Total rules applied 110 place count 220 transition count 272
Applied a total of 110 rules in 20 ms. Remains 220 /274 variables (removed 54) and now considering 272/329 (removed 57) transitions.
// Phase 1: matrix 272 rows 220 cols
[2025-05-30 12:08:59] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:08:59] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-05-30 12:08:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:08:59] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 271 sub problems to find dead transitions.
[2025-05-30 12:08:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (OVERLAPS) 272/492 variables, 220/223 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:06] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:06] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/492 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (OVERLAPS) 0/492 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 225 constraints, problems are : Problem set: 0 solved, 271 unsolved in 17624 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 272/492 variables, 220/225 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 271/496 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:42] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 497 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 47662ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 47662ms
Starting structural reductions in LTL mode, iteration 1 : 220/274 places, 272/329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47864 ms. Remains : 220/274 places, 272/329 transitions.
[2025-05-30 12:09:47] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:09:47] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:09:47] [INFO ] Input system was already deterministic with 272 transitions.
[2025-05-30 12:09:47] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:09:47] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:09:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality16126052944059607191.gal : 1 ms
[2025-05-30 12:09:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality11405208495983032613.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/CTLCardinality16126052944059607191.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11405208495983032613.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,416200,0.215261,12224,2,1416,5,28486,6,0,1149,40489,0


Converting to forward existential form...Done !
original formula: E(!(E((((p213==0)&&(p325==1)) * (((p162==1)||(p128==0)) * AF((p353==1)))) U (AG((((p179==1)||(p385==0))||(p413==1))) + !(((((p300==1)||(p...242
=> equivalent forward existential formula: [(FwdU((EY(FwdU(Init,!(E((((p213==0)&&(p325==1)) * (((p162==1)||(p128==0)) * !(EG(!((p353==1)))))) U (!(E(TRUE U...316
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t16, t17, t23, t31, t40, t42, t43, t44, t45, t46, t48, t51, t101, t157, t...296
(forward)formula 0,1,15.9442,462924,1,0,1016,2.84178e+06,589,590,7104,2.93896e+06,1310
FORMULA CO4-PT-10-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-30 12:10:03] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:10:03] [INFO ] Flatten gal took : 6 ms
Total runtime 422574 ms.

BK_STOP 1748607003746

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ 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="CO4-PT-10"
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 CO4-PT-10, 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 r044-tall-174854028500449"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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