Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r550-tall-171734898400042.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is CO4-PT-06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898400042
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 97K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CO4-PT-06-CTLFireability-2024-00
FORMULA_NAME CO4-PT-06-CTLFireability-2024-01
FORMULA_NAME CO4-PT-06-CTLFireability-2024-02
FORMULA_NAME CO4-PT-06-CTLFireability-2024-03
FORMULA_NAME CO4-PT-06-CTLFireability-2024-04
FORMULA_NAME CO4-PT-06-CTLFireability-2024-05
FORMULA_NAME CO4-PT-06-CTLFireability-2024-06
FORMULA_NAME CO4-PT-06-CTLFireability-2024-07
FORMULA_NAME CO4-PT-06-CTLFireability-2024-08
FORMULA_NAME CO4-PT-06-CTLFireability-2024-09
FORMULA_NAME CO4-PT-06-CTLFireability-2024-10
FORMULA_NAME CO4-PT-06-CTLFireability-2024-11
FORMULA_NAME CO4-PT-06-CTLFireability-2024-12
FORMULA_NAME CO4-PT-06-CTLFireability-2024-13
FORMULA_NAME CO4-PT-06-CTLFireability-2024-14
FORMULA_NAME CO4-PT-06-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717351355220

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-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 18:02:36] [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]
[2024-06-02 18:02:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:02:36] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-06-02 18:02:36] [INFO ] Transformed 383 places.
[2024-06-02 18:02:36] [INFO ] Transformed 454 transitions.
[2024-06-02 18:02:36] [INFO ] Found NUPN structural information;
[2024-06-02 18:02:36] [INFO ] Parsed PT model containing 383 places and 454 transitions and 1016 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Deduced a syphon composed of 100 places in 4 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-06-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-CTLFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 334/334 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 273 transition count 333
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 64 place count 220 transition count 278
Iterating global reduction 1 with 53 rules applied. Total rules applied 117 place count 220 transition count 278
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 121 place count 220 transition count 274
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 141 place count 200 transition count 254
Iterating global reduction 2 with 20 rules applied. Total rules applied 161 place count 200 transition count 254
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 162 place count 200 transition count 253
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 164 place count 198 transition count 250
Iterating global reduction 3 with 2 rules applied. Total rules applied 166 place count 198 transition count 250
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 167 place count 197 transition count 249
Iterating global reduction 3 with 1 rules applied. Total rules applied 168 place count 197 transition count 249
Applied a total of 168 rules in 68 ms. Remains 197 /283 variables (removed 86) and now considering 249/334 (removed 85) transitions.
// Phase 1: matrix 249 rows 197 cols
[2024-06-02 18:02:36] [INFO ] Computed 4 invariants in 12 ms
[2024-06-02 18:02:36] [INFO ] Implicit Places using invariants in 229 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 256 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 196/283 places, 249/334 transitions.
Applied a total of 0 rules in 3 ms. Remains 196 /196 variables (removed 0) and now considering 249/249 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 343 ms. Remains : 196/283 places, 249/334 transitions.
Support contains 46 out of 196 places after structural reductions.
[2024-06-02 18:02:37] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 18:02:37] [INFO ] Flatten gal took : 42 ms
FORMULA CO4-PT-06-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:02:37] [INFO ] Flatten gal took : 27 ms
[2024-06-02 18:02:37] [INFO ] Input system was already deterministic with 249 transitions.
Support contains 42 out of 196 places (down from 46) after GAL structural reductions.
RANDOM walk for 40000 steps (41 resets) in 1524 ms. (26 steps per ms) remains 30/38 properties
BEST_FIRST walk for 4002 steps (31 resets) in 85 ms. (46 steps per ms) remains 27/30 properties
BEST_FIRST walk for 4001 steps (32 resets) in 79 ms. (50 steps per ms) remains 24/27 properties
BEST_FIRST walk for 4001 steps (35 resets) in 73 ms. (54 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (34 resets) in 49 ms. (80 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (38 resets) in 55 ms. (71 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (29 resets) in 27 ms. (143 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4003 steps (28 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (22 resets) in 24 ms. (160 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4002 steps (41 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (30 resets) in 35 ms. (111 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4001 steps (35 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (25 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (26 resets) in 17 ms. (222 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4001 steps (23 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (32 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (32 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (30 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (25 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (27 resets) in 28 ms. (137 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4000 steps (26 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (34 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (26 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (21 resets) in 14 ms. (266 steps per ms) remains 18/19 properties
// Phase 1: matrix 249 rows 196 cols
[2024-06-02 18:02:38] [INFO ] Computed 3 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 9/40 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 103/143 variables, 40/43 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 183/326 variables, 86/129 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 93/419 variables, 53/182 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 21/440 variables, 14/196 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/440 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 13 (OVERLAPS) 5/445 variables, 3/199 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/445 variables, 0/199 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 0/445 variables, 0/199 constraints. Problems are: Problem set: 1 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 199 constraints, problems are : Problem set: 1 solved, 17 unsolved in 906 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 10/29 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 9/38 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 94/132 variables, 38/41 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 2/43 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 180/312 variables, 80/123 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 15/138 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/138 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 100/412 variables, 57/195 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 0/195 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 26/438 variables, 17/212 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/438 variables, 0/212 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 7/445 variables, 4/216 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/445 variables, 0/216 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 0/445 variables, 0/216 constraints. Problems are: Problem set: 1 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 445/445 variables, and 216 constraints, problems are : Problem set: 1 solved, 17 unsolved in 1228 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 17/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 2190ms problems are : Problem set: 1 solved, 17 unsolved
Finished Parikh walk after 196 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=196 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 17 properties in 899 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2024-06-02 18:02:41] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:02:41] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:02:41] [INFO ] Input system was already deterministic with 249 transitions.
Computed a total of 16 stabilizing places and 18 stable transitions
Graph (complete) has 320 edges and 196 vertex of which 193 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 249/249 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 181 transition count 232
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 181 transition count 232
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 172 transition count 223
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 172 transition count 223
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 170 transition count 221
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 170 transition count 221
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 170 transition count 219
Applied a total of 54 rules in 13 ms. Remains 170 /196 variables (removed 26) and now considering 219/249 (removed 30) transitions.
// Phase 1: matrix 219 rows 170 cols
[2024-06-02 18:02:41] [INFO ] Computed 3 invariants in 3 ms
[2024-06-02 18:02:41] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 18:02:41] [INFO ] Invariant cache hit.
[2024-06-02 18:02:41] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-06-02 18:02:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 219/389 variables, 170/173 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-02 18:02:44] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 16 ms to minimize.
[2024-06-02 18:02:44] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/389 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 175 constraints, problems are : Problem set: 0 solved, 218 unsolved in 7581 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/389 variables, 170/175 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 218/393 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 0/389 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 393 constraints, problems are : Problem set: 0 solved, 218 unsolved in 7522 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints]
After SMT, in 15161ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 15165ms
Starting structural reductions in LTL mode, iteration 1 : 170/196 places, 219/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15332 ms. Remains : 170/196 places, 219/249 transitions.
[2024-06-02 18:02:56] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:02:56] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:02:56] [INFO ] Input system was already deterministic with 219 transitions.
[2024-06-02 18:02:56] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:02:56] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:02:56] [INFO ] Time to serialize gal into /tmp/CTLFireability14899691530787496524.gal : 4 ms
[2024-06-02 18:02:56] [INFO ] Time to serialize properties into /tmp/CTLFireability14221194645506541832.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14899691530787496524.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14221194645506541832.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,184635,0.101946,7152,2,783,5,13129,6,0,897,15671,0


Converting to forward existential form...Done !
original formula: AF((EX((p258==1)) * EX(((p207==1) * EF((p196==0))))))
=> equivalent forward existential formula: [FwdG(Init,!((EX((p258==1)) * EX(((p207==1) * E(TRUE U (p196==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t16, t25, t30, t31, t33, t34, t38, t39, t42, t152, t175, t202, Intersect...245
(forward)formula 0,0,0.828318,33188,1,0,298,129820,465,185,5556,120126,480
FORMULA CO4-PT-06-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 249/249 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 185 transition count 237
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 185 transition count 237
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 179 transition count 231
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 179 transition count 231
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 177 transition count 229
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 177 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 177 transition count 228
Applied a total of 39 rules in 10 ms. Remains 177 /196 variables (removed 19) and now considering 228/249 (removed 21) transitions.
// Phase 1: matrix 228 rows 177 cols
[2024-06-02 18:02:57] [INFO ] Computed 3 invariants in 2 ms
[2024-06-02 18:02:57] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 18:02:57] [INFO ] Invariant cache hit.
[2024-06-02 18:02:57] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 227 sub problems to find dead transitions.
[2024-06-02 18:02:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (OVERLAPS) 228/405 variables, 177/180 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-02 18:03:00] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:03:00] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:03:00] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 3/183 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (OVERLAPS) 0/405 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/405 variables, and 183 constraints, problems are : Problem set: 0 solved, 227 unsolved in 7736 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (OVERLAPS) 228/405 variables, 177/183 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 227/410 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (OVERLAPS) 0/405 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/405 variables, and 410 constraints, problems are : Problem set: 0 solved, 227 unsolved in 8385 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 3/3 constraints]
After SMT, in 16174ms problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 16177ms
Starting structural reductions in LTL mode, iteration 1 : 177/196 places, 228/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16333 ms. Remains : 177/196 places, 228/249 transitions.
[2024-06-02 18:03:13] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:03:13] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:03:13] [INFO ] Input system was already deterministic with 228 transitions.
[2024-06-02 18:03:13] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:03:13] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:03:13] [INFO ] Time to serialize gal into /tmp/CTLFireability8367897074696926469.gal : 2 ms
[2024-06-02 18:03:13] [INFO ] Time to serialize properties into /tmp/CTLFireability6183589976550460904.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8367897074696926469.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6183589976550460904.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,256450,0.103598,7512,2,1367,5,13138,6,0,934,17822,0


Converting to forward existential form...Done !
original formula: E((AF(AG(EX((p265==1)))) * (!(AF((p358==1))) + ((p138==1)&&(p370==1)))) U (EG(((((p190!=1)&&(p294==1)) + (((p305==1)||(p289==1)) * AG((p2...245
=> equivalent forward existential formula: ([FwdG(FwdU(Init,(!(EG(!(!(E(TRUE U !(EX((p265==1)))))))) * (!(!(EG(!((p358==1))))) + ((p138==1)&&(p370==1))))),...508
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t10, t16, t17, t26, t31, t32, t34, t35, t39, t40, t44, t45, t49, t51,...388
(forward)formula 0,0,17.4733,536152,1,0,1366,3.81729e+06,516,676,5553,3.38974e+06,1665
FORMULA CO4-PT-06-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 249/249 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 181 transition count 232
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 181 transition count 232
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 172 transition count 223
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 172 transition count 223
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 169 transition count 220
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 169 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 169 transition count 218
Applied a total of 56 rules in 14 ms. Remains 169 /196 variables (removed 27) and now considering 218/249 (removed 31) transitions.
// Phase 1: matrix 218 rows 169 cols
[2024-06-02 18:03:31] [INFO ] Computed 3 invariants in 2 ms
[2024-06-02 18:03:31] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-02 18:03:31] [INFO ] Invariant cache hit.
[2024-06-02 18:03:31] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 18:03:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 218/387 variables, 169/172 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 18:03:34] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:03:34] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/387 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/387 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 174 constraints, problems are : Problem set: 0 solved, 217 unsolved in 7147 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/387 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 217/391 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/387 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 391 constraints, problems are : Problem set: 0 solved, 217 unsolved in 7920 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 2/2 constraints]
After SMT, in 15099ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 15102ms
Starting structural reductions in LTL mode, iteration 1 : 169/196 places, 218/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15249 ms. Remains : 169/196 places, 218/249 transitions.
[2024-06-02 18:03:46] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:03:46] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:03:46] [INFO ] Input system was already deterministic with 218 transitions.
[2024-06-02 18:03:46] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:03:46] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:03:46] [INFO ] Time to serialize gal into /tmp/CTLFireability3076477480946465942.gal : 2 ms
[2024-06-02 18:03:46] [INFO ] Time to serialize properties into /tmp/CTLFireability6016012787883141901.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3076477480946465942.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6016012787883141901.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,183183,0.093119,7224,2,778,5,13241,6,0,892,16030,0


Converting to forward existential form...Done !
original formula: EG(EX(EG((p84==1))))
=> equivalent forward existential formula: [FwdG(Init,EX(EG((p84==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t16, t25, t30, t31, t33, t34, t38, t39, t42, t151, t175, t202, Intersect...245
(forward)formula 0,0,0.808576,35848,1,0,431,159845,462,237,4984,157457,645
FORMULA CO4-PT-06-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 196/196 places, 249/249 transitions.
Graph (trivial) has 197 edges and 196 vertex of which 2 / 196 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 319 edges and 195 vertex of which 192 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 191 transition count 176
Reduce places removed 68 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 72 rules applied. Total rules applied 142 place count 123 transition count 172
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 146 place count 119 transition count 172
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 146 place count 119 transition count 155
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 180 place count 102 transition count 155
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 189 place count 93 transition count 144
Iterating global reduction 3 with 9 rules applied. Total rules applied 198 place count 93 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 200 place count 93 transition count 142
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 200 place count 93 transition count 141
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 202 place count 92 transition count 141
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 204 place count 90 transition count 139
Iterating global reduction 4 with 2 rules applied. Total rules applied 206 place count 90 transition count 139
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 224 place count 81 transition count 130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 226 place count 81 transition count 128
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 228 place count 79 transition count 126
Iterating global reduction 5 with 2 rules applied. Total rules applied 230 place count 79 transition count 126
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 232 place count 78 transition count 125
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 5 with 3 rules applied. Total rules applied 235 place count 78 transition count 122
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 238 place count 77 transition count 120
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 240 place count 76 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 242 place count 75 transition count 118
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 246 place count 75 transition count 114
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 1 rules applied. Total rules applied 247 place count 75 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 248 place count 74 transition count 113
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 250 place count 73 transition count 112
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 252 place count 71 transition count 110
Applied a total of 252 rules in 69 ms. Remains 71 /196 variables (removed 125) and now considering 110/249 (removed 139) transitions.
// Phase 1: matrix 110 rows 71 cols
[2024-06-02 18:03:47] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:03:47] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-02 18:03:47] [INFO ] Invariant cache hit.
[2024-06-02 18:03:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:03:47] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-06-02 18:03:47] [INFO ] Redundant transitions in 2 ms returned []
Running 104 sub problems to find dead transitions.
[2024-06-02 18:03:47] [INFO ] Invariant cache hit.
[2024-06-02 18:03:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 109/179 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 1/180 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 1/181 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 0/181 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 75 constraints, problems are : Problem set: 0 solved, 104 unsolved in 1747 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 109/179 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 43/116 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 1/180 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 61/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 1/181 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (OVERLAPS) 0/181 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 179 constraints, problems are : Problem set: 0 solved, 104 unsolved in 2159 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
After SMT, in 3928ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 3929ms
Starting structural reductions in SI_CTL mode, iteration 1 : 71/196 places, 110/249 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4092 ms. Remains : 71/196 places, 110/249 transitions.
[2024-06-02 18:03:51] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:03:51] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:03:51] [INFO ] Input system was already deterministic with 110 transitions.
[2024-06-02 18:03:51] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:03:51] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:03:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3777253528671093190.gal : 1 ms
[2024-06-02 18:03:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13544439307559330640.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3777253528671093190.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13544439307559330640.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 20832 steps (2524 resets) in 105 ms. (196 steps per ms) remains 0/1 properties
FORMULA CO4-PT-06-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
Loading property file /tmp/ReachabilityCardinality13544439307559330640.prop.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 249/249 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 180 transition count 231
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 180 transition count 231
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 42 place count 170 transition count 221
Iterating global reduction 0 with 10 rules applied. Total rules applied 52 place count 170 transition count 221
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 167 transition count 218
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 167 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 167 transition count 216
Applied a total of 60 rules in 15 ms. Remains 167 /196 variables (removed 29) and now considering 216/249 (removed 33) transitions.
// Phase 1: matrix 216 rows 167 cols
[2024-06-02 18:03:51] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:03:51] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-02 18:03:51] [INFO ] Invariant cache hit.
[2024-06-02 18:03:51] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-06-02 18:03:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 216/383 variables, 167/170 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-02 18:03:54] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:03:54] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 0/383 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 172 constraints, problems are : Problem set: 0 solved, 215 unsolved in 6910 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/383 variables, 167/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 215/387 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 0/383 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 387 constraints, problems are : Problem set: 0 solved, 215 unsolved in 7302 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 2/2 constraints]
After SMT, in 14239ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 14241ms
Starting structural reductions in LTL mode, iteration 1 : 167/196 places, 216/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14372 ms. Remains : 167/196 places, 216/249 transitions.
[2024-06-02 18:04:06] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:04:06] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:04:06] [INFO ] Input system was already deterministic with 216 transitions.
[2024-06-02 18:04:06] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:04:06] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:04:06] [INFO ] Time to serialize gal into /tmp/CTLFireability17394049607353511097.gal : 1 ms
[2024-06-02 18:04:06] [INFO ] Time to serialize properties into /tmp/CTLFireability2023069110904307185.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17394049607353511097.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2023069110904307185.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,180279,0.093606,7176,2,766,5,12829,6,0,882,15697,0


Converting to forward existential form...Done !
original formula: EF(EG(EX(A((p228==1) U ((p293==1)&&(p297==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),EX(!((E(!(((p293==1)&&(p297==1))) U (!((p228==1)) * !(((p293==1)&&(p297==1))))) + EG(!(((p...190
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t16, t25, t30, t31, t33, t34, t38, t39, t42, t151, t174, t201, Intersect...245
(forward)formula 0,0,4.88031,175704,1,0,597,1.16054e+06,463,320,4933,1.04103e+06,823
FORMULA CO4-PT-06-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 196/196 places, 249/249 transitions.
Graph (trivial) has 198 edges and 196 vertex of which 2 / 196 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 319 edges and 195 vertex of which 192 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 191 transition count 175
Reduce places removed 69 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 70 rules applied. Total rules applied 141 place count 122 transition count 174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 142 place count 121 transition count 174
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 121 transition count 158
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 174 place count 105 transition count 158
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 182 place count 97 transition count 148
Iterating global reduction 3 with 8 rules applied. Total rules applied 190 place count 97 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 192 place count 97 transition count 146
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 192 place count 97 transition count 145
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 194 place count 96 transition count 145
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 196 place count 94 transition count 143
Iterating global reduction 4 with 2 rules applied. Total rules applied 198 place count 94 transition count 143
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 220 place count 83 transition count 131
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 4 with 3 rules applied. Total rules applied 223 place count 83 transition count 128
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 226 place count 82 transition count 126
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 228 place count 81 transition count 125
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 230 place count 79 transition count 123
Iterating global reduction 7 with 2 rules applied. Total rules applied 232 place count 79 transition count 123
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 236 place count 79 transition count 119
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 237 place count 79 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 238 place count 78 transition count 118
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 9 with 2 rules applied. Total rules applied 240 place count 77 transition count 117
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 242 place count 75 transition count 115
Applied a total of 242 rules in 30 ms. Remains 75 /196 variables (removed 121) and now considering 115/249 (removed 134) transitions.
// Phase 1: matrix 115 rows 75 cols
[2024-06-02 18:04:11] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:04:11] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-02 18:04:11] [INFO ] Invariant cache hit.
[2024-06-02 18:04:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:04:11] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-06-02 18:04:11] [INFO ] Redundant transitions in 2 ms returned []
Running 105 sub problems to find dead transitions.
[2024-06-02 18:04:11] [INFO ] Invariant cache hit.
[2024-06-02 18:04:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 114/189 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 1/190 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 0/190 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 79 constraints, problems are : Problem set: 0 solved, 105 unsolved in 1708 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 114/189 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 105/183 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 1/190 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/190 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 184 constraints, problems are : Problem set: 0 solved, 105 unsolved in 2083 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
After SMT, in 3809ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 3810ms
Starting structural reductions in SI_CTL mode, iteration 1 : 75/196 places, 115/249 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3928 ms. Remains : 75/196 places, 115/249 transitions.
[2024-06-02 18:04:15] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:04:15] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:04:15] [INFO ] Input system was already deterministic with 115 transitions.
[2024-06-02 18:04:15] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:04:15] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:04:15] [INFO ] Time to serialize gal into /tmp/CTLFireability3562917448596923424.gal : 1 ms
[2024-06-02 18:04:15] [INFO ] Time to serialize properties into /tmp/CTLFireability3000813092214953901.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3562917448596923424.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3000813092214953901.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,11287,0.019725,4264,2,220,5,2387,6,0,408,2175,0


Converting to forward existential form...Done !
original formula: EG((!(A((p116==1) U (p323==1))) + (EF(EG((p192==0))) * EG((p216==0)))))
=> equivalent forward existential formula: [FwdG(Init,(!(!((E(!((p323==1)) U (!((p116==1)) * !((p323==1)))) + EG(!((p323==1)))))) + (E(TRUE U EG((p192==0))...185
Reverse transition relation is NOT exact ! Due to transitions t8, t32, t35, t42, t48, Intersection with reachable at each step enabled. (destroyed/reverse...185
(forward)formula 0,1,0.4772,23540,1,0,484,123114,275,300,2572,118885,722
FORMULA CO4-PT-06-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 249/249 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 180 transition count 231
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 180 transition count 231
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 42 place count 170 transition count 221
Iterating global reduction 0 with 10 rules applied. Total rules applied 52 place count 170 transition count 221
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 167 transition count 218
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 167 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 167 transition count 216
Applied a total of 60 rules in 8 ms. Remains 167 /196 variables (removed 29) and now considering 216/249 (removed 33) transitions.
// Phase 1: matrix 216 rows 167 cols
[2024-06-02 18:04:15] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:04:15] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-02 18:04:15] [INFO ] Invariant cache hit.
[2024-06-02 18:04:15] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-06-02 18:04:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 216/383 variables, 167/170 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-02 18:04:18] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 5 ms to minimize.
[2024-06-02 18:04:18] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 0/383 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 172 constraints, problems are : Problem set: 0 solved, 215 unsolved in 6895 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/383 variables, 167/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 215/387 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 0/383 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 387 constraints, problems are : Problem set: 0 solved, 215 unsolved in 7155 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 2/2 constraints]
After SMT, in 14078ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 14080ms
Starting structural reductions in LTL mode, iteration 1 : 167/196 places, 216/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14211 ms. Remains : 167/196 places, 216/249 transitions.
[2024-06-02 18:04:29] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:04:29] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:04:29] [INFO ] Input system was already deterministic with 216 transitions.
[2024-06-02 18:04:29] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:04:29] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:04:29] [INFO ] Time to serialize gal into /tmp/CTLFireability6283915440730774677.gal : 2 ms
[2024-06-02 18:04:29] [INFO ] Time to serialize properties into /tmp/CTLFireability11420681027482556817.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6283915440730774677.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11420681027482556817.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,180279,0.087846,7180,2,766,5,12829,6,0,882,15697,0


Converting to forward existential form...Done !
original formula: AF(EX(EF((EG((p228==1)) * (p200==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(E(TRUE U (EG((p228==1)) * (p200==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t16, t25, t30, t31, t33, t34, t38, t39, t42, t151, t174, t201, Intersect...245
(forward)formula 0,0,0.84602,38204,1,0,429,167828,460,238,5226,171035,645
FORMULA CO4-PT-06-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 249/249 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 181 transition count 233
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 181 transition count 233
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 172 transition count 224
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 172 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 171 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 171 transition count 223
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 171 transition count 222
Applied a total of 51 rules in 8 ms. Remains 171 /196 variables (removed 25) and now considering 222/249 (removed 27) transitions.
// Phase 1: matrix 222 rows 171 cols
[2024-06-02 18:04:30] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:04:30] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-02 18:04:30] [INFO ] Invariant cache hit.
[2024-06-02 18:04:30] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-06-02 18:04:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 222/393 variables, 171/174 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-02 18:04:33] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:04:33] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 0/393 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 176 constraints, problems are : Problem set: 0 solved, 221 unsolved in 7371 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 222/393 variables, 171/176 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 221/397 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 0/393 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 393/393 variables, and 397 constraints, problems are : Problem set: 0 solved, 221 unsolved in 7077 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 2/2 constraints]
After SMT, in 14483ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 14489ms
Starting structural reductions in LTL mode, iteration 1 : 171/196 places, 222/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14622 ms. Remains : 171/196 places, 222/249 transitions.
[2024-06-02 18:04:45] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:04:45] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:04:45] [INFO ] Input system was already deterministic with 222 transitions.
[2024-06-02 18:04:45] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:04:45] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:04:45] [INFO ] Time to serialize gal into /tmp/CTLFireability559074202221671062.gal : 4 ms
[2024-06-02 18:04:45] [INFO ] Time to serialize properties into /tmp/CTLFireability10155666434810924898.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability559074202221671062.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10155666434810924898.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,202731,0.095172,7224,2,795,5,12584,6,0,904,15214,0


Converting to forward existential form...Done !
original formula: AG(EF(AG((EX(TRUE) + ((p317==0) * E((p224==1) U (p201==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !((EX(TRUE) + ((p317==0) * E((p224==1) U (p201==1))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t16, t25, t30, t31, t33, t34, t38, t39, t43, t44, t47, t156, t179, t206, ...255
(forward)formula 0,0,1.54404,61840,1,0,320,363099,470,204,5169,252194,510
FORMULA CO4-PT-06-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 196/196 places, 249/249 transitions.
Graph (trivial) has 197 edges and 196 vertex of which 2 / 196 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 319 edges and 195 vertex of which 192 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 191 transition count 176
Reduce places removed 68 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 123 transition count 174
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 142 place count 121 transition count 174
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 142 place count 121 transition count 156
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 178 place count 103 transition count 156
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 188 place count 93 transition count 144
Iterating global reduction 3 with 10 rules applied. Total rules applied 198 place count 93 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 200 place count 93 transition count 142
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 200 place count 93 transition count 141
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 202 place count 92 transition count 141
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 203 place count 91 transition count 140
Iterating global reduction 4 with 1 rules applied. Total rules applied 204 place count 91 transition count 140
Performed 10 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 224 place count 81 transition count 128
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 4 with 3 rules applied. Total rules applied 227 place count 81 transition count 125
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 230 place count 80 transition count 123
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 232 place count 79 transition count 122
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 234 place count 77 transition count 120
Iterating global reduction 7 with 2 rules applied. Total rules applied 236 place count 77 transition count 120
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 238 place count 76 transition count 119
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 242 place count 76 transition count 115
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 243 place count 76 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 244 place count 75 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 246 place count 74 transition count 113
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 249 place count 74 transition count 113
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 251 place count 72 transition count 111
Applied a total of 251 rules in 31 ms. Remains 72 /196 variables (removed 124) and now considering 111/249 (removed 138) transitions.
// Phase 1: matrix 111 rows 72 cols
[2024-06-02 18:04:47] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:04:47] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-02 18:04:47] [INFO ] Invariant cache hit.
[2024-06-02 18:04:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:04:47] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-06-02 18:04:47] [INFO ] Redundant transitions in 1 ms returned []
Running 101 sub problems to find dead transitions.
[2024-06-02 18:04:47] [INFO ] Invariant cache hit.
[2024-06-02 18:04:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 110/181 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 1/182 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 1/183 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 0/183 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 76 constraints, problems are : Problem set: 0 solved, 101 unsolved in 1754 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 110/181 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 69/143 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 1/182 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 32/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 1/183 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/183 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 177 constraints, problems are : Problem set: 0 solved, 101 unsolved in 2253 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
After SMT, in 4017ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 4019ms
Starting structural reductions in SI_CTL mode, iteration 1 : 72/196 places, 111/249 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4142 ms. Remains : 72/196 places, 111/249 transitions.
[2024-06-02 18:04:51] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:04:51] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:04:51] [INFO ] Input system was already deterministic with 111 transitions.
[2024-06-02 18:04:51] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:04:51] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:04:51] [INFO ] Time to serialize gal into /tmp/CTLFireability7907103673711782886.gal : 1 ms
[2024-06-02 18:04:51] [INFO ] Time to serialize properties into /tmp/CTLFireability16385683729375091241.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7907103673711782886.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16385683729375091241.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,9241,0.023141,3904,2,267,5,2000,6,0,392,1848,0


Converting to forward existential form...Done !
original formula: AG(E((p195!=1) U ((p364!=1)||(p293==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((p195!=1) U ((p364!=1)||(p293==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t9, t27, t34, t40, t57, Intersection with reachable at each step enabled. (destroyed...193
(forward)formula 0,0,0.094411,7652,1,0,156,18357,241,82,2162,16774,237
FORMULA CO4-PT-06-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 249/249 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 182 transition count 233
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 182 transition count 233
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 173 transition count 224
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 173 transition count 224
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 170 transition count 221
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 170 transition count 221
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 170 transition count 219
Applied a total of 54 rules in 9 ms. Remains 170 /196 variables (removed 26) and now considering 219/249 (removed 30) transitions.
// Phase 1: matrix 219 rows 170 cols
[2024-06-02 18:04:51] [INFO ] Computed 3 invariants in 3 ms
[2024-06-02 18:04:51] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-02 18:04:51] [INFO ] Invariant cache hit.
[2024-06-02 18:04:51] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-06-02 18:04:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 219/389 variables, 170/173 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-02 18:04:54] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:04:54] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/389 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 175 constraints, problems are : Problem set: 0 solved, 218 unsolved in 7228 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/389 variables, 170/175 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 218/393 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 0/389 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 393 constraints, problems are : Problem set: 0 solved, 218 unsolved in 7180 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints]
After SMT, in 14434ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 14436ms
Starting structural reductions in LTL mode, iteration 1 : 170/196 places, 219/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14569 ms. Remains : 170/196 places, 219/249 transitions.
[2024-06-02 18:05:05] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:05:05] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:05:05] [INFO ] Input system was already deterministic with 219 transitions.
[2024-06-02 18:05:05] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:05:05] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:05:05] [INFO ] Time to serialize gal into /tmp/CTLFireability301707048140055621.gal : 1 ms
[2024-06-02 18:05:05] [INFO ] Time to serialize properties into /tmp/CTLFireability13578384637012262552.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability301707048140055621.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13578384637012262552.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,220974,0.111976,8280,2,1090,5,16583,6,0,897,21202,0


Converting to forward existential form...Done !
original formula: !(A(!(AX(AG(!(((p100==1)&&(p370==1)))))) U E((EX((p354==1)) * AF((p283!=1))) U ((EX((p96==1)) + E((p2==1) U (p291==1))) + ((p298==1)&&(p2...166
=> equivalent forward existential formula: ([((FwdU(Init,!(E((EX((p354==1)) * !(EG(!((p283!=1))))) U ((EX((p96==1)) + E((p2==1) U (p291==1))) + ((p298==1)&...495
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t10, t16, t25, t30, t31, t33, t34, t38, t39, t42, t45, t55, t66, t75, t84...334
(forward)formula 0,1,5.42495,207096,1,0,807,1.12397e+06,482,463,5307,1.35389e+06,971
FORMULA CO4-PT-06-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 249/249 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 181 transition count 232
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 181 transition count 232
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 172 transition count 223
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 172 transition count 223
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 169 transition count 220
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 169 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 169 transition count 218
Applied a total of 56 rules in 4 ms. Remains 169 /196 variables (removed 27) and now considering 218/249 (removed 31) transitions.
// Phase 1: matrix 218 rows 169 cols
[2024-06-02 18:05:11] [INFO ] Computed 3 invariants in 2 ms
[2024-06-02 18:05:11] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-02 18:05:11] [INFO ] Invariant cache hit.
[2024-06-02 18:05:11] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 18:05:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 218/387 variables, 169/172 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 18:05:14] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:05:14] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/387 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/387 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 174 constraints, problems are : Problem set: 0 solved, 217 unsolved in 7192 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/387 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 217/391 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/387 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 391 constraints, problems are : Problem set: 0 solved, 217 unsolved in 7144 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 2/2 constraints]
After SMT, in 14360ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 14363ms
Starting structural reductions in LTL mode, iteration 1 : 169/196 places, 218/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14498 ms. Remains : 169/196 places, 218/249 transitions.
[2024-06-02 18:05:25] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:05:25] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:05:25] [INFO ] Input system was already deterministic with 218 transitions.
[2024-06-02 18:05:25] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:05:25] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:05:25] [INFO ] Time to serialize gal into /tmp/CTLFireability15032989646218573765.gal : 1 ms
[2024-06-02 18:05:25] [INFO ] Time to serialize properties into /tmp/CTLFireability2193704838044131083.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15032989646218573765.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2193704838044131083.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,194167,0.102027,7488,2,775,5,13850,6,0,892,17396,0


Converting to forward existential form...Done !
original formula: AX(EG((p325==1)))
=> equivalent forward existential formula: [(EY(Init) * !(EG((p325==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t16, t25, t30, t32, t34, t35, t39, t40, t43, t152, t175, t202, Intersect...245
(forward)formula 0,0,0.758081,33816,1,0,398,152965,458,229,4974,118422,622
FORMULA CO4-PT-06-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 249/249 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 180 transition count 231
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 180 transition count 231
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 42 place count 170 transition count 221
Iterating global reduction 0 with 10 rules applied. Total rules applied 52 place count 170 transition count 221
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 167 transition count 218
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 167 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 167 transition count 216
Applied a total of 60 rules in 9 ms. Remains 167 /196 variables (removed 29) and now considering 216/249 (removed 33) transitions.
// Phase 1: matrix 216 rows 167 cols
[2024-06-02 18:05:26] [INFO ] Computed 3 invariants in 2 ms
[2024-06-02 18:05:26] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-02 18:05:26] [INFO ] Invariant cache hit.
[2024-06-02 18:05:26] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-06-02 18:05:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 216/383 variables, 167/170 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-02 18:05:29] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:05:29] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 0/383 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 172 constraints, problems are : Problem set: 0 solved, 215 unsolved in 6987 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/383 variables, 167/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 215/387 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 0/383 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 387 constraints, problems are : Problem set: 0 solved, 215 unsolved in 7366 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 2/2 constraints]
After SMT, in 14379ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 14380ms
Starting structural reductions in LTL mode, iteration 1 : 167/196 places, 216/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14507 ms. Remains : 167/196 places, 216/249 transitions.
[2024-06-02 18:05:41] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:05:41] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:05:41] [INFO ] Input system was already deterministic with 216 transitions.
[2024-06-02 18:05:41] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:05:41] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:05:41] [INFO ] Time to serialize gal into /tmp/CTLFireability5468777942152827801.gal : 2 ms
[2024-06-02 18:05:41] [INFO ] Time to serialize properties into /tmp/CTLFireability8577747277713522551.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5468777942152827801.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8577747277713522551.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,180279,0.09341,7172,2,766,5,12829,6,0,882,15697,0


Converting to forward existential form...Done !
original formula: EX(AX(A((p207!=1) U ((p345==1)&&(p374==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(!((E(!(((p345==1)&&(p374==1))) U (!((p207!=1)) * !(((p345==1)&&(p374==1))))) + EG(!(((p345==...187
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t16, t25, t30, t31, t33, t34, t38, t39, t42, t151, t174, t201, Intersect...245
(forward)formula 0,0,6.2264,231968,1,0,785,1.63564e+06,459,415,4936,1.41978e+06,1008
FORMULA CO4-PT-06-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 249/249 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 181 transition count 232
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 181 transition count 232
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 40 place count 171 transition count 222
Iterating global reduction 0 with 10 rules applied. Total rules applied 50 place count 171 transition count 222
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 168 transition count 219
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 168 transition count 219
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 168 transition count 217
Applied a total of 58 rules in 4 ms. Remains 168 /196 variables (removed 28) and now considering 217/249 (removed 32) transitions.
// Phase 1: matrix 217 rows 168 cols
[2024-06-02 18:05:47] [INFO ] Computed 3 invariants in 2 ms
[2024-06-02 18:05:47] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-02 18:05:47] [INFO ] Invariant cache hit.
[2024-06-02 18:05:47] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-06-02 18:05:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 217/385 variables, 168/171 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-02 18:05:50] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:05:50] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 0/385 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 173 constraints, problems are : Problem set: 0 solved, 216 unsolved in 7211 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/385 variables, 168/173 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 216/389 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/385 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 389 constraints, problems are : Problem set: 0 solved, 216 unsolved in 7333 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 2/2 constraints]
After SMT, in 14572ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 14574ms
Starting structural reductions in LTL mode, iteration 1 : 168/196 places, 217/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14710 ms. Remains : 168/196 places, 217/249 transitions.
[2024-06-02 18:06:02] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:06:02] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:06:02] [INFO ] Input system was already deterministic with 217 transitions.
[2024-06-02 18:06:02] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:06:02] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:06:02] [INFO ] Time to serialize gal into /tmp/CTLFireability6332592571206186495.gal : 2 ms
[2024-06-02 18:06:02] [INFO ] Time to serialize properties into /tmp/CTLFireability6141892527194832377.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6332592571206186495.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6141892527194832377.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,181731,0.093274,7184,2,767,5,12877,6,0,887,15951,0


Converting to forward existential form...Done !
original formula: AG(AX((EX((p111==0)) + !(A((p155==1) U ((p189==1)&&(p370==1)))))))
=> equivalent forward existential formula: [((EY(FwdU(Init,TRUE)) * !(!(!((E(!(((p189==1)&&(p370==1))) U (!((p155==1)) * !(((p189==1)&&(p370==1))))) + EG(!...214
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t16, t25, t30, t31, t33, t34, t38, t39, t42, t151, t175, t202, Intersect...245
(forward)formula 0,1,4.04039,145044,1,0,583,950829,462,314,4963,868055,806
FORMULA CO4-PT-06-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-06-02 18:06:06] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:06:06] [INFO ] Flatten gal took : 5 ms
Total runtime 209988 ms.

BK_STOP 1717351566357

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-06"
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-5568"
echo " Executing tool itstools"
echo " Input is CO4-PT-06, 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 r550-tall-171734898400042"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-06.tgz
mv CO4-PT-06 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;