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.r356-tall-171683760600202.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 ShieldIIPt-PT-002B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760600202
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 12 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 20:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 12 20:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 34K May 18 16:43 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 ShieldIIPt-PT-002B-CTLFireability-2024-00
FORMULA_NAME ShieldIIPt-PT-002B-CTLFireability-2024-01
FORMULA_NAME ShieldIIPt-PT-002B-CTLFireability-2024-02
FORMULA_NAME ShieldIIPt-PT-002B-CTLFireability-2024-03
FORMULA_NAME ShieldIIPt-PT-002B-CTLFireability-2024-04
FORMULA_NAME ShieldIIPt-PT-002B-CTLFireability-2024-05
FORMULA_NAME ShieldIIPt-PT-002B-CTLFireability-2024-06
FORMULA_NAME ShieldIIPt-PT-002B-CTLFireability-2024-07
FORMULA_NAME ShieldIIPt-PT-002B-CTLFireability-2024-08
FORMULA_NAME ShieldIIPt-PT-002B-CTLFireability-2024-09
FORMULA_NAME ShieldIIPt-PT-002B-CTLFireability-2024-10
FORMULA_NAME ShieldIIPt-PT-002B-CTLFireability-2024-11
FORMULA_NAME ShieldIIPt-PT-002B-CTLFireability-2023-12
FORMULA_NAME ShieldIIPt-PT-002B-CTLFireability-2023-13
FORMULA_NAME ShieldIIPt-PT-002B-CTLFireability-2023-14
FORMULA_NAME ShieldIIPt-PT-002B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716924653180

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-002B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-28 19:30:54] [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-05-28 19:30:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 19:30:54] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2024-05-28 19:30:54] [INFO ] Transformed 143 places.
[2024-05-28 19:30:54] [INFO ] Transformed 133 transitions.
[2024-05-28 19:30:54] [INFO ] Found NUPN structural information;
[2024-05-28 19:30:54] [INFO ] Parsed PT model containing 143 places and 133 transitions and 330 arcs in 163 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Support contains 84 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 133/133 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 138 transition count 128
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 138 transition count 128
Applied a total of 10 rules in 25 ms. Remains 138 /143 variables (removed 5) and now considering 128/133 (removed 5) transitions.
// Phase 1: matrix 128 rows 138 cols
[2024-05-28 19:30:54] [INFO ] Computed 19 invariants in 10 ms
[2024-05-28 19:30:54] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-28 19:30:54] [INFO ] Invariant cache hit.
[2024-05-28 19:30:55] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 127 sub problems to find dead transitions.
[2024-05-28 19:30:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-28 19:30:55] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 17 ms to minimize.
[2024-05-28 19:30:55] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:30:55] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-28 19:30:56] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:30:56] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:30:56] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:30:56] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:30:56] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:30:56] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-28 19:30:56] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:30:56] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:30:56] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:30:56] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:30:56] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:30:56] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:30:56] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-05-28 19:30:56] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 0 ms to minimize.
[2024-05-28 19:30:56] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:30:56] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 1 ms to minimize.
[2024-05-28 19:30:56] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-28 19:30:56] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:30:57] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:30:57] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-28 19:30:57] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-28 19:30:57] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-28 19:30:58] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (OVERLAPS) 128/266 variables, 138/183 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-28 19:30:59] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-28 19:30:59] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-28 19:31:00] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 12 (OVERLAPS) 0/266 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 186 constraints, problems are : Problem set: 0 solved, 127 unsolved in 7493 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 29/48 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 128/266 variables, 138/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 127/313 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-28 19:31:03] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:31:03] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:31:03] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2024-05-28 19:31:03] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 2 ms to minimize.
[2024-05-28 19:31:04] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:31:04] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 6/319 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-28 19:31:05] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 19:31:05] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 0 ms to minimize.
[2024-05-28 19:31:05] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:31:05] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-28 19:31:05] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 2 ms to minimize.
[2024-05-28 19:31:05] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-05-28 19:31:05] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 7/326 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-28 19:31:06] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 10 (OVERLAPS) 0/266 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 327 constraints, problems are : Problem set: 0 solved, 127 unsolved in 7884 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 43/43 constraints]
After SMT, in 15418ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 15436ms
Starting structural reductions in LTL mode, iteration 1 : 138/143 places, 128/133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15851 ms. Remains : 138/143 places, 128/133 transitions.
Support contains 84 out of 138 places after structural reductions.
[2024-05-28 19:31:10] [INFO ] Flatten gal took : 28 ms
[2024-05-28 19:31:10] [INFO ] Flatten gal took : 11 ms
[2024-05-28 19:31:10] [INFO ] Input system was already deterministic with 128 transitions.
RANDOM walk for 40000 steps (8 resets) in 1050 ms. (38 steps per ms) remains 2/64 properties
BEST_FIRST walk for 40002 steps (8 resets) in 416 ms. (95 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
[2024-05-28 19:31:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 122/138 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 128/266 variables, 138/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/266 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 157 constraints, problems are : Problem set: 0 solved, 2 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 122/138 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 19:31:11] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 128/266 variables, 138/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 19:31:11] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 19:31:11] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-28 19:31:11] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:31:11] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:31:11] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 4/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/266 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 165 constraints, problems are : Problem set: 0 solved, 2 unsolved in 385 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 485ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 330 ms.
Support contains 16 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 128/128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 138 transition count 106
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 26 rules applied. Total rules applied 48 place count 116 transition count 102
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 51 place count 113 transition count 102
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 51 place count 113 transition count 92
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 71 place count 103 transition count 92
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 82 place count 92 transition count 81
Iterating global reduction 3 with 11 rules applied. Total rules applied 93 place count 92 transition count 81
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 93 place count 92 transition count 78
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 99 place count 89 transition count 78
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 149 place count 64 transition count 53
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 155 place count 61 transition count 54
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 156 place count 61 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 157 place count 60 transition count 53
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 159 place count 60 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 160 place count 59 transition count 52
Applied a total of 160 rules in 42 ms. Remains 59 /138 variables (removed 79) and now considering 52/128 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 59/138 places, 52/128 transitions.
RANDOM walk for 40000 steps (8 resets) in 482 ms. (82 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 263 ms. (151 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 742937 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :0 out of 2
Probabilistic random walk after 742937 steps, saw 350668 distinct states, run finished after 3004 ms. (steps per millisecond=247 ) properties seen :0
// Phase 1: matrix 52 rows 59 cols
[2024-05-28 19:31:15] [INFO ] Computed 19 invariants in 1 ms
[2024-05-28 19:31:15] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/59 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 52/111 variables, 59/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 6/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/111 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 84 constraints, problems are : Problem set: 0 solved, 2 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 59/59 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/59 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 52/111 variables, 59/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 6/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/111 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 86 constraints, problems are : Problem set: 0 solved, 2 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 59/59 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 171ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 104 ms.
Support contains 16 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 52/52 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 59/59 places, 52/52 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 52/52 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2024-05-28 19:31:15] [INFO ] Invariant cache hit.
[2024-05-28 19:31:15] [INFO ] Implicit Places using invariants in 40 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 58/59 places, 52/52 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 46 ms. Remains : 58/59 places, 52/52 transitions.
RANDOM walk for 40000 steps (8 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 905266 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :0 out of 2
Probabilistic random walk after 905266 steps, saw 418819 distinct states, run finished after 3001 ms. (steps per millisecond=301 ) properties seen :0
// Phase 1: matrix 52 rows 58 cols
[2024-05-28 19:31:18] [INFO ] Computed 18 invariants in 2 ms
[2024-05-28 19:31:18] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/58 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 52/110 variables, 58/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/110 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 80 constraints, problems are : Problem set: 0 solved, 2 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 58/58 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/58 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 19:31:18] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:31:18] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 52/110 variables, 58/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/110 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 84 constraints, problems are : Problem set: 0 solved, 2 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 58/58 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 212ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 204 ms.
Support contains 16 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 52/52 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 58/58 places, 52/52 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 52/52 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2024-05-28 19:31:19] [INFO ] Invariant cache hit.
[2024-05-28 19:31:19] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-28 19:31:19] [INFO ] Invariant cache hit.
[2024-05-28 19:31:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-28 19:31:19] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-05-28 19:31:19] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2024-05-28 19:31:19] [INFO ] Invariant cache hit.
[2024-05-28 19:31:19] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 4/58 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-28 19:31:19] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-28 19:31:19] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:31:19] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-28 19:31:19] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-28 19:31:19] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 52/110 variables, 58/81 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/110 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 85 constraints, problems are : Problem set: 0 solved, 48 unsolved in 700 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 58/58 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 4/58 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 52/110 variables, 58/81 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 48/133 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-28 19:31:20] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 0/110 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 134 constraints, problems are : Problem set: 0 solved, 48 unsolved in 848 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 58/58 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 6/6 constraints]
After SMT, in 1562ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1563ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1678 ms. Remains : 58/58 places, 52/52 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 58 transition count 52
Applied a total of 1 rules in 9 ms. Remains 58 /58 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 52 rows 58 cols
[2024-05-28 19:31:20] [INFO ] Computed 18 invariants in 0 ms
[2024-05-28 19:31:20] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 19:31:20] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2024-05-28 19:31:20] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 19:31:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:31:21] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-28 19:31:21] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:31:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
TRAPS : Iteration 1
[2024-05-28 19:31:21] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-28 19:31:21] [INFO ] After 123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 171 ms.
[2024-05-28 19:31:21] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:31:21] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:31:21] [INFO ] Input system was already deterministic with 128 transitions.
Computed a total of 38 stabilizing places and 38 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 138/138 places, 128/128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 138 transition count 99
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 109 transition count 97
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 64 place count 108 transition count 94
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 67 place count 105 transition count 94
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 67 place count 105 transition count 83
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 89 place count 94 transition count 83
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 101 place count 82 transition count 71
Iterating global reduction 4 with 12 rules applied. Total rules applied 113 place count 82 transition count 71
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 113 place count 82 transition count 67
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 121 place count 78 transition count 67
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 181 place count 48 transition count 37
Applied a total of 181 rules in 18 ms. Remains 48 /138 variables (removed 90) and now considering 37/128 (removed 91) transitions.
// Phase 1: matrix 37 rows 48 cols
[2024-05-28 19:31:21] [INFO ] Computed 19 invariants in 2 ms
[2024-05-28 19:31:21] [INFO ] Implicit Places using invariants in 50 ms returned [37, 38]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 46/138 places, 37/128 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 46 transition count 36
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 45 transition count 36
Applied a total of 2 rules in 3 ms. Remains 45 /46 variables (removed 1) and now considering 36/37 (removed 1) transitions.
// Phase 1: matrix 36 rows 45 cols
[2024-05-28 19:31:21] [INFO ] Computed 17 invariants in 0 ms
[2024-05-28 19:31:21] [INFO ] Implicit Places using invariants in 30 ms returned [31]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 44/138 places, 36/128 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 43 transition count 35
Applied a total of 2 rules in 2 ms. Remains 43 /44 variables (removed 1) and now considering 35/36 (removed 1) transitions.
// Phase 1: matrix 35 rows 43 cols
[2024-05-28 19:31:21] [INFO ] Computed 16 invariants in 0 ms
[2024-05-28 19:31:21] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-28 19:31:21] [INFO ] Invariant cache hit.
[2024-05-28 19:31:21] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 43/138 places, 35/128 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 185 ms. Remains : 43/138 places, 35/128 transitions.
[2024-05-28 19:31:21] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:31:21] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:31:21] [INFO ] Input system was already deterministic with 35 transitions.
[2024-05-28 19:31:21] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:31:21] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:31:21] [INFO ] Time to serialize gal into /tmp/CTLFireability8837984503209007473.gal : 1 ms
[2024-05-28 19:31:21] [INFO ] Time to serialize properties into /tmp/CTLFireability11553797838745372948.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/CTLFireability8837984503209007473.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11553797838745372948.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.86624e+06,0.028263,4356,2,180,5,4762,6,0,209,6130,0


Converting to forward existential form...Done !
original formula: !(A(!(EG((p74==1))) U (p57==1)))
=> equivalent forward existential formula: ([FwdG((FwdU(Init,!((p57==1))) * !((p57==1))),(p74==1))] != FALSE + [FwdG(Init,!((p57==1)))] != FALSE)
Hit Full ! (commute/partial/dont) 32/0/3
Hit Full ! (commute/partial/dont) 33/0/2
Hit Full ! (commute/partial/dont) 32/0/3
(forward)formula 0,1,0.047183,4608,1,0,15,5200,33,7,1125,6130,17
FORMULA ShieldIIPt-PT-002B-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 138/138 places, 128/128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 137 transition count 96
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 64 place count 106 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 105 transition count 94
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 65 place count 105 transition count 83
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 87 place count 94 transition count 83
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 99 place count 82 transition count 71
Iterating global reduction 3 with 12 rules applied. Total rules applied 111 place count 82 transition count 71
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 111 place count 82 transition count 66
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 121 place count 77 transition count 66
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 179 place count 48 transition count 37
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 181 place count 46 transition count 35
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 183 place count 44 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 183 place count 44 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 185 place count 43 transition count 34
Applied a total of 185 rules in 22 ms. Remains 43 /138 variables (removed 95) and now considering 34/128 (removed 94) transitions.
// Phase 1: matrix 34 rows 43 cols
[2024-05-28 19:31:21] [INFO ] Computed 17 invariants in 1 ms
[2024-05-28 19:31:21] [INFO ] Implicit Places using invariants in 46 ms returned [29]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 42/138 places, 34/128 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 41 transition count 33
Applied a total of 2 rules in 2 ms. Remains 41 /42 variables (removed 1) and now considering 33/34 (removed 1) transitions.
// Phase 1: matrix 33 rows 41 cols
[2024-05-28 19:31:21] [INFO ] Computed 16 invariants in 6 ms
[2024-05-28 19:31:21] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-28 19:31:21] [INFO ] Invariant cache hit.
[2024-05-28 19:31:21] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 41/138 places, 33/128 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 176 ms. Remains : 41/138 places, 33/128 transitions.
[2024-05-28 19:31:21] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:31:21] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:31:21] [INFO ] Input system was already deterministic with 33 transitions.
RANDOM walk for 214 steps (0 resets) in 4 ms. (42 steps per ms) remains 0/1 properties
FORMULA ShieldIIPt-PT-002B-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 19:31:21] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:31:21] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:31:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18442423050610940441.gal : 1 ms
[2024-05-28 19:31:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13028498709211202844.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18442423050610940441.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13028498709211202844.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality13028498709211202844.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.010945,3632,2,72,5,174,6,0,200,74,0
Total reachable state count : 6

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 138/138 places, 128/128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 137 transition count 97
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 62 place count 107 transition count 95
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 65 place count 106 transition count 93
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 67 place count 104 transition count 93
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 67 place count 104 transition count 82
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 89 place count 93 transition count 82
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 101 place count 81 transition count 70
Iterating global reduction 4 with 12 rules applied. Total rules applied 113 place count 81 transition count 70
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 113 place count 81 transition count 66
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 121 place count 77 transition count 66
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 179 place count 48 transition count 37
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 181 place count 46 transition count 35
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 183 place count 44 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 183 place count 44 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 185 place count 43 transition count 34
Applied a total of 185 rules in 13 ms. Remains 43 /138 variables (removed 95) and now considering 34/128 (removed 94) transitions.
// Phase 1: matrix 34 rows 43 cols
[2024-05-28 19:31:21] [INFO ] Computed 17 invariants in 0 ms
[2024-05-28 19:31:21] [INFO ] Implicit Places using invariants in 29 ms returned [29]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 42/138 places, 34/128 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 41 transition count 33
Applied a total of 2 rules in 1 ms. Remains 41 /42 variables (removed 1) and now considering 33/34 (removed 1) transitions.
// Phase 1: matrix 33 rows 41 cols
[2024-05-28 19:31:21] [INFO ] Computed 16 invariants in 0 ms
[2024-05-28 19:31:21] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-28 19:31:21] [INFO ] Invariant cache hit.
[2024-05-28 19:31:21] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 41/138 places, 33/128 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 115 ms. Remains : 41/138 places, 33/128 transitions.
[2024-05-28 19:31:21] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:31:21] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:31:21] [INFO ] Input system was already deterministic with 33 transitions.
RANDOM walk for 133 steps (0 resets) in 4 ms. (26 steps per ms) remains 0/1 properties
FORMULA ShieldIIPt-PT-002B-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 19:31:21] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:31:21] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:31:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18289599213783114851.gal : 1 ms
[2024-05-28 19:31:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13474361031562363170.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18289599213783114851.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13474361031562363170.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality13474361031562363170.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.004622,3768,2,73,5,176,6,0,200,75,0
Total reachable state count : 6

Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 128/128 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 122 transition count 112
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 122 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 121 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 121 transition count 111
Applied a total of 34 rules in 4 ms. Remains 121 /138 variables (removed 17) and now considering 111/128 (removed 17) transitions.
// Phase 1: matrix 111 rows 121 cols
[2024-05-28 19:31:21] [INFO ] Computed 19 invariants in 0 ms
[2024-05-28 19:31:21] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-28 19:31:21] [INFO ] Invariant cache hit.
[2024-05-28 19:31:21] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-28 19:31:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-28 19:31:22] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:31:22] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:31:22] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-28 19:31:22] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:31:22] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-05-28 19:31:22] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-28 19:31:22] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:31:22] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-28 19:31:22] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:31:22] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:31:22] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:31:22] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-28 19:31:22] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:31:22] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-28 19:31:23] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:31:23] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 111/232 variables, 121/156 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-28 19:31:24] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/232 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 0/232 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 157 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4161 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-28 19:31:26] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-28 19:31:26] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 111/232 variables, 121/159 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 110/269 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-28 19:31:27] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:31:27] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-28 19:31:27] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:31:27] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:31:27] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:31:27] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:31:27] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 7/276 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 0/232 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 276 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4537 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 26/26 constraints]
After SMT, in 8708ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 8709ms
Starting structural reductions in LTL mode, iteration 1 : 121/138 places, 111/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8817 ms. Remains : 121/138 places, 111/128 transitions.
[2024-05-28 19:31:30] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:31:30] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:31:30] [INFO ] Input system was already deterministic with 111 transitions.
[2024-05-28 19:31:30] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:31:30] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:31:30] [INFO ] Time to serialize gal into /tmp/CTLFireability16965905310516833187.gal : 2 ms
[2024-05-28 19:31:30] [INFO ] Time to serialize properties into /tmp/CTLFireability5044476791315040063.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/CTLFireability16965905310516833187.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5044476791315040063.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,6.96681e+11,0.755588,34536,2,1534,5,98236,6,0,597,213602,0


Converting to forward existential form...Done !
original formula: EG(AF((EX((p111==1)) + !(E(EG(((p2==1)&&(p55==1))) U AX((p106==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((EX((p111==1)) + !(E(EG(((p2==1)&&(p55==1))) U !(EX(!((p106==1)))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t14, t18, t23, t29, t32, t34, t35, t37, t38, t39, t40, t41, t42, t44, t45, t49, t53, ...324
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-28 19:32:00] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:32:00] [INFO ] Applying decomposition
[2024-05-28 19:32:00] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9593813238558841380.txt' '-o' '/tmp/graph9593813238558841380.bin' '-w' '/tmp/graph9593813238558841380.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9593813238558841380.bin' '-l' '-1' '-v' '-w' '/tmp/graph9593813238558841380.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:32:00] [INFO ] Decomposing Gal with order
[2024-05-28 19:32:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:32:00] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-28 19:32:00] [INFO ] Flatten gal took : 31 ms
[2024-05-28 19:32:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-28 19:32:00] [INFO ] Time to serialize gal into /tmp/CTLFireability12262681872005082230.gal : 5 ms
[2024-05-28 19:32:00] [INFO ] Time to serialize properties into /tmp/CTLFireability1488345501702936761.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/CTLFireability12262681872005082230.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1488345501702936761.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.96681e+11,0.079824,7420,324,43,7360,497,351,14790,58,990,0


Converting to forward existential form...Done !
original formula: EG(AF((EX((i10.u36.p111==1)) + !(E(EG(((i2.i1.u1.p2==1)&&(i6.u19.p55==1))) U AX((i9.u35.p106==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((EX((i10.u36.p111==1)) + !(E(EG(((i2.i1.u1.p2==1)&&(i6.u19.p55==1))) U !(EX(!((i9.u35.p106==1)...175
Reverse transition relation is NOT exact ! Due to transitions t38, t82, t86, i0.i1.u32.t39, i1.i0.u10.t83, i2.t84, i2.i0.u6.t89, i2.i1.u1.t90, i2.i1.u9.t85...523
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,23.6038,526172,1,0,896952,610,1701,1.38614e+06,315,1603,695144
FORMULA ShieldIIPt-PT-002B-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 128/128 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 123 transition count 113
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 123 transition count 113
Applied a total of 30 rules in 4 ms. Remains 123 /138 variables (removed 15) and now considering 113/128 (removed 15) transitions.
// Phase 1: matrix 113 rows 123 cols
[2024-05-28 19:32:24] [INFO ] Computed 19 invariants in 0 ms
[2024-05-28 19:32:24] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-28 19:32:24] [INFO ] Invariant cache hit.
[2024-05-28 19:32:24] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-28 19:32:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:32:25] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:32:25] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:32:25] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:32:25] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:32:25] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:32:25] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-28 19:32:25] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:32:25] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 0 ms to minimize.
[2024-05-28 19:32:25] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-28 19:32:25] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:32:25] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:32:25] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-05-28 19:32:25] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:32:25] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:32:25] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:32:25] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2024-05-28 19:32:25] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:32:25] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 0 ms to minimize.
[2024-05-28 19:32:25] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:32:25] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/236 variables, 123/162 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:32:26] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:32:27] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/236 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 164 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4570 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 113/236 variables, 123/164 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 112/276 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:32:30] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:32:30] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-28 19:32:30] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:32:30] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 4/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:32:31] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:32:31] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 19:32:31] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 19:32:31] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:32:32] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-28 19:32:32] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:32:32] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-28 19:32:32] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 4/288 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:32:34] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/236 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:32:35] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (OVERLAPS) 0/236 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 290 constraints, problems are : Problem set: 0 solved, 112 unsolved in 9126 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 36/36 constraints]
After SMT, in 13706ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 13707ms
Starting structural reductions in LTL mode, iteration 1 : 123/138 places, 113/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13827 ms. Remains : 123/138 places, 113/128 transitions.
[2024-05-28 19:32:38] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:32:38] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:32:38] [INFO ] Input system was already deterministic with 113 transitions.
[2024-05-28 19:32:38] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:32:38] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:32:38] [INFO ] Time to serialize gal into /tmp/CTLFireability368745053134388205.gal : 1 ms
[2024-05-28 19:32:38] [INFO ] Time to serialize properties into /tmp/CTLFireability4268674678015416825.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/CTLFireability368745053134388205.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4268674678015416825.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.74548e+11,0.739666,33644,2,1725,5,96353,6,0,607,206048,0


Converting to forward existential form...Done !
original formula: EX((EG(AF((p119==0))) * E(EG(!(EG((p14==1)))) U ((((p126==1)||(p79==1))||((p134==1)&&(p135==1)))&&(p102==1)))))
=> equivalent forward existential formula: [(FwdU((EY(Init) * EG(!(EG(!((p119==0)))))),EG(!(EG((p14==1))))) * ((((p126==1)||(p79==1))||((p134==1)&&(p135==1...181
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t12, t16, t20, t25, t29, t33, t37, t40, t41, t42, t43, t44, t46, t47, t51, t55, t60,...325
Detected timeout of ITS tools.
[2024-05-28 19:33:08] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:33:08] [INFO ] Applying decomposition
[2024-05-28 19:33:08] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9545916259483180287.txt' '-o' '/tmp/graph9545916259483180287.bin' '-w' '/tmp/graph9545916259483180287.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9545916259483180287.bin' '-l' '-1' '-v' '-w' '/tmp/graph9545916259483180287.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:33:08] [INFO ] Decomposing Gal with order
[2024-05-28 19:33:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:33:08] [INFO ] Removed a total of 20 redundant transitions.
[2024-05-28 19:33:08] [INFO ] Flatten gal took : 9 ms
[2024-05-28 19:33:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-28 19:33:08] [INFO ] Time to serialize gal into /tmp/CTLFireability11159709511205594800.gal : 3 ms
[2024-05-28 19:33:08] [INFO ] Time to serialize properties into /tmp/CTLFireability10096877874527217247.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/CTLFireability11159709511205594800.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10096877874527217247.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.74548e+11,0.115364,8464,363,29,10777,206,304,15929,47,437,0


Converting to forward existential form...Done !
original formula: EX((EG(AF((i11.u34.p119==0))) * E(EG(!(EG((i3.u5.p14==1)))) U ((((i12.u39.p126==1)||(i8.u25.p79==1))||((i13.u42.p134==1)&&(i13.u43.p135==...182
=> equivalent forward existential formula: [(FwdU((EY(Init) * EG(!(EG(!((i11.u34.p119==0)))))),EG(!(EG((i3.u5.p14==1))))) * ((((i12.u39.p126==1)||(i8.u25.p...234
Reverse transition relation is NOT exact ! Due to transitions t44, t86, t88, i0.u1.t92, i0.u8.t87, i2.u6.t90, i3.t84, i3.u5.t91, i3.u9.t85, i4.t77, i4.u11....484
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 138/138 places, 128/128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 137 transition count 103
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 50 place count 113 transition count 101
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 52 place count 112 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 53 place count 111 transition count 100
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 53 place count 111 transition count 88
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 77 place count 99 transition count 88
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 91 place count 85 transition count 74
Iterating global reduction 4 with 14 rules applied. Total rules applied 105 place count 85 transition count 74
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 105 place count 85 transition count 71
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 111 place count 82 transition count 71
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 4 with 46 rules applied. Total rules applied 157 place count 59 transition count 48
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 159 place count 57 transition count 46
Applied a total of 159 rules in 12 ms. Remains 57 /138 variables (removed 81) and now considering 46/128 (removed 82) transitions.
// Phase 1: matrix 46 rows 57 cols
[2024-05-28 19:33:38] [INFO ] Computed 19 invariants in 1 ms
[2024-05-28 19:33:38] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-28 19:33:38] [INFO ] Invariant cache hit.
[2024-05-28 19:33:38] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-05-28 19:33:38] [INFO ] Redundant transitions in 1 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-28 19:33:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 6/57 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 46/103 variables, 57/76 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/103 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 76 constraints, problems are : Problem set: 0 solved, 40 unsolved in 416 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 6/57 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 46/103 variables, 57/76 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 40/116 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/103 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 116 constraints, problems are : Problem set: 0 solved, 40 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 857ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 857ms
Starting structural reductions in SI_CTL mode, iteration 1 : 57/138 places, 46/128 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 952 ms. Remains : 57/138 places, 46/128 transitions.
[2024-05-28 19:33:39] [INFO ] Flatten gal took : 9 ms
[2024-05-28 19:33:39] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:33:39] [INFO ] Input system was already deterministic with 46 transitions.
[2024-05-28 19:33:39] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:33:39] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:33:39] [INFO ] Time to serialize gal into /tmp/CTLFireability990425778676933130.gal : 0 ms
[2024-05-28 19:33:39] [INFO ] Time to serialize properties into /tmp/CTLFireability16712533484115959364.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/CTLFireability990425778676933130.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16712533484115959364.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,2.17728e+08,0.068999,6912,2,193,5,14373,6,0,277,22892,0


Converting to forward existential form...Done !
original formula: (A(A((((p25==1)&&(p38==1)) * ((p72==1) * !((AF((((p97==1)&&(p129==1))&&(p141==1))) * ((p31==1)||(p17==1)))))) U EG(AF((p3==1)))) U (AG(!(...232
=> equivalent forward existential formula: ((([(FwdU((FwdU(Init,!((!(E(TRUE U !(!((((p94==1)&&(p107==1))&&((p141==1)&&(p69==1))))))) * (p18!=1)))) * !(!((E...906
Hit Full ! (commute/partial/dont) 44/0/2
(forward)formula 0,0,0.084442,7176,1,0,9,14373,20,3,1345,22892,8
FORMULA ShieldIIPt-PT-002B-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 128/128 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 121 transition count 111
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 121 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 120 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 120 transition count 110
Applied a total of 36 rules in 3 ms. Remains 120 /138 variables (removed 18) and now considering 110/128 (removed 18) transitions.
// Phase 1: matrix 110 rows 120 cols
[2024-05-28 19:33:39] [INFO ] Computed 19 invariants in 1 ms
[2024-05-28 19:33:39] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-28 19:33:39] [INFO ] Invariant cache hit.
[2024-05-28 19:33:39] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2024-05-28 19:33:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 19:33:40] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:33:40] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:33:40] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-28 19:33:40] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:33:40] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:33:40] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-28 19:33:40] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:33:40] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
[2024-05-28 19:33:40] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-05-28 19:33:40] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:33:40] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:33:40] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 2 ms to minimize.
[2024-05-28 19:33:40] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-28 19:33:40] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:33:40] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-28 19:33:40] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 19:33:40] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:33:41] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 19:33:41] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/230 variables, 120/158 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/230 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 158 constraints, problems are : Problem set: 0 solved, 109 unsolved in 3345 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/230 variables, 120/158 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 109/267 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 19:33:43] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:33:43] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-28 19:33:44] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:33:44] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:33:44] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:33:44] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 6/273 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 19:33:45] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:33:45] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2024-05-28 19:33:45] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-28 19:33:45] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:33:45] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 5/278 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 19:33:46] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:33:46] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 2/280 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 19:33:47] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-28 19:33:47] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 19:33:48] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (OVERLAPS) 0/230 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 283 constraints, problems are : Problem set: 0 solved, 109 unsolved in 7990 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 35/35 constraints]
After SMT, in 11348ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 11349ms
Starting structural reductions in LTL mode, iteration 1 : 120/138 places, 110/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11463 ms. Remains : 120/138 places, 110/128 transitions.
[2024-05-28 19:33:51] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:33:51] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:33:51] [INFO ] Input system was already deterministic with 110 transitions.
[2024-05-28 19:33:51] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:33:51] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:33:51] [INFO ] Time to serialize gal into /tmp/CTLFireability6848976713034625191.gal : 0 ms
[2024-05-28 19:33:51] [INFO ] Time to serialize properties into /tmp/CTLFireability11207235923761501014.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/CTLFireability6848976713034625191.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11207235923761501014.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,6.02075e+11,0.808587,34252,2,1523,5,97248,6,0,592,211792,0


Converting to forward existential form...Done !
original formula: AX((!(E(AF(AX(((p15==1)&&(p48==1)))) U (p99==1))) + AG((p17==1))))
=> equivalent forward existential formula: [(FwdU((EY(Init) * !(!(E(!(EG(!(!(EX(!(((p15==1)&&(p48==1)))))))) U (p99==1))))),TRUE) * !((p17==1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t14, t18, t23, t27, t31, t33, t34, t36, t37, t38, t39, t40, t41, t43, t44, t48, t52, ...324
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-28 19:34:21] [INFO ] Flatten gal took : 11 ms
[2024-05-28 19:34:21] [INFO ] Applying decomposition
[2024-05-28 19:34:21] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9672539540768620886.txt' '-o' '/tmp/graph9672539540768620886.bin' '-w' '/tmp/graph9672539540768620886.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9672539540768620886.bin' '-l' '-1' '-v' '-w' '/tmp/graph9672539540768620886.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:34:21] [INFO ] Decomposing Gal with order
[2024-05-28 19:34:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:34:21] [INFO ] Removed a total of 19 redundant transitions.
[2024-05-28 19:34:21] [INFO ] Flatten gal took : 9 ms
[2024-05-28 19:34:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-28 19:34:21] [INFO ] Time to serialize gal into /tmp/CTLFireability9810056748651679329.gal : 2 ms
[2024-05-28 19:34:21] [INFO ] Time to serialize properties into /tmp/CTLFireability6173318516922947537.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/CTLFireability9810056748651679329.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6173318516922947537.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
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,6.02075e+11,0.05582,5828,309,29,4265,292,325,7201,49,587,0


Converting to forward existential form...Done !
original formula: AX((!(E(AF(AX(((i0.i1.u5.p15==1)&&(i4.u16.p48==1)))) U (i10.u34.p99==1))) + AG((i2.u6.p17==1))))
=> equivalent forward existential formula: [(FwdU((EY(Init) * !(!(E(!(EG(!(!(EX(!(((i0.i1.u5.p15==1)&&(i4.u16.p48==1)))))))) U (i10.u34.p99==1))))),TRUE) *...183
Reverse transition relation is NOT exact ! Due to transitions t37, t41, t83, t85, i0.i1.t81, i0.i1.u5.t88, i0.i1.u9.t82, i1.u1.t89, i1.u8.t84, i2.u6.t87, i...496
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,2.09839,102452,1,0,209129,412,1553,227888,257,1113,269018
FORMULA ShieldIIPt-PT-002B-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 138/138 places, 128/128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 137 transition count 97
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 62 place count 107 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 106 transition count 95
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 63 place count 106 transition count 83
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 87 place count 94 transition count 83
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 100 place count 81 transition count 70
Iterating global reduction 3 with 13 rules applied. Total rules applied 113 place count 81 transition count 70
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 113 place count 81 transition count 65
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 123 place count 76 transition count 65
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 177 place count 49 transition count 38
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 179 place count 47 transition count 36
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 181 place count 45 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 181 place count 45 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 183 place count 44 transition count 35
Applied a total of 183 rules in 9 ms. Remains 44 /138 variables (removed 94) and now considering 35/128 (removed 93) transitions.
// Phase 1: matrix 35 rows 44 cols
[2024-05-28 19:34:23] [INFO ] Computed 17 invariants in 0 ms
[2024-05-28 19:34:23] [INFO ] Implicit Places using invariants in 35 ms returned [29]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 43/138 places, 35/128 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 42 transition count 34
Applied a total of 2 rules in 2 ms. Remains 42 /43 variables (removed 1) and now considering 34/35 (removed 1) transitions.
// Phase 1: matrix 34 rows 42 cols
[2024-05-28 19:34:23] [INFO ] Computed 16 invariants in 0 ms
[2024-05-28 19:34:23] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-28 19:34:23] [INFO ] Invariant cache hit.
[2024-05-28 19:34:23] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 42/138 places, 34/128 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 118 ms. Remains : 42/138 places, 34/128 transitions.
[2024-05-28 19:34:23] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:34:23] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:34:23] [INFO ] Input system was already deterministic with 34 transitions.
[2024-05-28 19:34:23] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:34:23] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:34:23] [INFO ] Time to serialize gal into /tmp/CTLFireability4336737472546741783.gal : 1 ms
[2024-05-28 19:34:23] [INFO ] Time to serialize properties into /tmp/CTLFireability17171136174358866925.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/CTLFireability4336737472546741783.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17171136174358866925.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,2.79936e+06,0.02046,4180,2,109,5,3535,6,0,205,4587,0


Converting to forward existential form...Done !
original formula: AG(((EG(EF((p27==1))) + (p84==0)) + (p117==0)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !((p117==0))) * !((p84==0))) * !(EG(E(TRUE U (p27==1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.082883,7348,1,0,18,22941,25,9,1041,21029,10
FORMULA ShieldIIPt-PT-002B-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 128/128 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 125 transition count 115
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 125 transition count 115
Applied a total of 26 rules in 3 ms. Remains 125 /138 variables (removed 13) and now considering 115/128 (removed 13) transitions.
// Phase 1: matrix 115 rows 125 cols
[2024-05-28 19:34:23] [INFO ] Computed 19 invariants in 0 ms
[2024-05-28 19:34:23] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-28 19:34:23] [INFO ] Invariant cache hit.
[2024-05-28 19:34:23] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2024-05-28 19:34:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-28 19:34:24] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:34:24] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:34:24] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-28 19:34:24] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:34:24] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:34:24] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:34:24] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-28 19:34:24] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-28 19:34:24] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 0 ms to minimize.
[2024-05-28 19:34:24] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-28 19:34:24] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:34:24] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:34:24] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:34:24] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-28 19:34:24] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:34:24] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-05-28 19:34:24] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:34:24] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:34:24] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-28 19:34:24] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-28 19:34:25] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:34:25] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-28 19:34:25] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 115/240 variables, 125/167 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-28 19:34:26] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:34:26] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-28 19:34:27] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:34:27] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:34:27] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 3/172 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 0/240 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 172 constraints, problems are : Problem set: 0 solved, 114 unsolved in 5147 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 28/47 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 115/240 variables, 125/172 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 114/286 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-28 19:34:29] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:34:29] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:34:29] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:34:30] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:34:30] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:34:30] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-28 19:34:30] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-28 19:34:30] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 8/294 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-28 19:34:31] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:34:31] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-28 19:34:32] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-28 19:34:32] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-28 19:34:33] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (OVERLAPS) 0/240 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 299 constraints, problems are : Problem set: 0 solved, 114 unsolved in 8493 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 41/41 constraints]
After SMT, in 13650ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 13652ms
Starting structural reductions in LTL mode, iteration 1 : 125/138 places, 115/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13755 ms. Remains : 125/138 places, 115/128 transitions.
[2024-05-28 19:34:37] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:34:37] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:34:37] [INFO ] Input system was already deterministic with 115 transitions.
[2024-05-28 19:34:37] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:34:37] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:34:37] [INFO ] Time to serialize gal into /tmp/CTLFireability7354714262627797720.gal : 1 ms
[2024-05-28 19:34:37] [INFO ] Time to serialize properties into /tmp/CTLFireability16144599007930246206.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/CTLFireability7354714262627797720.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16144599007930246206.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.09028e+12,1.47847,58624,2,2543,5,162166,6,0,617,392900,0


Converting to forward existential form...Done !
original formula: A((AX(((EG((p34==1)) + ((p126==1)&&(p140==1))) + ((A(((p26==1)&&(p124==1)) U (p50==1)) * (p69!=1)) + (((p112!=1) + EF((((p94==1)&&(p107==...349
=> equivalent forward existential formula: [((Init * !(EG(!(EX(!(E(TRUE U !(!((E(!((p36!=1)) U (!(!(EG(!((p42==1))))) * !((p36!=1)))) + EG(!((p36!=1)))))))...791
Reverse transition relation is NOT exact ! Due to transitions t5, t10, t12, t15, t19, t24, t28, t29, t30, t32, t33, t36, t37, t39, t40, t41, t42, t43, t44,...360
Detected timeout of ITS tools.
[2024-05-28 19:35:07] [INFO ] Flatten gal took : 8 ms
[2024-05-28 19:35:07] [INFO ] Applying decomposition
[2024-05-28 19:35:07] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7863469727697282131.txt' '-o' '/tmp/graph7863469727697282131.bin' '-w' '/tmp/graph7863469727697282131.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7863469727697282131.bin' '-l' '-1' '-v' '-w' '/tmp/graph7863469727697282131.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:35:07] [INFO ] Decomposing Gal with order
[2024-05-28 19:35:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:35:07] [INFO ] Removed a total of 15 redundant transitions.
[2024-05-28 19:35:07] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:35:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 19:35:07] [INFO ] Time to serialize gal into /tmp/CTLFireability14771440857162905063.gal : 2 ms
[2024-05-28 19:35:07] [INFO ] Time to serialize properties into /tmp/CTLFireability2446309685256149012.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/CTLFireability14771440857162905063.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2446309685256149012.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.09028e+12,0.091296,7976,465,29,7159,245,346,23226,47,460,0


Converting to forward existential form...Done !
original formula: A((AX(((EG((i2.u11.p34==1)) + ((i11.u42.p126==1)&&(i12.u46.p140==1))) + ((A(((i0.i1.u9.p26==1)&&(i11.u42.p124==1)) U (i3.u16.p50==1)) * (...520
=> equivalent forward existential formula: [((Init * !(EG(!(EX(!(E(TRUE U !(!((E(!((i2.u12.p36!=1)) U (!(!(EG(!((i3.u13.p42==1))))) * !((i2.u12.p36!=1)))) ...1060
Reverse transition relation is NOT exact ! Due to transitions t44, t90, i0.t88, i0.i0.u1.t94, i0.i0.u8.t89, i0.i1.t86, i0.i1.u5.t93, i0.i1.u9.t87, i1.u6.t9...585
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 138/138 places, 128/128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 138 transition count 111
Reduce places removed 17 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 19 rules applied. Total rules applied 36 place count 121 transition count 109
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 38 place count 119 transition count 109
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 38 place count 119 transition count 96
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 64 place count 106 transition count 96
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 73 place count 97 transition count 87
Iterating global reduction 3 with 9 rules applied. Total rules applied 82 place count 97 transition count 87
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 82 place count 97 transition count 85
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 86 place count 95 transition count 85
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 130 place count 73 transition count 63
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 132 place count 73 transition count 63
Applied a total of 132 rules in 9 ms. Remains 73 /138 variables (removed 65) and now considering 63/128 (removed 65) transitions.
// Phase 1: matrix 63 rows 73 cols
[2024-05-28 19:35:37] [INFO ] Computed 19 invariants in 2 ms
[2024-05-28 19:35:37] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-28 19:35:37] [INFO ] Invariant cache hit.
[2024-05-28 19:35:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-28 19:35:37] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-28 19:35:37] [INFO ] Redundant transitions in 0 ms returned []
Running 62 sub problems to find dead transitions.
[2024-05-28 19:35:37] [INFO ] Invariant cache hit.
[2024-05-28 19:35:37] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-28 19:35:37] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-28 19:35:37] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 1 ms to minimize.
[2024-05-28 19:35:37] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:35:37] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-28 19:35:37] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:35:37] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-28 19:35:38] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:35:38] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:35:38] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 63/136 variables, 73/101 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 62 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 0/136 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 103 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1153 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 73/73 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 63/136 variables, 73/101 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 62/165 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-28 19:35:39] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:35:39] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-28 19:35:39] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 0/136 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 168 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1715 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 73/73 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 12/12 constraints]
After SMT, in 2876ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 2877ms
Starting structural reductions in SI_CTL mode, iteration 1 : 73/138 places, 63/128 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2982 ms. Remains : 73/138 places, 63/128 transitions.
[2024-05-28 19:35:40] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:35:40] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:35:40] [INFO ] Input system was already deterministic with 63 transitions.
[2024-05-28 19:35:40] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:35:40] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:35:40] [INFO ] Time to serialize gal into /tmp/CTLFireability3021497002441045628.gal : 1 ms
[2024-05-28 19:35:40] [INFO ] Time to serialize properties into /tmp/CTLFireability14823622807275322837.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/CTLFireability3021497002441045628.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14823622807275322837.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.73217e+09,0.394217,19704,2,730,5,54295,6,0,357,114659,0


Converting to forward existential form...Done !
original formula: E(((EF(((p66==1)||((p85==1)&&(p113==1)))) * A((((((((p28==1)&&(p60==1))&&(p72==1))||(((p33==1)&&(p92==1))&&(p78==1))) + E(((p90==1)&&(p12...370
=> equivalent forward existential formula: [(FwdU(Init,((E(TRUE U ((p66==1)||((p85==1)&&(p113==1)))) * !((E(!(!(EG(!(EG((p30==1)))))) U (!((((((((p28==1)&&...552
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t4, t7, t8, t9, t11, t12, t13, t15, t18, t19, t27, t30, t34, t38, t42, t44, t48, t55,...259
Detected timeout of ITS tools.
[2024-05-28 19:36:10] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:36:10] [INFO ] Applying decomposition
[2024-05-28 19:36:10] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7367924981508838368.txt' '-o' '/tmp/graph7367924981508838368.bin' '-w' '/tmp/graph7367924981508838368.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7367924981508838368.bin' '-l' '-1' '-v' '-w' '/tmp/graph7367924981508838368.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:36:10] [INFO ] Decomposing Gal with order
[2024-05-28 19:36:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:36:10] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-28 19:36:10] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:36:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 19:36:10] [INFO ] Time to serialize gal into /tmp/CTLFireability15917996981639915100.gal : 1 ms
[2024-05-28 19:36:10] [INFO ] Time to serialize properties into /tmp/CTLFireability9074847318875670635.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/CTLFireability15917996981639915100.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9074847318875670635.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.73217e+09,0.033149,4872,192,44,2421,210,255,3470,57,724,0


Converting to forward existential form...Done !
original formula: E(((EF(((u13.p66==1)||((i10.i1.u18.p85==1)&&(i9.u23.p113==1)))) * A((((((((i4.u5.p28==1)&&(i7.u12.p60==1))&&(u13.p72==1))||(((i5.u8.p33==...546
=> equivalent forward existential formula: [(FwdU(Init,((E(TRUE U ((u13.p66==1)||((i10.i1.u18.p85==1)&&(i9.u23.p113==1)))) * !((E(!(!(EG(!(EG((i5.u7.p30==1...752
Reverse transition relation is NOT exact ! Due to transitions t9, t48, t55, u25.t1, u13.t11, u13.t34, u13.t44, u3.t0, i4.u24.t42, i5.t30, i5.u6.t27, i5.u7....357
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,21.2743,777868,1,0,1.4226e+06,435,1491,2.74937e+06,311,1765,1130876
FORMULA ShieldIIPt-PT-002B-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 138/138 places, 128/128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 137 transition count 95
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 66 place count 105 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 104 transition count 93
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 67 place count 104 transition count 82
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 89 place count 93 transition count 82
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 101 place count 81 transition count 70
Iterating global reduction 3 with 12 rules applied. Total rules applied 113 place count 81 transition count 70
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 113 place count 81 transition count 65
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 123 place count 76 transition count 65
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 177 place count 49 transition count 38
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 179 place count 47 transition count 36
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 181 place count 45 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 181 place count 45 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 183 place count 44 transition count 35
Applied a total of 183 rules in 17 ms. Remains 44 /138 variables (removed 94) and now considering 35/128 (removed 93) transitions.
// Phase 1: matrix 35 rows 44 cols
[2024-05-28 19:36:31] [INFO ] Computed 17 invariants in 1 ms
[2024-05-28 19:36:31] [INFO ] Implicit Places using invariants in 39 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 43/138 places, 35/128 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 42 transition count 34
Applied a total of 2 rules in 2 ms. Remains 42 /43 variables (removed 1) and now considering 34/35 (removed 1) transitions.
// Phase 1: matrix 34 rows 42 cols
[2024-05-28 19:36:31] [INFO ] Computed 16 invariants in 0 ms
[2024-05-28 19:36:32] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-28 19:36:32] [INFO ] Invariant cache hit.
[2024-05-28 19:36:32] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 42/138 places, 34/128 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 123 ms. Remains : 42/138 places, 34/128 transitions.
[2024-05-28 19:36:32] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:36:32] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:36:32] [INFO ] Input system was already deterministic with 34 transitions.
RANDOM walk for 164 steps (0 resets) in 5 ms. (27 steps per ms) remains 0/1 properties
FORMULA ShieldIIPt-PT-002B-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 19:36:32] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:36:32] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:36:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14525707412192447060.gal : 1 ms
[2024-05-28 19:36:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9393588012720039050.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14525707412192447060.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9393588012720039050.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 128/128 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 124 transition count 114
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 124 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 123 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 123 transition count 113
Applied a total of 30 rules in 3 ms. Remains 123 /138 variables (removed 15) and now considering 113/128 (removed 15) transitions.
// Phase 1: matrix 113 rows 123 cols
[2024-05-28 19:36:32] [INFO ] Computed 19 invariants in 1 ms
[2024-05-28 19:36:32] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-28 19:36:32] [INFO ] Invariant cache hit.
[2024-05-28 19:36:32] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-28 19:36:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:36:32] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:36:32] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:36:32] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:36:32] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-28 19:36:32] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-05-28 19:36:32] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:36:32] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:36:33] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:36:33] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:36:33] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:36:33] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2024-05-28 19:36:33] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-28 19:36:33] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:36:33] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:36:33] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 1 ms to minimize.
[2024-05-28 19:36:33] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:36:33] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:36:33] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:36:33] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:36:33] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/236 variables, 123/162 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:36:35] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:36:35] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-28 19:36:35] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/236 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/236 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 165 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4590 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 23/42 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:36:37] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:36:37] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/236 variables, 123/167 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 112/279 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:36:37] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-05-28 19:36:38] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:36:38] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:36:38] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-28 19:36:38] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-28 19:36:38] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:36:38] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 7/286 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:36:39] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 19:36:39] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 19:36:39] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 3/289 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:36:40] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-28 19:36:40] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:36:40] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 0/236 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 292 constraints, problems are : Problem set: 0 solved, 112 unsolved in 6930 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 38/38 constraints]
After SMT, in 11530ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 11531ms
Starting structural reductions in LTL mode, iteration 1 : 123/138 places, 113/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11646 ms. Remains : 123/138 places, 113/128 transitions.
[2024-05-28 19:36:43] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:36:43] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:36:43] [INFO ] Input system was already deterministic with 113 transitions.
[2024-05-28 19:36:43] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:36:43] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:36:43] [INFO ] Time to serialize gal into /tmp/CTLFireability4106618687524742568.gal : 1 ms
[2024-05-28 19:36:43] [INFO ] Time to serialize properties into /tmp/CTLFireability14462663810734106769.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/CTLFireability4106618687524742568.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14462663810734106769.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,7.86196e+11,1.4849,58316,2,2416,5,156408,6,0,607,393754,0


Converting to forward existential form...Done !
original formula: ((AG(((p85==0)||(p113==0))) + AF(!(A((AF((p59==1)) + (p31==1)) U A((p32==1) U (p64==1)))))) + (!(E(!(EF((p110==1))) U (((p97==1)&&(p129==...202
=> equivalent forward existential formula: ([(FwdU((Init * !((!(E(TRUE U !(((p85==0)||(p113==0))))) + !(EG(!(!(!((E(!(!((E(!((p64==1)) U (!((p32==1)) * !((...837
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t14, t18, t23, t27, t32, t33, t36, t37, t38, t39, t40, t42, t43, t47, t48, t52, t54, ...339
Detected timeout of ITS tools.
[2024-05-28 19:37:13] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:37:13] [INFO ] Applying decomposition
[2024-05-28 19:37:13] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17261942068442683005.txt' '-o' '/tmp/graph17261942068442683005.bin' '-w' '/tmp/graph17261942068442683005.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17261942068442683005.bin' '-l' '-1' '-v' '-w' '/tmp/graph17261942068442683005.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:37:13] [INFO ] Decomposing Gal with order
[2024-05-28 19:37:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:37:13] [INFO ] Removed a total of 22 redundant transitions.
[2024-05-28 19:37:13] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:37:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 19:37:13] [INFO ] Time to serialize gal into /tmp/CTLFireability5764049513793881487.gal : 2 ms
[2024-05-28 19:37:13] [INFO ] Time to serialize properties into /tmp/CTLFireability11390036705533076840.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/CTLFireability5764049513793881487.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11390036705533076840.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.86196e+11,0.103664,8240,395,29,9024,213,359,18284,49,554,0


Converting to forward existential form...Done !
original formula: ((AG(((i8.i0.u30.p85==0)||(i10.u38.p113==0))) + AF(!(A((AF((i6.u21.p59==1)) + (i4.u14.p31==1)) U A((i4.u12.p32==1) U (i7.u24.p64==1))))))...295
=> equivalent forward existential formula: ([(FwdU((Init * !((!(E(TRUE U !(((i8.i0.u30.p85==0)||(i10.u38.p113==0))))) + !(EG(!(!(!((E(!(!((E(!((i7.u24.p64=...1116
Reverse transition relation is NOT exact ! Due to transitions t36, t86, t88, i0.i1.u33.t37, i1.u1.t92, i1.u8.t87, i2.u6.t90, i3.i0.t84, i3.i0.u5.t91, i3.i0...535
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 128/128 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 124 transition count 114
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 124 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 123 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 123 transition count 113
Applied a total of 30 rules in 6 ms. Remains 123 /138 variables (removed 15) and now considering 113/128 (removed 15) transitions.
// Phase 1: matrix 113 rows 123 cols
[2024-05-28 19:37:43] [INFO ] Computed 19 invariants in 2 ms
[2024-05-28 19:37:43] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-28 19:37:43] [INFO ] Invariant cache hit.
[2024-05-28 19:37:44] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-28 19:37:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:37:44] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:37:44] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:37:44] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:37:44] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-05-28 19:37:44] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:37:44] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:37:44] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:37:44] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:37:44] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-28 19:37:44] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
[2024-05-28 19:37:44] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:37:44] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:37:45] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:37:45] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2024-05-28 19:37:45] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:37:45] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:37:45] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:37:45] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:37:45] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:37:45] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:37:45] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-28 19:37:45] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:37:46] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:37:46] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:37:46] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 113/236 variables, 123/167 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:37:47] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 0/236 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 168 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4680 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 26/45 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:37:49] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/236 variables, 123/169 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 112/281 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:37:49] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 19:37:50] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 19:37:50] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 19:37:50] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 19:37:50] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-05-28 19:37:50] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:37:50] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 7/288 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:37:51] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-28 19:37:51] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:37:52] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:37:53] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-05-28 19:37:53] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:37:54] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:37:55] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:37:56] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/236 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/236 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 15 (OVERLAPS) 0/236 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 296 constraints, problems are : Problem set: 0 solved, 112 unsolved in 10524 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 42/42 constraints]
After SMT, in 15215ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 15219ms
Starting structural reductions in LTL mode, iteration 1 : 123/138 places, 113/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15341 ms. Remains : 123/138 places, 113/128 transitions.
[2024-05-28 19:37:59] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:37:59] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:37:59] [INFO ] Input system was already deterministic with 113 transitions.
[2024-05-28 19:37:59] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:37:59] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:37:59] [INFO ] Time to serialize gal into /tmp/CTLFireability17305899714106575771.gal : 1 ms
[2024-05-28 19:37:59] [INFO ] Time to serialize properties into /tmp/CTLFireability6412903812102939132.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/CTLFireability17305899714106575771.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6412903812102939132.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,7.82655e+11,1.20994,46280,2,1967,5,128517,6,0,607,296951,0


Converting to forward existential form...Done !
original formula: (AF(((((((p54==0)&&(p9==0))||((p90==1)&&(p129==1)))&&(p75==1))&&((p21==1)&&(p60==1)))&&((((p3==0)||(((p25==1)&&(p38==1))&&(p72==1)))||((p...281
=> equivalent forward existential formula: ([FwdG(Init,!(((((((p54==0)&&(p9==0))||((p90==1)&&(p129==1)))&&(p75==1))&&((p21==1)&&(p60==1)))&&((((p3==0)||(((...411
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t14, t18, t23, t27, t31, t33, t34, t36, t37, t38, t39, t40, t41, t43, t44, t48, t52, ...334
Detected timeout of ITS tools.
[2024-05-28 19:38:29] [INFO ] Flatten gal took : 8 ms
[2024-05-28 19:38:29] [INFO ] Applying decomposition
[2024-05-28 19:38:29] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4603359633562423265.txt' '-o' '/tmp/graph4603359633562423265.bin' '-w' '/tmp/graph4603359633562423265.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4603359633562423265.bin' '-l' '-1' '-v' '-w' '/tmp/graph4603359633562423265.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:38:29] [INFO ] Decomposing Gal with order
[2024-05-28 19:38:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:38:29] [INFO ] Removed a total of 20 redundant transitions.
[2024-05-28 19:38:29] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:38:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 19:38:29] [INFO ] Time to serialize gal into /tmp/CTLFireability4060863024273402316.gal : 1 ms
[2024-05-28 19:38:29] [INFO ] Time to serialize properties into /tmp/CTLFireability14826834441167466499.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/CTLFireability4060863024273402316.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14826834441167466499.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.82655e+11,0.273181,15664,331,31,21928,246,343,61798,52,601,0


Converting to forward existential form...Done !
original formula: (AF(((((((i4.u22.p54==0)&&(i5.i1.u4.p9==0))||((i8.i0.u34.p90==1)&&(i11.u43.p129==1)))&&(i7.i0.u28.p75==1))&&((i1.u8.p21==1)&&(i4.u22.p60=...441
=> equivalent forward existential formula: ([FwdG(Init,!(((((((i4.u22.p54==0)&&(i5.i1.u4.p9==0))||((i8.i0.u34.p90==1)&&(i11.u43.p129==1)))&&(i7.i0.u28.p75=...591
Reverse transition relation is NOT exact ! Due to transitions t37, t84, t88, i0.t86, i0.i0.u1.t92, i0.i0.u9.t87, i0.i1.u6.t91, i1.u7.t90, i2.t76, i2.u12.t8...535
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,0,17.6842,552016,1,0,830237,481,2389,2.09882e+06,297,1267,694520
FORMULA ShieldIIPt-PT-002B-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 138/138 places, 128/128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 137 transition count 98
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 108 transition count 96
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 63 place count 107 transition count 94
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 65 place count 105 transition count 94
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 65 place count 105 transition count 84
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 85 place count 95 transition count 84
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 96 place count 84 transition count 73
Iterating global reduction 4 with 11 rules applied. Total rules applied 107 place count 84 transition count 73
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 107 place count 84 transition count 68
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 117 place count 79 transition count 68
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 173 place count 51 transition count 40
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 175 place count 49 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 177 place count 47 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 177 place count 47 transition count 37
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 179 place count 46 transition count 37
Applied a total of 179 rules in 8 ms. Remains 46 /138 variables (removed 92) and now considering 37/128 (removed 91) transitions.
// Phase 1: matrix 37 rows 46 cols
[2024-05-28 19:38:47] [INFO ] Computed 17 invariants in 1 ms
[2024-05-28 19:38:47] [INFO ] Implicit Places using invariants in 36 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 45/138 places, 37/128 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 44 transition count 36
Applied a total of 2 rules in 1 ms. Remains 44 /45 variables (removed 1) and now considering 36/37 (removed 1) transitions.
// Phase 1: matrix 36 rows 44 cols
[2024-05-28 19:38:47] [INFO ] Computed 16 invariants in 0 ms
[2024-05-28 19:38:47] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-28 19:38:47] [INFO ] Invariant cache hit.
[2024-05-28 19:38:47] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 44/138 places, 36/128 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 119 ms. Remains : 44/138 places, 36/128 transitions.
[2024-05-28 19:38:47] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:38:47] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:38:47] [INFO ] Input system was already deterministic with 36 transitions.
[2024-05-28 19:38:47] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:38:47] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:38:47] [INFO ] Time to serialize gal into /tmp/CTLFireability5996153260738114109.gal : 1 ms
[2024-05-28 19:38:47] [INFO ] Time to serialize properties into /tmp/CTLFireability12780231208105982267.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/CTLFireability5996153260738114109.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12780231208105982267.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,2.23949e+06,0.017933,4196,2,155,5,3807,6,0,214,5072,0


Converting to forward existential form...Done !
original formula: AF(!(A(((p142==1)&&(p46==1)) U (p18!=1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!((p18!=1)) U (!(((p142==1)&&(p46==1))) * !((p18!=1)))) + EG(!((p18!=1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t8, t11, t13, t15, t17, t19, Intersection with reachable at each step enabled. (dest...196
(forward)formula 0,0,0.278056,16340,1,0,410,65324,103,236,1264,105771,377
FORMULA ShieldIIPt-PT-002B-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 128/128 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 122 transition count 112
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 122 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 121 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 121 transition count 111
Applied a total of 34 rules in 2 ms. Remains 121 /138 variables (removed 17) and now considering 111/128 (removed 17) transitions.
// Phase 1: matrix 111 rows 121 cols
[2024-05-28 19:38:47] [INFO ] Computed 19 invariants in 2 ms
[2024-05-28 19:38:47] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-28 19:38:47] [INFO ] Invariant cache hit.
[2024-05-28 19:38:47] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-28 19:38:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-28 19:38:48] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 19:38:48] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:38:48] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:38:48] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:38:48] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-28 19:38:48] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:38:48] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-28 19:38:48] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:38:48] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:38:48] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:38:48] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-28 19:38:48] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-05-28 19:38:48] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-28 19:38:48] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:38:48] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/232 variables, 121/155 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-28 19:38:49] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/232 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 156 constraints, problems are : Problem set: 0 solved, 110 unsolved in 3262 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/232 variables, 121/156 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 110/266 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-28 19:38:51] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-28 19:38:51] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:38:51] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:38:52] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:38:52] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-28 19:38:52] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:38:52] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:38:52] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 8/274 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-28 19:38:53] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-28 19:38:53] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:38:53] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:38:53] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-28 19:38:53] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 5/279 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-28 19:38:54] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-28 19:38:56] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/232 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 12 (OVERLAPS) 0/232 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 281 constraints, problems are : Problem set: 0 solved, 110 unsolved in 8254 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 31/31 constraints]
After SMT, in 11523ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 11525ms
Starting structural reductions in LTL mode, iteration 1 : 121/138 places, 111/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11644 ms. Remains : 121/138 places, 111/128 transitions.
[2024-05-28 19:38:59] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:38:59] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:38:59] [INFO ] Input system was already deterministic with 111 transitions.
[2024-05-28 19:38:59] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:38:59] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:38:59] [INFO ] Time to serialize gal into /tmp/CTLFireability4069650814400995088.gal : 1 ms
[2024-05-28 19:38:59] [INFO ] Time to serialize properties into /tmp/CTLFireability13427008291476253883.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/CTLFireability4069650814400995088.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13427008291476253883.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,6.14815e+11,0.809746,35056,2,1786,5,97557,6,0,597,215454,0


Converting to forward existential form...Done !
original formula: A((!(A(AX((p39==1)) U EG(((p84==1)&&(p117==1))))) * !(((p65==1) * (EG(((p83==1)||(p138==1))) + !((((p34==1)&&(p116==1)) + EF((p18==1)))))...170
=> equivalent forward existential formula: [((Init * !(EG(!((p77==1))))) * !(E(!((p77==1)) U (!((!(!((E(!(EG(((p84==1)&&(p117==1)))) U (!(!(EX(!((p39==1)))...354
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t14, t18, t23, t27, t32, t33, t36, t37, t38, t39, t40, t42, t43, t47, t51, t53, t57, ...319
Detected timeout of ITS tools.
[2024-05-28 19:39:29] [INFO ] Flatten gal took : 8 ms
[2024-05-28 19:39:29] [INFO ] Applying decomposition
[2024-05-28 19:39:29] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17168633443722030767.txt' '-o' '/tmp/graph17168633443722030767.bin' '-w' '/tmp/graph17168633443722030767.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17168633443722030767.bin' '-l' '-1' '-v' '-w' '/tmp/graph17168633443722030767.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:39:29] [INFO ] Decomposing Gal with order
[2024-05-28 19:39:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:39:29] [INFO ] Removed a total of 22 redundant transitions.
[2024-05-28 19:39:29] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:39:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 19:39:29] [INFO ] Time to serialize gal into /tmp/CTLFireability14659657381053201491.gal : 1 ms
[2024-05-28 19:39:29] [INFO ] Time to serialize properties into /tmp/CTLFireability16663477364301091910.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/CTLFireability14659657381053201491.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16663477364301091910.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.14815e+11,0.058779,6140,327,29,5029,187,336,7763,47,422,0


Converting to forward existential form...Done !
original formula: A((!(A(AX((i2.u14.p39==1)) U EG(((i7.i1.u31.p84==1)&&(i10.u40.p117==1))))) * !(((i6.u26.p65==1) * (EG(((i7.i1.u31.p83==1)||(i12.u48.p138=...254
=> equivalent forward existential formula: [((Init * !(EG(!((i0.i0.u28.p77==1))))) * !(E(!((i0.i0.u28.p77==1)) U (!((!(!((E(!(EG(((i7.i1.u31.p84==1)&&(i10....494
Reverse transition relation is NOT exact ! Due to transitions t40, t82, t84, i0.i1.u1.t90, i0.i1.u9.t85, i1.t86, i1.i0.u6.t89, i1.i1.u7.t88, i2.t80, i2.u14...495
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 138/138 places, 128/128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 137 transition count 97
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 62 place count 107 transition count 95
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 65 place count 106 transition count 93
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 67 place count 104 transition count 93
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 67 place count 104 transition count 84
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 85 place count 95 transition count 84
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 97 place count 83 transition count 72
Iterating global reduction 4 with 12 rules applied. Total rules applied 109 place count 83 transition count 72
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 109 place count 83 transition count 68
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 117 place count 79 transition count 68
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 175 place count 50 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 177 place count 48 transition count 37
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 179 place count 46 transition count 37
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 179 place count 46 transition count 36
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 181 place count 45 transition count 36
Applied a total of 181 rules in 14 ms. Remains 45 /138 variables (removed 93) and now considering 36/128 (removed 92) transitions.
// Phase 1: matrix 36 rows 45 cols
[2024-05-28 19:39:59] [INFO ] Computed 17 invariants in 0 ms
[2024-05-28 19:39:59] [INFO ] Implicit Places using invariants in 34 ms returned [28]
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 : 44/138 places, 36/128 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 43 transition count 35
Applied a total of 2 rules in 1 ms. Remains 43 /44 variables (removed 1) and now considering 35/36 (removed 1) transitions.
// Phase 1: matrix 35 rows 43 cols
[2024-05-28 19:39:59] [INFO ] Computed 16 invariants in 1 ms
[2024-05-28 19:39:59] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-28 19:39:59] [INFO ] Invariant cache hit.
[2024-05-28 19:39:59] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 43/138 places, 35/128 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 117 ms. Remains : 43/138 places, 35/128 transitions.
[2024-05-28 19:39:59] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:39:59] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:39:59] [INFO ] Input system was already deterministic with 35 transitions.
[2024-05-28 19:39:59] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:39:59] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:39:59] [INFO ] Time to serialize gal into /tmp/CTLFireability2176088842109726543.gal : 1 ms
[2024-05-28 19:39:59] [INFO ] Time to serialize properties into /tmp/CTLFireability791074648622222895.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/CTLFireability2176088842109726543.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability791074648622222895.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.1104e+06,0.026071,4716,2,119,5,5531,6,0,210,7636,0


Converting to forward existential form...Done !
original formula: EF(EG(((p139==1) * EG((p115==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((p139==1) * EG((p115==1))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.135982,9468,1,0,14,36331,23,8,975,31452,11
FORMULA ShieldIIPt-PT-002B-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-28 19:39:59] [INFO ] Flatten gal took : 8 ms
[2024-05-28 19:39:59] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:39:59] [INFO ] Applying decomposition
[2024-05-28 19:39:59] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15607090550939327934.txt' '-o' '/tmp/graph15607090550939327934.bin' '-w' '/tmp/graph15607090550939327934.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15607090550939327934.bin' '-l' '-1' '-v' '-w' '/tmp/graph15607090550939327934.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:39:59] [INFO ] Decomposing Gal with order
[2024-05-28 19:39:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:39:59] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-28 19:39:59] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:39:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 19:39:59] [INFO ] Time to serialize gal into /tmp/CTLFireability565662070587954079.gal : 2 ms
[2024-05-28 19:39:59] [INFO ] Time to serialize properties into /tmp/CTLFireability4221002700915045359.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/CTLFireability565662070587954079.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4221002700915045359.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 4 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.33411e+12,0.160198,10468,642,37,13237,303,365,24657,53,783,0


Converting to forward existential form...Done !
original formula: EX((EG(AF((i11.u42.p119==0))) * E(EG(!(EG((i2.u5.p14==1)))) U ((((i0.u45.p126==1)||(i6.i1.u30.p79==1))||((i12.u48.p134==1)&&(i12.u49.p135...184
=> equivalent forward existential formula: [(FwdU((EY(Init) * EG(!(EG(!((i11.u42.p119==0)))))),EG(!(EG((i2.u5.p14==1))))) * ((((i0.u45.p126==1)||(i6.i1.u30...236
Reverse transition relation is NOT exact ! Due to transitions t44, t101, t103, i0.t17, i0.u45.t21, i1.i0.u1.t107, i1.i0.u8.t102, i2.t99, i2.u5.t106, i2.u9....679
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
ITS-tools command line returned an error code 139
[2024-05-28 19:42:29] [INFO ] Applying decomposition
[2024-05-28 19:42:29] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:42:29] [INFO ] Decomposing Gal with order
[2024-05-28 19:42:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:42:29] [INFO ] Removed a total of 1 redundant transitions.
[2024-05-28 19:42:29] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:42:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 19:42:29] [INFO ] Time to serialize gal into /tmp/CTLFireability14203463415309564511.gal : 1 ms
[2024-05-28 19:42:29] [INFO ] Time to serialize properties into /tmp/CTLFireability483796300415089004.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/CTLFireability14203463415309564511.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability483796300415089004.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 4 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.33411e+12,3.33723,123760,1905,254,223178,624,223,856525,107,4923,0


Converting to forward existential form...Done !
original formula: EX((EG(AF((i1.i0.i0.u34.p119==0))) * E(EG(!(EG((i0.i1.i0.i0.i0.i0.i0.i0.u10.p14==1)))) U ((((i1.i0.u35.p126==1)||(i1.i0.i0.i0.i0.u50.p79=...229
=> equivalent forward existential formula: [(FwdU((EY(Init) * EG(!(EG(!((i1.i0.i0.u34.p119==0)))))),EG(!(EG((i0.i1.i0.i0.i0.i0.i0.i0.u10.p14==1))))) * ((((...281
Reverse transition relation is NOT exact ! Due to transitions i0.u2.t107, i0.i1.u19.t56, i0.i1.u19.t57, i0.i1.u19.t61, i0.i1.u19.t63, i0.i1.u19.t64, i0.i1....1151
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
ITS-tools command line returned an error code 137
[2024-05-28 19:51:32] [INFO ] Flatten gal took : 10 ms
[2024-05-28 19:51:32] [INFO ] Input system was already deterministic with 128 transitions.
[2024-05-28 19:51:32] [INFO ] Transformed 138 places.
[2024-05-28 19:51:32] [INFO ] Transformed 128 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 19:51:32] [INFO ] Time to serialize gal into /tmp/CTLFireability16120315539000252058.gal : 1 ms
[2024-05-28 19:51:32] [INFO ] Time to serialize properties into /tmp/CTLFireability15086661275106910708.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/CTLFireability16120315539000252058.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15086661275106910708.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 4 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.33411e+12,0.664853,29840,2,6061,5,99792,6,0,682,142338,0


Converting to forward existential form...Done !
original formula: EX((EG(AF((p119==0))) * E(EG(!(EG((p14==1)))) U ((((p126==1)||(p79==1))||((p134==1)&&(p135==1)))&&(p102==1)))))
=> equivalent forward existential formula: [(FwdU((EY(Init) * EG(!(EG(!((p119==0)))))),EG(!(EG((p14==1))))) * ((((p126==1)||(p79==1))||((p134==1)&&(p135==1...181
Reverse transition relation is NOT exact ! Due to transitions t6, t11, t13, t14, t17, t21, t27, t31, t33, t36, t37, t41, t43, t44, t45, t46, t47, t48, t50,...403
ITS-tools command line returned an error code 137
Total runtime 1847763 ms.

BK_STOP 1716926502202

--------------------
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="ShieldIIPt-PT-002B"
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 ShieldIIPt-PT-002B, 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 r356-tall-171683760600202"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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