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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 14:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 11 14:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 14:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 14:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 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 56K 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 ShieldPPPt-PT-003B-CTLFireability-2024-00
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-2024-01
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-2024-02
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-2024-03
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-2024-04
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-2024-05
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-2024-06
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-2024-07
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-2024-08
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-2024-09
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-2024-10
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-2024-11
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-2023-12
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-2023-13
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-2023-14
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717002776167

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-003B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 17:12:57] [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 17:12:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 17:12:57] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-05-29 17:12:57] [INFO ] Transformed 237 places.
[2024-05-29 17:12:57] [INFO ] Transformed 216 transitions.
[2024-05-29 17:12:57] [INFO ] Found NUPN structural information;
[2024-05-29 17:12:57] [INFO ] Parsed PT model containing 237 places and 216 transitions and 540 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 89 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 216/216 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 223 transition count 202
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 223 transition count 202
Applied a total of 28 rules in 39 ms. Remains 223 /237 variables (removed 14) and now considering 202/216 (removed 14) transitions.
// Phase 1: matrix 202 rows 223 cols
[2024-05-29 17:12:57] [INFO ] Computed 34 invariants in 17 ms
[2024-05-29 17:12:57] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-29 17:12:57] [INFO ] Invariant cache hit.
[2024-05-29 17:12:58] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-29 17:12:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-29 17:12:59] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 10 ms to minimize.
[2024-05-29 17:13:00] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-29 17:13:00] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:13:00] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
[2024-05-29 17:13:00] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-29 17:13:00] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-29 17:13:00] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-29 17:13:00] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:13:00] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:13:00] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:13:00] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:13:00] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
[2024-05-29 17:13:00] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:13:00] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:13:00] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-05-29 17:13:00] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:13:00] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:13:01] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:13:01] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:13:01] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-29 17:13:01] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:13:01] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
[2024-05-29 17:13:01] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 7 ms to minimize.
[2024-05-29 17:13:01] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:13:01] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:13:01] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:13:01] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:13:01] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:13:02] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:13:02] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:13:02] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:13:02] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 12/66 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 202/425 variables, 223/289 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-29 17:13:04] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-29 17:13:06] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:13:07] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-29 17:13:08] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-29 17:13:09] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-29 17:13:12] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/425 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 13 (OVERLAPS) 0/425 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 295 constraints, problems are : Problem set: 0 solved, 201 unsolved in 18548 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 223/223 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 38/72 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-29 17:13:17] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 202/425 variables, 223/296 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 201/497 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-29 17:13:20] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:13:20] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-05-29 17:13:20] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-29 17:13:20] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-29 17:13:21] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-29 17:13:21] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-29 17:13:21] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-29 17:13:21] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-29 17:13:22] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 9/506 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-29 17:13:26] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2024-05-29 17:13:27] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
[2024-05-29 17:13:28] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-29 17:13:28] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/425 variables, 4/510 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (OVERLAPS) 0/425 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 510 constraints, problems are : Problem set: 0 solved, 201 unsolved in 21690 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 223/223 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 52/52 constraints]
After SMT, in 40299ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 40320ms
Starting structural reductions in LTL mode, iteration 1 : 223/237 places, 202/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40834 ms. Remains : 223/237 places, 202/216 transitions.
Support contains 89 out of 223 places after structural reductions.
[2024-05-29 17:13:38] [INFO ] Flatten gal took : 35 ms
[2024-05-29 17:13:38] [INFO ] Flatten gal took : 14 ms
[2024-05-29 17:13:38] [INFO ] Input system was already deterministic with 202 transitions.
Support contains 86 out of 223 places (down from 89) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1313 ms. (30 steps per ms) remains 1/60 properties
BEST_FIRST walk for 40003 steps (8 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
[2024-05-29 17:13:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 191/223 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 202/425 variables, 223/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/425 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 257 constraints, problems are : Problem set: 0 solved, 1 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 223/223 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 191/223 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 17:13:39] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-29 17:13:39] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:13:39] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 202/425 variables, 223/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 17:13:39] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/425 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 223/223 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 425ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 2 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 202/202 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 223 transition count 148
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 56 rules applied. Total rules applied 110 place count 169 transition count 146
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 112 place count 168 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 113 place count 167 transition count 145
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 113 place count 167 transition count 131
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 141 place count 153 transition count 131
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 153 place count 141 transition count 119
Iterating global reduction 4 with 12 rules applied. Total rules applied 165 place count 141 transition count 119
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 165 place count 141 transition count 112
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 179 place count 134 transition count 112
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 273 place count 87 transition count 65
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 289 place count 79 transition count 65
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 297 place count 79 transition count 65
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 298 place count 78 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 299 place count 77 transition count 64
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 299 place count 77 transition count 62
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 303 place count 75 transition count 62
Applied a total of 303 rules in 47 ms. Remains 75 /223 variables (removed 148) and now considering 62/202 (removed 140) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 75/223 places, 62/202 transitions.
RANDOM walk for 40000 steps (9 resets) in 1024 ms. (39 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (9 resets) in 500 ms. (79 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1981926 steps, run timeout after 3001 ms. (steps per millisecond=660 ) properties seen :0 out of 1
Probabilistic random walk after 1981926 steps, saw 886415 distinct states, run finished after 3004 ms. (steps per millisecond=659 ) properties seen :0
// Phase 1: matrix 62 rows 75 cols
[2024-05-29 17:13:43] [INFO ] Computed 33 invariants in 2 ms
[2024-05-29 17:13:43] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/19 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/56 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/60 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/68 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/68 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 33/101 variables, 24/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/101 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/101 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/101 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 21/122 variables, 12/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/122 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/122 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/123 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/123 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/123 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1/124 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/124 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/124 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 10/134 variables, 6/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/134 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/134 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 3/137 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/137 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/137 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 0/137 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, State Equation: 75/75 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/19 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/56 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/60 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/60 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/68 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/68 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 33/101 variables, 24/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/101 variables, 8/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/101 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/101 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 21/122 variables, 12/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/122 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/122 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/122 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/123 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/123 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/123 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1/124 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/124 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/124 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 10/134 variables, 6/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/134 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/134 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 3/137 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/137 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/137 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/137 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, State Equation: 75/75 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 176ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 75/75 places, 62/62 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2024-05-29 17:13:43] [INFO ] Invariant cache hit.
[2024-05-29 17:13:43] [INFO ] Implicit Places using invariants in 52 ms returned [58, 62]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 55 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 73/75 places, 62/62 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 71 transition count 60
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 71 transition count 60
Applied a total of 4 rules in 3 ms. Remains 71 /73 variables (removed 2) and now considering 60/62 (removed 2) transitions.
// Phase 1: matrix 60 rows 71 cols
[2024-05-29 17:13:43] [INFO ] Computed 31 invariants in 1 ms
[2024-05-29 17:13:43] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-29 17:13:43] [INFO ] Invariant cache hit.
[2024-05-29 17:13:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 17:13:43] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 71/75 places, 60/62 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 171 ms. Remains : 71/75 places, 60/62 transitions.
RANDOM walk for 40000 steps (8 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1641200 steps, run timeout after 3001 ms. (steps per millisecond=546 ) properties seen :0 out of 1
Probabilistic random walk after 1641200 steps, saw 1018046 distinct states, run finished after 3001 ms. (steps per millisecond=546 ) properties seen :0
[2024-05-29 17:13:46] [INFO ] Invariant cache hit.
[2024-05-29 17:13:46] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/19 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/56 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/60 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/68 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/68 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 32/100 variables, 24/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/100 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/100 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/118 variables, 10/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/118 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/118 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 10/128 variables, 6/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/128 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/128 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 3/131 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/131 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/131 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/131 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 71/71 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/19 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/56 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/60 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/60 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/68 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/68 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 32/100 variables, 24/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/100 variables, 8/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/100 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/118 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/118 variables, 5/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/118 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 10/128 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/128 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/128 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 3/131 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/131 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/131 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/131 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 105 constraints, problems are : Problem set: 0 solved, 1 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 71/71 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 152ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 71 /71 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 71/71 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 71 /71 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-29 17:13:46] [INFO ] Invariant cache hit.
[2024-05-29 17:13:46] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 17:13:46] [INFO ] Invariant cache hit.
[2024-05-29 17:13:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 17:13:46] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-05-29 17:13:46] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2024-05-29 17:13:46] [INFO ] Invariant cache hit.
[2024-05-29 17:13:46] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-29 17:13:47] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 12 ms to minimize.
[2024-05-29 17:13:47] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-05-29 17:13:47] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:13:47] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:13:47] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 3/71 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-29 17:13:47] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 17:13:47] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 17:13:47] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-29 17:13:47] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:13:47] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 60/131 variables, 71/112 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 114 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1309 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 71/71 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 3/71 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 60/131 variables, 71/112 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 55/169 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 169 constraints, problems are : Problem set: 0 solved, 55 unsolved in 770 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 71/71 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 10/10 constraints]
After SMT, in 2093ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 2093ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2218 ms. Remains : 71/71 places, 60/60 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 71 transition count 60
Applied a total of 13 rules in 6 ms. Remains 71 /71 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 60 rows 71 cols
[2024-05-29 17:13:48] [INFO ] Computed 31 invariants in 1 ms
[2024-05-29 17:13:48] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 17:13:49] [INFO ] [Nat]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-05-29 17:13:49] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 17:13:49] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-29 17:13:49] [INFO ] After 4ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-29 17:13:49] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-29 17:13:49] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 110 ms.
[2024-05-29 17:13:49] [INFO ] Flatten gal took : 10 ms
[2024-05-29 17:13:49] [INFO ] Flatten gal took : 9 ms
[2024-05-29 17:13:49] [INFO ] Input system was already deterministic with 202 transitions.
Computed a total of 58 stabilizing places and 58 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 202/202 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 206 transition count 185
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 206 transition count 185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 205 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 204 transition count 183
Applied a total of 38 rules in 16 ms. Remains 204 /223 variables (removed 19) and now considering 183/202 (removed 19) transitions.
// Phase 1: matrix 183 rows 204 cols
[2024-05-29 17:13:49] [INFO ] Computed 34 invariants in 3 ms
[2024-05-29 17:13:49] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-29 17:13:49] [INFO ] Invariant cache hit.
[2024-05-29 17:13:49] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2024-05-29 17:13:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:13:50] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:13:50] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:13:50] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:13:50] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-05-29 17:13:50] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:13:50] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:13:51] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:13:51] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-29 17:13:51] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:13:51] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:13:51] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:13:51] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:13:51] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:13:51] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:13:51] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:13:51] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:13:51] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:13:51] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:13:51] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:13:51] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:13:52] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 2 ms to minimize.
[2024-05-29 17:13:52] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:13:53] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (OVERLAPS) 183/387 variables, 204/261 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:13:55] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (OVERLAPS) 0/387 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 262 constraints, problems are : Problem set: 0 solved, 182 unsolved in 10140 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 24/58 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/387 variables, 204/262 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 182/444 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:14:02] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-29 17:14:02] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-29 17:14:03] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-29 17:14:03] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-29 17:14:03] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-05-29 17:14:03] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-29 17:14:03] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-29 17:14:03] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 2 ms to minimize.
[2024-05-29 17:14:04] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 9/453 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:14:05] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:14:06] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-29 17:14:06] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:14:07] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-29 17:14:07] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 5/458 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:14:08] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (OVERLAPS) 0/387 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 459 constraints, problems are : Problem set: 0 solved, 182 unsolved in 17454 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 39/39 constraints]
After SMT, in 27617ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 27620ms
Starting structural reductions in LTL mode, iteration 1 : 204/223 places, 183/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27832 ms. Remains : 204/223 places, 183/202 transitions.
[2024-05-29 17:14:16] [INFO ] Flatten gal took : 13 ms
[2024-05-29 17:14:16] [INFO ] Flatten gal took : 8 ms
[2024-05-29 17:14:16] [INFO ] Input system was already deterministic with 183 transitions.
[2024-05-29 17:14:17] [INFO ] Flatten gal took : 8 ms
[2024-05-29 17:14:17] [INFO ] Flatten gal took : 8 ms
[2024-05-29 17:14:17] [INFO ] Time to serialize gal into /tmp/CTLFireability14133564090185975213.gal : 3 ms
[2024-05-29 17:14:17] [INFO ] Time to serialize properties into /tmp/CTLFireability7042458197865704113.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14133564090185975213.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7042458197865704113.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.05917e+19,8.85344,260124,2,11847,5,819641,6,0,1001,1.81455e+06,0


Converting to forward existential form...Done !
original formula: EG((EF((((p216==0)&&((p210==0)||(p72==0))) * AG((p149==0)))) + EX(!(E(EX((p126==1)) U EF((p125==1)))))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U (((p216==0)&&((p210==0)||(p72==0))) * !(E(TRUE U !((p149==0)))))) + EX(!(E(EX((p126==1)) U ...189
Reverse transition relation is NOT exact ! Due to transitions t12, t16, t21, t25, t27, t31, t35, t40, t41, t44, t46, t47, t49, t50, t52, t53, t57, t61, t66...443
Detected timeout of ITS tools.
[2024-05-29 17:14:47] [INFO ] Flatten gal took : 12 ms
[2024-05-29 17:14:47] [INFO ] Applying decomposition
[2024-05-29 17:14:47] [INFO ] Flatten gal took : 8 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/graph6545817695748695422.txt' '-o' '/tmp/graph6545817695748695422.bin' '-w' '/tmp/graph6545817695748695422.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6545817695748695422.bin' '-l' '-1' '-v' '-w' '/tmp/graph6545817695748695422.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:14:47] [INFO ] Decomposing Gal with order
[2024-05-29 17:14:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:14:47] [INFO ] Removed a total of 34 redundant transitions.
[2024-05-29 17:14:47] [INFO ] Flatten gal took : 67 ms
[2024-05-29 17:14:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-29 17:14:47] [INFO ] Time to serialize gal into /tmp/CTLFireability11021104944735975761.gal : 6 ms
[2024-05-29 17:14:47] [INFO ] Time to serialize properties into /tmp/CTLFireability12554530610433799605.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/CTLFireability11021104944735975761.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12554530610433799605.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.05917e+19,0.55039,21940,896,29,34280,324,444,76454,45,775,0


Converting to forward existential form...Done !
original formula: EG((EF((((i12.u71.p216==0)&&((i10.i2.u68.p210==0)||(i1.i1.u23.p72==0))) * AG((i4.i2.u49.p149==0)))) + EX(!(E(EX((i6.u41.p126==1)) U EF((i...175
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U (((i12.u71.p216==0)&&((i10.i2.u68.p210==0)||(i1.i1.u23.p72==0))) * !(E(TRUE U !((i4.i2.u49....242
Reverse transition relation is NOT exact ! Due to transitions t44, t47, t91, t94, t137, t140, t166, t180, i0.t143, i0.i0.u6.t146, i0.i1.u7.t145, i0.i2.t122...754
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 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,1,6.84857,190636,1,0,385729,448,3216,807782,279,1569,340609
FORMULA ShieldPPPt-PT-003B-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 202/202 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 205 transition count 184
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 204 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 203 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 203 transition count 182
Applied a total of 40 rules in 23 ms. Remains 203 /223 variables (removed 20) and now considering 182/202 (removed 20) transitions.
// Phase 1: matrix 182 rows 203 cols
[2024-05-29 17:14:54] [INFO ] Computed 34 invariants in 2 ms
[2024-05-29 17:14:54] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-29 17:14:54] [INFO ] Invariant cache hit.
[2024-05-29 17:14:54] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-29 17:14:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:14:55] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:14:55] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:14:56] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:14:56] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:14:56] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:14:56] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:14:56] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:14:56] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:14:56] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-29 17:14:56] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:14:56] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:14:56] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:14:56] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:14:56] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-29 17:14:56] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:14:56] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:14:56] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:14:56] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:14:56] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-05-29 17:14:57] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:14:57] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-05-29 17:14:57] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/385 variables, 203/259 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:15:01] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/385 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:15:02] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:15:05] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/385 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 12 (OVERLAPS) 0/385 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 262 constraints, problems are : Problem set: 0 solved, 181 unsolved in 13864 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/385 variables, 203/262 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 181/443 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:15:10] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-29 17:15:10] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 2 ms to minimize.
[2024-05-29 17:15:10] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-29 17:15:11] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:15:11] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-29 17:15:11] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-29 17:15:11] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-29 17:15:11] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:15:11] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:15:12] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:15:12] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-29 17:15:12] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 12/455 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:15:14] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-29 17:15:14] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 2/457 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:15:17] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:15:19] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:15:22] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:15:27] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/385 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:15:31] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/385 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/385 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:15:36] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/385 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 385/385 variables, and 463 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 45/45 constraints]
After SMT, in 43909ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 43911ms
Starting structural reductions in LTL mode, iteration 1 : 203/223 places, 182/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44259 ms. Remains : 203/223 places, 182/202 transitions.
[2024-05-29 17:15:38] [INFO ] Flatten gal took : 8 ms
[2024-05-29 17:15:38] [INFO ] Flatten gal took : 10 ms
[2024-05-29 17:15:38] [INFO ] Input system was already deterministic with 182 transitions.
[2024-05-29 17:15:38] [INFO ] Flatten gal took : 10 ms
[2024-05-29 17:15:38] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:15:38] [INFO ] Time to serialize gal into /tmp/CTLFireability2758484320827384294.gal : 5 ms
[2024-05-29 17:15:38] [INFO ] Time to serialize properties into /tmp/CTLFireability2577306709137594151.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/CTLFireability2758484320827384294.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2577306709137594151.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.57988e+19,6.64412,208684,2,10981,5,655503,6,0,996,1.429e+06,0


Converting to forward existential form...Done !
original formula: A(((p233==1) + AX(EG(A((p212==1) U (p9==1))))) U !(A(!((EF(((p113==1)&&(p146==1))) + ((p45==1)&&(p15==1)))) U EF(AG((p199==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(!((E(!(E(TRUE U !(E(TRUE U !((p199==1)))))) U (!(!((E(TRUE U ((p113==1)&&(p146==1))) + ((p45=...803
Reverse transition relation is NOT exact ! Due to transitions t12, t16, t21, t25, t31, t35, t36, t40, t41, t44, t46, t47, t49, t50, t52, t53, t57, t61, t66...437
Detected timeout of ITS tools.
[2024-05-29 17:16:08] [INFO ] Flatten gal took : 12 ms
[2024-05-29 17:16:08] [INFO ] Applying decomposition
[2024-05-29 17:16:08] [INFO ] Flatten gal took : 6 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/graph14278511857001923186.txt' '-o' '/tmp/graph14278511857001923186.bin' '-w' '/tmp/graph14278511857001923186.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14278511857001923186.bin' '-l' '-1' '-v' '-w' '/tmp/graph14278511857001923186.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:16:08] [INFO ] Decomposing Gal with order
[2024-05-29 17:16:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:16:08] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-29 17:16:08] [INFO ] Flatten gal took : 14 ms
[2024-05-29 17:16:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-29 17:16:08] [INFO ] Time to serialize gal into /tmp/CTLFireability7773031350479350690.gal : 4 ms
[2024-05-29 17:16:08] [INFO ] Time to serialize properties into /tmp/CTLFireability7200749633952940373.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/CTLFireability7773031350479350690.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7200749633952940373.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.57988e+19,0.475244,21692,910,45,35914,449,499,72038,62,1293,0


Converting to forward existential form...Done !
original formula: A(((i11.i2.u70.p233==1) + AX(EG(A((i10.i2.u64.p212==1) U (i1.i0.u3.p9==1))))) U !(A(!((EF(((i5.i0.u34.p113==1)&&(i8.u42.p146==1))) + ((i2...223
=> equivalent forward existential formula: [((Init * !(EG(!(!(!((E(!(E(TRUE U !(E(TRUE U !((i12.i1.u60.p199==1)))))) U (!(!((E(TRUE U ((i5.i0.u34.p113==1)&...1050
Reverse transition relation is NOT exact ! Due to transitions t44, t47, t90, t93, t136, t139, t165, t174, i0.i0.u1.t146, i0.i1.u9.t141, i1.t179, i1.i1.u11....749
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 202/202 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 222 transition count 147
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 56 rules applied. Total rules applied 110 place count 168 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 111 place count 167 transition count 145
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 111 place count 167 transition count 130
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 141 place count 152 transition count 130
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 155 place count 138 transition count 116
Iterating global reduction 3 with 14 rules applied. Total rules applied 169 place count 138 transition count 116
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 169 place count 138 transition count 107
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 187 place count 129 transition count 107
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 265 place count 90 transition count 68
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 267 place count 88 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 268 place count 87 transition count 66
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 268 place count 87 transition count 64
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 272 place count 85 transition count 64
Applied a total of 272 rules in 43 ms. Remains 85 /223 variables (removed 138) and now considering 64/202 (removed 138) transitions.
// Phase 1: matrix 64 rows 85 cols
[2024-05-29 17:16:38] [INFO ] Computed 33 invariants in 1 ms
[2024-05-29 17:16:38] [INFO ] Implicit Places using invariants in 50 ms returned [65, 69]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 83/223 places, 64/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 81 transition count 62
Applied a total of 4 rules in 4 ms. Remains 81 /83 variables (removed 2) and now considering 62/64 (removed 2) transitions.
// Phase 1: matrix 62 rows 81 cols
[2024-05-29 17:16:38] [INFO ] Computed 31 invariants in 1 ms
[2024-05-29 17:16:39] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-29 17:16:39] [INFO ] Invariant cache hit.
[2024-05-29 17:16:39] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 81/223 places, 62/202 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 272 ms. Remains : 81/223 places, 62/202 transitions.
[2024-05-29 17:16:39] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:16:39] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:16:39] [INFO ] Input system was already deterministic with 62 transitions.
[2024-05-29 17:16:39] [INFO ] Flatten gal took : 3 ms
RANDOM walk for 479 steps (0 resets) in 7 ms. (59 steps per ms) remains 0/1 properties
FORMULA ShieldPPPt-PT-003B-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 17:16:39] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:16:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16261490538630045828.gal : 0 ms
[2024-05-29 17:16:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6689357022854083250.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16261490538630045828.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6689357022854083250.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 202/202 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 207 transition count 186
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 207 transition count 186
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 206 transition count 185
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 206 transition count 185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 205 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 205 transition count 184
Applied a total of 36 rules in 12 ms. Remains 205 /223 variables (removed 18) and now considering 184/202 (removed 18) transitions.
// Phase 1: matrix 184 rows 205 cols
[2024-05-29 17:16:39] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 17:16:39] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-29 17:16:39] [INFO ] Invariant cache hit.
[2024-05-29 17:16:39] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Running 183 sub problems to find dead transitions.
[2024-05-29 17:16:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-29 17:16:40] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:16:40] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:16:40] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:16:40] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:16:41] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:16:41] [INFO ] Deduced a trap composed of 16 places in 16 ms of which 0 ms to minimize.
[2024-05-29 17:16:41] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:16:41] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:16:41] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-29 17:16:41] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-29 17:16:41] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-05-29 17:16:41] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:16:41] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:16:41] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:16:41] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:16:41] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:16:41] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:16:41] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:16:41] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:16:41] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-29 17:16:42] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:16:42] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 184/389 variables, 205/261 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-29 17:16:44] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:16:44] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-29 17:16:46] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-29 17:16:47] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-29 17:16:48] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:16:48] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 11 (OVERLAPS) 0/389 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 267 constraints, problems are : Problem set: 0 solved, 183 unsolved in 12384 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 28/62 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-29 17:16:53] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 184/389 variables, 205/268 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 183/451 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-29 17:16:54] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:16:55] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-29 17:16:55] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-29 17:16:55] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-29 17:16:55] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:16:55] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:16:55] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:16:56] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:16:56] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 9/460 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-29 17:16:57] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-29 17:17:00] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-29 17:17:03] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/389 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 12 (OVERLAPS) 0/389 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 463 constraints, problems are : Problem set: 0 solved, 183 unsolved in 19216 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 41/41 constraints]
After SMT, in 31616ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 31618ms
Starting structural reductions in LTL mode, iteration 1 : 205/223 places, 184/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32014 ms. Remains : 205/223 places, 184/202 transitions.
[2024-05-29 17:17:11] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:17:11] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:17:11] [INFO ] Input system was already deterministic with 184 transitions.
[2024-05-29 17:17:11] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:17:11] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:17:11] [INFO ] Time to serialize gal into /tmp/CTLFireability4771787652304240529.gal : 1 ms
[2024-05-29 17:17:11] [INFO ] Time to serialize properties into /tmp/CTLFireability3147199306098529079.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/CTLFireability4771787652304240529.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3147199306098529079.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,4.6548e+19,9.84913,286304,2,16133,5,867048,6,0,1006,2.00478e+06,0


Converting to forward existential form...Done !
original formula: (EG(((p52==1) + (AF(AX((p224==1))) * A(EG((p73==1)) U AX((p65==1)))))) + AX(AG((AF((p65==0)) + AF((p180==0))))))
=> equivalent forward existential formula: [FwdG((FwdU(EY((Init * !(EG(((p52==1) + (!(EG(!(!(EX(!((p224==1))))))) * !((E(!(!(EX(!((p65==1))))) U (!(EG((p73...277
Reverse transition relation is NOT exact ! Due to transitions t12, t16, t22, t26, t27, t31, t35, t40, t41, t44, t46, t47, t49, t50, t52, t53, t57, t61, t66...461
Detected timeout of ITS tools.
[2024-05-29 17:17:41] [INFO ] Flatten gal took : 8 ms
[2024-05-29 17:17:41] [INFO ] Applying decomposition
[2024-05-29 17:17:41] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5225740910891757897.txt' '-o' '/tmp/graph5225740910891757897.bin' '-w' '/tmp/graph5225740910891757897.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5225740910891757897.bin' '-l' '-1' '-v' '-w' '/tmp/graph5225740910891757897.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:17:41] [INFO ] Decomposing Gal with order
[2024-05-29 17:17:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:17:41] [INFO ] Removed a total of 27 redundant transitions.
[2024-05-29 17:17:41] [INFO ] Flatten gal took : 27 ms
[2024-05-29 17:17:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 17:17:41] [INFO ] Time to serialize gal into /tmp/CTLFireability9412056459363087781.gal : 2 ms
[2024-05-29 17:17:41] [INFO ] Time to serialize properties into /tmp/CTLFireability10553349837002491796.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/CTLFireability9412056459363087781.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10553349837002491796.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,4.6548e+19,0.88216,32516,1269,46,54759,506,504,120235,61,1359,0


Converting to forward existential form...Done !
original formula: (EG(((i2.i3.u15.p52==1) + (AF(AX((i12.u70.p224==1))) * A(EG((i0.i1.u22.p73==1)) U AX((i4.u20.p65==1)))))) + AX(AG((AF((i4.u20.p65==0)) + ...183
=> equivalent forward existential formula: [FwdG((FwdU(EY((Init * !(EG(((i2.i3.u15.p52==1) + (!(EG(!(!(EX(!((i12.u70.p224==1))))))) * !((E(!(!(EX(!((i4.u20...344
Reverse transition relation is NOT exact ! Due to transitions t44, t50, t90, t93, t138, t141, t167, t175, t176, i0.i0.u10.t140, i0.i1.t108, i0.i1.u22.t104,...804
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 202/202 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 206 transition count 185
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 206 transition count 185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 205 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 204 transition count 183
Applied a total of 38 rules in 7 ms. Remains 204 /223 variables (removed 19) and now considering 183/202 (removed 19) transitions.
// Phase 1: matrix 183 rows 204 cols
[2024-05-29 17:18:11] [INFO ] Computed 34 invariants in 2 ms
[2024-05-29 17:18:11] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-29 17:18:11] [INFO ] Invariant cache hit.
[2024-05-29 17:18:11] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2024-05-29 17:18:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:18:12] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:18:12] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:18:13] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-29 17:18:13] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
[2024-05-29 17:18:13] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:18:13] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-29 17:18:13] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:18:13] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-29 17:18:13] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:18:13] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:18:13] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:18:13] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:18:13] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-29 17:18:13] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:18:13] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:18:13] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-29 17:18:13] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:18:13] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:18:13] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:18:13] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:18:14] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:18:15] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-29 17:18:15] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:18:15] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (OVERLAPS) 183/387 variables, 204/262 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:18:18] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/387 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (OVERLAPS) 0/387 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 263 constraints, problems are : Problem set: 0 solved, 182 unsolved in 10452 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/387 variables, 204/263 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 182/445 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:18:24] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:18:24] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:18:24] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:18:24] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:18:25] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:18:25] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-29 17:18:25] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:18:25] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:18:25] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-29 17:18:25] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-29 17:18:25] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 11/456 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:18:28] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (OVERLAPS) 0/387 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 457 constraints, problems are : Problem set: 0 solved, 182 unsolved in 17628 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 37/37 constraints]
After SMT, in 28094ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 28096ms
Starting structural reductions in LTL mode, iteration 1 : 204/223 places, 183/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28298 ms. Remains : 204/223 places, 183/202 transitions.
[2024-05-29 17:18:39] [INFO ] Flatten gal took : 10 ms
[2024-05-29 17:18:39] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:18:39] [INFO ] Input system was already deterministic with 183 transitions.
[2024-05-29 17:18:39] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:18:39] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:18:39] [INFO ] Time to serialize gal into /tmp/CTLFireability9889577229507688120.gal : 1 ms
[2024-05-29 17:18:39] [INFO ] Time to serialize properties into /tmp/CTLFireability1447796748463812485.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/CTLFireability9889577229507688120.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1447796748463812485.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.52784e+19,6.58568,211980,2,12150,5,663722,6,0,1001,1.4576e+06,0


Converting to forward existential form...Done !
original formula: AX(EG(E((!(E(((p113==1)&&(p146==1)) U (p82==1))) + AX((p121==1))) U (((p70==1) * AG(((p42==1)&&(p101==1)))) * (p148==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(E((!(E(((p113==1)&&(p146==1)) U (p82==1))) + !(EX(!((p121==1))))) U (((p70==1) * !(E(TRUE U !(...206
Reverse transition relation is NOT exact ! Due to transitions t12, t16, t21, t25, t30, t34, t39, t40, t43, t45, t46, t48, t49, t51, t52, t56, t60, t65, t69...444
(forward)formula 0,0,26.8797,746668,1,0,605,3.02586e+06,407,207,5737,5.34995e+06,600
FORMULA ShieldPPPt-PT-003B-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 202/202 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 222 transition count 156
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 92 place count 177 transition count 154
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 96 place count 176 transition count 151
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 99 place count 173 transition count 151
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 99 place count 173 transition count 135
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 131 place count 157 transition count 135
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 142 place count 146 transition count 124
Iterating global reduction 4 with 11 rules applied. Total rules applied 153 place count 146 transition count 124
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 153 place count 146 transition count 118
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 165 place count 140 transition count 118
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 233 place count 106 transition count 84
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 235 place count 104 transition count 82
Applied a total of 235 rules in 21 ms. Remains 104 /223 variables (removed 119) and now considering 82/202 (removed 120) transitions.
// Phase 1: matrix 82 rows 104 cols
[2024-05-29 17:19:06] [INFO ] Computed 34 invariants in 0 ms
[2024-05-29 17:19:06] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-29 17:19:06] [INFO ] Invariant cache hit.
[2024-05-29 17:19:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 17:19:07] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-05-29 17:19:07] [INFO ] Redundant transitions in 1 ms returned []
Running 79 sub problems to find dead transitions.
[2024-05-29 17:19:07] [INFO ] Invariant cache hit.
[2024-05-29 17:19:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 3/104 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-29 17:19:07] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:19:07] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
[2024-05-29 17:19:07] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
[2024-05-29 17:19:07] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-29 17:19:07] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-29 17:19:07] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-29 17:19:07] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-05-29 17:19:07] [INFO ] Deduced a trap composed of 7 places in 13 ms of which 0 ms to minimize.
[2024-05-29 17:19:07] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 0 ms to minimize.
[2024-05-29 17:19:07] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 10/44 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 82/186 variables, 104/148 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/186 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 149 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1515 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 104/104 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 3/104 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 10/44 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 82/186 variables, 104/148 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 79/228 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-29 17:19:09] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/186 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-29 17:19:10] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 12 (OVERLAPS) 0/186 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 230 constraints, problems are : Problem set: 0 solved, 79 unsolved in 3070 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 104/104 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 12/12 constraints]
After SMT, in 4593ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 4594ms
Starting structural reductions in SI_CTL mode, iteration 1 : 104/223 places, 82/202 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4752 ms. Remains : 104/223 places, 82/202 transitions.
[2024-05-29 17:19:11] [INFO ] Flatten gal took : 7 ms
[2024-05-29 17:19:11] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:19:11] [INFO ] Input system was already deterministic with 82 transitions.
[2024-05-29 17:19:11] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:19:11] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:19:11] [INFO ] Time to serialize gal into /tmp/CTLFireability3991109356625890574.gal : 0 ms
[2024-05-29 17:19:11] [INFO ] Time to serialize properties into /tmp/CTLFireability1466220294554332429.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/CTLFireability3991109356625890574.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1466220294554332429.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,5.37929e+13,0.643489,29292,2,638,5,98257,6,0,498,180415,0


Converting to forward existential form...Done !
original formula: E(!(AG((((p202==1) + EF((p193==1))) + (EF((p193==1)) * (p110==1))))) U (EG(E(AF(((p104==1)&&(p124==1))) U EF((p6==1)))) * (((p214==1) + A...263
=> equivalent forward existential formula: (([((FwdU(Init,!(!(E(TRUE U !((((p202==1) + E(TRUE U (p193==1))) + (E(TRUE U (p193==1)) * (p110==1)))))))) * EG(...911
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t9, t14, t30, t31, t34, t36, t38, t42, t44, t47, t51, t56, t6...281
Detected timeout of ITS tools.
[2024-05-29 17:19:41] [INFO ] Flatten gal took : 9 ms
[2024-05-29 17:19:41] [INFO ] Applying decomposition
[2024-05-29 17:19:41] [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/graph2341871814121536956.txt' '-o' '/tmp/graph2341871814121536956.bin' '-w' '/tmp/graph2341871814121536956.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2341871814121536956.bin' '-l' '-1' '-v' '-w' '/tmp/graph2341871814121536956.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:19:41] [INFO ] Decomposing Gal with order
[2024-05-29 17:19:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:19:41] [INFO ] Removed a total of 8 redundant transitions.
[2024-05-29 17:19:41] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:19:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-29 17:19:41] [INFO ] Time to serialize gal into /tmp/CTLFireability1558853356918877353.gal : 6 ms
[2024-05-29 17:19:41] [INFO ] Time to serialize properties into /tmp/CTLFireability515791161228125987.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/CTLFireability1558853356918877353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability515791161228125987.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 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,5.37929e+13,0.140881,10136,208,48,14210,233,278,22588,52,939,0


Converting to forward existential form...Done !
original formula: E(!(AG((((i11.u28.p202==1) + EF((i11.u27.p193==1))) + (EF((i11.u27.p193==1)) * (i5.i0.u16.p110==1))))) U (EG(E(AF(((i4.u14.p104==1)&&(i9....376
=> equivalent forward existential formula: (([((FwdU(Init,!(!(E(TRUE U !((((i11.u28.p202==1) + E(TRUE U (i11.u27.p193==1))) + (E(TRUE U (i11.u27.p193==1)) ...1186
Reverse transition relation is NOT exact ! Due to transitions t69, t71, i0.u3.t1, i0.u10.t56, i1.u4.t2, i1.u9.t36, i2.t14, i2.u7.t68, i3.u2.t0, i3.u8.t34, ...433
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 202/202 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 222 transition count 146
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 57 rules applied. Total rules applied 112 place count 167 transition count 144
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 114 place count 166 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 165 transition count 143
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 115 place count 165 transition count 129
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 143 place count 151 transition count 129
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 157 place count 137 transition count 115
Iterating global reduction 4 with 14 rules applied. Total rules applied 171 place count 137 transition count 115
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 171 place count 137 transition count 106
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 189 place count 128 transition count 106
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 269 place count 88 transition count 66
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 271 place count 86 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 272 place count 85 transition count 64
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 272 place count 85 transition count 62
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 276 place count 83 transition count 62
Applied a total of 276 rules in 23 ms. Remains 83 /223 variables (removed 140) and now considering 62/202 (removed 140) transitions.
// Phase 1: matrix 62 rows 83 cols
[2024-05-29 17:20:11] [INFO ] Computed 33 invariants in 0 ms
[2024-05-29 17:20:11] [INFO ] Implicit Places using invariants in 43 ms returned [63, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 81/223 places, 62/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 79 transition count 60
Applied a total of 4 rules in 3 ms. Remains 79 /81 variables (removed 2) and now considering 60/62 (removed 2) transitions.
// Phase 1: matrix 60 rows 79 cols
[2024-05-29 17:20:11] [INFO ] Computed 31 invariants in 1 ms
[2024-05-29 17:20:11] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-29 17:20:11] [INFO ] Invariant cache hit.
[2024-05-29 17:20:11] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 79/223 places, 60/202 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 169 ms. Remains : 79/223 places, 60/202 transitions.
[2024-05-29 17:20:11] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:20:11] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:20:11] [INFO ] Input system was already deterministic with 60 transitions.
[2024-05-29 17:20:11] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:20:12] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:20:12] [INFO ] Time to serialize gal into /tmp/CTLFireability18920233644190784.gal : 1 ms
[2024-05-29 17:20:12] [INFO ] Time to serialize properties into /tmp/CTLFireability14121377740329368252.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/CTLFireability18920233644190784.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14121377740329368252.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,7.08588e+11,0.136294,10236,2,140,5,28095,6,0,379,45335,0


Converting to forward existential form...Done !
original formula: EG(AF(((p112==1)&&(p114==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((p112==1)&&(p114==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 57/0/3
(forward)formula 0,0,15.6948,545212,1,0,12,2.39363e+06,24,6,1849,4.19811e+06,9
FORMULA ShieldPPPt-PT-003B-CTLFireability-2024-06 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 : 223/223 places, 202/202 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 205 transition count 184
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 204 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 203 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 203 transition count 182
Applied a total of 40 rules in 11 ms. Remains 203 /223 variables (removed 20) and now considering 182/202 (removed 20) transitions.
// Phase 1: matrix 182 rows 203 cols
[2024-05-29 17:20:27] [INFO ] Computed 34 invariants in 2 ms
[2024-05-29 17:20:27] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-29 17:20:27] [INFO ] Invariant cache hit.
[2024-05-29 17:20:27] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-29 17:20:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:20:29] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:20:29] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:20:29] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:20:29] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:20:29] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:20:29] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:20:29] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:20:29] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 2 ms to minimize.
[2024-05-29 17:20:29] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:20:29] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:20:29] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:20:29] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2024-05-29 17:20:29] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:20:29] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:20:29] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:20:30] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 4 ms to minimize.
[2024-05-29 17:20:30] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:20:30] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:20:30] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:20:30] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:20:30] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:20:30] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-29 17:20:30] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/385 variables, 203/260 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/385 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 260 constraints, problems are : Problem set: 0 solved, 181 unsolved in 7063 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 23/57 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:20:36] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/385 variables, 203/261 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 181/442 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:20:37] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 17:20:37] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-29 17:20:37] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-29 17:20:38] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:20:38] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:20:38] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:20:38] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:20:38] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:20:38] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-29 17:20:38] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-29 17:20:38] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:20:39] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:20:39] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2024-05-29 17:20:39] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 14/456 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:20:41] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-29 17:20:41] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-29 17:20:42] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:20:42] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 4/460 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:20:44] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:20:46] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:20:52] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/385 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/385 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 14 (OVERLAPS) 0/385 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 463 constraints, problems are : Problem set: 0 solved, 181 unsolved in 24598 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 45/45 constraints]
After SMT, in 31677ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 31678ms
Starting structural reductions in LTL mode, iteration 1 : 203/223 places, 182/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31873 ms. Remains : 203/223 places, 182/202 transitions.
[2024-05-29 17:20:59] [INFO ] Flatten gal took : 7 ms
[2024-05-29 17:20:59] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:20:59] [INFO ] Input system was already deterministic with 182 transitions.
[2024-05-29 17:20:59] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:20:59] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:20:59] [INFO ] Time to serialize gal into /tmp/CTLFireability860675246132468174.gal : 1 ms
[2024-05-29 17:20:59] [INFO ] Time to serialize properties into /tmp/CTLFireability16885834569240450435.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/CTLFireability860675246132468174.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16885834569240450435.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,4.03101e+19,6.68032,216868,2,12655,5,678816,6,0,996,1.49513e+06,0


Converting to forward existential form...Done !
original formula: E(!((((p17==1)&&(p53==1)) + AF(((((p198!=1)||((p204==1)&&(p198==1)))&&(p44!=1)) * EX((p220==1)))))) U AX(!(A((p83!=1) U EF((p62==1))))))
=> equivalent forward existential formula: [(FwdU(Init,!((((p17==1)&&(p53==1)) + !(EG(!(((((p198!=1)||((p204==1)&&(p198==1)))&&(p44!=1)) * EX((p220==1)))))...283
Reverse transition relation is NOT exact ! Due to transitions t12, t16, t21, t25, t30, t34, t39, t40, t43, t45, t46, t48, t49, t51, t52, t56, t60, t65, t69...438
Detected timeout of ITS tools.
[2024-05-29 17:21:29] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:21:29] [INFO ] Applying decomposition
[2024-05-29 17:21:29] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5337205490045801050.txt' '-o' '/tmp/graph5337205490045801050.bin' '-w' '/tmp/graph5337205490045801050.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5337205490045801050.bin' '-l' '-1' '-v' '-w' '/tmp/graph5337205490045801050.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:21:29] [INFO ] Decomposing Gal with order
[2024-05-29 17:21:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:21:29] [INFO ] Removed a total of 33 redundant transitions.
[2024-05-29 17:21:29] [INFO ] Flatten gal took : 18 ms
[2024-05-29 17:21:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 17:21:29] [INFO ] Time to serialize gal into /tmp/CTLFireability17421359542388597853.gal : 3 ms
[2024-05-29 17:21:29] [INFO ] Time to serialize properties into /tmp/CTLFireability6316787593937522904.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/CTLFireability17421359542388597853.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6316787593937522904.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,4.03101e+19,0.457803,20368,867,29,33089,328,447,64213,45,822,0


Converting to forward existential form...Done !
original formula: E(!((((i0.i1.u6.p17==1)&&(i0.i2.u16.p53==1)) + AF(((((i12.i1.u63.p198!=1)||((i11.i2.u67.p204==1)&&(i12.i1.u63.p198==1)))&&(i2.u14.p44!=1)...241
=> equivalent forward existential formula: [(FwdU(Init,!((((i0.i1.u6.p17==1)&&(i0.i2.u16.p53==1)) + !(EG(!(((((i12.i1.u63.p198!=1)||((i11.i2.u67.p204==1)&&...390
Reverse transition relation is NOT exact ! Due to transitions t43, t46, t89, t92, t136, t139, t165, t174, i0.t142, i0.i0.u5.t145, i0.i1.u6.t144, i0.i2.t121...748
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 202/202 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 222 transition count 151
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 172 transition count 151
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 100 place count 172 transition count 136
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 130 place count 157 transition count 136
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 143 place count 144 transition count 123
Iterating global reduction 2 with 13 rules applied. Total rules applied 156 place count 144 transition count 123
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 156 place count 144 transition count 114
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 174 place count 135 transition count 114
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 248 place count 98 transition count 77
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 250 place count 96 transition count 75
Applied a total of 250 rules in 20 ms. Remains 96 /223 variables (removed 127) and now considering 75/202 (removed 127) transitions.
// Phase 1: matrix 75 rows 96 cols
[2024-05-29 17:21:59] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 17:21:59] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-29 17:21:59] [INFO ] Invariant cache hit.
[2024-05-29 17:22:00] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2024-05-29 17:22:00] [INFO ] Redundant transitions in 1 ms returned []
Running 71 sub problems to find dead transitions.
[2024-05-29 17:22:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 4/96 variables, 8/34 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 75/171 variables, 96/130 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 0/171 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 130 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1079 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 4/96 variables, 8/34 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 75/171 variables, 96/130 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 71/201 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/171 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 201 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1166 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
After SMT, in 2252ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 2253ms
Starting structural reductions in SI_CTL mode, iteration 1 : 96/223 places, 75/202 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2387 ms. Remains : 96/223 places, 75/202 transitions.
[2024-05-29 17:22:02] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:22:02] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:22:02] [INFO ] Input system was already deterministic with 75 transitions.
[2024-05-29 17:22:02] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:22:02] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:22:02] [INFO ] Time to serialize gal into /tmp/CTLFireability2761567729660378631.gal : 0 ms
[2024-05-29 17:22:02] [INFO ] Time to serialize properties into /tmp/CTLFireability8527202023054919055.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/CTLFireability2761567729660378631.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8527202023054919055.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,8.06514e+13,0.269189,16340,2,226,5,51448,6,0,461,90775,0


Converting to forward existential form...Done !
original formula: A(((p42==1)&&(p101==1)) U AF(E((((p52!=1)&&(p22==1)) * ((p69==1) * AG((p195==1)))) U ((p183==1)&&(p235==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(E((((p52!=1)&&(p22==1)) * ((p69==1) * !(E(TRUE U !((p195==1)))))) U ((p183==1)&&(p235==1...425
Reverse transition relation is NOT exact ! Due to transitions t6, t34, t37, t67, Intersection with reachable at each step enabled. (destroyed/reverse/inte...178
Detected timeout of ITS tools.
[2024-05-29 17:22:32] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:22:32] [INFO ] Applying decomposition
[2024-05-29 17:22:32] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14449055718906755177.txt' '-o' '/tmp/graph14449055718906755177.bin' '-w' '/tmp/graph14449055718906755177.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14449055718906755177.bin' '-l' '-1' '-v' '-w' '/tmp/graph14449055718906755177.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:22:32] [INFO ] Decomposing Gal with order
[2024-05-29 17:22:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:22:32] [INFO ] Removed a total of 9 redundant transitions.
[2024-05-29 17:22:32] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:22:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-29 17:22:32] [INFO ] Time to serialize gal into /tmp/CTLFireability7210685558051118222.gal : 3 ms
[2024-05-29 17:22:32] [INFO ] Time to serialize properties into /tmp/CTLFireability14494909858618862246.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/CTLFireability7210685558051118222.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14494909858618862246.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,8.06514e+13,0.056027,5516,61,21,3950,169,260,7672,54,633,0


Converting to forward existential form...Done !
original formula: A(((i3.u7.p42==1)&&(i4.u13.p101==1)) U AF(E((((i1.u8.p52!=1)&&(i1.u3.p22==1)) * ((i2.u9.p69==1) * AG((i8.i1.u25.p195==1)))) U ((i8.i0.u21...186
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(E((((i1.u8.p52!=1)&&(i1.u3.p22==1)) * ((i2.u9.p69==1) * !(E(TRUE U !((i8.i1.u25.p195==1)...573
Reverse transition relation is NOT exact ! Due to transitions t67, i4.u15.t34, i6.u16.t37, i8.i0.u22.t6, Intersection with reachable at each step enabled....202
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 202/202 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 205 transition count 184
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 204 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 203 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 203 transition count 182
Applied a total of 40 rules in 11 ms. Remains 203 /223 variables (removed 20) and now considering 182/202 (removed 20) transitions.
// Phase 1: matrix 182 rows 203 cols
[2024-05-29 17:23:02] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 17:23:02] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-29 17:23:02] [INFO ] Invariant cache hit.
[2024-05-29 17:23:02] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-29 17:23:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:23:03] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:23:03] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:23:03] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:23:03] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 0 ms to minimize.
[2024-05-29 17:23:04] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:23:04] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:23:04] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:23:04] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-29 17:23:04] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:23:04] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-29 17:23:04] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2024-05-29 17:23:04] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:23:04] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:23:04] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:23:04] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:23:04] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:23:04] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:23:04] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:23:04] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:23:04] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/385 variables, 203/257 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:23:06] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:23:06] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:23:06] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:23:07] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:23:09] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 1 ms to minimize.
[2024-05-29 17:23:10] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (OVERLAPS) 0/385 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 263 constraints, problems are : Problem set: 0 solved, 181 unsolved in 10354 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 26/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/385 variables, 203/263 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 181/444 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:23:14] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-29 17:23:15] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 2 ms to minimize.
[2024-05-29 17:23:15] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:23:15] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-29 17:23:15] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:23:15] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 17:23:16] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:23:16] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-29 17:23:16] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:23:16] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 10/454 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:23:18] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:23:18] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 2/456 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:23:20] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:23:26] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/385 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 12 (OVERLAPS) 0/385 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 458 constraints, problems are : Problem set: 0 solved, 181 unsolved in 21280 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 40/40 constraints]
After SMT, in 31647ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 31649ms
Starting structural reductions in LTL mode, iteration 1 : 203/223 places, 182/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31837 ms. Remains : 203/223 places, 182/202 transitions.
[2024-05-29 17:23:34] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:23:34] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:23:34] [INFO ] Input system was already deterministic with 182 transitions.
[2024-05-29 17:23:34] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:23:34] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:23:34] [INFO ] Time to serialize gal into /tmp/CTLFireability10478059901391039498.gal : 1 ms
[2024-05-29 17:23:34] [INFO ] Time to serialize properties into /tmp/CTLFireability6712493563646553525.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/CTLFireability10478059901391039498.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6712493563646553525.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.52767e+19,6.59621,209696,2,11288,5,659299,6,0,996,1.44809e+06,0


Converting to forward existential form...Done !
original formula: AF(EG(AX((((p187==1)||(p147==1)) + (EX(((p106==1)&&(p158==1))) + ((p220==1)&&(p103==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(EX(!((((p187==1)||(p147==1)) + (EX(((p106==1)&&(p158==1))) + ((p220==1)&&(p103==1))))))))))] =...161
Reverse transition relation is NOT exact ! Due to transitions t12, t16, t21, t25, t30, t34, t39, t40, t43, t45, t46, t48, t49, t51, t52, t56, t60, t66, t70...437
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-29 17:24:04] [INFO ] Flatten gal took : 7 ms
[2024-05-29 17:24:04] [INFO ] Applying decomposition
[2024-05-29 17:24:04] [INFO ] Flatten gal took : 4 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/graph15386375939453446542.txt' '-o' '/tmp/graph15386375939453446542.bin' '-w' '/tmp/graph15386375939453446542.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15386375939453446542.bin' '-l' '-1' '-v' '-w' '/tmp/graph15386375939453446542.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:24:04] [INFO ] Decomposing Gal with order
[2024-05-29 17:24:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:24:04] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-29 17:24:04] [INFO ] Flatten gal took : 7 ms
[2024-05-29 17:24:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2024-05-29 17:24:04] [INFO ] Time to serialize gal into /tmp/CTLFireability11997699332584971565.gal : 7 ms
[2024-05-29 17:24:04] [INFO ] Time to serialize properties into /tmp/CTLFireability12944549330548879326.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/CTLFireability11997699332584971565.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12944549330548879326.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.52767e+19,0.536089,20896,1021,43,33111,677,476,72982,54,1922,0


Converting to forward existential form...Done !
original formula: AF(EG(AX((((i11.i1.u61.p187==1)||(i9.u47.p147==1)) + (EX(((i6.u33.p106==1)&&(i5.i2.u48.p158==1))) + ((i13.u71.p220==1)&&(i6.u33.p103==1))...160
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(EX(!((((i11.i1.u61.p187==1)||(i9.u47.p147==1)) + (EX(((i6.u33.p106==1)&&(i5.i2.u48.p158==1))) ...211
Reverse transition relation is NOT exact ! Due to transitions t43, t46, t90, t93, t139, t142, t165, t174, i0.i0.u1.t146, i0.i1.u8.t141, i1.t179, i1.t136, i...745
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 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 202/202 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 205 transition count 184
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 204 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 203 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 203 transition count 182
Applied a total of 40 rules in 6 ms. Remains 203 /223 variables (removed 20) and now considering 182/202 (removed 20) transitions.
// Phase 1: matrix 182 rows 203 cols
[2024-05-29 17:24:34] [INFO ] Computed 34 invariants in 2 ms
[2024-05-29 17:24:34] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-29 17:24:34] [INFO ] Invariant cache hit.
[2024-05-29 17:24:34] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-29 17:24:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:24:35] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:24:35] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:24:35] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 0 ms to minimize.
[2024-05-29 17:24:35] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-29 17:24:36] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:24:36] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:24:36] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:24:36] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:24:36] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-29 17:24:36] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 0 ms to minimize.
[2024-05-29 17:24:36] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-29 17:24:36] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:24:36] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:24:36] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2024-05-29 17:24:36] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-29 17:24:36] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:24:36] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-29 17:24:36] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:24:36] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:24:36] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:24:37] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:24:37] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:24:37] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-29 17:24:37] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-05-29 17:24:37] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:24:37] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/385 variables, 203/263 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:24:39] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/385 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 264 constraints, problems are : Problem set: 0 solved, 181 unsolved in 8017 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 27/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:24:43] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:24:43] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:24:44] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:24:44] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:24:44] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:24:44] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:24:44] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:24:45] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:24:46] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 182/385 variables, 203/273 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 181/454 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:24:50] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-29 17:24:50] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-29 17:24:50] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-05-29 17:24:51] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-29 17:24:51] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-29 17:24:51] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 6/460 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:24:53] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-29 17:24:53] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 13 (OVERLAPS) 0/385 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 462 constraints, problems are : Problem set: 0 solved, 181 unsolved in 18853 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 44/44 constraints]
After SMT, in 26883ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 26885ms
Starting structural reductions in LTL mode, iteration 1 : 203/223 places, 182/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27064 ms. Remains : 203/223 places, 182/202 transitions.
[2024-05-29 17:25:01] [INFO ] Flatten gal took : 9 ms
[2024-05-29 17:25:01] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:25:01] [INFO ] Input system was already deterministic with 182 transitions.
[2024-05-29 17:25:01] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:25:01] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:25:01] [INFO ] Time to serialize gal into /tmp/CTLFireability681639258126520301.gal : 1 ms
[2024-05-29 17:25:01] [INFO ] Time to serialize properties into /tmp/CTLFireability7739605665414618700.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/CTLFireability681639258126520301.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7739605665414618700.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.02014e+19,9.30878,276768,2,12477,5,857484,6,0,996,1.9376e+06,0


Converting to forward existential form...Done !
original formula: (EF((EG((p19==1)) * ((p60==1)||((p36==1)&&(p69==1))))) + AX((((p97==1)&&(p124==1)) * (((p78==0)||((((p150==0)||(p171==0))||(p207==0))&&((...200
=> equivalent forward existential formula: ([(EY((Init * !(E(TRUE U (EG((p19==1)) * ((p60==1)||((p36==1)&&(p69==1)))))))) * !(((p97==1)&&(p124==1))))] = FA...440
Reverse transition relation is NOT exact ! Due to transitions t12, t16, t21, t25, t30, t34, t39, t40, t43, t45, t46, t48, t49, t51, t52, t56, t57, t61, t63...436
Detected timeout of ITS tools.
[2024-05-29 17:25:31] [INFO ] Flatten gal took : 11 ms
[2024-05-29 17:25:31] [INFO ] Applying decomposition
[2024-05-29 17:25:31] [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/graph6119432664481909139.txt' '-o' '/tmp/graph6119432664481909139.bin' '-w' '/tmp/graph6119432664481909139.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6119432664481909139.bin' '-l' '-1' '-v' '-w' '/tmp/graph6119432664481909139.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:25:31] [INFO ] Decomposing Gal with order
[2024-05-29 17:25:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:25:31] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-29 17:25:31] [INFO ] Flatten gal took : 10 ms
[2024-05-29 17:25:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 17:25:31] [INFO ] Time to serialize gal into /tmp/CTLFireability1648507166960641515.gal : 2 ms
[2024-05-29 17:25:31] [INFO ] Time to serialize properties into /tmp/CTLFireability2024450990770776842.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/CTLFireability1648507166960641515.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2024450990770776842.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,4.02014e+19,1.24971,46500,1093,29,78540,354,463,175592,53,769,0


Converting to forward existential form...Done !
original formula: (EF((EG((i2.i1.u8.p19==1)) * ((i3.u20.p60==1)||((i0.i1.u12.p36==1)&&(i3.u22.p69==1))))) + AX((((i5.i1.u32.p97==1)&&(i7.u39.p124==1)) * ((...317
=> equivalent forward existential formula: ([(EY((Init * !(E(TRUE U (EG((i2.i1.u8.p19==1)) * ((i3.u20.p60==1)||((i0.i1.u12.p36==1)&&(i3.u22.p69==1)))))))) ...623
Reverse transition relation is NOT exact ! Due to transitions t43, t46, t90, t93, t136, t139, t165, t174, i0.t179, i0.i1.u11.t138, i0.i2.t107, i0.i2.u23.t1...733
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 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 202/202 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 204 transition count 183
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 204 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 203 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 203 transition count 182
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 202 transition count 181
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 202 transition count 181
Applied a total of 42 rules in 12 ms. Remains 202 /223 variables (removed 21) and now considering 181/202 (removed 21) transitions.
// Phase 1: matrix 181 rows 202 cols
[2024-05-29 17:26:01] [INFO ] Computed 34 invariants in 0 ms
[2024-05-29 17:26:01] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-29 17:26:01] [INFO ] Invariant cache hit.
[2024-05-29 17:26:01] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2024-05-29 17:26:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:26:03] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:26:03] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:26:03] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:26:03] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 0 ms to minimize.
[2024-05-29 17:26:03] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:26:03] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 0 ms to minimize.
[2024-05-29 17:26:03] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:26:03] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-29 17:26:03] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:26:03] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:26:03] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2024-05-29 17:26:03] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:26:03] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:26:03] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:26:03] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 2 ms to minimize.
[2024-05-29 17:26:03] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:26:03] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:26:04] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:26:04] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:26:04] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/383 variables, 202/256 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:26:05] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:26:06] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:26:07] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:26:09] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/383 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:26:12] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/383 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 12 (OVERLAPS) 0/383 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 261 constraints, problems are : Problem set: 0 solved, 180 unsolved in 13732 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:26:16] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/383 variables, 202/262 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 180/442 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:26:18] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:26:18] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:26:18] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-29 17:26:18] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 2 ms to minimize.
[2024-05-29 17:26:19] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-29 17:26:19] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-29 17:26:19] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-29 17:26:19] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-29 17:26:19] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-29 17:26:19] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 10/452 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:26:21] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-29 17:26:23] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (OVERLAPS) 0/383 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 454 constraints, problems are : Problem set: 0 solved, 180 unsolved in 15373 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 38/38 constraints]
After SMT, in 29120ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 29122ms
Starting structural reductions in LTL mode, iteration 1 : 202/223 places, 181/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29315 ms. Remains : 202/223 places, 181/202 transitions.
[2024-05-29 17:26:31] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:26:31] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:26:31] [INFO ] Input system was already deterministic with 181 transitions.
[2024-05-29 17:26:31] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:26:31] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:26:31] [INFO ] Time to serialize gal into /tmp/CTLFireability2626612324939203707.gal : 1 ms
[2024-05-29 17:26:31] [INFO ] Time to serialize properties into /tmp/CTLFireability5811043751976745816.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/CTLFireability2626612324939203707.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5811043751976745816.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.52767e+19,6.44271,206948,2,10932,5,648203,6,0,991,1.41692e+06,0


Converting to forward existential form...Done !
original formula: (!(E((EF(AG((p199==1))) + !((((p91==1)&&(p153==1))||(p164==1)))) U EG(((p20==1)&&(p47==1))))) * AX(EF((p95==1))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,(E(TRUE U !(E(TRUE U !((p199==1))))) + !((((p91==1)&&(p153==1))||(p164==1))))),((p20==1)&&(p47=...217
Reverse transition relation is NOT exact ! Due to transitions t12, t16, t21, t25, t30, t34, t39, t40, t43, t45, t46, t48, t49, t51, t52, t56, t60, t65, t69...432
Detected timeout of ITS tools.
[2024-05-29 17:27:01] [INFO ] Flatten gal took : 11 ms
[2024-05-29 17:27:01] [INFO ] Applying decomposition
[2024-05-29 17:27:01] [INFO ] Flatten gal took : 4 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/graph13277045543333479138.txt' '-o' '/tmp/graph13277045543333479138.bin' '-w' '/tmp/graph13277045543333479138.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13277045543333479138.bin' '-l' '-1' '-v' '-w' '/tmp/graph13277045543333479138.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:27:01] [INFO ] Decomposing Gal with order
[2024-05-29 17:27:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:27:01] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-29 17:27:01] [INFO ] Flatten gal took : 7 ms
[2024-05-29 17:27:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 17:27:01] [INFO ] Time to serialize gal into /tmp/CTLFireability11162140693874376908.gal : 2 ms
[2024-05-29 17:27:01] [INFO ] Time to serialize properties into /tmp/CTLFireability15045254170290358900.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/CTLFireability11162140693874376908.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15045254170290358900.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.52767e+19,1.05205,38848,1052,29,69145,368,457,134637,50,913,0


Converting to forward existential form...Done !
original formula: (!(E((EF(AG((i11.i1.u59.p199==1))) + !((((i8.i0.u29.p91==1)&&(i5.i2.u48.p153==1))||(i13.i0.u50.p164==1)))) U EG(((i1.i1.u7.p20==1)&&(i3.u...199
=> equivalent forward existential formula: ([FwdG(FwdU(Init,(E(TRUE U !(E(TRUE U !((i11.i1.u59.p199==1))))) + !((((i8.i0.u29.p91==1)&&(i5.i2.u48.p153==1))|...285
Reverse transition relation is NOT exact ! Due to transitions t43, t46, t89, t92, t135, t138, t164, t173, i0.i0.u1.t145, i0.i1.u8.t140, i1.t141, i1.i0.u5.t...720
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 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,1,8.01535,228664,1,0,373882,368,2698,900207,294,1043,435685
FORMULA ShieldPPPt-PT-003B-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 202/202 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 222 transition count 146
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 57 rules applied. Total rules applied 112 place count 167 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 113 place count 166 transition count 144
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 113 place count 166 transition count 129
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 143 place count 151 transition count 129
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 157 place count 137 transition count 115
Iterating global reduction 3 with 14 rules applied. Total rules applied 171 place count 137 transition count 115
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 171 place count 137 transition count 106
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 189 place count 128 transition count 106
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 267 place count 89 transition count 67
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 268 place count 88 transition count 66
Applied a total of 268 rules in 15 ms. Remains 88 /223 variables (removed 135) and now considering 66/202 (removed 136) transitions.
// Phase 1: matrix 66 rows 88 cols
[2024-05-29 17:27:09] [INFO ] Computed 34 invariants in 0 ms
[2024-05-29 17:27:09] [INFO ] Implicit Places using invariants in 44 ms returned [78]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 87/223 places, 66/202 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 87 transition count 64
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 85 transition count 64
Applied a total of 4 rules in 2 ms. Remains 85 /87 variables (removed 2) and now considering 64/66 (removed 2) transitions.
// Phase 1: matrix 64 rows 85 cols
[2024-05-29 17:27:09] [INFO ] Computed 33 invariants in 0 ms
[2024-05-29 17:27:09] [INFO ] Implicit Places using invariants in 43 ms returned [65, 69]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 83/223 places, 64/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 81 transition count 62
Applied a total of 4 rules in 2 ms. Remains 81 /83 variables (removed 2) and now considering 62/64 (removed 2) transitions.
// Phase 1: matrix 62 rows 81 cols
[2024-05-29 17:27:09] [INFO ] Computed 31 invariants in 0 ms
[2024-05-29 17:27:09] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 17:27:09] [INFO ] Invariant cache hit.
[2024-05-29 17:27:09] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 81/223 places, 62/202 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 203 ms. Remains : 81/223 places, 62/202 transitions.
[2024-05-29 17:27:09] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:27:09] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:27:09] [INFO ] Input system was already deterministic with 62 transitions.
[2024-05-29 17:27:09] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:27:09] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:27:09] [INFO ] Time to serialize gal into /tmp/CTLFireability7037747065754348256.gal : 1 ms
[2024-05-29 17:27:09] [INFO ] Time to serialize properties into /tmp/CTLFireability637572091056217437.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/CTLFireability7037747065754348256.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability637572091056217437.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,7.08588e+11,0.136603,10244,2,238,5,28211,6,0,388,45573,0


Converting to forward existential form...Done !
original formula: AF(AG((p162==1)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((p162==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t13, t15, t17, t19, t21, t27, t30, t34, t42, t58, Intersection with ...234
(forward)formula 0,0,0.318757,15524,1,0,151,54989,150,68,2420,75268,144
FORMULA ShieldPPPt-PT-003B-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 202/202 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 206 transition count 185
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 206 transition count 185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 205 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 204 transition count 183
Applied a total of 38 rules in 9 ms. Remains 204 /223 variables (removed 19) and now considering 183/202 (removed 19) transitions.
// Phase 1: matrix 183 rows 204 cols
[2024-05-29 17:27:09] [INFO ] Computed 34 invariants in 5 ms
[2024-05-29 17:27:09] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-29 17:27:09] [INFO ] Invariant cache hit.
[2024-05-29 17:27:09] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2024-05-29 17:27:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:27:11] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:27:11] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:27:11] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-05-29 17:27:11] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-29 17:27:11] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-29 17:27:11] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 1 ms to minimize.
[2024-05-29 17:27:11] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-29 17:27:11] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:27:11] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-29 17:27:11] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:27:11] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:27:11] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:27:11] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 0 ms to minimize.
[2024-05-29 17:27:11] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:27:11] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:27:11] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:27:12] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:27:12] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:27:12] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:27:12] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:27:12] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:27:12] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:27:12] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:27:13] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (OVERLAPS) 183/387 variables, 204/262 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:27:16] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/387 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (OVERLAPS) 0/387 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 263 constraints, problems are : Problem set: 0 solved, 182 unsolved in 10439 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:27:21] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:27:21] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (OVERLAPS) 183/387 variables, 204/265 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 182/447 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:27:23] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-29 17:27:23] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-29 17:27:24] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-29 17:27:24] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:27:24] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:27:24] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:27:24] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:27:25] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-29 17:27:25] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:27:25] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:27:25] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 11/458 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:27:27] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (OVERLAPS) 0/387 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 459 constraints, problems are : Problem set: 0 solved, 182 unsolved in 14490 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 39/39 constraints]
After SMT, in 24955ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 24957ms
Starting structural reductions in LTL mode, iteration 1 : 204/223 places, 183/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25148 ms. Remains : 204/223 places, 183/202 transitions.
[2024-05-29 17:27:34] [INFO ] Flatten gal took : 10 ms
[2024-05-29 17:27:34] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:27:34] [INFO ] Input system was already deterministic with 183 transitions.
[2024-05-29 17:27:34] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:27:34] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:27:34] [INFO ] Time to serialize gal into /tmp/CTLFireability1435917534542355572.gal : 1 ms
[2024-05-29 17:27:34] [INFO ] Time to serialize properties into /tmp/CTLFireability12345114007301099096.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/CTLFireability1435917534542355572.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12345114007301099096.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.14057e+19,6.6284,215952,2,11574,5,675161,6,0,1001,1.48111e+06,0


Converting to forward existential form...Done !
original formula: (EF(EX(AX(EX((p126==1))))) * AF((AF((((p143==1)||(p185==0))||(p149==0))) * EX(A((p58==1) U (p206==1))))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U EX(!(EX(!(EX((p126==1)))))))))] = FALSE * [FwdG(Init,!((!(EG(!((((p143==1)||(p185==0))||(p1...255
Reverse transition relation is NOT exact ! Due to transitions t12, t16, t21, t25, t30, t34, t35, t36, t40, t41, t44, t46, t47, t49, t50, t52, t53, t57, t61...448
Detected timeout of ITS tools.
[2024-05-29 17:28:04] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:28:04] [INFO ] Applying decomposition
[2024-05-29 17:28:04] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1595116604863992329.txt' '-o' '/tmp/graph1595116604863992329.bin' '-w' '/tmp/graph1595116604863992329.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1595116604863992329.bin' '-l' '-1' '-v' '-w' '/tmp/graph1595116604863992329.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:28:05] [INFO ] Decomposing Gal with order
[2024-05-29 17:28:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:28:05] [INFO ] Removed a total of 28 redundant transitions.
[2024-05-29 17:28:05] [INFO ] Flatten gal took : 11 ms
[2024-05-29 17:28:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 17:28:05] [INFO ] Time to serialize gal into /tmp/CTLFireability7368769155377098347.gal : 3 ms
[2024-05-29 17:28:05] [INFO ] Time to serialize properties into /tmp/CTLFireability902165582148791690.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/CTLFireability7368769155377098347.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability902165582148791690.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 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.14057e+19,0.81048,32508,1069,31,56566,315,446,125899,48,780,0


Converting to forward existential form...Done !
original formula: (EF(EX(AX(EX((i6.u36.p126==1))))) * AF((AF((((i8.u42.p143==1)||(i12.u55.p185==0))||(i9.i1.u44.p149==0))) * EX(A((i2.i1.u15.p58==1) U (i11...176
=> equivalent forward existential formula: ([(Init * !(E(TRUE U EX(!(EX(!(EX((i6.u36.p126==1)))))))))] = FALSE * [FwdG(Init,!((!(EG(!((((i8.u42.p143==1)||(...330
Reverse transition relation is NOT exact ! Due to transitions t44, t47, t90, t93, t140, t143, t166, t175, i0.i0.u1.t147, i0.i1.u8.t142, i1.t180, i1.t137, i...772
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 202/202 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 205 transition count 184
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 204 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 203 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 203 transition count 182
Applied a total of 40 rules in 15 ms. Remains 203 /223 variables (removed 20) and now considering 182/202 (removed 20) transitions.
// Phase 1: matrix 182 rows 203 cols
[2024-05-29 17:28:35] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 17:28:35] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-29 17:28:35] [INFO ] Invariant cache hit.
[2024-05-29 17:28:35] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-29 17:28:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:28:36] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:28:36] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:28:36] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:28:36] [INFO ] Deduced a trap composed of 19 places in 15 ms of which 1 ms to minimize.
[2024-05-29 17:28:36] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:28:36] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:28:36] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:28:36] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-29 17:28:36] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:28:36] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:28:36] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-05-29 17:28:37] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:28:37] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:28:37] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:28:37] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:28:37] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:28:37] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:28:37] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:28:37] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 1 ms to minimize.
[2024-05-29 17:28:37] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:28:37] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:28:38] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:28:39] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:28:39] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 182/385 variables, 203/261 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:28:41] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:28:41] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (OVERLAPS) 0/385 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 263 constraints, problems are : Problem set: 0 solved, 181 unsolved in 9507 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 26/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/385 variables, 203/263 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 181/444 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:28:46] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-29 17:28:46] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-29 17:28:46] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-29 17:28:47] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-05-29 17:28:47] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:28:47] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:28:47] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:28:47] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:28:47] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-29 17:28:47] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:28:48] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 11/455 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:28:50] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:28:52] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-29 17:28:52] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 2/458 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 17:28:57] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/385 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 12 (OVERLAPS) 0/385 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 459 constraints, problems are : Problem set: 0 solved, 181 unsolved in 19849 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 41/41 constraints]
After SMT, in 29370ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 29372ms
Starting structural reductions in LTL mode, iteration 1 : 203/223 places, 182/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29571 ms. Remains : 203/223 places, 182/202 transitions.
[2024-05-29 17:29:04] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:29:04] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:29:04] [INFO ] Input system was already deterministic with 182 transitions.
[2024-05-29 17:29:04] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:29:04] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:29:04] [INFO ] Time to serialize gal into /tmp/CTLFireability10330941732098144125.gal : 1 ms
[2024-05-29 17:29:04] [INFO ] Time to serialize properties into /tmp/CTLFireability13741311752533931635.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/CTLFireability10330941732098144125.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13741311752533931635.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.99569e+19,7.24155,232784,2,11612,5,730068,6,0,996,1.60612e+06,0


Converting to forward existential form...Done !
original formula: EG(AX(((p148==0)||(p46==0))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(((p148==0)||(p46==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t16, t21, t25, t30, t34, t39, t40, t43, t45, t46, t48, t49, t51, t52, t56, t60, t65, t69...444
(forward)formula 0,1,29.1205,822868,1,0,566,3.11916e+06,385,186,5609,5.65824e+06,554
FORMULA ShieldPPPt-PT-003B-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 202/202 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 206 transition count 185
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 206 transition count 185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 205 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 204 transition count 183
Applied a total of 38 rules in 15 ms. Remains 204 /223 variables (removed 19) and now considering 183/202 (removed 19) transitions.
// Phase 1: matrix 183 rows 204 cols
[2024-05-29 17:29:33] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 17:29:34] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-29 17:29:34] [INFO ] Invariant cache hit.
[2024-05-29 17:29:34] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2024-05-29 17:29:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:29:35] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:29:35] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:29:35] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:29:35] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:29:35] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-29 17:29:35] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 0 ms to minimize.
[2024-05-29 17:29:35] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:29:35] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-29 17:29:35] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:29:35] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:29:35] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-05-29 17:29:36] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:29:36] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:29:36] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:29:36] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:29:36] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:29:36] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:29:36] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:29:36] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:29:36] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:29:36] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:29:36] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 183/387 variables, 204/260 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:29:38] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:29:41] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/387 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:29:44] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:29:44] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/387 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:29:45] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 13 (OVERLAPS) 0/387 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 265 constraints, problems are : Problem set: 0 solved, 182 unsolved in 14636 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 27/61 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:29:49] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 183/387 variables, 204/266 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 182/448 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:29:51] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-29 17:29:51] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-29 17:29:51] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-29 17:29:52] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-29 17:29:52] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-29 17:29:52] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:29:52] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-29 17:29:52] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:29:52] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 9/457 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:29:55] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-29 17:29:55] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-29 17:29:56] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 3/460 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-29 17:29:58] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (OVERLAPS) 0/387 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 461 constraints, problems are : Problem set: 0 solved, 182 unsolved in 17760 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 41/41 constraints]
After SMT, in 32408ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 32410ms
Starting structural reductions in LTL mode, iteration 1 : 204/223 places, 183/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32593 ms. Remains : 204/223 places, 183/202 transitions.
[2024-05-29 17:30:06] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:30:06] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:30:06] [INFO ] Input system was already deterministic with 183 transitions.
[2024-05-29 17:30:06] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:30:06] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:30:06] [INFO ] Time to serialize gal into /tmp/CTLFireability10009606275831223497.gal : 1 ms
[2024-05-29 17:30:06] [INFO ] Time to serialize properties into /tmp/CTLFireability11811882590644137882.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/CTLFireability10009606275831223497.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11811882590644137882.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,4.03159e+19,8.38276,253936,2,12033,5,806254,6,0,1001,1.74847e+06,0


Converting to forward existential form...Done !
original formula: A(EG((p217==1)) U AF((((p182==1)&&(p184==1)) * (!(((p198!=1) * E((p161==1) U ((p94==1)&&(p130==1))))) + AX(((p33==1)||(p159==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((((p182==1)&&(p184==1)) * (!(((p198!=1) * E((p161==1) U ((p94==1)&&(p130==1))))) + !(EX(...492
Reverse transition relation is NOT exact ! Due to transitions t12, t16, t21, t25, t26, t27, t31, t35, t40, t41, t44, t46, t47, t49, t50, t52, t53, t58, t62...448
Detected timeout of ITS tools.
[2024-05-29 17:30:36] [INFO ] Flatten gal took : 11 ms
[2024-05-29 17:30:36] [INFO ] Applying decomposition
[2024-05-29 17:30:36] [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/graph8609382116045769926.txt' '-o' '/tmp/graph8609382116045769926.bin' '-w' '/tmp/graph8609382116045769926.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8609382116045769926.bin' '-l' '-1' '-v' '-w' '/tmp/graph8609382116045769926.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:30:36] [INFO ] Decomposing Gal with order
[2024-05-29 17:30:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:30:36] [INFO ] Removed a total of 33 redundant transitions.
[2024-05-29 17:30:36] [INFO ] Flatten gal took : 8 ms
[2024-05-29 17:30:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 17:30:36] [INFO ] Time to serialize gal into /tmp/CTLFireability2041680701620902711.gal : 2 ms
[2024-05-29 17:30:36] [INFO ] Time to serialize properties into /tmp/CTLFireability12933332138866206713.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/CTLFireability2041680701620902711.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12933332138866206713.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,4.03159e+19,0.461969,21168,859,29,33031,337,436,66218,50,793,0


Converting to forward existential form...Done !
original formula: A(EG((i14.u70.p217==1)) U AF((((i12.i0.u58.p182==1)&&(i12.i0.u58.p184==1)) * (!(((i12.i1.u64.p198!=1) * E((i11.i0.u51.p161==1) U ((i8.i1....241
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((((i12.i0.u58.p182==1)&&(i12.i0.u58.p184==1)) * (!(((i12.i1.u64.p198!=1) * E((i11.i0.u51...746
Reverse transition relation is NOT exact ! Due to transitions t44, t47, t91, t94, t137, t140, t166, t171, t175, i0.i0.u1.t147, i0.i1.u9.t142, i1.t143, i1.i...754
Detected timeout of ITS tools.
[2024-05-29 17:31:06] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:31:06] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:31:06] [INFO ] Applying decomposition
[2024-05-29 17:31:06] [INFO ] Flatten gal took : 4 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/graph16816931541162634198.txt' '-o' '/tmp/graph16816931541162634198.bin' '-w' '/tmp/graph16816931541162634198.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16816931541162634198.bin' '-l' '-1' '-v' '-w' '/tmp/graph16816931541162634198.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:31:06] [INFO ] Decomposing Gal with order
[2024-05-29 17:31:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:31:06] [INFO ] Removed a total of 21 redundant transitions.
[2024-05-29 17:31:06] [INFO ] Flatten gal took : 8 ms
[2024-05-29 17:31:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 17:31:06] [INFO ] Time to serialize gal into /tmp/CTLFireability8660277516731465054.gal : 1 ms
[2024-05-29 17:31:06] [INFO ] Time to serialize properties into /tmp/CTLFireability13757809050640468210.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/CTLFireability8660277516731465054.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13757809050640468210.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 9 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.32987e+20,0.680447,29176,1514,54,47639,466,491,96239,64,1195,0


Converting to forward existential form...Done !
original formula: A(((i16.i2.u81.p233==1) + AX(EG(A((i14.i1.u73.p212==1) U (i2.i0.u3.p9==1))))) U !(A(!((EF(((i6.i1.u39.p113==1)&&(i9.u51.p146==1))) + ((i1...220
=> equivalent forward existential formula: [((Init * !(EG(!(!(!((E(!(E(TRUE U !(E(TRUE U !((i13.u70.p199==1)))))) U (!(!((E(TRUE U ((i6.i1.u39.p113==1)&&(i...1023
Reverse transition relation is NOT exact ! Due to transitions t55, t58, t102, t105, t156, t159, t185, t193, t194, i0.u10.t158, i1.t154, i1.u13.t153, i1.u14...946
Detected timeout of ITS tools.
[2024-05-29 17:57:10] [INFO ] Applying decomposition
[2024-05-29 17:57:10] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:57:10] [INFO ] Decomposing Gal with order
[2024-05-29 17:57:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:57:10] [INFO ] Removed a total of 5 redundant transitions.
[2024-05-29 17:57:10] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:57:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 5 ms.
[2024-05-29 17:57:10] [INFO ] Time to serialize gal into /tmp/CTLFireability5739495111221515872.gal : 2 ms
[2024-05-29 17:57:10] [INFO ] Time to serialize properties into /tmp/CTLFireability5637923924604998788.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/CTLFireability5739495111221515872.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5637923924604998788.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 9 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.32987e+20,38.6803,1337912,6601,247,2.48584e+06,594,323,1.07699e+07,115,4085,0


Converting to forward existential form...Done !
original formula: A(((i1.u66.p233==1) + AX(EG(A((i1.i0.i0.u64.p212==1) U (i0.i0.i1.i0.i0.u90.p9==1))))) U !(A(!((EF(((i0.i1.i0.i0.i0.i0.i1.u41.p113==1)&&(i...294
=> equivalent forward existential formula: [((Init * !(EG(!(!(!((E(!(E(TRUE U !(E(TRUE U !((i1.i0.i0.i0.u63.p199==1)))))) U (!(!((E(TRUE U ((i0.i1.i0.i0.i0...1297
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u3.t166, i0.i0.i1.u24.t116, i0.i0.i1.u24.t117, i0.i0.i1.u24.t121, i0.i0.i1.u24.t122, i0...1702

BK_TIME_CONFINEMENT_REACHED

--------------------
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="ShieldPPPt-PT-003B"
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 ShieldPPPt-PT-003B, 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-171683761400570"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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