Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 9.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K 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 152K 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-09-CTLFireability-2024-12
FORMULA_NAME CO4-PT-09-CTLFireability-2024-13
FORMULA_NAME CO4-PT-09-CTLFireability-2024-14
FORMULA_NAME CO4-PT-09-CTLFireability-2024-15
FORMULA_NAME CO4-PT-09-CTLFireability-2025-00
FORMULA_NAME CO4-PT-09-CTLFireability-2025-01
FORMULA_NAME CO4-PT-09-CTLFireability-2025-02
FORMULA_NAME CO4-PT-09-CTLFireability-2025-03
FORMULA_NAME CO4-PT-09-CTLFireability-2025-04
FORMULA_NAME CO4-PT-09-CTLFireability-2025-05
FORMULA_NAME CO4-PT-09-CTLFireability-2025-06
FORMULA_NAME CO4-PT-09-CTLFireability-2025-07
FORMULA_NAME CO4-PT-09-CTLFireability-2025-08
FORMULA_NAME CO4-PT-09-CTLFireability-2025-09
FORMULA_NAME CO4-PT-09-CTLFireability-2025-10
FORMULA_NAME CO4-PT-09-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748606280638

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-30 11:58:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 11:58:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:58:02] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2025-05-30 11:58:02] [INFO ] Transformed 467 places.
[2025-05-30 11:58:02] [INFO ] Transformed 634 transitions.
[2025-05-30 11:58:02] [INFO ] Found NUPN structural information;
[2025-05-30 11:58:02] [INFO ] Parsed PT model containing 467 places and 634 transitions and 1868 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Deduced a syphon composed of 108 places in 7 ms
Reduce places removed 108 places and 163 transitions.
Support contains 91 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 471/471 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 346 transition count 469
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 86 place count 275 transition count 397
Iterating global reduction 1 with 71 rules applied. Total rules applied 157 place count 275 transition count 397
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 161 place count 275 transition count 393
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 182 place count 254 transition count 366
Iterating global reduction 2 with 21 rules applied. Total rules applied 203 place count 254 transition count 366
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 205 place count 252 transition count 363
Iterating global reduction 2 with 2 rules applied. Total rules applied 207 place count 252 transition count 363
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 208 place count 251 transition count 362
Iterating global reduction 2 with 1 rules applied. Total rules applied 209 place count 251 transition count 362
Applied a total of 209 rules in 78 ms. Remains 251 /359 variables (removed 108) and now considering 362/471 (removed 109) transitions.
// Phase 1: matrix 362 rows 251 cols
[2025-05-30 11:58:02] [INFO ] Computed 6 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:58:03] [INFO ] Implicit Places using invariants in 239 ms returned []
[2025-05-30 11:58:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:58:03] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2025-05-30 11:58:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (OVERLAPS) 1/251 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:58:08] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:58:08] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:58:08] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:58:09] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 3 ms to minimize.
Problem TDEAD282 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:58:09] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 4 ms to minimize.
Problem TDEAD283 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:58:09] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 3 ms to minimize.
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:58:09] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:58:09] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 2 ms to minimize.
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:58:09] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 3 ms to minimize.
Problem TDEAD329 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 9/15 constraints. Problems are: Problem set: 11 solved, 350 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 0/15 constraints. Problems are: Problem set: 11 solved, 350 unsolved
At refinement iteration 4 (OVERLAPS) 362/613 variables, 251/266 constraints. Problems are: Problem set: 11 solved, 350 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:58:15] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/613 variables, 1/267 constraints. Problems are: Problem set: 11 solved, 350 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/613 variables, 0/267 constraints. Problems are: Problem set: 11 solved, 350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 613/613 variables, and 267 constraints, problems are : Problem set: 11 solved, 350 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 350 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 350 unsolved
At refinement iteration 1 (OVERLAPS) 1/251 variables, 6/6 constraints. Problems are: Problem set: 11 solved, 350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 10/16 constraints. Problems are: Problem set: 11 solved, 350 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 0/16 constraints. Problems are: Problem set: 11 solved, 350 unsolved
At refinement iteration 4 (OVERLAPS) 362/613 variables, 251/267 constraints. Problems are: Problem set: 11 solved, 350 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/613 variables, 350/617 constraints. Problems are: Problem set: 11 solved, 350 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:58:40] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/613 variables, 1/618 constraints. Problems are: Problem set: 11 solved, 350 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:01] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 613/613 variables, and 619 constraints, problems are : Problem set: 11 solved, 350 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 350/361 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60248ms problems are : Problem set: 11 solved, 350 unsolved
Search for dead transitions found 11 dead transitions in 60260ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in LTL mode, iteration 1 : 251/359 places, 351/471 transitions.
Applied a total of 0 rules in 3 ms. Remains 251 /251 variables (removed 0) and now considering 351/351 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60844 ms. Remains : 251/359 places, 351/471 transitions.
Support contains 91 out of 251 places after structural reductions.
[2025-05-30 11:59:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-05-30 11:59:03] [INFO ] Flatten gal took : 61 ms
[2025-05-30 11:59:03] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA CO4-PT-09-CTLFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-CTLFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-CTLFireability-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-CTLFireability-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 11:59:04] [INFO ] Flatten gal took : 27 ms
[2025-05-30 11:59:04] [INFO ] Input system was already deterministic with 351 transitions.
Support contains 74 out of 251 places (down from 91) after GAL structural reductions.
RANDOM walk for 40000 steps (118 resets) in 1058 ms. (37 steps per ms) remains 43/54 properties
BEST_FIRST walk for 4002 steps (31 resets) in 57 ms. (69 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4003 steps (29 resets) in 40 ms. (97 steps per ms) remains 39/42 properties
BEST_FIRST walk for 4001 steps (31 resets) in 42 ms. (93 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (29 resets) in 41 ms. (95 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (17 resets) in 21 ms. (181 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (31 resets) in 14 ms. (266 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4004 steps (26 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (30 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (31 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (30 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (30 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (28 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (33 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (30 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (26 resets) in 28 ms. (138 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (31 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (26 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (28 resets) in 16 ms. (235 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4003 steps (27 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (26 resets) in 12 ms. (308 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (30 resets) in 32 ms. (121 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (19 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (31 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (32 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (31 resets) in 14 ms. (266 steps per ms) remains 33/37 properties
BEST_FIRST walk for 4003 steps (22 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (16 resets) in 10 ms. (363 steps per ms) remains 31/33 properties
BEST_FIRST walk for 4003 steps (28 resets) in 12 ms. (307 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (34 resets) in 12 ms. (307 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (19 resets) in 13 ms. (286 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (29 resets) in 10 ms. (363 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (31 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (27 resets) in 10 ms. (364 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (25 resets) in 12 ms. (307 steps per ms) remains 31/31 properties
// Phase 1: matrix 351 rows 251 cols
[2025-05-30 11:59:04] [INFO ] Computed 6 invariants in 4 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/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 23/69 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 1/70 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 183/253 variables, 70/76 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 227/480 variables, 103/179 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (OVERLAPS) 100/580 variables, 64/243 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/580 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Problem AtomicPropp44 is UNSAT
At refinement iteration 11 (OVERLAPS) 17/597 variables, 11/254 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/597 variables, 0/254 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 13 (OVERLAPS) 5/602 variables, 3/257 constraints. Problems are: Problem set: 1 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:05] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 4 ms to minimize.
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/602 variables, 1/258 constraints. Problems are: Problem set: 3 solved, 28 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/602 variables, 0/258 constraints. Problems are: Problem set: 3 solved, 28 unsolved
At refinement iteration 16 (OVERLAPS) 0/602 variables, 0/258 constraints. Problems are: Problem set: 3 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 602/602 variables, and 258 constraints, problems are : Problem set: 3 solved, 28 unsolved in 2434 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 28 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 25/66 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:07] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:07] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:07] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 2 ms to minimize.
Problem AtomicPropp39 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:07] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:07] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 5/11 constraints. Problems are: Problem set: 4 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:07] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/12 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 1/67 variables, 1/13 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 173/240 variables, 67/80 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 4/84 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/84 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 227/467 variables, 97/181 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/467 variables, 23/204 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/467 variables, 0/204 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 14 (OVERLAPS) 111/578 variables, 71/275 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/578 variables, 0/275 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 16 (OVERLAPS) 19/597 variables, 13/288 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/597 variables, 0/288 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 18 (OVERLAPS) 5/602 variables, 3/291 constraints. Problems are: Problem set: 4 solved, 27 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/602 variables, and 291 constraints, problems are : Problem set: 4 solved, 27 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 27/31 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7459ms problems are : Problem set: 4 solved, 27 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 40 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 351/351 transitions.
Graph (trivial) has 180 edges and 251 vertex of which 2 / 251 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 575 edges and 250 vertex of which 248 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 248 transition count 281
Reduce places removed 62 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 69 rules applied. Total rules applied 135 place count 186 transition count 274
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 142 place count 179 transition count 274
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 142 place count 179 transition count 258
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 174 place count 163 transition count 258
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 182 place count 155 transition count 248
Iterating global reduction 3 with 8 rules applied. Total rules applied 190 place count 155 transition count 248
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 191 place count 155 transition count 247
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 192 place count 154 transition count 245
Iterating global reduction 4 with 1 rules applied. Total rules applied 193 place count 154 transition count 245
Performed 23 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 239 place count 131 transition count 220
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 246 place count 131 transition count 213
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 247 place count 130 transition count 211
Iterating global reduction 5 with 1 rules applied. Total rules applied 248 place count 130 transition count 211
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 250 place count 129 transition count 210
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 252 place count 129 transition count 208
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 280 place count 115 transition count 228
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 286 place count 115 transition count 222
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 291 place count 110 transition count 202
Iterating global reduction 7 with 5 rules applied. Total rules applied 296 place count 110 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 299 place count 110 transition count 199
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 300 place count 109 transition count 193
Iterating global reduction 8 with 1 rules applied. Total rules applied 301 place count 109 transition count 193
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 314 place count 109 transition count 180
Free-agglomeration rule applied 10 times.
Iterating global reduction 8 with 10 rules applied. Total rules applied 324 place count 109 transition count 170
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 334 place count 99 transition count 170
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 339 place count 99 transition count 170
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 340 place count 99 transition count 170
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 341 place count 98 transition count 169
Applied a total of 341 rules in 98 ms. Remains 98 /251 variables (removed 153) and now considering 169/351 (removed 182) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 98/251 places, 169/351 transitions.
RANDOM walk for 40000 steps (3130 resets) in 543 ms. (73 steps per ms) remains 8/27 properties
BEST_FIRST walk for 40003 steps (419 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (661 resets) in 147 ms. (270 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (672 resets) in 121 ms. (327 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (663 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (669 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (588 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (657 resets) in 67 ms. (588 steps per ms) remains 6/6 properties
[2025-05-30 11:59:12] [INFO ] Flow matrix only has 163 transitions (discarded 6 similar events)
// Phase 1: matrix 163 rows 98 cols
[2025-05-30 11:59:12] [INFO ] Computed 5 invariants in 2 ms
[2025-05-30 11:59:12] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 23/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 117/152 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 90/242 variables, 50/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 17/259 variables, 11/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 2/261 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/261 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/261 variables, and 105 constraints, problems are : Problem set: 0 solved, 6 unsolved in 440 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 98/98 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 23/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 117/152 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 90/242 variables, 50/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 6/98 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 17/259 variables, 11/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 2/261 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/261 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/261 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 261/261 variables, and 111 constraints, problems are : Problem set: 0 solved, 6 unsolved in 494 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 98/98 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 944ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 4 properties in 559 ms.
Support contains 6 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 169/169 transitions.
Graph (complete) has 313 edges and 98 vertex of which 96 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 96 transition count 145
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
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 1 with 23 rules applied. Total rules applied 46 place count 77 transition count 141
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 49 place count 76 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 75 transition count 139
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 50 place count 75 transition count 136
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 56 place count 72 transition count 136
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 60 place count 68 transition count 128
Iterating global reduction 4 with 4 rules applied. Total rules applied 64 place count 68 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 65 place count 68 transition count 127
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 79 place count 61 transition count 120
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 80 place count 60 transition count 116
Iterating global reduction 5 with 1 rules applied. Total rules applied 81 place count 60 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 82 place count 60 transition count 115
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 90 place count 56 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 91 place count 56 transition count 120
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 93 place count 54 transition count 112
Iterating global reduction 7 with 2 rules applied. Total rules applied 95 place count 54 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 96 place count 54 transition count 111
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 97 place count 54 transition count 110
Free-agglomeration rule applied 11 times.
Iterating global reduction 8 with 11 rules applied. Total rules applied 108 place count 54 transition count 99
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 125 place count 43 transition count 93
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 126 place count 43 transition count 93
Applied a total of 126 rules in 29 ms. Remains 43 /98 variables (removed 55) and now considering 93/169 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 43/98 places, 93/169 transitions.
RANDOM walk for 40000 steps (8 resets) in 143 ms. (277 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (10 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (10 resets) in 77 ms. (512 steps per ms) remains 1/2 properties
[2025-05-30 11:59:14] [INFO ] Flow matrix only has 83 transitions (discarded 10 similar events)
// Phase 1: matrix 83 rows 43 cols
[2025-05-30 11:59:14] [INFO ] Computed 6 invariants in 1 ms
[2025-05-30 11:59:14] [INFO ] State equation strengthened by 19 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/24 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 73/97 variables, 24/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 27/124 variables, 17/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/126 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/126 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/126 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 68 constraints, problems are : Problem set: 0 solved, 1 unsolved in 93 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/24 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 73/97 variables, 24/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 27/124 variables, 17/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/126 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/126 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/126 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/126 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 69 constraints, problems are : Problem set: 0 solved, 1 unsolved in 89 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 189ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 25 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Parikh walk visited 1 properties in 7 ms.
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
[2025-05-30 11:59:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-05-30 11:59:14] [INFO ] Flatten gal took : 19 ms
FORMULA CO4-PT-09-CTLFireability-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 11:59:14] [INFO ] Flatten gal took : 19 ms
[2025-05-30 11:59:14] [INFO ] Input system was already deterministic with 351 transitions.
Support contains 54 out of 251 places (down from 65) after GAL structural reductions.
Computed a total of 20 stabilizing places and 26 stable transitions
Graph (complete) has 577 edges and 251 vertex of which 247 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 251/251 places, 351/351 transitions.
Graph (trivial) has 242 edges and 251 vertex of which 2 / 251 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 576 edges and 250 vertex of which 246 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 86 place count 245 transition count 260
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 88 rules applied. Total rules applied 174 place count 161 transition count 256
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 9 rules applied. Total rules applied 183 place count 159 transition count 249
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 189 place count 153 transition count 249
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 189 place count 153 transition count 235
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 217 place count 139 transition count 235
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 232 place count 124 transition count 213
Iterating global reduction 4 with 15 rules applied. Total rules applied 247 place count 124 transition count 213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 249 place count 124 transition count 211
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 249 place count 124 transition count 209
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 253 place count 122 transition count 209
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 256 place count 119 transition count 204
Iterating global reduction 5 with 3 rules applied. Total rules applied 259 place count 119 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 260 place count 119 transition count 203
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 288 place count 105 transition count 189
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 292 place count 105 transition count 185
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 294 place count 103 transition count 181
Iterating global reduction 7 with 2 rules applied. Total rules applied 296 place count 103 transition count 181
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 300 place count 101 transition count 179
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 6 rules applied. Total rules applied 306 place count 101 transition count 173
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 8 with 6 rules applied. Total rules applied 312 place count 99 transition count 169
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 316 place count 97 transition count 167
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 10 with 2 rules applied. Total rules applied 318 place count 96 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 323 place count 96 transition count 161
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 10 with 1 rules applied. Total rules applied 324 place count 96 transition count 160
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 325 place count 95 transition count 160
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 12 with 2 rules applied. Total rules applied 327 place count 94 transition count 159
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 329 place count 92 transition count 157
Applied a total of 329 rules in 46 ms. Remains 92 /251 variables (removed 159) and now considering 157/351 (removed 194) transitions.
// Phase 1: matrix 157 rows 92 cols
[2025-05-30 11:59:14] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:59:14] [INFO ] Implicit Places using invariants in 49 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 91/251 places, 157/351 transitions.
Applied a total of 0 rules in 3 ms. Remains 91 /91 variables (removed 0) and now considering 157/157 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 102 ms. Remains : 91/251 places, 157/351 transitions.
[2025-05-30 11:59:14] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:59:14] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:59:14] [INFO ] Input system was already deterministic with 157 transitions.
[2025-05-30 11:59:14] [INFO ] Flatten gal took : 7 ms
[2025-05-30 11:59:14] [INFO ] Flatten gal took : 6 ms
[2025-05-30 11:59:14] [INFO ] Time to serialize gal into /tmp/CTLFireability16898700860105077817.gal : 3 ms
[2025-05-30 11:59:14] [INFO ] Time to serialize properties into /tmp/CTLFireability2663824943723935830.ctl : 2 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/CTLFireability16898700860105077817.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2663824943723935830.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,285649,0.063945,5856,2,795,5,7987,6,0,512,5816,0


Converting to forward existential form...Done !
original formula: A((p396==1) U EF(((!(A((p117==1) U (p382==1))) * (p302==1)) * ((p378==1)&&(p465==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U ((!(!((E(!((p382==1)) U (!((p117==1)) * !((p382==1)))) + EG(!((p382==1)))))) * (p302==...485
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t9, t14, t38, t48, t54, t83, t85, t89, t99, t101, t103, t106, t110, t114, t119, t...272
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,4.01368,144264,1,0,601,804646,355,325,4211,924681,706
FORMULA CO4-PT-09-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 351/351 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 224 transition count 318
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 224 transition count 318
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 224 transition count 317
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 67 place count 212 transition count 301
Iterating global reduction 1 with 12 rules applied. Total rules applied 79 place count 212 transition count 301
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 80 place count 212 transition count 300
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 85 place count 207 transition count 295
Iterating global reduction 2 with 5 rules applied. Total rules applied 90 place count 207 transition count 295
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 92 place count 207 transition count 293
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 94 place count 205 transition count 291
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 205 transition count 291
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 98 place count 205 transition count 289
Applied a total of 98 rules in 11 ms. Remains 205 /251 variables (removed 46) and now considering 289/351 (removed 62) transitions.
// Phase 1: matrix 289 rows 205 cols
[2025-05-30 11:59:18] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:59:18] [INFO ] Implicit Places using invariants in 61 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 204/251 places, 289/351 transitions.
Applied a total of 0 rules in 3 ms. Remains 204 /204 variables (removed 0) and now considering 289/289 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 76 ms. Remains : 204/251 places, 289/351 transitions.
[2025-05-30 11:59:18] [INFO ] Flatten gal took : 11 ms
[2025-05-30 11:59:18] [INFO ] Flatten gal took : 12 ms
[2025-05-30 11:59:18] [INFO ] Input system was already deterministic with 289 transitions.
[2025-05-30 11:59:18] [INFO ] Flatten gal took : 19 ms
[2025-05-30 11:59:18] [INFO ] Flatten gal took : 10 ms
[2025-05-30 11:59:18] [INFO ] Time to serialize gal into /tmp/CTLFireability13465242801109365196.gal : 4 ms
[2025-05-30 11:59:18] [INFO ] Time to serialize properties into /tmp/CTLFireability15539108359928272524.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/CTLFireability13465242801109365196.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15539108359928272524.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,1.18593e+07,0.240298,14444,2,2875,5,35186,6,0,1101,42187,0


Converting to forward existential form...Done !
original formula: EF(EG((A((p417!=1) U !((((p221==1)&&(p302==1))&&(p453==1)))) + EX(AX((p2==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!((E(!(!((((p221==1)&&(p302==1))&&(p453==1)))) U (!((p417!=1)) * !(!((((p221==1)&&(p302==...260
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t12, t19, t28, t33, t34, t36, t37, t41, t42, t50, t59, t64, t65, ...381
(forward)formula 0,1,3.64288,128024,1,0,554,543280,608,292,7522,586520,750
FORMULA CO4-PT-09-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 351/351 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 228 transition count 322
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 228 transition count 322
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 56 place count 218 transition count 309
Iterating global reduction 0 with 10 rules applied. Total rules applied 66 place count 218 transition count 309
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 218 transition count 308
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 70 place count 215 transition count 305
Iterating global reduction 1 with 3 rules applied. Total rules applied 73 place count 215 transition count 305
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 215 transition count 304
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 213 transition count 302
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 213 transition count 302
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 80 place count 213 transition count 300
Applied a total of 80 rules in 19 ms. Remains 213 /251 variables (removed 38) and now considering 300/351 (removed 51) transitions.
// Phase 1: matrix 300 rows 213 cols
[2025-05-30 11:59:22] [INFO ] Computed 6 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:59:22] [INFO ] Implicit Places using invariants in 64 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/251 places, 300/351 transitions.
Applied a total of 0 rules in 8 ms. Remains 212 /212 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 212/251 places, 300/351 transitions.
[2025-05-30 11:59:22] [INFO ] Flatten gal took : 12 ms
[2025-05-30 11:59:22] [INFO ] Flatten gal took : 11 ms
[2025-05-30 11:59:22] [INFO ] Input system was already deterministic with 300 transitions.
[2025-05-30 11:59:22] [INFO ] Flatten gal took : 10 ms
[2025-05-30 11:59:22] [INFO ] Flatten gal took : 10 ms
[2025-05-30 11:59:22] [INFO ] Time to serialize gal into /tmp/CTLFireability14915740955809742963.gal : 2 ms
[2025-05-30 11:59:22] [INFO ] Time to serialize properties into /tmp/CTLFireability10551837830699144755.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/CTLFireability14915740955809742963.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10551837830699144755.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,1.37358e+07,0.265661,15392,2,2987,5,37986,6,0,1143,44673,0


Converting to forward existential form...Done !
original formula: (EG((p275==1)) + AX(A((AF(((((p215==1)&&(p302==1))&&(p453==1))||(p99==1))) * (p158==1)) U ((p186==1) * EX(((p400==1)&&(p119==1)))))))
=> equivalent forward existential formula: (([((FwdU(EY((Init * !(EG((p275==1))))),!(((p186==1) * EX(((p400==1)&&(p119==1)))))) * !((!(EG(!(((((p215==1)&&(...529
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t12, t19, t28, t33, t34, t36, t37, t41, t42, t46, t47, t55, t64, ...403
(forward)formula 0,0,9.02207,285708,1,0,736,1.59314e+06,626,367,7705,1.56207e+06,973
FORMULA CO4-PT-09-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 351/351 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 224 transition count 317
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 224 transition count 317
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 224 transition count 316
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 67 place count 212 transition count 300
Iterating global reduction 1 with 12 rules applied. Total rules applied 79 place count 212 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 80 place count 212 transition count 299
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 85 place count 207 transition count 294
Iterating global reduction 2 with 5 rules applied. Total rules applied 90 place count 207 transition count 294
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 92 place count 207 transition count 292
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 94 place count 205 transition count 290
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 205 transition count 290
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 98 place count 205 transition count 288
Applied a total of 98 rules in 49 ms. Remains 205 /251 variables (removed 46) and now considering 288/351 (removed 63) transitions.
// Phase 1: matrix 288 rows 205 cols
[2025-05-30 11:59:31] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:59:32] [INFO ] Implicit Places using invariants in 178 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 202 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 204/251 places, 288/351 transitions.
Applied a total of 0 rules in 8 ms. Remains 204 /204 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 259 ms. Remains : 204/251 places, 288/351 transitions.
[2025-05-30 11:59:32] [INFO ] Flatten gal took : 9 ms
[2025-05-30 11:59:32] [INFO ] Flatten gal took : 25 ms
[2025-05-30 11:59:32] [INFO ] Input system was already deterministic with 288 transitions.
[2025-05-30 11:59:32] [INFO ] Flatten gal took : 10 ms
[2025-05-30 11:59:32] [INFO ] Flatten gal took : 26 ms
[2025-05-30 11:59:32] [INFO ] Time to serialize gal into /tmp/CTLFireability4295140781360190348.gal : 2 ms
[2025-05-30 11:59:32] [INFO ] Time to serialize properties into /tmp/CTLFireability16103093896024871933.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/CTLFireability4295140781360190348.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16103093896024871933.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,1.19631e+07,0.246723,11876,2,2635,5,26903,6,0,1100,32612,0


Converting to forward existential form...Done !
original formula: EX(AG(((p346==0)||(((p300==1)&&(p309==1))&&(p434==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(((p346==0)||(((p300==1)&&(p309==1))&&(p434==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t12, t19, t28, t33, t34, t36, t37, t41, t42, t50, t59, t64, t65, ...387
(forward)formula 0,0,6.02778,176232,1,0,472,973831,598,271,7187,745356,655
FORMULA CO4-PT-09-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 351/351 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 226 transition count 321
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 226 transition count 321
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 226 transition count 320
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 61 place count 216 transition count 306
Iterating global reduction 1 with 10 rules applied. Total rules applied 71 place count 216 transition count 306
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 76 place count 211 transition count 301
Iterating global reduction 1 with 5 rules applied. Total rules applied 81 place count 211 transition count 301
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 83 place count 211 transition count 299
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 85 place count 209 transition count 297
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 209 transition count 297
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 89 place count 209 transition count 295
Applied a total of 89 rules in 11 ms. Remains 209 /251 variables (removed 42) and now considering 295/351 (removed 56) transitions.
// Phase 1: matrix 295 rows 209 cols
[2025-05-30 11:59:38] [INFO ] Computed 6 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:59:38] [INFO ] Implicit Places using invariants in 440 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 443 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 208/251 places, 295/351 transitions.
Applied a total of 0 rules in 2 ms. Remains 208 /208 variables (removed 0) and now considering 295/295 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 457 ms. Remains : 208/251 places, 295/351 transitions.
[2025-05-30 11:59:38] [INFO ] Flatten gal took : 11 ms
[2025-05-30 11:59:38] [INFO ] Flatten gal took : 9 ms
[2025-05-30 11:59:38] [INFO ] Input system was already deterministic with 295 transitions.
[2025-05-30 11:59:38] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:59:38] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:59:38] [INFO ] Time to serialize gal into /tmp/CTLFireability13949233337701310967.gal : 1 ms
[2025-05-30 11:59:38] [INFO ] Time to serialize properties into /tmp/CTLFireability1401680280843745057.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/CTLFireability13949233337701310967.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1401680280843745057.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,1.3383e+07,0.343858,16028,2,3128,5,40601,6,0,1123,47244,0


Converting to forward existential form...Done !
original formula: (E((p344==1) U (EF((p233==1)) * AF((((p302==1)&&(p449==1))&&(p465==1))))) + (EF((((AX((p453==0)) + (p302!=1)) + ((p357!=1)||(p457!=1))) +...297
=> equivalent forward existential formula: ([((FwdU(Init,(p344==1)) * E(TRUE U (p233==1))) * !(EG(!((((p302==1)&&(p449==1))&&(p465==1))))))] != FALSE + [((...874
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t12, t19, t28, t33, t34, t36, t37, t41, t42, t50, t59, t60, t66, ...390
Detected timeout of ITS tools.
[2025-05-30 12:00:08] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:00:08] [INFO ] Applying decomposition
[2025-05-30 12:00:08] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9313136346965865670.txt' '-o' '/tmp/graph9313136346965865670.bin' '-w' '/tmp/graph9313136346965865670.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9313136346965865670.bin' '-l' '-1' '-v' '-w' '/tmp/graph9313136346965865670.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:00:09] [INFO ] Decomposing Gal with order
[2025-05-30 12:00:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:00:09] [INFO ] Removed a total of 196 redundant transitions.
[2025-05-30 12:00:09] [INFO ] Flatten gal took : 65 ms
[2025-05-30 12:00:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 11 ms.
[2025-05-30 12:00:09] [INFO ] Time to serialize gal into /tmp/CTLFireability17117908604135619651.gal : 5 ms
[2025-05-30 12:00:09] [INFO ] Time to serialize properties into /tmp/CTLFireability15428114475033464760.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/CTLFireability17117908604135619651.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15428114475033464760.ctl'

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 -...264
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,1.3383e+07,0.155871,10012,386,186,10052,1878,671,23172,149,8529,0


Converting to forward existential form...Done !
original formula: (E((i9.u47.p344==1) U (EF((i7.i0.u30.p233==1)) * AF((((i8.i1.u45.p302==1)&&(i12.u59.p449==1))&&(i8.i1.u63.p465==1))))) + (EF((((AX((i12.u...470
=> equivalent forward existential formula: ([((FwdU(Init,(i9.u47.p344==1)) * E(TRUE U (i7.i0.u30.p233==1))) * !(EG(!((((i8.i1.u45.p302==1)&&(i12.u59.p449==...1317
Reverse transition relation is NOT exact ! Due to transitions t12, t81, t209, t245, t272, i0.t206, i2.i0.u13.t183, i4.i1.u21.t190, i5.t140, i5.i0.u24.t150,...602
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 251/251 places, 351/351 transitions.
Graph (trivial) has 256 edges and 251 vertex of which 2 / 251 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 576 edges and 250 vertex of which 246 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 93 rules applied. Total rules applied 95 place count 245 transition count 251
Reduce places removed 93 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 97 rules applied. Total rules applied 192 place count 152 transition count 247
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 195 place count 150 transition count 246
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 195 place count 150 transition count 231
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 225 place count 135 transition count 231
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 238 place count 122 transition count 212
Iterating global reduction 3 with 13 rules applied. Total rules applied 251 place count 122 transition count 212
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 253 place count 122 transition count 210
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 253 place count 122 transition count 208
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 257 place count 120 transition count 208
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 260 place count 117 transition count 203
Iterating global reduction 4 with 3 rules applied. Total rules applied 263 place count 117 transition count 203
Performed 18 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 299 place count 99 transition count 183
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 6 rules applied. Total rules applied 305 place count 99 transition count 177
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 5 with 3 rules applied. Total rules applied 308 place count 98 transition count 175
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 310 place count 97 transition count 174
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 312 place count 95 transition count 170
Iterating global reduction 7 with 2 rules applied. Total rules applied 314 place count 95 transition count 170
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 318 place count 93 transition count 168
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 321 place count 93 transition count 165
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 8 with 3 rules applied. Total rules applied 324 place count 92 transition count 163
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 326 place count 91 transition count 162
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 10 with 2 rules applied. Total rules applied 328 place count 90 transition count 161
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 334 place count 90 transition count 155
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 10 with 1 rules applied. Total rules applied 335 place count 90 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 336 place count 89 transition count 154
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 12 with 2 rules applied. Total rules applied 338 place count 88 transition count 153
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 340 place count 86 transition count 151
Applied a total of 340 rules in 45 ms. Remains 86 /251 variables (removed 165) and now considering 151/351 (removed 200) transitions.
[2025-05-30 12:00:39] [INFO ] Flow matrix only has 131 transitions (discarded 20 similar events)
// Phase 1: matrix 131 rows 86 cols
[2025-05-30 12:00:39] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:00:39] [INFO ] Implicit Places using invariants in 60 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 85/251 places, 151/351 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 111 ms. Remains : 85/251 places, 151/351 transitions.
[2025-05-30 12:00:39] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:00:39] [INFO ] Flatten gal took : 3 ms
[2025-05-30 12:00:39] [INFO ] Input system was already deterministic with 151 transitions.
[2025-05-30 12:00:39] [INFO ] Flatten gal took : 3 ms
[2025-05-30 12:00:39] [INFO ] Flatten gal took : 3 ms
[2025-05-30 12:00:39] [INFO ] Time to serialize gal into /tmp/CTLFireability4144063554784924972.gal : 1 ms
[2025-05-30 12:00:39] [INFO ] Time to serialize properties into /tmp/CTLFireability16533903727633548435.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/CTLFireability4144063554784924972.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16533903727633548435.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,167833,0.032838,5064,2,631,5,3958,6,0,484,3221,0


Converting to forward existential form...Done !
original formula: EG((p459==0))
=> equivalent forward existential formula: [FwdG(Init,(p459==0))] != FALSE
Hit Full ! (commute/partial/dont) 148/0/3
(forward)formula 0,1,0.145925,10568,1,0,8,38186,19,4,2495,14464,8
FORMULA CO4-PT-09-CTLFireability-2025-07 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 : 251/251 places, 351/351 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 224 transition count 317
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 224 transition count 317
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 224 transition count 316
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 67 place count 212 transition count 300
Iterating global reduction 1 with 12 rules applied. Total rules applied 79 place count 212 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 80 place count 212 transition count 299
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 85 place count 207 transition count 294
Iterating global reduction 2 with 5 rules applied. Total rules applied 90 place count 207 transition count 294
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 92 place count 207 transition count 292
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 94 place count 205 transition count 290
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 205 transition count 290
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 98 place count 205 transition count 288
Applied a total of 98 rules in 12 ms. Remains 205 /251 variables (removed 46) and now considering 288/351 (removed 63) transitions.
// Phase 1: matrix 288 rows 205 cols
[2025-05-30 12:00:39] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:00:39] [INFO ] Implicit Places using invariants in 115 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 116 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 204/251 places, 288/351 transitions.
Applied a total of 0 rules in 2 ms. Remains 204 /204 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131 ms. Remains : 204/251 places, 288/351 transitions.
[2025-05-30 12:00:39] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:00:39] [INFO ] Flatten gal took : 22 ms
[2025-05-30 12:00:39] [INFO ] Input system was already deterministic with 288 transitions.
[2025-05-30 12:00:39] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:00:39] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:00:39] [INFO ] Time to serialize gal into /tmp/CTLFireability5783406945602876717.gal : 1 ms
[2025-05-30 12:00:39] [INFO ] Time to serialize properties into /tmp/CTLFireability7241539984505680288.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/CTLFireability5783406945602876717.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7241539984505680288.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,1.18593e+07,0.231256,14156,2,2806,5,33701,6,0,1100,40468,0


Converting to forward existential form...Done !
original formula: EG((AF(AX((((p302==0)||(p428==0))||(p457==0)))) + (EX((p420==1)) * (p163==1))))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(!(EX(!((((p302==0)||(p428==0))||(p457==0)))))))) + (EX((p420==1)) * (p163==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t12, t19, t28, t33, t34, t36, t37, t41, t42, t50, t59, t64, t65, ...387
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,20.4711,631820,1,0,891,2.91606e+06,607,538,7418,4.07474e+06,993
FORMULA CO4-PT-09-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 351/351 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 223 transition count 316
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 223 transition count 316
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 223 transition count 315
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 69 place count 211 transition count 299
Iterating global reduction 1 with 12 rules applied. Total rules applied 81 place count 211 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 82 place count 211 transition count 298
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 87 place count 206 transition count 293
Iterating global reduction 2 with 5 rules applied. Total rules applied 92 place count 206 transition count 293
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 94 place count 206 transition count 291
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 96 place count 204 transition count 289
Iterating global reduction 3 with 2 rules applied. Total rules applied 98 place count 204 transition count 289
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 100 place count 204 transition count 287
Applied a total of 100 rules in 11 ms. Remains 204 /251 variables (removed 47) and now considering 287/351 (removed 64) transitions.
// Phase 1: matrix 287 rows 204 cols
[2025-05-30 12:01:00] [INFO ] Computed 6 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:01:00] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-05-30 12:01:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:01:00] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2025-05-30 12:01:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:03] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:03] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:03] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:04] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:04] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:05] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (OVERLAPS) 287/491 variables, 204/216 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 0/491 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 491/491 variables, and 216 constraints, problems are : Problem set: 0 solved, 286 unsolved in 19261 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 287/491 variables, 204/216 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 286/502 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:25] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/491 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 491/491 variables, and 503 constraints, problems are : Problem set: 0 solved, 286 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49369ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 49384ms
Starting structural reductions in LTL mode, iteration 1 : 204/251 places, 287/351 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49588 ms. Remains : 204/251 places, 287/351 transitions.
[2025-05-30 12:01:50] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:01:50] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:01:50] [INFO ] Input system was already deterministic with 287 transitions.
[2025-05-30 12:01:50] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:01:50] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:01:50] [INFO ] Time to serialize gal into /tmp/CTLFireability15168629531741936709.gal : 2 ms
[2025-05-30 12:01:50] [INFO ] Time to serialize properties into /tmp/CTLFireability5533940728687659948.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/CTLFireability15168629531741936709.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5533940728687659948.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,1.17645e+07,0.25138,14664,2,3010,5,33541,6,0,1099,43241,0


Converting to forward existential form...Done !
original formula: EF(AG((AX(FALSE) * AX(((((p5==1)&&(p290==1))&&((p299==1)&&(p302==1)))&&(((p380==1)&&(p451==1))&&(p456==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(EX(!(FALSE))) * !(EX(!(((((p5==1)&&(p290==1))&&((p299==1)&&(p302==1)))&&(((p...205
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t12, t19, t28, t33, t34, t36, t37, t41, t42, t50, t59, t64, t65, ...381
(forward)formula 0,1,4.08274,117264,1,0,424,497817,596,249,7281,478089,591
FORMULA CO4-PT-09-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 351/351 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 223 transition count 316
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 223 transition count 316
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 223 transition count 315
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 69 place count 211 transition count 299
Iterating global reduction 1 with 12 rules applied. Total rules applied 81 place count 211 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 82 place count 211 transition count 298
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 87 place count 206 transition count 293
Iterating global reduction 2 with 5 rules applied. Total rules applied 92 place count 206 transition count 293
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 94 place count 206 transition count 291
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 96 place count 204 transition count 289
Iterating global reduction 3 with 2 rules applied. Total rules applied 98 place count 204 transition count 289
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 100 place count 204 transition count 287
Applied a total of 100 rules in 11 ms. Remains 204 /251 variables (removed 47) and now considering 287/351 (removed 64) transitions.
[2025-05-30 12:01:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:01:54] [INFO ] Implicit Places using invariants in 70 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 203/251 places, 287/351 transitions.
Applied a total of 0 rules in 2 ms. Remains 203 /203 variables (removed 0) and now considering 287/287 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 84 ms. Remains : 203/251 places, 287/351 transitions.
[2025-05-30 12:01:54] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:01:54] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:01:54] [INFO ] Input system was already deterministic with 287 transitions.
[2025-05-30 12:01:54] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:01:54] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:01:54] [INFO ] Time to serialize gal into /tmp/CTLFireability3204855354502373995.gal : 1 ms
[2025-05-30 12:01:54] [INFO ] Time to serialize properties into /tmp/CTLFireability18357408756455840529.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/CTLFireability3204855354502373995.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18357408756455840529.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,1.17645e+07,0.185932,11744,2,2636,5,26899,6,0,1095,31517,0


Converting to forward existential form...Done !
original formula: EF((AG((p174==0)) + E(AX(FALSE) U ((p228==1)||(p152==1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !((p174==0)))))] != FALSE + [(FwdU(FwdU(Init,TRUE),!(EX(!(FALSE)))) * ((p228==1)...179
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t12, t19, t28, t33, t34, t36, t37, t41, t42, t50, t59, t64, t65, ...381
(forward)formula 0,1,6.21631,180944,1,0,441,942429,596,256,6966,803530,617
FORMULA CO4-PT-09-CTLFireability-2024-13 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 : 251/251 places, 351/351 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 224 transition count 317
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 224 transition count 317
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 224 transition count 316
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 67 place count 212 transition count 300
Iterating global reduction 1 with 12 rules applied. Total rules applied 79 place count 212 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 80 place count 212 transition count 299
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 85 place count 207 transition count 294
Iterating global reduction 2 with 5 rules applied. Total rules applied 90 place count 207 transition count 294
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 92 place count 207 transition count 292
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 94 place count 205 transition count 290
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 205 transition count 290
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 98 place count 205 transition count 288
Applied a total of 98 rules in 11 ms. Remains 205 /251 variables (removed 46) and now considering 288/351 (removed 63) transitions.
// Phase 1: matrix 288 rows 205 cols
[2025-05-30 12:02:00] [INFO ] Computed 6 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:02:00] [INFO ] Implicit Places using invariants in 60 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 204/251 places, 288/351 transitions.
Applied a total of 0 rules in 2 ms. Remains 204 /204 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 204/251 places, 288/351 transitions.
[2025-05-30 12:02:00] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:02:00] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:02:00] [INFO ] Input system was already deterministic with 288 transitions.
[2025-05-30 12:02:00] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:02:00] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:02:00] [INFO ] Time to serialize gal into /tmp/CTLFireability5516444394167273928.gal : 2 ms
[2025-05-30 12:02:00] [INFO ] Time to serialize properties into /tmp/CTLFireability14836028128788564111.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/CTLFireability5516444394167273928.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14836028128788564111.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,1.22104e+07,0.200272,11728,2,2635,5,26656,6,0,1100,31681,0


Converting to forward existential form...Done !
original formula: EX(((AF(EX(TRUE)) + (p431==1)) + (p339==1)))
=> equivalent forward existential formula: (([(EY(Init) * !(EG(!(EX(TRUE)))))] != FALSE + [(EY(Init) * (p431==1))] != FALSE) + [(EY(Init) * (p339==1))] != ...161
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t12, t19, t28, t33, t34, t36, t37, t41, t42, t50, t59, t65, t66, ...381
Using saturation style SCC detection
(forward)formula 0,1,2.85732,99500,1,0,448,387833,599,247,7311,447237,620
FORMULA CO4-PT-09-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 251/251 places, 351/351 transitions.
Graph (trivial) has 250 edges and 251 vertex of which 2 / 251 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 576 edges and 250 vertex of which 246 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 92 place count 245 transition count 254
Reduce places removed 90 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 94 rules applied. Total rules applied 186 place count 155 transition count 250
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 190 place count 153 transition count 248
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 191 place count 152 transition count 248
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 191 place count 152 transition count 233
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 221 place count 137 transition count 233
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 235 place count 123 transition count 212
Iterating global reduction 4 with 14 rules applied. Total rules applied 249 place count 123 transition count 212
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 251 place count 123 transition count 210
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 251 place count 123 transition count 209
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 253 place count 122 transition count 209
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 255 place count 120 transition count 205
Iterating global reduction 5 with 2 rules applied. Total rules applied 257 place count 120 transition count 205
Performed 18 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 293 place count 102 transition count 185
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
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 5 with 6 rules applied. Total rules applied 299 place count 102 transition count 179
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 3 rules applied. Total rules applied 302 place count 101 transition count 177
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 304 place count 100 transition count 176
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 306 place count 98 transition count 172
Iterating global reduction 8 with 2 rules applied. Total rules applied 308 place count 98 transition count 172
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 312 place count 96 transition count 170
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
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 8 with 3 rules applied. Total rules applied 315 place count 96 transition count 167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 316 place count 95 transition count 167
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 322 place count 95 transition count 161
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 10 with 1 rules applied. Total rules applied 323 place count 95 transition count 160
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 324 place count 94 transition count 160
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 324 place count 94 transition count 159
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 326 place count 93 transition count 159
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 328 place count 92 transition count 158
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 12 with 4 rules applied. Total rules applied 332 place count 92 transition count 158
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 334 place count 90 transition count 156
Applied a total of 334 rules in 37 ms. Remains 90 /251 variables (removed 161) and now considering 156/351 (removed 195) transitions.
// Phase 1: matrix 156 rows 90 cols
[2025-05-30 12:02:03] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:02:03] [INFO ] Implicit Places using invariants in 45 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 89/251 places, 156/351 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 86 ms. Remains : 89/251 places, 156/351 transitions.
[2025-05-30 12:02:03] [INFO ] Flatten gal took : 3 ms
[2025-05-30 12:02:03] [INFO ] Flatten gal took : 3 ms
[2025-05-30 12:02:03] [INFO ] Input system was already deterministic with 156 transitions.
[2025-05-30 12:02:03] [INFO ] Flatten gal took : 2 ms
[2025-05-30 12:02:03] [INFO ] Flatten gal took : 3 ms
[2025-05-30 12:02:03] [INFO ] Time to serialize gal into /tmp/CTLFireability14084580202355472618.gal : 1 ms
[2025-05-30 12:02:03] [INFO ] Time to serialize properties into /tmp/CTLFireability5306569301181091846.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/CTLFireability14084580202355472618.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5306569301181091846.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,211201,0.050843,5988,2,787,5,7552,6,0,504,5683,0


Converting to forward existential form...Done !
original formula: E(A(AF((((p300==1)&&(p311==1))&&(p448==1))) U (((p300==1)&&(p307==1))&&(p356==1))) U !(((p270!=1)||(p409==1))))
=> equivalent forward existential formula: [(FwdU(Init,!((E(!((((p300==1)&&(p307==1))&&(p356==1))) U (!(!(EG(!((((p300==1)&&(p311==1))&&(p448==1)))))) * !(...280
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t9, t15, t36, t46, t51, t64, t114, t115, t119, t121, Intersection with reachable...227
(forward)formula 0,0,1.94466,82052,1,0,594,445161,346,287,3520,474439,750
FORMULA CO4-PT-09-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2025-05-30 12:02:05] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:02:05] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:02:05] [INFO ] Applying decomposition
[2025-05-30 12:02:05] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16672022723223203365.txt' '-o' '/tmp/graph16672022723223203365.bin' '-w' '/tmp/graph16672022723223203365.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16672022723223203365.bin' '-l' '-1' '-v' '-w' '/tmp/graph16672022723223203365.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:02:05] [INFO ] Decomposing Gal with order
[2025-05-30 12:02:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:02:05] [INFO ] Removed a total of 248 redundant transitions.
[2025-05-30 12:02:05] [INFO ] Flatten gal took : 33 ms
[2025-05-30 12:02:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 5 ms.
[2025-05-30 12:02:06] [INFO ] Time to serialize gal into /tmp/CTLFireability16959555156893334730.gal : 19 ms
[2025-05-30 12:02:06] [INFO ] Time to serialize properties into /tmp/CTLFireability11212997733411603449.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/CTLFireability16959555156893334730.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11212997733411603449.ctl'

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 -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.739e+07,0.624501,26888,1573,471,34827,4814,714,121780,148,32262,0


Converting to forward existential form...Done !
original formula: (E((i9.u67.p344==1) U (EF((i6.i0.i0.u39.p233==1)) * AF((((i11.u61.p302==1)&&(i11.u87.p449==1))&&(i0.u91.p465==1))))) + (EF((((AX((i11.u89...455
=> equivalent forward existential formula: ([((FwdU(Init,(i9.u67.p344==1)) * E(TRUE U (i6.i0.i0.u39.p233==1))) * !(EG(!((((i11.u61.p302==1)&&(i11.u87.p449=...1298
Reverse transition relation is NOT exact ! Due to transitions t14, t58, t126, t199, t215, t232, t282, t285, t315, t321, t347, t350, i0.t4, i0.u90.t8, i0.u9...747
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,0,202.111,2463676,1,0,3.21505e+06,11558,2551,1.80465e+07,406,143556,2386007
FORMULA CO4-PT-09-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 446152 ms.

BK_STOP 1748606728778

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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-09"
export BK_EXAMINATION="CTLFireability"
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-09, examination is CTLFireability"
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-174854028500442"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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