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-171734898500066.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-09, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898500066
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K 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 152K 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-09-CTLFireability-2024-00
FORMULA_NAME CO4-PT-09-CTLFireability-2024-01
FORMULA_NAME CO4-PT-09-CTLFireability-2024-02
FORMULA_NAME CO4-PT-09-CTLFireability-2024-03
FORMULA_NAME CO4-PT-09-CTLFireability-2024-04
FORMULA_NAME CO4-PT-09-CTLFireability-2024-05
FORMULA_NAME CO4-PT-09-CTLFireability-2024-06
FORMULA_NAME CO4-PT-09-CTLFireability-2024-07
FORMULA_NAME CO4-PT-09-CTLFireability-2024-08
FORMULA_NAME CO4-PT-09-CTLFireability-2024-09
FORMULA_NAME CO4-PT-09-CTLFireability-2024-10
FORMULA_NAME CO4-PT-09-CTLFireability-2024-11
FORMULA_NAME CO4-PT-09-CTLFireability-2024-12
FORMULA_NAME CO4-PT-09-CTLFireability-2024-13
FORMULA_NAME CO4-PT-09-CTLFireability-2024-14
FORMULA_NAME CO4-PT-09-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717351629211

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 18:07:10] [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:07:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:07:10] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-06-02 18:07:10] [INFO ] Transformed 467 places.
[2024-06-02 18:07:10] [INFO ] Transformed 634 transitions.
[2024-06-02 18:07:10] [INFO ] Found NUPN structural information;
[2024-06-02 18:07:10] [INFO ] Parsed PT model containing 467 places and 634 transitions and 1868 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Deduced a syphon composed of 108 places in 16 ms
Reduce places removed 108 places and 163 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-09-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 471/471 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 346 transition count 469
Discarding 76 places :
Symmetric choice reduction at 1 with 76 rule applications. Total rules 91 place count 270 transition count 391
Iterating global reduction 1 with 76 rules applied. Total rules applied 167 place count 270 transition count 391
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 171 place count 270 transition count 387
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 202 place count 239 transition count 346
Iterating global reduction 2 with 31 rules applied. Total rules applied 233 place count 239 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 234 place count 239 transition count 345
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 239 place count 234 transition count 338
Iterating global reduction 3 with 5 rules applied. Total rules applied 244 place count 234 transition count 338
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 246 place count 232 transition count 336
Iterating global reduction 3 with 2 rules applied. Total rules applied 248 place count 232 transition count 336
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 249 place count 231 transition count 335
Iterating global reduction 3 with 1 rules applied. Total rules applied 250 place count 231 transition count 335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 251 place count 231 transition count 334
Applied a total of 251 rules in 92 ms. Remains 231 /359 variables (removed 128) and now considering 334/471 (removed 137) transitions.
// Phase 1: matrix 334 rows 231 cols
[2024-06-02 18:07:10] [INFO ] Computed 6 invariants in 21 ms
[2024-06-02 18:07:10] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-06-02 18:07:10] [INFO ] Invariant cache hit.
[2024-06-02 18:07:11] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 333 sub problems to find dead transitions.
[2024-06-02 18:07:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-06-02 18:07:14] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 12 ms to minimize.
[2024-06-02 18:07:14] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 2 ms to minimize.
[2024-06-02 18:07:14] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:07:14] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:07:14] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:07:15] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
Problem TDEAD268 is UNSAT
[2024-06-02 18:07:15] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
[2024-06-02 18:07:15] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
Problem TDEAD275 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 8/14 constraints. Problems are: Problem set: 10 solved, 323 unsolved
[2024-06-02 18:07:16] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:07:16] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-06-02 18:07:16] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 3/17 constraints. Problems are: Problem set: 10 solved, 323 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/17 constraints. Problems are: Problem set: 10 solved, 323 unsolved
At refinement iteration 5 (OVERLAPS) 334/565 variables, 231/248 constraints. Problems are: Problem set: 10 solved, 323 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 0/248 constraints. Problems are: Problem set: 10 solved, 323 unsolved
[2024-06-02 18:07:24] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/565 variables, 1/249 constraints. Problems are: Problem set: 10 solved, 323 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 0/249 constraints. Problems are: Problem set: 10 solved, 323 unsolved
At refinement iteration 9 (OVERLAPS) 0/565 variables, 0/249 constraints. Problems are: Problem set: 10 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 249 constraints, problems are : Problem set: 10 solved, 323 unsolved in 22303 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 10 solved, 323 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 323 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 6/6 constraints. Problems are: Problem set: 10 solved, 323 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 12/18 constraints. Problems are: Problem set: 10 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/18 constraints. Problems are: Problem set: 10 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 334/565 variables, 231/249 constraints. Problems are: Problem set: 10 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 323/572 constraints. Problems are: Problem set: 10 solved, 323 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 0/572 constraints. Problems are: Problem set: 10 solved, 323 unsolved
At refinement iteration 7 (OVERLAPS) 0/565 variables, 0/572 constraints. Problems are: Problem set: 10 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 572 constraints, problems are : Problem set: 10 solved, 323 unsolved in 19140 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 323/333 constraints, Known Traps: 12/12 constraints]
After SMT, in 41656ms problems are : Problem set: 10 solved, 323 unsolved
Search for dead transitions found 10 dead transitions in 41677ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in LTL mode, iteration 1 : 231/359 places, 324/471 transitions.
Applied a total of 0 rules in 3 ms. Remains 231 /231 variables (removed 0) and now considering 324/324 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42229 ms. Remains : 231/359 places, 324/471 transitions.
Support contains 49 out of 231 places after structural reductions.
[2024-06-02 18:07:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 18:07:53] [INFO ] Flatten gal took : 54 ms
FORMULA CO4-PT-09-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:07:53] [INFO ] Flatten gal took : 35 ms
[2024-06-02 18:07:53] [INFO ] Input system was already deterministic with 324 transitions.
Support contains 48 out of 231 places (down from 49) after GAL structural reductions.
FORMULA CO4-PT-09-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (99 resets) in 1504 ms. (26 steps per ms) remains 24/30 properties
BEST_FIRST walk for 4003 steps (31 resets) in 15 ms. (250 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4001 steps (28 resets) in 54 ms. (72 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (29 resets) in 38 ms. (102 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4002 steps (27 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (27 resets) in 46 ms. (85 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (19 resets) in 23 ms. (166 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4004 steps (33 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (29 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (18 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (28 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (30 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (33 resets) in 10 ms. (363 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 4003 steps (29 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (33 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (29 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (29 resets) in 27 ms. (142 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4002 steps (31 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (24 resets) in 36 ms. (108 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4003 steps (26 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
// Phase 1: matrix 324 rows 231 cols
[2024-06-02 18:07:53] [INFO ] Computed 6 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 16/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 11/54 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 147/201 variables, 54/60 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 213/414 variables, 90/150 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 123/537 variables, 74/224 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/537 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 16/553 variables, 12/236 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/553 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 13 (OVERLAPS) 2/555 variables, 1/237 constraints. Problems are: Problem set: 1 solved, 17 unsolved
[2024-06-02 18:07:54] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
Problem AtomicPropp16 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/555 variables, 1/238 constraints. Problems are: Problem set: 2 solved, 16 unsolved
[2024-06-02 18:07:54] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:07:54] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
Problem AtomicPropp12 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/555 variables, 2/240 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/555 variables, 0/240 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 0/555 variables, 0/240 constraints. Problems are: Problem set: 3 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 240 constraints, problems are : Problem set: 3 solved, 15 unsolved in 1276 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 18/41 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 2/5 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 11/52 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 1/9 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 143/195 variables, 52/61 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 2/63 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/63 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 215/410 variables, 90/153 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 13/166 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 0/166 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 126/536 variables, 75/241 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/536 variables, 0/241 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 17/553 variables, 13/254 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/553 variables, 0/254 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 2/555 variables, 1/255 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/555 variables, 0/255 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 19 (OVERLAPS) 0/555 variables, 0/255 constraints. Problems are: Problem set: 3 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 255 constraints, problems are : Problem set: 3 solved, 15 unsolved in 1436 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 15/18 constraints, Known Traps: 3/3 constraints]
After SMT, in 2732ms problems are : Problem set: 3 solved, 15 unsolved
Parikh walk visited 14 properties in 3173 ms.
Support contains 5 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 324/324 transitions.
Graph (trivial) has 218 edges and 231 vertex of which 2 / 231 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 532 edges and 230 vertex of which 226 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 74 rules applied. Total rules applied 76 place count 226 transition count 242
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 81 rules applied. Total rules applied 157 place count 155 transition count 232
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 165 place count 147 transition count 232
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 165 place count 147 transition count 212
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 205 place count 127 transition count 212
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 214 place count 118 transition count 200
Iterating global reduction 3 with 9 rules applied. Total rules applied 223 place count 118 transition count 200
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 3 with 3 rules applied. Total rules applied 226 place count 118 transition count 197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 227 place count 117 transition count 197
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 227 place count 117 transition count 196
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 229 place count 116 transition count 196
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 231 place count 114 transition count 192
Iterating global reduction 5 with 2 rules applied. Total rules applied 233 place count 114 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 234 place count 114 transition count 191
Performed 30 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 294 place count 84 transition count 153
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 7 rules applied. Total rules applied 301 place count 84 transition count 146
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 303 place count 83 transition count 145
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 305 place count 81 transition count 141
Iterating global reduction 8 with 2 rules applied. Total rules applied 307 place count 81 transition count 141
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 309 place count 80 transition count 140
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 343 place count 63 transition count 160
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 351 place count 63 transition count 152
Discarding 10 places :
Symmetric choice reduction at 9 with 10 rule applications. Total rules 361 place count 53 transition count 112
Iterating global reduction 9 with 10 rules applied. Total rules applied 371 place count 53 transition count 112
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 379 place count 53 transition count 104
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 381 place count 51 transition count 92
Iterating global reduction 10 with 2 rules applied. Total rules applied 383 place count 51 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 384 place count 51 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 386 place count 50 transition count 103
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 11 with 19 rules applied. Total rules applied 405 place count 50 transition count 84
Free-agglomeration rule applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 409 place count 50 transition count 80
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 414 place count 46 transition count 79
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 12 with 4 rules applied. Total rules applied 418 place count 46 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 419 place count 46 transition count 78
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 420 place count 45 transition count 77
Applied a total of 420 rules in 74 ms. Remains 45 /231 variables (removed 186) and now considering 77/324 (removed 247) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 45/231 places, 77/324 transitions.
RANDOM walk for 1062 steps (58 resets) in 20 ms. (50 steps per ms) remains 0/1 properties
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
[2024-06-02 18:07:59] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:07:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CO4-PT-09-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:08:00] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:08:00] [INFO ] Input system was already deterministic with 324 transitions.
Support contains 39 out of 231 places (down from 42) after GAL structural reductions.
Computed a total of 18 stabilizing places and 23 stable transitions
Graph (complete) has 534 edges and 231 vertex of which 228 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 324/324 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 219 transition count 309
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 219 transition count 309
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 219 transition count 308
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 214 transition count 300
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 214 transition count 300
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 210 transition count 295
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 210 transition count 295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 210 transition count 294
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 207 transition count 291
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 207 transition count 291
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 52 place count 207 transition count 289
Applied a total of 52 rules in 12 ms. Remains 207 /231 variables (removed 24) and now considering 289/324 (removed 35) transitions.
// Phase 1: matrix 289 rows 207 cols
[2024-06-02 18:08:00] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 18:08:00] [INFO ] Implicit Places using invariants in 57 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 206/231 places, 289/324 transitions.
Applied a total of 0 rules in 2 ms. Remains 206 /206 variables (removed 0) and now considering 289/289 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 72 ms. Remains : 206/231 places, 289/324 transitions.
[2024-06-02 18:08:00] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:08:00] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:08:00] [INFO ] Input system was already deterministic with 289 transitions.
[2024-06-02 18:08:00] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:08:00] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:08:00] [INFO ] Time to serialize gal into /tmp/CTLFireability14067170565199288787.gal : 6 ms
[2024-06-02 18:08:00] [INFO ] Time to serialize properties into /tmp/CTLFireability4400683540303830961.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14067170565199288787.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4400683540303830961.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,1.26563e+07,0.258519,14180,2,2953,5,36994,6,0,1109,43830,0


Converting to forward existential form...Done !
original formula: EX((AX(EG(EX((p408==0)))) + (p192==1)))
=> equivalent forward existential formula: ([(EY(Init) * !(EX(!(EG(EX((p408==0)))))))] != FALSE + [(EY(Init) * (p192==1))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t12, t19, t28, t33, t35, t37, t38, t42, t43, t51, t60, t65, t66, ...381
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,26.6721,860760,1,0,734,5.48087e+06,602,418,7474,5.48177e+06,905
FORMULA CO4-PT-09-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 231/231 places, 324/324 transitions.
Graph (trivial) has 237 edges and 231 vertex of which 2 / 231 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 533 edges and 230 vertex of which 227 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 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 82 place count 226 transition count 239
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 164 place count 146 transition count 237
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 164 place count 146 transition count 217
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 204 place count 126 transition count 217
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 209 place count 121 transition count 209
Iterating global reduction 2 with 5 rules applied. Total rules applied 214 place count 121 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 215 place count 121 transition count 208
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 215 place count 121 transition count 207
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 217 place count 120 transition count 207
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 218 place count 119 transition count 205
Iterating global reduction 3 with 1 rules applied. Total rules applied 219 place count 119 transition count 205
Performed 16 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
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 251 place count 103 transition count 187
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 8 rules applied. Total rules applied 259 place count 103 transition count 179
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 8 rules applied. Total rules applied 267 place count 100 transition count 174
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 5 rules applied. Total rules applied 272 place count 98 transition count 171
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 275 place count 97 transition count 169
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 277 place count 96 transition count 168
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 279 place count 94 transition count 164
Iterating global reduction 8 with 2 rules applied. Total rules applied 281 place count 94 transition count 164
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 283 place count 93 transition count 163
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 289 place count 93 transition count 157
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 290 place count 93 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 291 place count 92 transition count 156
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 291 place count 92 transition count 155
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 293 place count 91 transition count 155
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 10 with 2 rules applied. Total rules applied 295 place count 90 transition count 154
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 297 place count 88 transition count 152
Applied a total of 297 rules in 49 ms. Remains 88 /231 variables (removed 143) and now considering 152/324 (removed 172) transitions.
// Phase 1: matrix 152 rows 88 cols
[2024-06-02 18:08:27] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 18:08:27] [INFO ] Implicit Places using invariants in 79 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 87/231 places, 152/324 transitions.
Applied a total of 0 rules in 6 ms. Remains 87 /87 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 135 ms. Remains : 87/231 places, 152/324 transitions.
[2024-06-02 18:08:27] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:08:27] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:08:27] [INFO ] Input system was already deterministic with 152 transitions.
[2024-06-02 18:08:27] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:08:27] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:08:27] [INFO ] Time to serialize gal into /tmp/CTLFireability13972946969305149485.gal : 1 ms
[2024-06-02 18:08:27] [INFO ] Time to serialize properties into /tmp/CTLFireability12623665358004477519.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/CTLFireability13972946969305149485.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12623665358004477519.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,143857,0.046124,5244,2,624,5,6115,6,0,492,4401,0


Converting to forward existential form...Done !
original formula: EG(AF((p386==0)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((p386==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t9, t15, t35, t43, t49, t64, t114, t117, t119, t122, Intersection with reachable...227
(forward)formula 0,1,0.696651,34364,1,0,339,140892,330,193,3363,168258,451
FORMULA CO4-PT-09-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 324/324 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 219 transition count 309
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 219 transition count 309
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 219 transition count 308
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 214 transition count 301
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 214 transition count 301
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 211 transition count 297
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 211 transition count 297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 211 transition count 296
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 209 transition count 294
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 209 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 209 transition count 293
Applied a total of 47 rules in 32 ms. Remains 209 /231 variables (removed 22) and now considering 293/324 (removed 31) transitions.
// Phase 1: matrix 293 rows 209 cols
[2024-06-02 18:08:28] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 18:08:28] [INFO ] Implicit Places using invariants in 63 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 208/231 places, 293/324 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 99 ms. Remains : 208/231 places, 293/324 transitions.
[2024-06-02 18:08:28] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:08:28] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:08:28] [INFO ] Input system was already deterministic with 293 transitions.
[2024-06-02 18:08:28] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:08:28] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:08:28] [INFO ] Time to serialize gal into /tmp/CTLFireability10746871430458367744.gal : 2 ms
[2024-06-02 18:08:28] [INFO ] Time to serialize properties into /tmp/CTLFireability2645734307714162982.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/CTLFireability10746871430458367744.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2645734307714162982.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,1.35481e+07,0.261174,15324,2,2986,5,39381,6,0,1121,47034,0


Converting to forward existential form...Done !
original formula: EX(EG((p316==0)))
=> equivalent forward existential formula: [FwdG(EY(Init),(p316==0))] != FALSE
Hit Full ! (commute/partial/dont) 291/0/2
(forward)formula 0,1,2.23465,87604,1,0,38,401042,19,4,5721,246409,36
FORMULA CO4-PT-09-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 324/324 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 223 transition count 314
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 223 transition count 314
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 219 transition count 308
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 219 transition count 308
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 217 transition count 306
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 217 transition count 306
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 217 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 216 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 216 transition count 304
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 216 transition count 303
Applied a total of 32 rules in 19 ms. Remains 216 /231 variables (removed 15) and now considering 303/324 (removed 21) transitions.
// Phase 1: matrix 303 rows 216 cols
[2024-06-02 18:08:30] [INFO ] Computed 6 invariants in 2 ms
[2024-06-02 18:08:30] [INFO ] Implicit Places using invariants in 72 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 215/231 places, 303/324 transitions.
Applied a total of 0 rules in 2 ms. Remains 215 /215 variables (removed 0) and now considering 303/303 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110 ms. Remains : 215/231 places, 303/324 transitions.
[2024-06-02 18:08:30] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:08:30] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:08:30] [INFO ] Input system was already deterministic with 303 transitions.
[2024-06-02 18:08:30] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:08:30] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:08:30] [INFO ] Time to serialize gal into /tmp/CTLFireability12797622738052760598.gal : 18 ms
[2024-06-02 18:08:30] [INFO ] Time to serialize properties into /tmp/CTLFireability13928723351021826104.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12797622738052760598.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13928723351021826104.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,2.09979e+07,0.291642,15912,2,3450,5,39946,6,0,1159,50179,0


Converting to forward existential form...Done !
original formula: AF(((E((EF((p228==1)) * (((p382==1)&&(p412==1))||(((p199==1)&&(p302==1))&&(p453==1)))) U (!(EG((p303==1))) + EF((p119==1)))) * AG(E((p387...226
=> equivalent forward existential formula: [FwdG(Init,!(((E((E(TRUE U (p228==1)) * (((p382==1)&&(p412==1))||(((p199==1)&&(p302==1))&&(p453==1)))) U (!(EG((...301
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t12, t13, t19, t28, t35, t37, t38, t39, t40, t42, t43, t47, t48, ...397
Detected timeout of ITS tools.
[2024-06-02 18:09:00] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:09:00] [INFO ] Applying decomposition
[2024-06-02 18:09:00] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14730370167684733541.txt' '-o' '/tmp/graph14730370167684733541.bin' '-w' '/tmp/graph14730370167684733541.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14730370167684733541.bin' '-l' '-1' '-v' '-w' '/tmp/graph14730370167684733541.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:09:00] [INFO ] Decomposing Gal with order
[2024-06-02 18:09:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:09:00] [INFO ] Removed a total of 215 redundant transitions.
[2024-06-02 18:09:01] [INFO ] Flatten gal took : 50 ms
[2024-06-02 18:09:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 12 ms.
[2024-06-02 18:09:01] [INFO ] Time to serialize gal into /tmp/CTLFireability15956462631588715857.gal : 5 ms
[2024-06-02 18:09:01] [INFO ] Time to serialize properties into /tmp/CTLFireability1078689028489033504.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/CTLFireability15956462631588715857.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1078689028489033504.ctl'

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 -...263
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,2.09979e+07,0.186174,11740,719,253,12393,2140,678,34981,131,13518,0


Converting to forward existential form...Done !
original formula: AF(((E((EF((i5.i1.u36.p228==1)) * (((i9.u56.p382==1)&&(i11.i1.u66.p412==1))||(((i6.u29.p199==1)&&(i12.u52.p302==1))&&(i12.u74.p453==1))))...338
=> equivalent forward existential formula: [FwdG(Init,!(((E((E(TRUE U (i5.i1.u36.p228==1)) * (((i9.u56.p382==1)&&(i11.i1.u66.p412==1))||(((i6.u29.p199==1)&...413
Reverse transition relation is NOT exact ! Due to transitions t12, t43, t53, t90, t159, t192, t251, t278, i0.t4, i0.u75.t8, i0.u75.t9, i0.u76.t3, i0.u76.t5...620
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,0,3.82909,162484,1,0,242098,5915,4692,933844,658,43464,383646
FORMULA CO4-PT-09-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 324/324 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 219 transition count 310
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 219 transition count 310
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 219 transition count 309
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 213 transition count 300
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 213 transition count 300
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 209 transition count 295
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 209 transition count 295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 209 transition count 294
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 206 transition count 291
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 206 transition count 291
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 54 place count 206 transition count 289
Applied a total of 54 rules in 19 ms. Remains 206 /231 variables (removed 25) and now considering 289/324 (removed 35) transitions.
// Phase 1: matrix 289 rows 206 cols
[2024-06-02 18:09:04] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 18:09:05] [INFO ] Implicit Places using invariants in 62 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 205/231 places, 289/324 transitions.
Applied a total of 0 rules in 2 ms. Remains 205 /205 variables (removed 0) and now considering 289/289 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 205/231 places, 289/324 transitions.
[2024-06-02 18:09:05] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:09:05] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:09:05] [INFO ] Input system was already deterministic with 289 transitions.
[2024-06-02 18:09:05] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:09:05] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:09:05] [INFO ] Time to serialize gal into /tmp/CTLFireability986531402664232210.gal : 2 ms
[2024-06-02 18:09:05] [INFO ] Time to serialize properties into /tmp/CTLFireability1231723664109284695.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/CTLFireability986531402664232210.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1231723664109284695.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18593e+07,0.271284,13768,2,2926,5,31712,6,0,1105,42140,0


Converting to forward existential form...Done !
original formula: AX((((p133==0)||(p302==0))||((p453==0)||(((p300==1)&&(p311==1))&&(p356==1)))))
=> equivalent forward existential formula: [(EY(Init) * !((((p133==0)||(p302==0))||((p453==0)||(((p300==1)&&(p311==1))&&(p356==1))))))] = FALSE
(forward)formula 0,1,0.289294,14032,1,0,9,31712,9,2,1399,42140,2
FORMULA CO4-PT-09-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 324/324 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 218 transition count 308
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 218 transition count 308
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 218 transition count 307
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 212 transition count 298
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 212 transition count 298
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 208 transition count 293
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 208 transition count 293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 208 transition count 292
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 51 place count 205 transition count 289
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 205 transition count 289
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 56 place count 205 transition count 287
Applied a total of 56 rules in 8 ms. Remains 205 /231 variables (removed 26) and now considering 287/324 (removed 37) transitions.
// Phase 1: matrix 287 rows 205 cols
[2024-06-02 18:09:05] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 18:09:05] [INFO ] Implicit Places using invariants in 55 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 204/231 places, 287/324 transitions.
Applied a total of 0 rules in 2 ms. Remains 204 /204 variables (removed 0) and now considering 287/287 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 204/231 places, 287/324 transitions.
[2024-06-02 18:09:05] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:09:05] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:09:05] [INFO ] Input system was already deterministic with 287 transitions.
[2024-06-02 18:09:05] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:09:05] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:09:05] [INFO ] Time to serialize gal into /tmp/CTLFireability8612685901100263300.gal : 1 ms
[2024-06-02 18:09:05] [INFO ] Time to serialize properties into /tmp/CTLFireability13821750790162410859.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/CTLFireability8612685901100263300.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13821750790162410859.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,1.17645e+07,0.24513,14008,2,2829,5,34296,6,0,1099,41990,0


Converting to forward existential form...Done !
original formula: AG(EX(((p289==1) * AX(FALSE))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(((p289==1) * !(EX(!(FALSE)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t12, t19, t28, t33, t34, t36, t37, t41, t42, t50, t59, t64, t65, ...381
(forward)formula 0,0,2.75332,97744,1,0,415,379096,590,242,6936,412193,581
FORMULA CO4-PT-09-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 324/324 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 218 transition count 308
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 218 transition count 308
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 218 transition count 307
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 212 transition count 298
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 212 transition count 298
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 208 transition count 293
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 208 transition count 293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 208 transition count 292
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 51 place count 205 transition count 289
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 205 transition count 289
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 56 place count 205 transition count 287
Applied a total of 56 rules in 7 ms. Remains 205 /231 variables (removed 26) and now considering 287/324 (removed 37) transitions.
[2024-06-02 18:09:08] [INFO ] Invariant cache hit.
[2024-06-02 18:09:08] [INFO ] Implicit Places using invariants in 55 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 204/231 places, 287/324 transitions.
Applied a total of 0 rules in 3 ms. Remains 204 /204 variables (removed 0) and now considering 287/287 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 204/231 places, 287/324 transitions.
[2024-06-02 18:09:08] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:09:08] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:09:08] [INFO ] Input system was already deterministic with 287 transitions.
[2024-06-02 18:09:08] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:09:08] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:09:08] [INFO ] Time to serialize gal into /tmp/CTLFireability11565434561670110847.gal : 5 ms
[2024-06-02 18:09:08] [INFO ] Time to serialize properties into /tmp/CTLFireability3538007221078069738.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11565434561670110847.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3538007221078069738.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,1.17645e+07,0.286819,14000,2,2829,5,34296,6,0,1099,41990,0


Converting to forward existential form...Done !
original formula: (E(!(E((p90==1) U (p346==1))) U AF(!(AX((p418==1))))) * AX(AF(AG((((p302==1)&&(p357==1))&&(p457==1))))))
=> equivalent forward existential formula: ([(Init * !(E(!(E((p90==1) U (p346==1))) U !(EG(!(!(!(EX(!((p418==1)))))))))))] = FALSE * [FwdG(EY(Init),!(!(E(T...213
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t12, t19, t28, t33, t34, t36, t37, t41, t42, t50, t59, t64, t65, ...381
(forward)formula 0,0,4.84189,133564,1,0,442,563127,600,244,7538,559819,617
FORMULA CO4-PT-09-CTLFireability-2024-11 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 : 231/231 places, 324/324 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 218 transition count 308
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 218 transition count 308
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 218 transition count 307
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 212 transition count 298
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 212 transition count 298
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 208 transition count 293
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 208 transition count 293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 208 transition count 292
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 51 place count 205 transition count 289
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 205 transition count 289
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 56 place count 205 transition count 287
Applied a total of 56 rules in 15 ms. Remains 205 /231 variables (removed 26) and now considering 287/324 (removed 37) transitions.
[2024-06-02 18:09:13] [INFO ] Invariant cache hit.
[2024-06-02 18:09:13] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 18:09:13] [INFO ] Invariant cache hit.
[2024-06-02 18:09:13] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2024-06-02 18:09:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-06-02 18:09:15] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:09:15] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-02 18:09:15] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:09:16] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 287/492 variables, 205/215 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (OVERLAPS) 0/492 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 215 constraints, problems are : Problem set: 0 solved, 286 unsolved in 10155 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-06-02 18:09:25] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:09:25] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-06-02 18:09:25] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-06-02 18:09:25] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (OVERLAPS) 287/492 variables, 205/219 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 286/505 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 0/492 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 492/492 variables, and 505 constraints, problems are : Problem set: 0 solved, 286 unsolved in 13008 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 8/8 constraints]
After SMT, in 23273ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 23278ms
Starting structural reductions in LTL mode, iteration 1 : 205/231 places, 287/324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23462 ms. Remains : 205/231 places, 287/324 transitions.
[2024-06-02 18:09:36] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:09:36] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:09:36] [INFO ] Input system was already deterministic with 287 transitions.
[2024-06-02 18:09:36] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:09:36] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:09:36] [INFO ] Time to serialize gal into /tmp/CTLFireability11415076094840705612.gal : 2 ms
[2024-06-02 18:09:36] [INFO ] Time to serialize properties into /tmp/CTLFireability13164041109783984949.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/CTLFireability11415076094840705612.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13164041109783984949.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,1.17645e+07,0.23206,12428,2,2807,5,29998,6,0,1103,36237,0


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

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

Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 324/324 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 218 transition count 308
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 218 transition count 308
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 218 transition count 307
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 212 transition count 298
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 212 transition count 298
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 208 transition count 293
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 208 transition count 293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 208 transition count 292
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 51 place count 205 transition count 289
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 205 transition count 289
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 56 place count 205 transition count 287
Applied a total of 56 rules in 8 ms. Remains 205 /231 variables (removed 26) and now considering 287/324 (removed 37) transitions.
[2024-06-02 18:09:40] [INFO ] Invariant cache hit.
[2024-06-02 18:09:40] [INFO ] Implicit Places using invariants in 51 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 204/231 places, 287/324 transitions.
Applied a total of 0 rules in 2 ms. Remains 204 /204 variables (removed 0) and now considering 287/287 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 204/231 places, 287/324 transitions.
[2024-06-02 18:09:40] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:09:40] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:09:40] [INFO ] Input system was already deterministic with 287 transitions.
[2024-06-02 18:09:40] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:09:40] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:09:40] [INFO ] Time to serialize gal into /tmp/CTLFireability230898108706303447.gal : 1 ms
[2024-06-02 18:09:40] [INFO ] Time to serialize properties into /tmp/CTLFireability9124012643393475230.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/CTLFireability230898108706303447.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9124012643393475230.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17645e+07,0.24023,14004,2,2829,5,34296,6,0,1099,41990,0


Converting to forward existential form...Done !
original formula: EF((AG((p174==0)) + E(AX(FALSE) U ((p228==1)||(p152==1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !((p174==0)))))] != FALSE + [(FwdU(FwdU(Init,TRUE),!(EX(!(FALSE)))) * ((p228==1)...179
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t12, t19, t28, t33, t34, t36, t37, t41, t42, t50, t59, t64, t65, ...381
(forward)formula 0,1,7.08526,234172,1,0,441,1.37513e+06,596,256,7098,1.0378e+06,617
FORMULA CO4-PT-09-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 324/324 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 219 transition count 309
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 219 transition count 309
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 219 transition count 308
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 213 transition count 299
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 213 transition count 299
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 209 transition count 294
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 209 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 209 transition count 293
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 206 transition count 290
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 206 transition count 290
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 54 place count 206 transition count 288
Applied a total of 54 rules in 6 ms. Remains 206 /231 variables (removed 25) and now considering 288/324 (removed 36) transitions.
// Phase 1: matrix 288 rows 206 cols
[2024-06-02 18:09:47] [INFO ] Computed 6 invariants in 4 ms
[2024-06-02 18:09:47] [INFO ] Implicit Places using invariants in 54 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 205/231 places, 288/324 transitions.
Applied a total of 0 rules in 1 ms. Remains 205 /205 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 205/231 places, 288/324 transitions.
[2024-06-02 18:09:47] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:09:47] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:09:47] [INFO ] Input system was already deterministic with 288 transitions.
[2024-06-02 18:09:47] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:09:47] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:09:47] [INFO ] Time to serialize gal into /tmp/CTLFireability18175382613545955985.gal : 4 ms
[2024-06-02 18:09:47] [INFO ] Time to serialize properties into /tmp/CTLFireability3523302101153467110.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/CTLFireability18175382613545955985.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3523302101153467110.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,1.22104e+07,0.244385,14264,2,2917,5,35434,6,0,1104,43353,0


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

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

Starting structural reductions in SI_CTL mode, iteration 0 : 231/231 places, 324/324 transitions.
Graph (trivial) has 232 edges and 231 vertex of which 2 / 231 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 533 edges and 230 vertex of which 227 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 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 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 79 place count 226 transition count 242
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 81 rules applied. Total rules applied 160 place count 149 transition count 238
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 162 place count 147 transition count 238
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 162 place count 147 transition count 219
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 200 place count 128 transition count 219
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 206 place count 122 transition count 209
Iterating global reduction 3 with 6 rules applied. Total rules applied 212 place count 122 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 213 place count 122 transition count 208
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 213 place count 122 transition count 207
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 215 place count 121 transition count 207
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 216 place count 120 transition count 205
Iterating global reduction 4 with 1 rules applied. Total rules applied 217 place count 120 transition count 205
Performed 16 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 249 place count 104 transition count 187
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 7 rules applied. Total rules applied 256 place count 104 transition count 180
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 5 rules applied. Total rules applied 261 place count 102 transition count 177
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 263 place count 101 transition count 176
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 265 place count 99 transition count 172
Iterating global reduction 7 with 2 rules applied. Total rules applied 267 place count 99 transition count 172
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 271 place count 97 transition count 170
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 274 place count 97 transition count 167
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 277 place count 96 transition count 165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 278 place count 95 transition count 165
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 284 place count 95 transition count 159
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 1 rules applied. Total rules applied 285 place count 95 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 286 place count 94 transition count 158
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 286 place count 94 transition count 157
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 288 place count 93 transition count 157
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 290 place count 92 transition count 156
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 12 with 4 rules applied. Total rules applied 294 place count 92 transition count 156
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 296 place count 90 transition count 154
Applied a total of 296 rules in 57 ms. Remains 90 /231 variables (removed 141) and now considering 154/324 (removed 170) transitions.
// Phase 1: matrix 154 rows 90 cols
[2024-06-02 18:09:50] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 18:09:50] [INFO ] Implicit Places using invariants in 35 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 89/231 places, 154/324 transitions.
Applied a total of 0 rules in 4 ms. Remains 89 /89 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 99 ms. Remains : 89/231 places, 154/324 transitions.
[2024-06-02 18:09:50] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:09:50] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:09:50] [INFO ] Input system was already deterministic with 154 transitions.
[2024-06-02 18:09:50] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:09:50] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:09:50] [INFO ] Time to serialize gal into /tmp/CTLFireability10758676767512752113.gal : 3 ms
[2024-06-02 18:09:50] [INFO ] Time to serialize properties into /tmp/CTLFireability4320008078048136116.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/CTLFireability10758676767512752113.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4320008078048136116.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,195361,0.050691,5572,2,702,5,7635,6,0,502,5024,0


Converting to forward existential form...Done !
original formula: E(A(AF((((p300==1)&&(p311==1))&&(p448==1))) U (((p300==1)&&(p307==1))&&(p356==1))) U !(((p270!=1)||(p409==1))))
=> equivalent forward existential formula: [(FwdU(Init,!((E(!((((p300==1)&&(p307==1))&&(p356==1))) U (!(!(EG(!((((p300==1)&&(p311==1))&&(p448==1)))))) * !(...280
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t9, t15, t34, t42, t48, t65, t113, t116, t117, t120, Intersection with reachable...227
(forward)formula 0,0,1.74762,73452,1,0,592,388457,342,286,3493,426866,746
FORMULA CO4-PT-09-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-06-02 18:09:52] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:09:52] [INFO ] Flatten gal took : 6 ms
Total runtime 162454 ms.

BK_STOP 1717351792809

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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-09"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is CO4-PT-09, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r550-tall-171734898500066"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-09.tgz
mv CO4-PT-09 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.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 ;