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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 13 11:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 13 11:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 11:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K Apr 13 11:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 18K 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 ShieldPPPs-PT-001B-CTLFireability-2024-00
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-2024-01
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-2024-02
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-2024-03
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-2024-04
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-2024-05
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-2024-06
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-2024-07
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-2024-08
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-2024-09
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-2024-10
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-2024-11
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-2023-12
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-2023-13
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-2023-14
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716951120245

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-001B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 02:52:01] [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-29 02:52:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 02:52:01] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2024-05-29 02:52:01] [INFO ] Transformed 71 places.
[2024-05-29 02:52:01] [INFO ] Transformed 66 transitions.
[2024-05-29 02:52:01] [INFO ] Found NUPN structural information;
[2024-05-29 02:52:01] [INFO ] Parsed PT model containing 71 places and 66 transitions and 180 arcs in 132 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 60 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Applied a total of 0 rules in 25 ms. Remains 71 /71 variables (removed 0) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 71 cols
[2024-05-29 02:52:01] [INFO ] Computed 12 invariants in 7 ms
[2024-05-29 02:52:01] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-29 02:52:01] [INFO ] Invariant cache hit.
[2024-05-29 02:52:01] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-29 02:52:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 12/82 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-29 02:52:02] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 9 ms to minimize.
[2024-05-29 02:52:02] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 02:52:02] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-29 02:52:02] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-05-29 02:52:02] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-29 02:52:02] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-29 02:52:02] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-29 02:52:02] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
[2024-05-29 02:52:02] [INFO ] Deduced a trap composed of 18 places in 15 ms of which 0 ms to minimize.
[2024-05-29 02:52:02] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-29 02:52:02] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-29 02:52:02] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
[2024-05-29 02:52:02] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-29 02:52:02] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-29 02:52:02] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 0 ms to minimize.
[2024-05-29 02:52:02] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-29 02:52:02] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-29 02:52:03] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 1 ms to minimize.
[2024-05-29 02:52:03] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-29 02:52:03] [INFO ] Deduced a trap composed of 20 places in 17 ms of which 0 ms to minimize.
[2024-05-29 02:52:03] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 02:52:03] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 66/137 variables, 71/176 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-29 02:52:03] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/137 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 177 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2224 ms.
Refiners :[Domain max(s): 71/71 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 12/82 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 23/106 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 66/137 variables, 71/177 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 65/242 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-29 02:52:04] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-29 02:52:04] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-29 02:52:04] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 3/245 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-29 02:52:05] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 11 (OVERLAPS) 0/137 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 246 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2520 ms.
Refiners :[Domain max(s): 71/71 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 27/27 constraints]
After SMT, in 4783ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 4792ms
Finished structural reductions in LTL mode , in 1 iterations and 5133 ms. Remains : 71/71 places, 66/66 transitions.
Support contains 60 out of 71 places after structural reductions.
[2024-05-29 02:52:06] [INFO ] Flatten gal took : 20 ms
[2024-05-29 02:52:06] [INFO ] Flatten gal took : 7 ms
[2024-05-29 02:52:06] [INFO ] Input system was already deterministic with 66 transitions.
Reduction of identical properties reduced properties to check from 58 to 54
RANDOM walk for 40000 steps (132 resets) in 937 ms. (42 steps per ms) remains 2/54 properties
BEST_FIRST walk for 40004 steps (22 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (28 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
[2024-05-29 02:52:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 2 (OVERLAPS) 22/26 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 22/28 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 45/71 variables, 10/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 45/83 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-29 02:52:07] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-29 02:52:07] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 2/85 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/85 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 66/137 variables, 71/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-29 02:52:07] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 1 ms to minimize.
[2024-05-29 02:52:07] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 2/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/137 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 158 constraints, problems are : Problem set: 1 solved, 1 unsolved in 192 ms.
Refiners :[Domain max(s): 71/71 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 24/26 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 24/28 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 45/71 variables, 10/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 45/83 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 4/87 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-29 02:52:07] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 1/88 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 0/88 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 66/137 variables, 71/159 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 1/160 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-29 02:52:07] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/137 variables, 1/161 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/137 variables, 0/161 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/137 variables, 0/161 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 161 constraints, problems are : Problem set: 1 solved, 1 unsolved in 104 ms.
Refiners :[Domain max(s): 71/71 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 301ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 66/66 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 71 transition count 58
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 63 transition count 58
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 16 place count 63 transition count 53
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 26 place count 58 transition count 53
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 31 place count 53 transition count 48
Iterating global reduction 2 with 5 rules applied. Total rules applied 36 place count 53 transition count 48
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 36 place count 53 transition count 46
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 51 transition count 46
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 72 place count 35 transition count 30
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 78 place count 35 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 34 transition count 29
Applied a total of 79 rules in 26 ms. Remains 34 /71 variables (removed 37) and now considering 29/66 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 34/71 places, 29/66 transitions.
RANDOM walk for 40000 steps (8 resets) in 243 ms. (163 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Probably explored full state space saw : 31649 states, properties seen :0
Probabilistic random walk after 151995 steps, saw 31649 distinct states, run finished after 211 ms. (steps per millisecond=720 ) properties seen :0
Explored full state space saw : 31649 states, properties seen :0
Exhaustive walk after 151995 steps, saw 31649 distinct states, run finished after 98 ms. (steps per millisecond=1550 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-05-29 02:52:08] [INFO ] Flatten gal took : 6 ms
[2024-05-29 02:52:08] [INFO ] Flatten gal took : 5 ms
[2024-05-29 02:52:08] [INFO ] Input system was already deterministic with 66 transitions.
Computed a total of 16 stabilizing places and 16 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 70 transition count 59
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 64 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 63 transition count 58
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 14 place count 63 transition count 52
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 26 place count 57 transition count 52
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 31 place count 52 transition count 47
Iterating global reduction 3 with 5 rules applied. Total rules applied 36 place count 52 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 36 place count 52 transition count 46
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 51 transition count 46
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
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 38 transition count 33
Applied a total of 64 rules in 12 ms. Remains 38 /71 variables (removed 33) and now considering 33/66 (removed 33) transitions.
// Phase 1: matrix 33 rows 38 cols
[2024-05-29 02:52:08] [INFO ] Computed 12 invariants in 3 ms
[2024-05-29 02:52:08] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 02:52:08] [INFO ] Invariant cache hit.
[2024-05-29 02:52:08] [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.
[2024-05-29 02:52:08] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-29 02:52:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 1/38 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-05-29 02:52:08] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-29 02:52:08] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 3 ms to minimize.
[2024-05-29 02:52:08] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 33/71 variables, 38/53 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-05-29 02:52:08] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-29 02:52:08] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/71 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 71/71 variables, and 55 constraints, problems are : Problem set: 0 solved, 32 unsolved in 466 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 1/38 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 33/71 variables, 38/55 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 32/87 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-05-29 02:52:08] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-29 02:52:08] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-05-29 02:52:08] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 0/71 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 71/71 variables, and 90 constraints, problems are : Problem set: 0 solved, 32 unsolved in 583 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 8/8 constraints]
After SMT, in 1057ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 1058ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/71 places, 33/66 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1146 ms. Remains : 38/71 places, 33/66 transitions.
[2024-05-29 02:52:09] [INFO ] Flatten gal took : 4 ms
[2024-05-29 02:52:09] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:52:09] [INFO ] Input system was already deterministic with 33 transitions.
[2024-05-29 02:52:09] [INFO ] Flatten gal took : 3 ms
[2024-05-29 02:52:09] [INFO ] Flatten gal took : 3 ms
[2024-05-29 02:52:09] [INFO ] Time to serialize gal into /tmp/CTLFireability9774657320109952536.gal : 2 ms
[2024-05-29 02:52:09] [INFO ] Time to serialize properties into /tmp/CTLFireability13300341613879804383.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/CTLFireability9774657320109952536.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13300341613879804383.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,36776,0.066242,6196,2,913,5,10945,6,0,187,18331,0


Converting to forward existential form...Done !
original formula: E(AF((p59==1)) U A(((p60==1)||(p11==1)) U (p10==1)))
=> equivalent forward existential formula: [((FwdU(Init,!(EG(!((p59==1))))) * !(EG(!((p10==1))))) * !(E(!((p10==1)) U (!(((p60==1)||(p11==1))) * !((p10==1)...170
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t9, t10, t11, t12, t23, t24, t25, t26, t28, t29, t31, t32, I...251
(forward)formula 0,1,1.0601,48556,1,0,615,237725,103,313,1180,360162,720
FORMULA ShieldPPPs-PT-001B-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 64 transition count 59
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 64 transition count 59
Applied a total of 14 rules in 6 ms. Remains 64 /71 variables (removed 7) and now considering 59/66 (removed 7) transitions.
// Phase 1: matrix 59 rows 64 cols
[2024-05-29 02:52:10] [INFO ] Computed 12 invariants in 2 ms
[2024-05-29 02:52:10] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 02:52:10] [INFO ] Invariant cache hit.
[2024-05-29 02:52:10] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-05-29 02:52:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:52:10] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-29 02:52:10] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 02:52:10] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-29 02:52:10] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 59/123 variables, 64/80 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 80 constraints, problems are : Problem set: 0 solved, 58 unsolved in 854 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:52:11] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-29 02:52:11] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/123 variables, 64/82 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 58/140 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:52:11] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-29 02:52:11] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-29 02:52:11] [INFO ] Deduced a trap composed of 9 places in 14 ms of which 0 ms to minimize.
[2024-05-29 02:52:11] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 2 ms to minimize.
[2024-05-29 02:52:12] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 1 ms to minimize.
[2024-05-29 02:52:12] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 6/146 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:52:12] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 02:52:12] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-29 02:52:12] [INFO ] Deduced a trap composed of 25 places in 19 ms of which 1 ms to minimize.
[2024-05-29 02:52:12] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 13 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:52:12] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-29 02:52:12] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:52:13] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-29 02:52:13] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 12 (OVERLAPS) 0/123 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 154 constraints, problems are : Problem set: 0 solved, 58 unsolved in 3091 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 20/20 constraints]
After SMT, in 3954ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 3955ms
Starting structural reductions in LTL mode, iteration 1 : 64/71 places, 59/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4049 ms. Remains : 64/71 places, 59/66 transitions.
[2024-05-29 02:52:14] [INFO ] Flatten gal took : 7 ms
[2024-05-29 02:52:14] [INFO ] Flatten gal took : 3 ms
[2024-05-29 02:52:14] [INFO ] Input system was already deterministic with 59 transitions.
[2024-05-29 02:52:14] [INFO ] Flatten gal took : 3 ms
[2024-05-29 02:52:14] [INFO ] Flatten gal took : 3 ms
[2024-05-29 02:52:14] [INFO ] Time to serialize gal into /tmp/CTLFireability3740996007689311238.gal : 1 ms
[2024-05-29 02:52:14] [INFO ] Time to serialize properties into /tmp/CTLFireability12712734933016314553.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/CTLFireability3740996007689311238.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12712734933016314553.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,3.53243e+06,1.27668,51076,2,8178,5,170626,6,0,317,284945,0


Converting to forward existential form...Done !
original formula: EG((AX((((EF(((p8==1)||(p31==1))) + ((p25==1)&&(p40==1))) + ((p20==0)||(p57==0))) + (p38==0))) + EG(A((p50==1) U (p60==1)))))
=> equivalent forward existential formula: [FwdG(Init,(!(EX(!((((E(TRUE U ((p8==1)||(p31==1))) + ((p25==1)&&(p40==1))) + ((p20==0)||(p57==0))) + (p38==0)))...243
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t15, t20, t26, t29, t31, t32, t34, t35, t37, t38, t39, ...258
Detected timeout of ITS tools.
[2024-05-29 02:52:44] [INFO ] Flatten gal took : 3 ms
[2024-05-29 02:52:44] [INFO ] Applying decomposition
[2024-05-29 02:52:44] [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/graph10036228057114529896.txt' '-o' '/tmp/graph10036228057114529896.bin' '-w' '/tmp/graph10036228057114529896.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10036228057114529896.bin' '-l' '-1' '-v' '-w' '/tmp/graph10036228057114529896.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:52:44] [INFO ] Decomposing Gal with order
[2024-05-29 02:52:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:52:44] [INFO ] Removed a total of 9 redundant transitions.
[2024-05-29 02:52:44] [INFO ] Flatten gal took : 28 ms
[2024-05-29 02:52:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 02:52:44] [INFO ] Time to serialize gal into /tmp/CTLFireability9662551832484529354.gal : 3 ms
[2024-05-29 02:52:44] [INFO ] Time to serialize properties into /tmp/CTLFireability9207482212255654797.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/CTLFireability9662551832484529354.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9207482212255654797.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,3.53243e+06,0.085023,7688,436,33,8915,197,205,12341,43,536,0


Converting to forward existential form...Done !
original formula: EG((AX((((EF(((i1.i0.u3.p8==1)||(i5.u12.p31==1))) + ((i3.u10.p25==1)&&(i6.u16.p40==1))) + ((i2.u8.p20==0)||(i7.u21.p57==0))) + (i6.u16.p3...207
=> equivalent forward existential formula: [FwdG(Init,(!(EX(!((((E(TRUE U ((i1.i0.u3.p8==1)||(i5.u12.p31==1))) + ((i3.u10.p25==1)&&(i6.u16.p40==1))) + ((i2...321
Reverse transition relation is NOT exact ! Due to transitions t29, t32, t35, u23.t9, u23.t10, u23.t11, i0.u0.t39, i1.i1.u5.t38, i2.u6.t37, i3.u9.t34, i5.u1...370
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,1.42549,73160,1,0,164987,362,1238,175876,219,846,256843
FORMULA ShieldPPPs-PT-001B-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 60
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 64 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 64 transition count 59
Applied a total of 14 rules in 5 ms. Remains 64 /71 variables (removed 7) and now considering 59/66 (removed 7) transitions.
// Phase 1: matrix 59 rows 64 cols
[2024-05-29 02:52:46] [INFO ] Computed 12 invariants in 0 ms
[2024-05-29 02:52:46] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 02:52:46] [INFO ] Invariant cache hit.
[2024-05-29 02:52:46] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-05-29 02:52:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:52:46] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-29 02:52:46] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 02:52:46] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-29 02:52:46] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:52:46] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-29 02:52:46] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-29 02:52:46] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:52:46] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 59/123 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:52:47] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/123 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 85 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1406 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:52:47] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-29 02:52:47] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/123 variables, 64/87 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 58/145 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:52:47] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-29 02:52:48] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 02:52:48] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-29 02:52:48] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 4/149 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/123 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 149 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1495 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 15/15 constraints]
After SMT, in 2910ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 2912ms
Starting structural reductions in LTL mode, iteration 1 : 64/71 places, 59/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3005 ms. Remains : 64/71 places, 59/66 transitions.
[2024-05-29 02:52:49] [INFO ] Flatten gal took : 9 ms
[2024-05-29 02:52:49] [INFO ] Flatten gal took : 3 ms
[2024-05-29 02:52:49] [INFO ] Input system was already deterministic with 59 transitions.
[2024-05-29 02:52:49] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:52:49] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:52:49] [INFO ] Time to serialize gal into /tmp/CTLFireability17047854400094729943.gal : 1 ms
[2024-05-29 02:52:49] [INFO ] Time to serialize properties into /tmp/CTLFireability8273771368346616016.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/CTLFireability17047854400094729943.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8273771368346616016.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,3.99973e+06,1.0233,41320,2,5923,5,130654,6,0,317,227811,0


Converting to forward existential form...Done !
original formula: (AG(A((p42==1) U ((p34==1)&&(p54==1)))) + A(!(AX((p8==1))) U (AF((AF(((p34==1)&&(p54==1))) * E(((p25==1)&&(p40==1)) U (p67==1)))) + AF((!...199
=> equivalent forward existential formula: ([(FwdU(FwdU((Init * !(!((E(!((!(EG(!((!(EG(!(((p34==1)&&(p54==1))))) * E(((p25==1)&&(p40==1)) U (p67==1)))))) +...1414
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t16, t21, t30, t32, t33, t35, t36, t38, t39, t40, ...253
Detected timeout of ITS tools.
[2024-05-29 02:53:19] [INFO ] Flatten gal took : 3 ms
[2024-05-29 02:53:19] [INFO ] Applying decomposition
[2024-05-29 02:53:19] [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/graph18359342303088073032.txt' '-o' '/tmp/graph18359342303088073032.bin' '-w' '/tmp/graph18359342303088073032.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18359342303088073032.bin' '-l' '-1' '-v' '-w' '/tmp/graph18359342303088073032.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:53:19] [INFO ] Decomposing Gal with order
[2024-05-29 02:53:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:53:19] [INFO ] Removed a total of 9 redundant transitions.
[2024-05-29 02:53:19] [INFO ] Flatten gal took : 7 ms
[2024-05-29 02:53:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 02:53:19] [INFO ] Time to serialize gal into /tmp/CTLFireability13884448964573747440.gal : 2 ms
[2024-05-29 02:53:19] [INFO ] Time to serialize properties into /tmp/CTLFireability8854629657694324215.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/CTLFireability13884448964573747440.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8854629657694324215.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,3.99973e+06,0.12692,9816,433,34,13608,227,212,17471,46,693,0


Converting to forward existential form...Done !
original formula: (AG(A((i6.u15.p42==1) U ((i4.u14.p34==1)&&(u19.p54==1)))) + A(!(AX((i1.i1.u3.p8==1))) U (AF((AF(((i4.u14.p34==1)&&(u19.p54==1))) * E(((i3...269
=> equivalent forward existential formula: ([(FwdU(FwdU((Init * !(!((E(!((!(EG(!((!(EG(!(((i4.u14.p34==1)&&(u19.p54==1))))) * E(((i3.u11.p25==1)&&(i6.u15.p...1778
Reverse transition relation is NOT exact ! Due to transitions t30, t33, t36, u22.t10, u22.t11, u22.t12, u19.t6, u19.t7, u19.t8, u19.t9, i0.u0.t40, i1.i1.u5...350
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 9
(forward)formula 0,0,8.55556,388392,1,0,833914,514,1267,1.11248e+06,252,1571,1166936
FORMULA ShieldPPPs-PT-001B-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 64 transition count 59
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 63 transition count 58
Applied a total of 16 rules in 12 ms. Remains 63 /71 variables (removed 8) and now considering 58/66 (removed 8) transitions.
// Phase 1: matrix 58 rows 63 cols
[2024-05-29 02:53:27] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 02:53:27] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-29 02:53:27] [INFO ] Invariant cache hit.
[2024-05-29 02:53:27] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2024-05-29 02:53:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:53:28] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-29 02:53:28] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-29 02:53:28] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-29 02:53:28] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:53:28] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-29 02:53:28] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:53:28] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-29 02:53:28] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:53:28] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 58/121 variables, 63/84 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:53:28] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/121 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 85 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1451 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:53:29] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 58/121 variables, 63/86 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 57/143 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:53:29] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 3 ms to minimize.
[2024-05-29 02:53:29] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-29 02:53:29] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 0 ms to minimize.
[2024-05-29 02:53:29] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-29 02:53:29] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 5/148 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:53:30] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/121 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 149 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1822 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 17/17 constraints]
After SMT, in 3278ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 3279ms
Starting structural reductions in LTL mode, iteration 1 : 63/71 places, 58/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3371 ms. Remains : 63/71 places, 58/66 transitions.
[2024-05-29 02:53:31] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:53:31] [INFO ] Flatten gal took : 3 ms
[2024-05-29 02:53:31] [INFO ] Input system was already deterministic with 58 transitions.
[2024-05-29 02:53:31] [INFO ] Flatten gal took : 3 ms
[2024-05-29 02:53:31] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:53:31] [INFO ] Time to serialize gal into /tmp/CTLFireability9842489921941657037.gal : 1 ms
[2024-05-29 02:53:31] [INFO ] Time to serialize properties into /tmp/CTLFireability11569171615198834371.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/CTLFireability9842489921941657037.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11569171615198834371.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,3.49598e+06,1.0465,42588,2,5935,5,136158,6,0,312,235490,0


Converting to forward existential form...Done !
original formula: AX(AG(EF((((p27==1)&&(p68==1))&&(((p1==0)||(p52==0))||(p56==0))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U (((p27==1)&&(p68==1))&&(((p1==0)||(p52==0))||(p56==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t15, t20, t29, t31, t32, t34, t35, t37, t38, t39, Inte...248
(forward)formula 0,0,5.21614,162464,1,0,163,773479,138,76,1923,857579,162
FORMULA ShieldPPPs-PT-001B-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 70 transition count 57
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 62 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 61 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 18 place count 61 transition count 53
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 24 place count 58 transition count 53
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 29 place count 53 transition count 48
Iterating global reduction 3 with 5 rules applied. Total rules applied 34 place count 53 transition count 48
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 34 place count 53 transition count 47
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 52 transition count 47
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 66 place count 37 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 36 transition count 31
Applied a total of 67 rules in 10 ms. Remains 36 /71 variables (removed 35) and now considering 31/66 (removed 35) transitions.
// Phase 1: matrix 31 rows 36 cols
[2024-05-29 02:53:36] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 02:53:36] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 02:53:36] [INFO ] Invariant cache hit.
[2024-05-29 02:53:36] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-29 02:53:36] [INFO ] Redundant transitions in 0 ms returned []
Running 28 sub problems to find dead transitions.
[2024-05-29 02:53:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 2/36 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 31/67 variables, 36/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 0/67 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 67/67 variables, and 48 constraints, problems are : Problem set: 0 solved, 28 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 2/36 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 31/67 variables, 36/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 28/76 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/67 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 67/67 variables, and 76 constraints, problems are : Problem set: 0 solved, 28 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 494ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 494ms
Starting structural reductions in SI_CTL mode, iteration 1 : 36/71 places, 31/66 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 567 ms. Remains : 36/71 places, 31/66 transitions.
[2024-05-29 02:53:36] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:53:36] [INFO ] Flatten gal took : 3 ms
[2024-05-29 02:53:36] [INFO ] Input system was already deterministic with 31 transitions.
[2024-05-29 02:53:36] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:53:36] [INFO ] Flatten gal took : 1 ms
[2024-05-29 02:53:36] [INFO ] Time to serialize gal into /tmp/CTLFireability14163078561927229586.gal : 1 ms
[2024-05-29 02:53:36] [INFO ] Time to serialize properties into /tmp/CTLFireability12689760802892091793.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/CTLFireability14163078561927229586.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12689760802892091793.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,122882,0.051846,6004,2,552,5,10726,6,0,178,16567,0


Converting to forward existential form...Done !
original formula: AF(((AF(((p51==1)||((p61==0)&&((p19==0)||(p21==0))))) * EG(AG((((p14==1)&&(p49==1))&&((p20==1)&&(p57==1)))))) * (p56==1)))
=> equivalent forward existential formula: [FwdG(Init,!(((!(EG(!(((p51==1)||((p61==0)&&((p19==0)||(p21==0))))))) * EG(!(E(TRUE U !((((p14==1)&&(p49==1))&&(...203
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t9, t16, t24, t27, t28, t29, t30, Intersection with reachabl...226
(forward)formula 0,0,0.146917,9436,1,0,96,28682,96,38,1164,35407,84
FORMULA ShieldPPPs-PT-001B-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 66 transition count 61
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 66 transition count 61
Applied a total of 10 rules in 11 ms. Remains 66 /71 variables (removed 5) and now considering 61/66 (removed 5) transitions.
// Phase 1: matrix 61 rows 66 cols
[2024-05-29 02:53:37] [INFO ] Computed 12 invariants in 2 ms
[2024-05-29 02:53:37] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-29 02:53:37] [INFO ] Invariant cache hit.
[2024-05-29 02:53:37] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-29 02:53:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 02:53:37] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-29 02:53:37] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-29 02:53:37] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 02:53:37] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-29 02:53:37] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-29 02:53:37] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 61/127 variables, 66/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 02:53:37] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 02:53:38] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-29 02:53:38] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/127 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 87 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1303 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 61/127 variables, 66/87 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 60/147 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 02:53:38] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 02:53:38] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-29 02:53:38] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 1 ms to minimize.
[2024-05-29 02:53:39] [INFO ] Deduced a trap composed of 23 places in 16 ms of which 1 ms to minimize.
[2024-05-29 02:53:39] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 5/152 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 02:53:39] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-29 02:53:39] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 02:53:39] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 1 ms to minimize.
[2024-05-29 02:53:39] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 4 ms to minimize.
[2024-05-29 02:53:39] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-29 02:53:39] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 02:53:40] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/127 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 02:53:41] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/127 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/127 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 13 (OVERLAPS) 0/127 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 160 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3888 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 22/22 constraints]
After SMT, in 5199ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 5199ms
Starting structural reductions in LTL mode, iteration 1 : 66/71 places, 61/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5291 ms. Remains : 66/71 places, 61/66 transitions.
[2024-05-29 02:53:42] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:53:42] [INFO ] Flatten gal took : 3 ms
[2024-05-29 02:53:42] [INFO ] Input system was already deterministic with 61 transitions.
[2024-05-29 02:53:42] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:53:42] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:53:42] [INFO ] Time to serialize gal into /tmp/CTLFireability656904974175146395.gal : 1 ms
[2024-05-29 02:53:42] [INFO ] Time to serialize properties into /tmp/CTLFireability9712904560174133266.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/CTLFireability656904974175146395.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9712904560174133266.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,4.0062e+06,1.57529,60208,2,11271,5,193164,6,0,327,338872,0


Converting to forward existential form...Done !
original formula: AG(((AX((((p19==0)||(p21==0))&&(p64==0))) + EX((p66==1))) + (!(E(EF((p45==1)) U AG(((p32==1)&&(p68==1))))) + (EF((p9==0)) * ((p29==0)||(p...166
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !((!(EX(!((((p19==0)||(p21==0))&&(p64==0))))) + EX((p66==1))))) * !((E(TRUE U (p9==0)...251
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t16, t21, t28, t30, t31, t33, t34, t36, t37, t39, ...263
(forward)formula 0,1,3.46456,89420,1,0,149,367367,144,64,1870,356294,132
FORMULA ShieldPPPs-PT-001B-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 64 transition count 59
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 63 transition count 58
Applied a total of 16 rules in 4 ms. Remains 63 /71 variables (removed 8) and now considering 58/66 (removed 8) transitions.
// Phase 1: matrix 58 rows 63 cols
[2024-05-29 02:53:45] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 02:53:45] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-29 02:53:45] [INFO ] Invariant cache hit.
[2024-05-29 02:53:46] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2024-05-29 02:53:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:53:46] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-29 02:53:46] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-29 02:53:46] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-29 02:53:46] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:53:46] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-29 02:53:46] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:53:46] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-29 02:53:46] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:53:46] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 58/121 variables, 63/84 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:53:47] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/121 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 85 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1456 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:53:47] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 58/121 variables, 63/86 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 57/143 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:53:47] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 02:53:47] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-29 02:53:48] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-29 02:53:48] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 02:53:48] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 5/148 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:53:48] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/121 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 149 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1956 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 17/17 constraints]
After SMT, in 3419ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 3420ms
Starting structural reductions in LTL mode, iteration 1 : 63/71 places, 58/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3502 ms. Remains : 63/71 places, 58/66 transitions.
[2024-05-29 02:53:49] [INFO ] Flatten gal took : 7 ms
[2024-05-29 02:53:49] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:53:49] [INFO ] Input system was already deterministic with 58 transitions.
[2024-05-29 02:53:49] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:53:49] [INFO ] Flatten gal took : 3 ms
[2024-05-29 02:53:49] [INFO ] Time to serialize gal into /tmp/CTLFireability3408976116102462772.gal : 3 ms
[2024-05-29 02:53:49] [INFO ] Time to serialize properties into /tmp/CTLFireability6048501016523942649.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/CTLFireability3408976116102462772.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6048501016523942649.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,3.49598e+06,1.06486,42568,2,5935,5,136158,6,0,312,235490,0


Converting to forward existential form...Done !
original formula: E(((p14==1)&&(p49==1)) U A(!(EF(EG(((p20==1)&&(p56==1))))) U A(!((EG((p60==1)) * (p40!=1))) U AX((p17==1)))))
=> equivalent forward existential formula: [((FwdU(Init,((p14==1)&&(p49==1))) * !(EG(!(!((E(!(!(EX(!((p17==1))))) U (!(!((EG((p60==1)) * (p40!=1)))) * !(!(...516
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t15, t20, t29, t31, t32, t34, t35, t37, t38, t39, Inte...248
Using saturation style SCC detection
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 55/2/3
(forward)formula 0,0,13.1203,412028,1,0,709,2.61538e+06,165,302,1890,2.15389e+06,810
FORMULA ShieldPPPs-PT-001B-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 64 transition count 59
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 63 transition count 58
Applied a total of 16 rules in 4 ms. Remains 63 /71 variables (removed 8) and now considering 58/66 (removed 8) transitions.
[2024-05-29 02:54:02] [INFO ] Invariant cache hit.
[2024-05-29 02:54:02] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 02:54:02] [INFO ] Invariant cache hit.
[2024-05-29 02:54:02] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2024-05-29 02:54:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:54:02] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-29 02:54:02] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 02:54:03] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 02:54:03] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:54:03] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-29 02:54:03] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:54:03] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-29 02:54:03] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:54:03] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 58/121 variables, 63/84 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:54:03] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/121 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 85 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1484 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:54:04] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 58/121 variables, 63/86 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 57/143 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:54:04] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 02:54:04] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-29 02:54:04] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-29 02:54:04] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-29 02:54:04] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 5/148 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:54:05] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/121 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 149 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1911 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 17/17 constraints]
After SMT, in 3400ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 3401ms
Starting structural reductions in LTL mode, iteration 1 : 63/71 places, 58/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3479 ms. Remains : 63/71 places, 58/66 transitions.
[2024-05-29 02:54:06] [INFO ] Flatten gal took : 6 ms
[2024-05-29 02:54:06] [INFO ] Flatten gal took : 3 ms
[2024-05-29 02:54:06] [INFO ] Input system was already deterministic with 58 transitions.
[2024-05-29 02:54:06] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:54:06] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:54:06] [INFO ] Time to serialize gal into /tmp/CTLFireability1910309038923475977.gal : 1 ms
[2024-05-29 02:54:06] [INFO ] Time to serialize properties into /tmp/CTLFireability16386675498655868567.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/CTLFireability1910309038923475977.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16386675498655868567.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,3.49598e+06,1.08873,42588,2,5935,5,136158,6,0,312,235490,0


Converting to forward existential form...Done !
original formula: AG(A(EG((EF((p31==1)) + EX((p9==1)))) U (E((AX(((p33==1)&&(p35==1))) * (p7!=1)) U ((p20==1)&&(p57==1))) * AF(((p27==1)&&(p67==1))))))
=> equivalent forward existential formula: (([((FwdU(FwdU(Init,TRUE),!((E((!(EX(!(((p33==1)&&(p35==1))))) * (p7!=1)) U ((p20==1)&&(p57==1))) * !(EG(!(((p27...665
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t15, t20, t29, t31, t32, t34, t35, t37, t38, t39, Inte...248
(forward)formula 0,0,27.6101,870200,1,0,944,5.10455e+06,150,436,1813,6.4412e+06,969
FORMULA ShieldPPPs-PT-001B-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 71 transition count 59
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 64 transition count 59
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 14 place count 64 transition count 54
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 59 transition count 54
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 31 place count 52 transition count 47
Iterating global reduction 2 with 7 rules applied. Total rules applied 38 place count 52 transition count 47
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 38 place count 52 transition count 45
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 50 transition count 45
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 66 place count 38 transition count 33
Applied a total of 66 rules in 17 ms. Remains 38 /71 variables (removed 33) and now considering 33/66 (removed 33) transitions.
// Phase 1: matrix 33 rows 38 cols
[2024-05-29 02:54:33] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 02:54:34] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 02:54:34] [INFO ] Invariant cache hit.
[2024-05-29 02:54:34] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-29 02:54:34] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-29 02:54:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-05-29 02:54:34] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 02:54:34] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-29 02:54:34] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
[2024-05-29 02:54:34] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 1 ms to minimize.
[2024-05-29 02:54:34] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 33/71 variables, 38/55 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-05-29 02:54:34] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/71 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 71/71 variables, and 56 constraints, problems are : Problem set: 0 solved, 32 unsolved in 501 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 33/71 variables, 38/56 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 32/88 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-05-29 02:54:34] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/71 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/71 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 71/71 variables, and 89 constraints, problems are : Problem set: 0 solved, 32 unsolved in 589 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 7/7 constraints]
After SMT, in 1095ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 1095ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/71 places, 33/66 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1174 ms. Remains : 38/71 places, 33/66 transitions.
[2024-05-29 02:54:35] [INFO ] Flatten gal took : 7 ms
[2024-05-29 02:54:35] [INFO ] Flatten gal took : 5 ms
[2024-05-29 02:54:35] [INFO ] Input system was already deterministic with 33 transitions.
[2024-05-29 02:54:35] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:54:35] [INFO ] Flatten gal took : 1 ms
[2024-05-29 02:54:35] [INFO ] Time to serialize gal into /tmp/CTLFireability7346886184065263428.gal : 0 ms
[2024-05-29 02:54:35] [INFO ] Time to serialize properties into /tmp/CTLFireability15497250311451996959.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/CTLFireability7346886184065263428.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15497250311451996959.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,65666,0.092029,7884,2,821,5,16742,6,0,187,26615,0


Converting to forward existential form...Done !
original formula: AG(A((p16!=1) U ((p10==1) * (AF(((p0==1)||(p58==1))) + (p9==1)))))
=> equivalent forward existential formula: (([((FwdU(FwdU(Init,TRUE),!(((p10==1) * (!(EG(!(((p0==1)||(p58==1))))) + (p9==1))))) * !((p16!=1))) * !((p10==1)...412
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t10, t21, t25, t26, t29, t30, t31, t32, Intersection with reacha...228
(forward)formula 0,0,1.1188,52656,1,0,480,267654,95,211,1182,346856,527
FORMULA ShieldPPPs-PT-001B-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 66 transition count 61
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 66 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 65 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 65 transition count 60
Applied a total of 12 rules in 6 ms. Remains 65 /71 variables (removed 6) and now considering 60/66 (removed 6) transitions.
// Phase 1: matrix 60 rows 65 cols
[2024-05-29 02:54:36] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 02:54:36] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 02:54:36] [INFO ] Invariant cache hit.
[2024-05-29 02:54:36] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2024-05-29 02:54:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-29 02:54:36] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-29 02:54:36] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-29 02:54:36] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-29 02:54:36] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 0 ms to minimize.
[2024-05-29 02:54:36] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 1 ms to minimize.
[2024-05-29 02:54:36] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 02:54:36] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 1 ms to minimize.
[2024-05-29 02:54:36] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/125 variables, 65/85 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-29 02:54:37] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 0/125 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 86 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1124 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-29 02:54:37] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-29 02:54:37] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 60/125 variables, 65/88 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 59/147 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-29 02:54:37] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-29 02:54:38] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 02:54:38] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
[2024-05-29 02:54:38] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 0 ms to minimize.
[2024-05-29 02:54:38] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 02:54:38] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 6/153 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-29 02:54:38] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-29 02:54:38] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-29 02:54:39] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/125 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-29 02:54:39] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-29 02:54:39] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/125 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 13 (OVERLAPS) 0/125 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 158 constraints, problems are : Problem set: 0 solved, 59 unsolved in 3314 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 22/22 constraints]
After SMT, in 4445ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 4446ms
Starting structural reductions in LTL mode, iteration 1 : 65/71 places, 60/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4522 ms. Remains : 65/71 places, 60/66 transitions.
[2024-05-29 02:54:40] [INFO ] Flatten gal took : 6 ms
[2024-05-29 02:54:40] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:54:40] [INFO ] Input system was already deterministic with 60 transitions.
[2024-05-29 02:54:40] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:54:40] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:54:40] [INFO ] Time to serialize gal into /tmp/CTLFireability1800287448818921311.gal : 1 ms
[2024-05-29 02:54:40] [INFO ] Time to serialize properties into /tmp/CTLFireability7879181834358689007.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/CTLFireability1800287448818921311.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7879181834358689007.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,3.99458e+06,1.12084,45728,2,3526,5,144515,6,0,322,277747,0


Converting to forward existential form...Done !
original formula: A((AG((((p1==1)&&(p52==1))&&(p17==1))) + A(AX((p54==1)) U !(A(((p26==1)&&(p28==1)) U (p23==1))))) U E((p9==1) U (((p24==1)&&(p16==1)) + (...297
=> equivalent forward existential formula: [((Init * !(EG(!(E((p9==1) U (((p24==1)&&(p16==1)) + ((E(TRUE U (p39==1)) * E(!((E(!((p67==1)) U (!((p65==1)) * ...1139
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t16, t21, t25, t26, t31, t33, t34, t36, t37, t39, ...263
Detected timeout of ITS tools.
[2024-05-29 02:55:10] [INFO ] Flatten gal took : 7 ms
[2024-05-29 02:55:10] [INFO ] Applying decomposition
[2024-05-29 02:55:10] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5223664175462386564.txt' '-o' '/tmp/graph5223664175462386564.bin' '-w' '/tmp/graph5223664175462386564.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5223664175462386564.bin' '-l' '-1' '-v' '-w' '/tmp/graph5223664175462386564.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:55:10] [INFO ] Decomposing Gal with order
[2024-05-29 02:55:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:55:10] [INFO ] Removed a total of 9 redundant transitions.
[2024-05-29 02:55:10] [INFO ] Flatten gal took : 5 ms
[2024-05-29 02:55:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 02:55:10] [INFO ] Time to serialize gal into /tmp/CTLFireability1098459994947025126.gal : 2 ms
[2024-05-29 02:55:10] [INFO ] Time to serialize properties into /tmp/CTLFireability8974344202588183099.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/CTLFireability1098459994947025126.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8974344202588183099.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,3.99458e+06,0.115183,8776,436,44,10946,235,234,15559,49,863,0


Converting to forward existential form...Done !
original formula: A((AG((((i3.u0.p1==1)&&(i2.u19.p52==1))&&(i1.u7.p17==1))) + A(AX((i2.u19.p54==1)) U !(A(((i3.u11.p26==1)&&(i3.u10.p28==1)) U (i3.u9.p23==...445
=> equivalent forward existential formula: [((Init * !(EG(!(E((i0.i1.u3.p9==1) U (((i3.u10.p24==1)&&(i1.u6.p16==1)) + ((E(TRUE U (i6.u15.p39==1)) * E(!((E(...1591
Reverse transition relation is NOT exact ! Due to transitions t31, t34, t37, u22.t10, u22.t11, u22.t12, i0.i0.u17.t25, i0.i0.u17.t26, i0.i1.u5.t40, i1.u6.t...395
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,8.89611,350128,1,0,645102,417,1282,792007,251,1225,777133
FORMULA ShieldPPPs-PT-001B-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 71 transition count 58
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 63 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 62 transition count 57
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 18 place count 62 transition count 52
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 28 place count 57 transition count 52
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 35 place count 50 transition count 45
Iterating global reduction 3 with 7 rules applied. Total rules applied 42 place count 50 transition count 45
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 42 place count 50 transition count 43
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 46 place count 48 transition count 43
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
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 72 place count 35 transition count 30
Applied a total of 72 rules in 15 ms. Remains 35 /71 variables (removed 36) and now considering 30/66 (removed 36) transitions.
// Phase 1: matrix 30 rows 35 cols
[2024-05-29 02:55:19] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 02:55:19] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 02:55:19] [INFO ] Invariant cache hit.
[2024-05-29 02:55:19] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-29 02:55:19] [INFO ] Redundant transitions in 0 ms returned []
Running 29 sub problems to find dead transitions.
[2024-05-29 02:55:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-29 02:55:20] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 30/65 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 48 constraints, problems are : Problem set: 0 solved, 29 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 30/65 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 29/77 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 0/65 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 77 constraints, problems are : Problem set: 0 solved, 29 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 1/1 constraints]
After SMT, in 585ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 585ms
Starting structural reductions in SI_CTL mode, iteration 1 : 35/71 places, 30/66 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 683 ms. Remains : 35/71 places, 30/66 transitions.
[2024-05-29 02:55:20] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:55:20] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:55:20] [INFO ] Input system was already deterministic with 30 transitions.
[2024-05-29 02:55:20] [INFO ] Flatten gal took : 1 ms
[2024-05-29 02:55:20] [INFO ] Flatten gal took : 1 ms
[2024-05-29 02:55:20] [INFO ] Time to serialize gal into /tmp/CTLFireability9586731750535182307.gal : 0 ms
[2024-05-29 02:55:20] [INFO ] Time to serialize properties into /tmp/CTLFireability9845079528465906370.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/CTLFireability9586731750535182307.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9845079528465906370.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,54993,0.084941,7588,2,1119,5,14925,6,0,172,24922,0


Converting to forward existential form...Done !
original formula: A((p4==1) U EF(((p20==1)&&(p57==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U ((p20==1)&&(p57==1))))))) * !(E(!(E(TRUE U ((p20==1)&&(p57==1)))) U (!((p4==1)) * !(E(...198
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t22, t23, t26, t27, t28, t29, Intersection with reachable at...222
Using saturation style SCC detection
(forward)formula 0,1,0.268056,13924,1,0,177,50681,91,97,1175,62636,177
FORMULA ShieldPPPs-PT-001B-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 70 transition count 57
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 62 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 61 transition count 56
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 18 place count 61 transition count 52
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 26 place count 57 transition count 52
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 32 place count 51 transition count 46
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 51 transition count 46
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 38 place count 51 transition count 43
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 44 place count 48 transition count 43
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 72 place count 34 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 33 transition count 28
Applied a total of 73 rules in 15 ms. Remains 33 /71 variables (removed 38) and now considering 28/66 (removed 38) transitions.
// Phase 1: matrix 28 rows 33 cols
[2024-05-29 02:55:20] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 02:55:20] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 02:55:20] [INFO ] Invariant cache hit.
[2024-05-29 02:55:20] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-05-29 02:55:20] [INFO ] Redundant transitions in 0 ms returned []
Running 25 sub problems to find dead transitions.
[2024-05-29 02:55:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 1/33 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-29 02:55:21] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 28/61 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 0/61 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/61 variables, and 46 constraints, problems are : Problem set: 0 solved, 25 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 1/33 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 28/61 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 25/71 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 0/61 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/61 variables, and 71 constraints, problems are : Problem set: 0 solved, 25 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 1/1 constraints]
After SMT, in 524ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 525ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/71 places, 28/66 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 604 ms. Remains : 33/71 places, 28/66 transitions.
[2024-05-29 02:55:21] [INFO ] Flatten gal took : 1 ms
[2024-05-29 02:55:21] [INFO ] Flatten gal took : 1 ms
[2024-05-29 02:55:21] [INFO ] Input system was already deterministic with 28 transitions.
[2024-05-29 02:55:21] [INFO ] Flatten gal took : 1 ms
[2024-05-29 02:55:21] [INFO ] Flatten gal took : 1 ms
[2024-05-29 02:55:21] [INFO ] Time to serialize gal into /tmp/CTLFireability13729598903983517617.gal : 0 ms
[2024-05-29 02:55:21] [INFO ] Time to serialize properties into /tmp/CTLFireability2427103515371973607.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/CTLFireability13729598903983517617.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2427103515371973607.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,68524,0.064569,6256,2,645,5,11402,6,0,163,19150,0


Converting to forward existential form...Done !
original formula: A(!(((p26==1)&&(p28==1))) U AF(((p66==1)||((p14==1)&&(p49==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(((p66==1)||((p14==1)&&(p49==1)))))))))) * !(E(!(!(EG(!(((p66==1)||((p14==1)&&(p49==1))))...250
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t11, t22, t25, t26, t27, Intersection with reachable at each...217
Using saturation style SCC detection
(forward)formula 0,1,1.21158,55520,1,0,696,288810,86,383,1044,412900,770
FORMULA ShieldPPPs-PT-001B-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 66 transition count 61
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 66 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 65 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 65 transition count 60
Applied a total of 12 rules in 5 ms. Remains 65 /71 variables (removed 6) and now considering 60/66 (removed 6) transitions.
// Phase 1: matrix 60 rows 65 cols
[2024-05-29 02:55:22] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 02:55:22] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-29 02:55:22] [INFO ] Invariant cache hit.
[2024-05-29 02:55:22] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2024-05-29 02:55:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-29 02:55:22] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 02:55:23] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 02:55:23] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-29 02:55:23] [INFO ] Deduced a trap composed of 27 places in 21 ms of which 1 ms to minimize.
[2024-05-29 02:55:23] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-29 02:55:23] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-29 02:55:23] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-29 02:55:23] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-29 02:55:23] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/125 variables, 65/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 86 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/125 variables, 65/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/145 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-29 02:55:24] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 02:55:24] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-29 02:55:24] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-29 02:55:24] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
[2024-05-29 02:55:24] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-29 02:55:24] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-29 02:55:24] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 7/152 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-29 02:55:24] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/125 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/125 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 153 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2211 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 17/17 constraints]
After SMT, in 3238ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3239ms
Starting structural reductions in LTL mode, iteration 1 : 65/71 places, 60/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3324 ms. Remains : 65/71 places, 60/66 transitions.
[2024-05-29 02:55:26] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:55:26] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:55:26] [INFO ] Input system was already deterministic with 60 transitions.
[2024-05-29 02:55:26] [INFO ] Flatten gal took : 1 ms
[2024-05-29 02:55:26] [INFO ] Flatten gal took : 1 ms
[2024-05-29 02:55:26] [INFO ] Time to serialize gal into /tmp/CTLFireability2858039128616010589.gal : 0 ms
[2024-05-29 02:55:26] [INFO ] Time to serialize properties into /tmp/CTLFireability13355931636045543164.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/CTLFireability2858039128616010589.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13355931636045543164.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,3.9736e+06,1.25153,49476,2,6756,5,165984,6,0,322,278231,0


Converting to forward existential form...Done !
original formula: ((AF(((((p8==1)&&(p39==1))||((p14==1)&&(p49==1)))||(p2==1))) + EX(AG((p59==1)))) + ((EG(AF(((p15==1)&&(p48==1)))) * EF((p42==0))) * EG(AG...168
=> equivalent forward existential formula: [FwdG(((Init * !(((EG(!(EG(!(((p15==1)&&(p48==1)))))) * E(TRUE U (p42==0))) * EG(!(E(TRUE U !((p60==1)))))))) * ...255
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t16, t22, t24, t31, t33, t34, t36, t37, t39, t40, ...258
Hit Full ! (commute/partial/dont) 51/15/9
(forward)formula 0,1,2.91455,83556,1,0,208,379496,162,71,2019,392998,202
FORMULA ShieldPPPs-PT-001B-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 66 transition count 61
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 66 transition count 61
Applied a total of 10 rules in 3 ms. Remains 66 /71 variables (removed 5) and now considering 61/66 (removed 5) transitions.
// Phase 1: matrix 61 rows 66 cols
[2024-05-29 02:55:28] [INFO ] Computed 12 invariants in 0 ms
[2024-05-29 02:55:28] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 02:55:28] [INFO ] Invariant cache hit.
[2024-05-29 02:55:29] [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.
Running 60 sub problems to find dead transitions.
[2024-05-29 02:55:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 02:55:29] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-29 02:55:29] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-29 02:55:29] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 02:55:29] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-29 02:55:29] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-05-29 02:55:29] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-29 02:55:29] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 61/127 variables, 66/85 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 02:55:29] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 02:55:30] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-29 02:55:30] [INFO ] Deduced a trap composed of 26 places in 19 ms of which 1 ms to minimize.
[2024-05-29 02:55:30] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/127 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 02:55:30] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-29 02:55:30] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 02:55:30] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/127 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 92 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1791 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 02:55:31] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 0 ms to minimize.
[2024-05-29 02:55:31] [INFO ] Deduced a trap composed of 19 places in 15 ms of which 0 ms to minimize.
[2024-05-29 02:55:31] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 02:55:31] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 02:55:31] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/127 variables, 66/97 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 60/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 02:55:31] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-29 02:55:31] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 02:55:32] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/127 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 12 (OVERLAPS) 0/127 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 160 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2391 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 22/22 constraints]
After SMT, in 4188ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4189ms
Starting structural reductions in LTL mode, iteration 1 : 66/71 places, 61/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4264 ms. Remains : 66/71 places, 61/66 transitions.
[2024-05-29 02:55:33] [INFO ] Flatten gal took : 7 ms
[2024-05-29 02:55:33] [INFO ] Flatten gal took : 1 ms
[2024-05-29 02:55:33] [INFO ] Input system was already deterministic with 61 transitions.
[2024-05-29 02:55:33] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:55:33] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:55:33] [INFO ] Time to serialize gal into /tmp/CTLFireability7107671959441920256.gal : 1 ms
[2024-05-29 02:55:33] [INFO ] Time to serialize properties into /tmp/CTLFireability17470414433431430021.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/CTLFireability7107671959441920256.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17470414433431430021.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,4.01001e+06,1.25119,50764,2,3936,5,160210,6,0,327,314254,0


Converting to forward existential form...Done !
original formula: EF((EX((AG(((p15==0)||(p48==0))) * ((p18==0)||(p43==0)))) * ((EF((((p12==0)||(p62==0))&&(p36==0))) + (p51==1)) + ((((p19==1)&&(p21==1))&&...202
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,TRUE) * EX((!(E(TRUE U !(((p15==0)||(p48==0))))) * ((p18==0)||(p43==0))))),TRUE) * (((p12==0...475
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t16, t22, t24, t28, t31, t33, t34, t36, t37, t39, ...268
(forward)formula 0,1,3.51524,103772,1,0,190,475882,147,87,1996,637888,183
FORMULA ShieldPPPs-PT-001B-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 70 transition count 56
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 61 transition count 56
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 18 place count 61 transition count 51
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 28 place count 56 transition count 51
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 35 place count 49 transition count 44
Iterating global reduction 2 with 7 rules applied. Total rules applied 42 place count 49 transition count 44
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 42 place count 49 transition count 41
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 48 place count 46 transition count 41
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 74 place count 33 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 32 transition count 27
Applied a total of 75 rules in 12 ms. Remains 32 /71 variables (removed 39) and now considering 27/66 (removed 39) transitions.
// Phase 1: matrix 27 rows 32 cols
[2024-05-29 02:55:36] [INFO ] Computed 12 invariants in 0 ms
[2024-05-29 02:55:36] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 02:55:36] [INFO ] Invariant cache hit.
[2024-05-29 02:55:36] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-29 02:55:36] [INFO ] Redundant transitions in 0 ms returned []
Running 25 sub problems to find dead transitions.
[2024-05-29 02:55:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 27/59 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 0/59 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 59/59 variables, and 44 constraints, problems are : Problem set: 0 solved, 25 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 27/59 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 25/69 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 0/59 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 59/59 variables, and 69 constraints, problems are : Problem set: 0 solved, 25 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 363ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 363ms
Starting structural reductions in SI_CTL mode, iteration 1 : 32/71 places, 27/66 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 439 ms. Remains : 32/71 places, 27/66 transitions.
[2024-05-29 02:55:37] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:55:37] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:55:37] [INFO ] Input system was already deterministic with 27 transitions.
[2024-05-29 02:55:37] [INFO ] Flatten gal took : 1 ms
[2024-05-29 02:55:37] [INFO ] Flatten gal took : 1 ms
[2024-05-29 02:55:37] [INFO ] Time to serialize gal into /tmp/CTLFireability8827960337416704079.gal : 1 ms
[2024-05-29 02:55:37] [INFO ] Time to serialize properties into /tmp/CTLFireability18142639072623283483.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/CTLFireability8827960337416704079.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18142639072623283483.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,44099,0.03557,5192,2,474,5,7431,6,0,158,11844,0


Converting to forward existential form...Done !
original formula: EG((p17==0))
=> equivalent forward existential formula: [FwdG(Init,(p17==0))] != FALSE
Hit Full ! (commute/partial/dont) 25/0/2
(forward)formula 0,0,0.101193,7832,1,0,13,23875,19,3,792,23008,12
FORMULA ShieldPPPs-PT-001B-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 60
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 64 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 64 transition count 59
Applied a total of 14 rules in 5 ms. Remains 64 /71 variables (removed 7) and now considering 59/66 (removed 7) transitions.
// Phase 1: matrix 59 rows 64 cols
[2024-05-29 02:55:37] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 02:55:37] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 02:55:37] [INFO ] Invariant cache hit.
[2024-05-29 02:55:37] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-05-29 02:55:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:55:37] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-29 02:55:37] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-29 02:55:37] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-29 02:55:37] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-29 02:55:37] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
[2024-05-29 02:55:37] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 59/123 variables, 64/82 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 0/123 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 82 constraints, problems are : Problem set: 0 solved, 58 unsolved in 921 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:55:38] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-29 02:55:38] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/123 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 58/142 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:55:38] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-29 02:55:38] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-29 02:55:38] [INFO ] Deduced a trap composed of 14 places in 15 ms of which 0 ms to minimize.
[2024-05-29 02:55:38] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-29 02:55:38] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2024-05-29 02:55:38] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 1 ms to minimize.
[2024-05-29 02:55:39] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 02:55:39] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-29 02:55:39] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 9/151 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:55:39] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 02:55:39] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 02:55:39] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-29 02:55:39] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 4/155 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 0/123 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 155 constraints, problems are : Problem set: 0 solved, 58 unsolved in 2257 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 21/21 constraints]
After SMT, in 3183ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 3183ms
Starting structural reductions in LTL mode, iteration 1 : 64/71 places, 59/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3261 ms. Remains : 64/71 places, 59/66 transitions.
[2024-05-29 02:55:40] [INFO ] Flatten gal took : 6 ms
[2024-05-29 02:55:40] [INFO ] Flatten gal took : 3 ms
[2024-05-29 02:55:40] [INFO ] Input system was already deterministic with 59 transitions.
[2024-05-29 02:55:40] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:55:40] [INFO ] Flatten gal took : 1 ms
[2024-05-29 02:55:40] [INFO ] Time to serialize gal into /tmp/CTLFireability17917912757774285659.gal : 1 ms
[2024-05-29 02:55:40] [INFO ] Time to serialize properties into /tmp/CTLFireability15254125371079934167.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/CTLFireability17917912757774285659.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15254125371079934167.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.51718e+06,1.02901,41216,2,3363,5,128620,6,0,317,245770,0


Converting to forward existential form...Done !
original formula: AF(EX(AG((((p9==0)&&(p47==0))&&((p34==1)&&(p57==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E(TRUE U !((((p9==0)&&(p47==0))&&((p34==1)&&(p57==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t15, t20, t24, t25, t30, t32, t33, t35, t36, t38, t39, ...258
(forward)formula 0,0,2.78978,87012,1,0,226,323240,144,66,1959,526656,216
FORMULA ShieldPPPs-PT-001B-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-29 02:55:43] [INFO ] Flatten gal took : 4 ms
[2024-05-29 02:55:43] [INFO ] Flatten gal took : 2 ms
Total runtime 222163 ms.

BK_STOP 1716951343509

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

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