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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K 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 132K 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-11-CTLFireability-2024-00
FORMULA_NAME CO4-PT-11-CTLFireability-2024-01
FORMULA_NAME CO4-PT-11-CTLFireability-2024-02
FORMULA_NAME CO4-PT-11-CTLFireability-2024-03
FORMULA_NAME CO4-PT-11-CTLFireability-2024-04
FORMULA_NAME CO4-PT-11-CTLFireability-2024-05
FORMULA_NAME CO4-PT-11-CTLFireability-2024-06
FORMULA_NAME CO4-PT-11-CTLFireability-2024-07
FORMULA_NAME CO4-PT-11-CTLFireability-2024-08
FORMULA_NAME CO4-PT-11-CTLFireability-2024-09
FORMULA_NAME CO4-PT-11-CTLFireability-2024-10
FORMULA_NAME CO4-PT-11-CTLFireability-2024-11
FORMULA_NAME CO4-PT-11-CTLFireability-2024-12
FORMULA_NAME CO4-PT-11-CTLFireability-2024-13
FORMULA_NAME CO4-PT-11-CTLFireability-2024-14
FORMULA_NAME CO4-PT-11-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717351837145

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-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 18:10:38] [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:10:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:10:38] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-06-02 18:10:38] [INFO ] Transformed 545 places.
[2024-06-02 18:10:38] [INFO ] Transformed 617 transitions.
[2024-06-02 18:10:38] [INFO ] Found NUPN structural information;
[2024-06-02 18:10:38] [INFO ] Parsed PT model containing 545 places and 617 transitions and 1344 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Deduced a syphon composed of 157 places in 15 ms
Reduce places removed 157 places and 177 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-11-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 62 out of 388 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 388/388 places, 440/440 transitions.
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 376 transition count 437
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 66 place count 325 transition count 385
Iterating global reduction 1 with 51 rules applied. Total rules applied 117 place count 325 transition count 385
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 152 place count 290 transition count 350
Iterating global reduction 1 with 35 rules applied. Total rules applied 187 place count 290 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 188 place count 290 transition count 349
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 204 place count 274 transition count 333
Iterating global reduction 2 with 16 rules applied. Total rules applied 220 place count 274 transition count 333
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 229 place count 265 transition count 324
Iterating global reduction 2 with 9 rules applied. Total rules applied 238 place count 265 transition count 324
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 239 place count 265 transition count 323
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 241 place count 263 transition count 321
Iterating global reduction 3 with 2 rules applied. Total rules applied 243 place count 263 transition count 321
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 244 place count 262 transition count 320
Iterating global reduction 3 with 1 rules applied. Total rules applied 245 place count 262 transition count 320
Applied a total of 245 rules in 102 ms. Remains 262 /388 variables (removed 126) and now considering 320/440 (removed 120) transitions.
// Phase 1: matrix 320 rows 262 cols
[2024-06-02 18:10:38] [INFO ] Computed 4 invariants in 19 ms
[2024-06-02 18:10:38] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-06-02 18:10:38] [INFO ] Invariant cache hit.
[2024-06-02 18:10:39] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Running 319 sub problems to find dead transitions.
[2024-06-02 18:10:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (OVERLAPS) 1/262 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (OVERLAPS) 320/582 variables, 262/266 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-06-02 18:10:46] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 19 ms to minimize.
[2024-06-02 18:10:46] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/582 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (OVERLAPS) 0/582 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Real declared 582/582 variables, and 268 constraints, problems are : Problem set: 0 solved, 319 unsolved in 16743 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 319 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (OVERLAPS) 1/262 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (OVERLAPS) 320/582 variables, 262/268 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 319/587 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 7 (OVERLAPS) 0/582 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Int declared 582/582 variables, and 587 constraints, problems are : Problem set: 0 solved, 319 unsolved in 22175 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 2/2 constraints]
After SMT, in 39035ms problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 39061ms
Starting structural reductions in LTL mode, iteration 1 : 262/388 places, 320/440 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39600 ms. Remains : 262/388 places, 320/440 transitions.
Support contains 62 out of 262 places after structural reductions.
[2024-06-02 18:11:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 18:11:18] [INFO ] Flatten gal took : 43 ms
[2024-06-02 18:11:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CO4-PT-11-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:11:18] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:11:18] [INFO ] Input system was already deterministic with 320 transitions.
Support contains 48 out of 262 places (down from 62) after GAL structural reductions.
RANDOM walk for 40000 steps (36 resets) in 1726 ms. (23 steps per ms) remains 26/32 properties
BEST_FIRST walk for 4004 steps (39 resets) in 81 ms. (48 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4000 steps (23 resets) in 128 ms. (31 steps per ms) remains 23/25 properties
BEST_FIRST walk for 4001 steps (23 resets) in 80 ms. (49 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (23 resets) in 29 ms. (133 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4001 steps (16 resets) in 59 ms. (66 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (24 resets) in 63 ms. (62 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (20 resets) in 58 ms. (67 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (39 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (27 resets) in 17 ms. (222 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4001 steps (31 resets) in 27 ms. (142 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (37 resets) in 18 ms. (210 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (49 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (36 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (37 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (30 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (24 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (30 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (24 resets) in 38 ms. (102 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (29 resets) in 30 ms. (129 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4001 steps (30 resets) in 25 ms. (153 steps per ms) remains 19/19 properties
[2024-06-02 18:11:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 24/54 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 115/169 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 197/366 variables, 87/145 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 123/489 variables, 69/214 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 57/546 variables, 31/245 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/546 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 26/572 variables, 15/260 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/572 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 9/581 variables, 5/265 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/581 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 15 (OVERLAPS) 1/582 variables, 1/266 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/582 variables, 0/266 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 17 (OVERLAPS) 0/582 variables, 0/266 constraints. Problems are: Problem set: 1 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 582/582 variables, and 266 constraints, problems are : Problem set: 1 solved, 18 unsolved in 1307 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 24/50 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 109/159 variables, 50/54 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 2/56 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 194/353 variables, 85/141 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 16/157 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 132/485 variables, 72/229 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 0/229 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 60/545 variables, 33/262 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/545 variables, 0/262 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 27/572 variables, 16/278 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/572 variables, 0/278 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 9/581 variables, 5/283 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/581 variables, 0/283 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 17 (OVERLAPS) 1/582 variables, 1/284 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/582 variables, 0/284 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 19 (OVERLAPS) 0/582 variables, 0/284 constraints. Problems are: Problem set: 1 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 582/582 variables, and 284 constraints, problems are : Problem set: 1 solved, 18 unsolved in 1911 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 18/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 3232ms problems are : Problem set: 1 solved, 18 unsolved
Parikh walk visited 16 properties in 4336 ms.
Support contains 5 out of 262 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 262/262 places, 320/320 transitions.
Graph (trivial) has 258 edges and 262 vertex of which 3 / 262 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 396 edges and 260 vertex of which 243 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 130 rules applied. Total rules applied 132 place count 243 transition count 174
Reduce places removed 116 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 118 rules applied. Total rules applied 250 place count 127 transition count 172
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 252 place count 125 transition count 172
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 252 place count 125 transition count 160
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 276 place count 113 transition count 160
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 283 place count 106 transition count 153
Iterating global reduction 3 with 7 rules applied. Total rules applied 290 place count 106 transition count 153
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 290 place count 106 transition count 150
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 296 place count 103 transition count 150
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 300 place count 99 transition count 145
Iterating global reduction 3 with 4 rules applied. Total rules applied 304 place count 99 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 305 place count 99 transition count 144
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 306 place count 98 transition count 143
Iterating global reduction 4 with 1 rules applied. Total rules applied 307 place count 98 transition count 143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 308 place count 98 transition count 142
Performed 40 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 388 place count 58 transition count 94
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 391 place count 58 transition count 91
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 394 place count 55 transition count 88
Iterating global reduction 6 with 3 rules applied. Total rules applied 397 place count 55 transition count 88
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 401 place count 53 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 402 place count 53 transition count 85
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 426 place count 41 transition count 86
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 433 place count 41 transition count 79
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 442 place count 32 transition count 61
Iterating global reduction 8 with 9 rules applied. Total rules applied 451 place count 32 transition count 61
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 457 place count 32 transition count 55
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 460 place count 29 transition count 46
Iterating global reduction 9 with 3 rules applied. Total rules applied 463 place count 29 transition count 46
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 465 place count 29 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 467 place count 29 transition count 42
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 468 place count 29 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 469 place count 28 transition count 41
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 470 place count 28 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 471 place count 27 transition count 40
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 10 edges and 26 vertex of which 2 / 26 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 11 with 2 rules applied. Total rules applied 473 place count 25 transition count 40
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 475 place count 25 transition count 38
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 476 place count 24 transition count 37
Iterating global reduction 13 with 1 rules applied. Total rules applied 477 place count 24 transition count 37
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 13 with 2 rules applied. Total rules applied 479 place count 23 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 13 with 4 rules applied. Total rules applied 483 place count 23 transition count 32
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 485 place count 21 transition count 30
Iterating global reduction 13 with 2 rules applied. Total rules applied 487 place count 21 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 488 place count 21 transition count 29
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 489 place count 20 transition count 28
Iterating global reduction 14 with 1 rules applied. Total rules applied 490 place count 20 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 491 place count 20 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 492 place count 20 transition count 26
Free-agglomeration rule applied 2 times.
Iterating global reduction 15 with 2 rules applied. Total rules applied 494 place count 20 transition count 24
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 496 place count 18 transition count 24
Applied a total of 496 rules in 95 ms. Remains 18 /262 variables (removed 244) and now considering 24/320 (removed 296) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 18/262 places, 24/320 transitions.
RANDOM walk for 1512 steps (163 resets) in 25 ms. (58 steps per ms) remains 0/2 properties
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
[2024-06-02 18:11:27] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:11:27] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:11:27] [INFO ] Input system was already deterministic with 320 transitions.
Computed a total of 18 stabilizing places and 20 stable transitions
Graph (complete) has 399 edges and 262 vertex of which 254 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 320/320 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 237 transition count 294
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 237 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 237 transition count 293
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 67 place count 221 transition count 277
Iterating global reduction 1 with 16 rules applied. Total rules applied 83 place count 221 transition count 277
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 85 place count 221 transition count 275
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 94 place count 212 transition count 266
Iterating global reduction 2 with 9 rules applied. Total rules applied 103 place count 212 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 212 transition count 265
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 108 place count 208 transition count 261
Iterating global reduction 3 with 4 rules applied. Total rules applied 112 place count 208 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 113 place count 208 transition count 260
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 115 place count 206 transition count 258
Iterating global reduction 4 with 2 rules applied. Total rules applied 117 place count 206 transition count 258
Applied a total of 117 rules in 20 ms. Remains 206 /262 variables (removed 56) and now considering 258/320 (removed 62) transitions.
// Phase 1: matrix 258 rows 206 cols
[2024-06-02 18:11:27] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 18:11:27] [INFO ] Implicit Places using invariants in 57 ms returned [6]
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 : 205/262 places, 258/320 transitions.
Applied a total of 0 rules in 4 ms. Remains 205 /205 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 82 ms. Remains : 205/262 places, 258/320 transitions.
[2024-06-02 18:11:27] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:11:27] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:11:27] [INFO ] Input system was already deterministic with 258 transitions.
[2024-06-02 18:11:27] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:11:27] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:11:27] [INFO ] Time to serialize gal into /tmp/CTLFireability7583629803503535554.gal : 5 ms
[2024-06-02 18:11:27] [INFO ] Time to serialize properties into /tmp/CTLFireability8754231765423399911.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/CTLFireability7583629803503535554.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8754231765423399911.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,459604,0.108102,7396,2,1308,5,13523,6,0,1076,14467,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.119321,7396,1,0,6,13523,7,1,1269,14467,1
FORMULA CO4-PT-11-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 320/320 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 238 transition count 295
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 238 transition count 295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 238 transition count 294
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 65 place count 222 transition count 278
Iterating global reduction 1 with 16 rules applied. Total rules applied 81 place count 222 transition count 278
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 83 place count 222 transition count 276
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 92 place count 213 transition count 267
Iterating global reduction 2 with 9 rules applied. Total rules applied 101 place count 213 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 102 place count 213 transition count 266
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 106 place count 209 transition count 262
Iterating global reduction 3 with 4 rules applied. Total rules applied 110 place count 209 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 111 place count 209 transition count 261
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 113 place count 207 transition count 259
Iterating global reduction 4 with 2 rules applied. Total rules applied 115 place count 207 transition count 259
Applied a total of 115 rules in 20 ms. Remains 207 /262 variables (removed 55) and now considering 259/320 (removed 61) transitions.
// Phase 1: matrix 259 rows 207 cols
[2024-06-02 18:11:27] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 18:11:27] [INFO ] Implicit Places using invariants in 62 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 206/262 places, 259/320 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 259/259 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 206/262 places, 259/320 transitions.
[2024-06-02 18:11:27] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:11:27] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:11:27] [INFO ] Input system was already deterministic with 259 transitions.
[2024-06-02 18:11:27] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:11:27] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:11:27] [INFO ] Time to serialize gal into /tmp/CTLFireability7045509792627354970.gal : 3 ms
[2024-06-02 18:11:27] [INFO ] Time to serialize properties into /tmp/CTLFireability2234525656248846923.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/CTLFireability7045509792627354970.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2234525656248846923.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,462532,0.101094,7456,2,1315,5,13596,6,0,1080,14557,0


Converting to forward existential form...Done !
original formula: AX(AX((((p483==1)&&(p250==0))&&((p530==0)||(p0==0)))))
=> equivalent forward existential formula: [(EY(EY(Init)) * !((((p483==1)&&(p250==0))&&((p530==0)||(p0==0)))))] = FALSE
(forward)formula 0,0,0.11462,7720,1,0,10,13596,9,2,1298,14557,3
FORMULA CO4-PT-11-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 320/320 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 238 transition count 295
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 238 transition count 295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 238 transition count 294
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 64 place count 223 transition count 279
Iterating global reduction 1 with 15 rules applied. Total rules applied 79 place count 223 transition count 279
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 81 place count 223 transition count 277
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 89 place count 215 transition count 269
Iterating global reduction 2 with 8 rules applied. Total rules applied 97 place count 215 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 215 transition count 268
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 102 place count 211 transition count 264
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 211 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 107 place count 211 transition count 263
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 109 place count 209 transition count 261
Iterating global reduction 4 with 2 rules applied. Total rules applied 111 place count 209 transition count 261
Applied a total of 111 rules in 19 ms. Remains 209 /262 variables (removed 53) and now considering 261/320 (removed 59) transitions.
// Phase 1: matrix 261 rows 209 cols
[2024-06-02 18:11:27] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:11:27] [INFO ] Implicit Places using invariants in 59 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 208/262 places, 261/320 transitions.
Applied a total of 0 rules in 2 ms. Remains 208 /208 variables (removed 0) and now considering 261/261 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 83 ms. Remains : 208/262 places, 261/320 transitions.
[2024-06-02 18:11:27] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:11:27] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:11:27] [INFO ] Input system was already deterministic with 261 transitions.
[2024-06-02 18:11:27] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:11:27] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:11:27] [INFO ] Time to serialize gal into /tmp/CTLFireability16871220183063741628.gal : 2 ms
[2024-06-02 18:11:27] [INFO ] Time to serialize properties into /tmp/CTLFireability17198285962894641123.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/CTLFireability16871220183063741628.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17198285962894641123.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,468388,0.099936,7732,2,1329,5,14597,6,0,1091,16544,0


Converting to forward existential form...Done !
original formula: AF((((p328==1) * EF(!(E(((p428==1)&&(p434==1)) U ((p160==1)&&(p530==1)))))) * EX(TRUE)))
=> equivalent forward existential formula: [FwdG(Init,!((((p328==1) * E(TRUE U !(E(((p428==1)&&(p434==1)) U ((p160==1)&&(p530==1)))))) * EX(TRUE))))] = FAL...157
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t22, t30, t39, t41, t42, t43, t44, t45, t47, t50, t94, t15...300
(forward)formula 0,0,2.5632,92604,1,0,598,298950,554,410,6125,595067,744
FORMULA CO4-PT-11-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 320/320 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 238 transition count 295
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 238 transition count 295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 238 transition count 294
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 65 place count 222 transition count 278
Iterating global reduction 1 with 16 rules applied. Total rules applied 81 place count 222 transition count 278
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 83 place count 222 transition count 276
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 92 place count 213 transition count 267
Iterating global reduction 2 with 9 rules applied. Total rules applied 101 place count 213 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 102 place count 213 transition count 266
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 106 place count 209 transition count 262
Iterating global reduction 3 with 4 rules applied. Total rules applied 110 place count 209 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 111 place count 209 transition count 261
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 113 place count 207 transition count 259
Iterating global reduction 4 with 2 rules applied. Total rules applied 115 place count 207 transition count 259
Applied a total of 115 rules in 15 ms. Remains 207 /262 variables (removed 55) and now considering 259/320 (removed 61) transitions.
// Phase 1: matrix 259 rows 207 cols
[2024-06-02 18:11:30] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:11:30] [INFO ] Implicit Places using invariants in 61 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 206/262 places, 259/320 transitions.
Applied a total of 0 rules in 2 ms. Remains 206 /206 variables (removed 0) and now considering 259/259 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 79 ms. Remains : 206/262 places, 259/320 transitions.
[2024-06-02 18:11:30] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:11:30] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:11:30] [INFO ] Input system was already deterministic with 259 transitions.
[2024-06-02 18:11:30] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:11:30] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:11:30] [INFO ] Time to serialize gal into /tmp/CTLFireability17808728491024110778.gal : 2 ms
[2024-06-02 18:11:30] [INFO ] Time to serialize properties into /tmp/CTLFireability4708178085670630339.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/CTLFireability17808728491024110778.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4708178085670630339.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,462532,0.092399,7456,2,1315,5,13633,6,0,1081,14651,0


Converting to forward existential form...Done !
original formula: (AX(EX(TRUE)) + EF(AG((p370==1))))
=> equivalent forward existential formula: [(EY((Init * !(E(TRUE U !(E(TRUE U !((p370==1)))))))) * !(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t22, t30, t39, t41, t42, t43, t44, t45, t47, t50, t94, t14...300
(forward)formula 0,1,0.887457,35892,1,0,336,104168,540,222,6055,107188,531
FORMULA CO4-PT-11-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 320/320 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 238 transition count 295
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 238 transition count 295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 238 transition count 294
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 64 place count 223 transition count 279
Iterating global reduction 1 with 15 rules applied. Total rules applied 79 place count 223 transition count 279
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 81 place count 223 transition count 277
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 89 place count 215 transition count 269
Iterating global reduction 2 with 8 rules applied. Total rules applied 97 place count 215 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 215 transition count 268
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 102 place count 211 transition count 264
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 211 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 107 place count 211 transition count 263
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 109 place count 209 transition count 261
Iterating global reduction 4 with 2 rules applied. Total rules applied 111 place count 209 transition count 261
Applied a total of 111 rules in 11 ms. Remains 209 /262 variables (removed 53) and now considering 261/320 (removed 59) transitions.
// Phase 1: matrix 261 rows 209 cols
[2024-06-02 18:11:31] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:11:31] [INFO ] Implicit Places using invariants in 60 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 208/262 places, 261/320 transitions.
Applied a total of 0 rules in 1 ms. Remains 208 /208 variables (removed 0) and now considering 261/261 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 73 ms. Remains : 208/262 places, 261/320 transitions.
[2024-06-02 18:11:31] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:11:31] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:11:31] [INFO ] Input system was already deterministic with 261 transitions.
[2024-06-02 18:11:31] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:11:31] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:11:31] [INFO ] Time to serialize gal into /tmp/CTLFireability10062951252802331334.gal : 1 ms
[2024-06-02 18:11:31] [INFO ] Time to serialize properties into /tmp/CTLFireability9204496166677684236.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/CTLFireability10062951252802331334.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9204496166677684236.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,468388,0.09664,7464,2,1329,5,13811,6,0,1091,14881,0


Converting to forward existential form...Done !
original formula: AF(AX((p386==1)))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((p386==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t13, t14, t15, t16, t17, t23, t31, t40, t42, t43, t44, t45, t46, t48, t51, t96, t15...300
(forward)formula 0,0,2.76217,92724,1,0,601,280438,545,402,5823,619819,730
FORMULA CO4-PT-11-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 320/320 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 237 transition count 294
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 237 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 237 transition count 293
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 67 place count 221 transition count 277
Iterating global reduction 1 with 16 rules applied. Total rules applied 83 place count 221 transition count 277
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 85 place count 221 transition count 275
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 94 place count 212 transition count 266
Iterating global reduction 2 with 9 rules applied. Total rules applied 103 place count 212 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 212 transition count 265
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 108 place count 208 transition count 261
Iterating global reduction 3 with 4 rules applied. Total rules applied 112 place count 208 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 113 place count 208 transition count 260
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 115 place count 206 transition count 258
Iterating global reduction 4 with 2 rules applied. Total rules applied 117 place count 206 transition count 258
Applied a total of 117 rules in 9 ms. Remains 206 /262 variables (removed 56) and now considering 258/320 (removed 62) transitions.
// Phase 1: matrix 258 rows 206 cols
[2024-06-02 18:11:34] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:11:34] [INFO ] Implicit Places using invariants in 52 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 205/262 places, 258/320 transitions.
Applied a total of 0 rules in 2 ms. Remains 205 /205 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64 ms. Remains : 205/262 places, 258/320 transitions.
[2024-06-02 18:11:34] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:11:34] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:11:34] [INFO ] Input system was already deterministic with 258 transitions.
[2024-06-02 18:11:34] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:11:34] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:11:34] [INFO ] Time to serialize gal into /tmp/CTLFireability12144312988390580039.gal : 2 ms
[2024-06-02 18:11:34] [INFO ] Time to serialize properties into /tmp/CTLFireability3765821054830354855.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/CTLFireability12144312988390580039.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3765821054830354855.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,459604,0.095135,7192,2,1308,5,13523,6,0,1076,14467,0


Converting to forward existential form...Done !
original formula: AF(AX(FALSE))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(FALSE)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t22, t30, t39, t41, t42, t43, t44, t45, t47, t50, t94, t14...300
(forward)formula 0,0,2.69606,90716,1,0,597,269367,537,399,5750,597795,723
FORMULA CO4-PT-11-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 320/320 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 237 transition count 294
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 237 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 237 transition count 293
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 67 place count 221 transition count 277
Iterating global reduction 1 with 16 rules applied. Total rules applied 83 place count 221 transition count 277
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 85 place count 221 transition count 275
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 94 place count 212 transition count 266
Iterating global reduction 2 with 9 rules applied. Total rules applied 103 place count 212 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 212 transition count 265
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 108 place count 208 transition count 261
Iterating global reduction 3 with 4 rules applied. Total rules applied 112 place count 208 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 113 place count 208 transition count 260
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 115 place count 206 transition count 258
Iterating global reduction 4 with 2 rules applied. Total rules applied 117 place count 206 transition count 258
Applied a total of 117 rules in 9 ms. Remains 206 /262 variables (removed 56) and now considering 258/320 (removed 62) transitions.
[2024-06-02 18:11:37] [INFO ] Invariant cache hit.
[2024-06-02 18:11:37] [INFO ] Implicit Places using invariants in 55 ms returned [6]
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/262 places, 258/320 transitions.
Applied a total of 0 rules in 2 ms. Remains 205 /205 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 205/262 places, 258/320 transitions.
[2024-06-02 18:11:37] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:11:37] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:11:37] [INFO ] Input system was already deterministic with 258 transitions.
[2024-06-02 18:11:37] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:11:37] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:11:37] [INFO ] Time to serialize gal into /tmp/CTLFireability12492700644860685220.gal : 5 ms
[2024-06-02 18:11:37] [INFO ] Time to serialize properties into /tmp/CTLFireability10416859608374180042.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/CTLFireability12492700644860685220.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10416859608374180042.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,459604,0.096224,7196,2,1308,5,13523,6,0,1076,14467,0


Converting to forward existential form...Done !
original formula: EG(EX(TRUE))
=> equivalent forward existential formula: [FwdG(Init,EX(TRUE))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t22, t30, t39, t41, t42, t43, t44, t45, t47, t50, t94, t14...300
(forward)formula 0,1,2.63593,90700,1,0,597,269367,537,399,5736,597800,723
FORMULA CO4-PT-11-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 320/320 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 237 transition count 294
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 237 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 237 transition count 293
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 67 place count 221 transition count 277
Iterating global reduction 1 with 16 rules applied. Total rules applied 83 place count 221 transition count 277
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 85 place count 221 transition count 275
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 94 place count 212 transition count 266
Iterating global reduction 2 with 9 rules applied. Total rules applied 103 place count 212 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 212 transition count 265
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 108 place count 208 transition count 261
Iterating global reduction 3 with 4 rules applied. Total rules applied 112 place count 208 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 113 place count 208 transition count 260
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 115 place count 206 transition count 258
Iterating global reduction 4 with 2 rules applied. Total rules applied 117 place count 206 transition count 258
Applied a total of 117 rules in 9 ms. Remains 206 /262 variables (removed 56) and now considering 258/320 (removed 62) transitions.
[2024-06-02 18:11:40] [INFO ] Invariant cache hit.
[2024-06-02 18:11:40] [INFO ] Implicit Places using invariants in 50 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 205/262 places, 258/320 transitions.
Applied a total of 0 rules in 2 ms. Remains 205 /205 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 72 ms. Remains : 205/262 places, 258/320 transitions.
[2024-06-02 18:11:40] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:11:40] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:11:40] [INFO ] Input system was already deterministic with 258 transitions.
[2024-06-02 18:11:40] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:11:40] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:11:40] [INFO ] Time to serialize gal into /tmp/CTLFireability7123191306028764518.gal : 3 ms
[2024-06-02 18:11:40] [INFO ] Time to serialize properties into /tmp/CTLFireability11244899514454167433.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/CTLFireability7123191306028764518.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11244899514454167433.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,459604,0.097218,7192,2,1308,5,13523,6,0,1076,14467,0


Converting to forward existential form...Done !
original formula: AF(!(A(EX(TRUE) U EG((p486==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(EG((p486==1))) U (!(EX(TRUE)) * !(EG((p486==1))))) + EG(!(EG((p486==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t22, t30, t39, t41, t42, t43, t44, t45, t47, t50, t94, t14...300
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,5.4657,168988,1,0,866,806897,548,532,6033,1.02982e+06,1118
FORMULA CO4-PT-11-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 262/262 places, 320/320 transitions.
Graph (trivial) has 270 edges and 262 vertex of which 3 / 262 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 397 edges and 260 vertex of which 252 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 117 place count 251 transition count 193
Reduce places removed 115 places and 0 transitions.
Iterating post reduction 1 with 115 rules applied. Total rules applied 232 place count 136 transition count 193
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 232 place count 136 transition count 181
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 256 place count 124 transition count 181
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 263 place count 117 transition count 173
Iterating global reduction 2 with 7 rules applied. Total rules applied 270 place count 117 transition count 173
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 270 place count 117 transition count 170
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 276 place count 114 transition count 170
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 279 place count 111 transition count 167
Iterating global reduction 2 with 3 rules applied. Total rules applied 282 place count 111 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 283 place count 111 transition count 166
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 329 place count 88 transition count 143
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 3 with 5 rules applied. Total rules applied 334 place count 88 transition count 138
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 337 place count 86 transition count 137
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 340 place count 83 transition count 134
Iterating global reduction 5 with 3 rules applied. Total rules applied 343 place count 83 transition count 134
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 352 place count 83 transition count 125
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 4 rules applied. Total rules applied 356 place count 83 transition count 121
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 360 place count 79 transition count 121
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 362 place count 78 transition count 120
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 364 place count 76 transition count 118
Applied a total of 364 rules in 49 ms. Remains 76 /262 variables (removed 186) and now considering 118/320 (removed 202) transitions.
// Phase 1: matrix 118 rows 76 cols
[2024-06-02 18:11:45] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 18:11:45] [INFO ] Implicit Places using invariants in 33 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 75/262 places, 118/320 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 86 ms. Remains : 75/262 places, 118/320 transitions.
[2024-06-02 18:11:45] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:11:45] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:11:45] [INFO ] Input system was already deterministic with 118 transitions.
[2024-06-02 18:11:45] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:11:45] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:11:45] [INFO ] Time to serialize gal into /tmp/CTLFireability15425072220841968956.gal : 5 ms
[2024-06-02 18:11:45] [INFO ] Time to serialize properties into /tmp/CTLFireability265518044219301703.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/CTLFireability15425072220841968956.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability265518044219301703.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,16849,0.030429,3964,2,233,5,2280,6,0,410,2123,0


Converting to forward existential form...Done !
original formula: AG(EF((p454==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p454==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t11, t26, t41, t46, t75, Intersection with reachable at each step enabled. (destroyed/re...190
(forward)formula 0,1,0.137006,7712,1,0,153,20669,256,81,2470,15659,245
FORMULA CO4-PT-11-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 320/320 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 242 transition count 299
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 242 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 242 transition count 298
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 52 place count 231 transition count 287
Iterating global reduction 1 with 11 rules applied. Total rules applied 63 place count 231 transition count 287
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 231 transition count 285
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 71 place count 225 transition count 279
Iterating global reduction 2 with 6 rules applied. Total rules applied 77 place count 225 transition count 279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 225 transition count 278
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 81 place count 222 transition count 275
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 222 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 85 place count 222 transition count 274
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 86 place count 221 transition count 273
Iterating global reduction 4 with 1 rules applied. Total rules applied 87 place count 221 transition count 273
Applied a total of 87 rules in 25 ms. Remains 221 /262 variables (removed 41) and now considering 273/320 (removed 47) transitions.
// Phase 1: matrix 273 rows 221 cols
[2024-06-02 18:11:45] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:11:46] [INFO ] Implicit Places using invariants in 428 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 432 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 220/262 places, 273/320 transitions.
Applied a total of 0 rules in 2 ms. Remains 220 /220 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 459 ms. Remains : 220/262 places, 273/320 transitions.
[2024-06-02 18:11:46] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:11:46] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:11:46] [INFO ] Input system was already deterministic with 273 transitions.
[2024-06-02 18:11:46] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:11:46] [INFO ] Flatten gal took : 21 ms
[2024-06-02 18:11:46] [INFO ] Time to serialize gal into /tmp/CTLFireability18070524938868903518.gal : 2 ms
[2024-06-02 18:11:46] [INFO ] Time to serialize properties into /tmp/CTLFireability18342375574020717118.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/CTLFireability18070524938868903518.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18342375574020717118.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,497974,0.104289,6980,2,1125,5,11772,6,0,1150,11914,0


Converting to forward existential form...Done !
original formula: (AF((p357==0)) * EX((E((E((p208==1) U (p439==1)) + EG((p356==1))) U (p116!=1)) * (AG(((p155==1)&&(p471==1))) + (E((p386!=1) U (p418==1)) ...193
=> equivalent forward existential formula: ([FwdG(Init,!((p357==0)))] = FALSE * [(Init * !(EX((E((E((p208==1) U (p439==1)) + EG((p356==1))) U (p116!=1)) * ...284
Reverse transition relation is NOT exact ! Due to transitions t13, t14, t15, t16, t17, t18, t19, t25, t33, t42, t46, t47, t48, t49, t51, t54, t155, t191, t...272
(forward)formula 0,1,8.37002,266656,1,0,1289,1.29559e+06,604,675,6426,1.73194e+06,1686
FORMULA CO4-PT-11-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 320/320 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 239 transition count 296
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 239 transition count 296
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 239 transition count 295
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 62 place count 224 transition count 280
Iterating global reduction 1 with 15 rules applied. Total rules applied 77 place count 224 transition count 280
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 79 place count 224 transition count 278
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 87 place count 216 transition count 270
Iterating global reduction 2 with 8 rules applied. Total rules applied 95 place count 216 transition count 270
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 98 place count 213 transition count 267
Iterating global reduction 2 with 3 rules applied. Total rules applied 101 place count 213 transition count 267
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 212 transition count 266
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 212 transition count 266
Applied a total of 103 rules in 14 ms. Remains 212 /262 variables (removed 50) and now considering 266/320 (removed 54) transitions.
// Phase 1: matrix 266 rows 212 cols
[2024-06-02 18:11:54] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:11:54] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 18:11:54] [INFO ] Invariant cache hit.
[2024-06-02 18:11:55] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 265 sub problems to find dead transitions.
[2024-06-02 18:11:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 266/478 variables, 212/216 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 18:11:59] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:11:59] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 18:12:03] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/478 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (OVERLAPS) 0/478 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/478 variables, and 219 constraints, problems are : Problem set: 0 solved, 265 unsolved in 14413 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (OVERLAPS) 266/478 variables, 212/219 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 265/484 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 0/478 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 478/478 variables, and 484 constraints, problems are : Problem set: 0 solved, 265 unsolved in 13776 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 3/3 constraints]
After SMT, in 28233ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 28236ms
Starting structural reductions in LTL mode, iteration 1 : 212/262 places, 266/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28411 ms. Remains : 212/262 places, 266/320 transitions.
[2024-06-02 18:12:23] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:12:23] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:12:23] [INFO ] Input system was already deterministic with 266 transitions.
[2024-06-02 18:12:23] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:12:23] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:12:23] [INFO ] Time to serialize gal into /tmp/CTLFireability15254314768626342168.gal : 2 ms
[2024-06-02 18:12:23] [INFO ] Time to serialize properties into /tmp/CTLFireability14402785658428927872.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/CTLFireability15254314768626342168.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14402785658428927872.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,498916,0.098116,7468,2,1509,5,14070,6,0,1112,14707,0


Converting to forward existential form...Done !
original formula: (A(((!((!(AX((p313==1))) + (p440==1))) * (p518==1)) * (p542==1)) U E(((EX((p453==1)) + ((p459==1)&&(p374==1))) + !(AF(((((p7==1)&&(p427==...244
=> equivalent forward existential formula: [FwdG(EY((Init * !((E(!(E(((EX((p453==1)) + ((p459==1)&&(p374==1))) + !(!(EG(!(((((p7==1)&&(p427==1))&&((p436==1...630
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t11, t12, t13, t14, t15, t16, t22, t30, t39, t41, t42, t43, t44, t45, t47, t49, t51,...333
(forward)formula 0,1,6.49087,196344,1,0,760,923528,575,414,6576,1.18803e+06,1037
FORMULA CO4-PT-11-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 320/320 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 242 transition count 299
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 242 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 242 transition count 298
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 55 place count 228 transition count 284
Iterating global reduction 1 with 14 rules applied. Total rules applied 69 place count 228 transition count 284
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 71 place count 228 transition count 282
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 79 place count 220 transition count 274
Iterating global reduction 2 with 8 rules applied. Total rules applied 87 place count 220 transition count 274
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 220 transition count 273
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 91 place count 217 transition count 270
Iterating global reduction 3 with 3 rules applied. Total rules applied 94 place count 217 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 217 transition count 269
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 97 place count 215 transition count 267
Iterating global reduction 4 with 2 rules applied. Total rules applied 99 place count 215 transition count 267
Applied a total of 99 rules in 16 ms. Remains 215 /262 variables (removed 47) and now considering 267/320 (removed 53) transitions.
// Phase 1: matrix 267 rows 215 cols
[2024-06-02 18:12:29] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 18:12:29] [INFO ] Implicit Places using invariants in 58 ms returned [6]
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 : 214/262 places, 267/320 transitions.
Applied a total of 0 rules in 2 ms. Remains 214 /214 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 76 ms. Remains : 214/262 places, 267/320 transitions.
[2024-06-02 18:12:29] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:12:29] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:12:29] [INFO ] Input system was already deterministic with 267 transitions.
[2024-06-02 18:12:29] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:12:29] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:12:29] [INFO ] Time to serialize gal into /tmp/CTLFireability17556195647919465648.gal : 1 ms
[2024-06-02 18:12:29] [INFO ] Time to serialize properties into /tmp/CTLFireability6731117270523239650.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/CTLFireability17556195647919465648.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6731117270523239650.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,485956,0.103451,8012,2,1363,5,14973,6,0,1121,18169,0


Converting to forward existential form...Done !
original formula: !(A(!((((p189==1) + AX(AX((p390==1)))) + AF((((p540==1)&&(p188==1))&&(p530==1))))) U ((E((p332==1) U (p348==1)) + (p130==1)) + (p414==1))...157
=> equivalent forward existential formula: ([((((FwdU(Init,!(((E((p332==1) U (p348==1)) + (p130==1)) + (p414==1)))) * !(!((((p189==1) + !(EX(!(!(EX(!((p390...372
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t22, t30, t39, t41, t42, t43, t44, t45, t47, t50, t97, t15...300
(forward)formula 0,1,7.46778,234256,1,0,1002,1.0117e+06,573,594,6001,1.55937e+06,1292
FORMULA CO4-PT-11-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-06-02 18:12:37] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:12:37] [INFO ] Flatten gal took : 5 ms
Total runtime 119278 ms.

BK_STOP 1717351957593

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CO4-PT-11"
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-11, 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-171734898500082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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