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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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 Apr 23 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 21:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 11 21:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 21:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 11 21:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:55 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 24K 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 ShieldRVt-PT-002B-CTLCardinality-2024-00
FORMULA_NAME ShieldRVt-PT-002B-CTLCardinality-2024-01
FORMULA_NAME ShieldRVt-PT-002B-CTLCardinality-2024-02
FORMULA_NAME ShieldRVt-PT-002B-CTLCardinality-2024-03
FORMULA_NAME ShieldRVt-PT-002B-CTLCardinality-2024-04
FORMULA_NAME ShieldRVt-PT-002B-CTLCardinality-2024-05
FORMULA_NAME ShieldRVt-PT-002B-CTLCardinality-2024-06
FORMULA_NAME ShieldRVt-PT-002B-CTLCardinality-2024-07
FORMULA_NAME ShieldRVt-PT-002B-CTLCardinality-2024-08
FORMULA_NAME ShieldRVt-PT-002B-CTLCardinality-2024-09
FORMULA_NAME ShieldRVt-PT-002B-CTLCardinality-2024-10
FORMULA_NAME ShieldRVt-PT-002B-CTLCardinality-2024-11
FORMULA_NAME ShieldRVt-PT-002B-CTLCardinality-2023-12
FORMULA_NAME ShieldRVt-PT-002B-CTLCardinality-2023-13
FORMULA_NAME ShieldRVt-PT-002B-CTLCardinality-2023-14
FORMULA_NAME ShieldRVt-PT-002B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717075356140

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-002B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-30 13:22:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 13:22:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 13:22:37] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2024-05-30 13:22:37] [INFO ] Transformed 103 places.
[2024-05-30 13:22:37] [INFO ] Transformed 103 transitions.
[2024-05-30 13:22:37] [INFO ] Found NUPN structural information;
[2024-05-30 13:22:37] [INFO ] Parsed PT model containing 103 places and 103 transitions and 242 arcs in 151 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Support contains 76 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 100 transition count 100
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 100 transition count 100
Applied a total of 6 rules in 21 ms. Remains 100 /103 variables (removed 3) and now considering 100/103 (removed 3) transitions.
// Phase 1: matrix 100 rows 100 cols
[2024-05-30 13:22:37] [INFO ] Computed 9 invariants in 13 ms
[2024-05-30 13:22:37] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-30 13:22:37] [INFO ] Invariant cache hit.
[2024-05-30 13:22:37] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Running 99 sub problems to find dead transitions.
[2024-05-30 13:22:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-30 13:22:38] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 9 ms to minimize.
[2024-05-30 13:22:38] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:22:38] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:22:38] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:22:38] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-30 13:22:38] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:22:38] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:22:38] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:22:38] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:22:39] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 0 ms to minimize.
[2024-05-30 13:22:39] [INFO ] Deduced a trap composed of 30 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:22:39] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-30 13:22:39] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:22:39] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 0 ms to minimize.
[2024-05-30 13:22:39] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-30 13:22:39] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-05-30 13:22:39] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:22:39] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:22:39] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:22:39] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:22:39] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-30 13:22:40] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 100/200 variables, 100/131 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-30 13:22:41] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:22:41] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:22:41] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:22:41] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/200 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-30 13:22:41] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:22:42] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 12 (OVERLAPS) 0/200 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 137 constraints, problems are : Problem set: 0 solved, 99 unsolved in 5062 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/200 variables, 100/137 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 99/236 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-30 13:22:43] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:22:43] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 2 ms to minimize.
[2024-05-30 13:22:43] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:22:43] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:22:44] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:22:44] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:22:44] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 4 ms to minimize.
[2024-05-30 13:22:44] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:22:44] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 1 ms to minimize.
[2024-05-30 13:22:44] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:22:44] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:22:44] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:22:44] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 13/249 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-30 13:22:45] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:22:45] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/200 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 251 constraints, problems are : Problem set: 0 solved, 99 unsolved in 4586 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 43/43 constraints]
After SMT, in 9689ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 9710ms
Starting structural reductions in LTL mode, iteration 1 : 100/103 places, 100/103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10089 ms. Remains : 100/103 places, 100/103 transitions.
Support contains 76 out of 100 places after structural reductions.
[2024-05-30 13:22:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-30 13:22:47] [INFO ] Flatten gal took : 29 ms
[2024-05-30 13:22:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldRVt-PT-002B-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 13:22:47] [INFO ] Flatten gal took : 9 ms
[2024-05-30 13:22:47] [INFO ] Input system was already deterministic with 100 transitions.
Support contains 71 out of 100 places (down from 76) after GAL structural reductions.
RANDOM walk for 40000 steps (27 resets) in 1382 ms. (28 steps per ms) remains 3/65 properties
BEST_FIRST walk for 40001 steps (8 resets) in 175 ms. (227 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (13 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (12 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
[2024-05-30 13:22:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 57/100 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 13:22:48] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:22:48] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 100/200 variables, 100/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 111 constraints, problems are : Problem set: 0 solved, 2 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 57/100 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 13:22:48] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 100/200 variables, 100/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 13:22:48] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/200 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 115 constraints, problems are : Problem set: 0 solved, 2 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 333ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 199 ms.
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 100/100 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 100 transition count 71
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 71 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 70 transition count 69
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 61 place count 70 transition count 59
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 81 place count 60 transition count 59
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 90 place count 51 transition count 50
Iterating global reduction 3 with 9 rules applied. Total rules applied 99 place count 51 transition count 50
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 99 place count 51 transition count 46
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 107 place count 47 transition count 46
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 143 place count 29 transition count 28
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 153 place count 24 transition count 31
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 154 place count 24 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 155 place count 23 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 156 place count 22 transition count 29
Applied a total of 156 rules in 22 ms. Remains 22 /100 variables (removed 78) and now considering 29/100 (removed 71) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 22/100 places, 29/100 transitions.
RANDOM walk for 40000 steps (343 resets) in 386 ms. (103 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (84 resets) in 206 ms. (193 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (103 resets) in 206 ms. (193 steps per ms) remains 2/2 properties
Probably explored full state space saw : 520 states, properties seen :0
Probabilistic random walk after 2772 steps, saw 520 distinct states, run finished after 19 ms. (steps per millisecond=145 ) properties seen :0
Explored full state space saw : 520 states, properties seen :0
Exhaustive walk after 2772 steps, saw 520 distinct states, run finished after 9 ms. (steps per millisecond=308 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2024-05-30 13:22:49] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:22:49] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:22:49] [INFO ] Input system was already deterministic with 100 transitions.
Computed a total of 31 stabilizing places and 31 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 84 transition count 84
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 84 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 83 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 83 transition count 83
Applied a total of 34 rules in 7 ms. Remains 83 /100 variables (removed 17) and now considering 83/100 (removed 17) transitions.
// Phase 1: matrix 83 rows 83 cols
[2024-05-30 13:22:49] [INFO ] Computed 9 invariants in 4 ms
[2024-05-30 13:22:49] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-30 13:22:49] [INFO ] Invariant cache hit.
[2024-05-30 13:22:49] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2024-05-30 13:22:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 13:22:49] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:22:49] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:22:49] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:22:49] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-30 13:22:50] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:22:50] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 13:22:50] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:22:50] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-30 13:22:50] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 83/166 variables, 83/101 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 0/166 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 101 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1786 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/166 variables, 83/101 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 82/183 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 13:22:51] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 3 ms to minimize.
[2024-05-30 13:22:51] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:22:51] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:22:51] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:22:51] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-30 13:22:51] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 6/189 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 13:22:52] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 13:22:52] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/166 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 191 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2902 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 17/17 constraints]
After SMT, in 4698ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 4700ms
Starting structural reductions in LTL mode, iteration 1 : 83/100 places, 83/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4801 ms. Remains : 83/100 places, 83/100 transitions.
[2024-05-30 13:22:54] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:22:54] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:22:54] [INFO ] Input system was already deterministic with 83 transitions.
[2024-05-30 13:22:54] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:22:54] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:22:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality5884272305190609137.gal : 2 ms
[2024-05-30 13:22:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality11062213382605971083.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/CTLCardinality5884272305190609137.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11062213382605971083.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.29473e+07,0.085612,6992,2,758,5,11880,6,0,417,22996,0


Converting to forward existential form...Done !
original formula: (A((p67==1) U A(((AF(AG((p48==1))) + (p74==0)) + (p87==1)) U ((AX((p25==1)) * EG(((p52==0)||(p63==1)))) * AX(EX(((p44==0)||(p34==1)))))))...292
=> equivalent forward existential formula: ((((([(EY((FwdU((FwdU(Init,!(!((E(!(((!(EX(!((p25==1)))) * EG(((p52==0)||(p63==1)))) * !(EX(!(EX(((p44==0)||(p34...2906
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t22, t27, t31, t32, t38, t39, t43, t45, t48, t52, t53, t54, t58, t62, t65, ...268
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-30 13:23:24] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:23:24] [INFO ] Applying decomposition
[2024-05-30 13:23:24] [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/graph7165772162028426319.txt' '-o' '/tmp/graph7165772162028426319.bin' '-w' '/tmp/graph7165772162028426319.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7165772162028426319.bin' '-l' '-1' '-v' '-w' '/tmp/graph7165772162028426319.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:23:24] [INFO ] Decomposing Gal with order
[2024-05-30 13:23:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:23:24] [INFO ] Removed a total of 17 redundant transitions.
[2024-05-30 13:23:24] [INFO ] Flatten gal took : 34 ms
[2024-05-30 13:23:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 13:23:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality9881176467221886058.gal : 4 ms
[2024-05-30 13:23:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality8892321063380778418.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/CTLCardinality9881176467221886058.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8892321063380778418.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.29473e+07,0.032054,4900,204,25,2568,168,217,3462,43,395,0


Converting to forward existential form...Done !
original formula: (A((i6.u21.p67==1) U A(((AF(AG((i5.u18.p48==1))) + (i7.u25.p74==0)) + (i8.u29.p87==1)) U ((AX((i3.u8.p25==1)) * EG(((i5.u16.p52==0)||(i6....412
=> equivalent forward existential formula: ((((([(EY((FwdU((FwdU(Init,!(!((E(!(((!(EX(!((i3.u8.p25==1)))) * EG(((i5.u16.p52==0)||(i6.u23.p63==1)))) * !(EX(...3852
Reverse transition relation is NOT exact ! Due to transitions t77, i0.u1.t72, i2.t65, i2.u4.t69, i3.t62, i3.t58, i4.t54, i4.t48, i4.u12.t52, i4.u14.t53, i5...369
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,7.12063,263620,1,0,497295,357,1523,778023,223,1169,489780
FORMULA ShieldRVt-PT-002B-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 83 transition count 83
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 83 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 82 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 82 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 81 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 81 transition count 81
Applied a total of 38 rules in 10 ms. Remains 81 /100 variables (removed 19) and now considering 81/100 (removed 19) transitions.
// Phase 1: matrix 81 rows 81 cols
[2024-05-30 13:23:31] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 13:23:31] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-30 13:23:31] [INFO ] Invariant cache hit.
[2024-05-30 13:23:31] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-30 13:23:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 13:23:32] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:23:32] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-30 13:23:32] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:23:32] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:23:32] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-30 13:23:32] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:23:32] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 13:23:32] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/98 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/162 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 98 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1719 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 81/162 variables, 81/98 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 80/178 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 13:23:33] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:23:34] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:23:34] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:23:34] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 4/182 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 13:23:34] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:23:34] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/162 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 184 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2216 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 14/14 constraints]
After SMT, in 3950ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 3951ms
Starting structural reductions in LTL mode, iteration 1 : 81/100 places, 81/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4073 ms. Remains : 81/100 places, 81/100 transitions.
[2024-05-30 13:23:35] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:23:35] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:23:35] [INFO ] Input system was already deterministic with 81 transitions.
[2024-05-30 13:23:35] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:23:35] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:23:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality9184813674343688002.gal : 2 ms
[2024-05-30 13:23:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality13428080650708626929.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/CTLCardinality9184813674343688002.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13428080650708626929.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.29284e+07,0.070909,7080,2,775,5,12094,6,0,407,22309,0


Converting to forward existential form...Done !
original formula: (EX(((AX((p52==0)) + EF((p91==1))) + (E(((p57==0)||(p18==1)) U EF((p93==1))) + AF(AG((p35==0)))))) * EG(((p39==0)||(p50==1))))
=> equivalent forward existential formula: [FwdG((Init * EX(((!(EX(!((p52==0)))) + E(TRUE U (p91==1))) + (E(((p57==0)||(p18==1)) U E(TRUE U (p93==1))) + !(...223
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t10, t13, t17, t20, t22, t26, t30, t31, t37, t41, t46, t47, t51, t53, t56, t60, t63, ...263
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 77/0/4
(forward)formula 0,1,16.3449,490236,1,0,857,2.51996e+06,208,589,2543,4.28403e+06,946
FORMULA ShieldRVt-PT-002B-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 84 transition count 84
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 84 transition count 84
Applied a total of 32 rules in 10 ms. Remains 84 /100 variables (removed 16) and now considering 84/100 (removed 16) transitions.
// Phase 1: matrix 84 rows 84 cols
[2024-05-30 13:23:52] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 13:23:52] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-30 13:23:52] [INFO ] Invariant cache hit.
[2024-05-30 13:23:52] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2024-05-30 13:23:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-30 13:23:52] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:23:52] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:23:52] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:23:52] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:23:52] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:23:52] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:23:52] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 84/168 variables, 84/100 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 0/168 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 100 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1590 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 84/84 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-30 13:23:54] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 84/168 variables, 84/101 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 83/184 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-30 13:23:54] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:23:54] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:23:54] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:23:54] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-30 13:23:54] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 5/189 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-30 13:23:55] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-30 13:23:55] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:23:55] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:23:55] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 4/193 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-30 13:23:55] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:23:56] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:23:56] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:23:56] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:23:56] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 5/198 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-30 13:23:56] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/168 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 12 (OVERLAPS) 0/168 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 199 constraints, problems are : Problem set: 0 solved, 83 unsolved in 4298 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 84/84 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 23/23 constraints]
After SMT, in 5898ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 5899ms
Starting structural reductions in LTL mode, iteration 1 : 84/100 places, 84/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6015 ms. Remains : 84/100 places, 84/100 transitions.
[2024-05-30 13:23:58] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:23:58] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:23:58] [INFO ] Input system was already deterministic with 84 transitions.
[2024-05-30 13:23:58] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:23:58] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:23:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality3918311464999535199.gal : 1 ms
[2024-05-30 13:23:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality3844930959079979204.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/CTLCardinality3918311464999535199.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3844930959079979204.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.92872e+07,0.089543,7624,2,848,5,13384,6,0,422,27131,0


Converting to forward existential form...Done !
original formula: EG(AG((((AF(((p83==0)&&(p33==1))) + (p18==1)) + ((p101==0)||(p44==1))) + (EX(((p24==0)||(p70==1))) * A(EF((p69==0)) U EG((p65==0)))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((((!(EG(!(((p83==0)&&(p33==1))))) + (p18==1)) + ((p101==0)||(p44==1))) + (EX(((p24==0)||...273
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t17, t22, t26, t33, t39, t40, t44, t46, t49, t53, t55, t59, t63, t66, t70, ...268
Using saturation style SCC detection
(forward)formula 0,0,29.6141,913472,1,0,1878,4.85648e+06,215,918,2508,8.25225e+06,2023
FORMULA ShieldRVt-PT-002B-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 84 transition count 84
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 84 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 83 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 83 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 82 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 82 transition count 82
Applied a total of 36 rules in 13 ms. Remains 82 /100 variables (removed 18) and now considering 82/100 (removed 18) transitions.
// Phase 1: matrix 82 rows 82 cols
[2024-05-30 13:24:28] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 13:24:28] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-30 13:24:28] [INFO ] Invariant cache hit.
[2024-05-30 13:24:28] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2024-05-30 13:24:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 13:24:28] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-30 13:24:28] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-30 13:24:28] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:24:28] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:24:28] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2024-05-30 13:24:28] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:24:28] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 13:24:28] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:24:29] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 82/164 variables, 82/100 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 0/164 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 100 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1742 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 82/164 variables, 82/100 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 81/181 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 13:24:30] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:24:30] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:24:30] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-30 13:24:30] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:24:30] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:24:30] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-05-30 13:24:30] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-05-30 13:24:30] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:24:30] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 9/190 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 13:24:31] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:24:31] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:24:31] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/164 variables, 3/193 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 0/164 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 193 constraints, problems are : Problem set: 0 solved, 81 unsolved in 3431 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 21/21 constraints]
After SMT, in 5192ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 5193ms
Starting structural reductions in LTL mode, iteration 1 : 82/100 places, 82/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5306 ms. Remains : 82/100 places, 82/100 transitions.
[2024-05-30 13:24:33] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:24:33] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:24:33] [INFO ] Input system was already deterministic with 82 transitions.
[2024-05-30 13:24:33] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:24:33] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:24:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality4601568977775432455.gal : 1 ms
[2024-05-30 13:24:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality9845366175548289166.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/CTLCardinality4601568977775432455.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9845366175548289166.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.7955e+07,0.075314,6820,2,704,5,11651,6,0,412,21282,0


Converting to forward existential form...Done !
original formula: (AG(A((p82==1) U (p66==0))) + AF(EX(((p94==1) * !(A((p70==0) U (p20==0)))))))
=> equivalent forward existential formula: [FwdG((Init * !(!(E(TRUE U !(!((E(!((p66==0)) U (!((p82==1)) * !((p66==0)))) + EG(!((p66==0)))))))))),!(EX(((p94...245
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t9, t13, t17, t19, t23, t27, t30, t32, t33, t35, t39, t43, t48, t52, t61, t64, t68, t...257
(forward)formula 0,0,8.7702,306492,1,0,1090,1.18552e+06,211,589,2342,2.62842e+06,1072
FORMULA ShieldRVt-PT-002B-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 82 transition count 82
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 82 transition count 82
Applied a total of 36 rules in 13 ms. Remains 82 /100 variables (removed 18) and now considering 82/100 (removed 18) transitions.
// Phase 1: matrix 82 rows 82 cols
[2024-05-30 13:24:42] [INFO ] Computed 9 invariants in 3 ms
[2024-05-30 13:24:42] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-30 13:24:42] [INFO ] Invariant cache hit.
[2024-05-30 13:24:42] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2024-05-30 13:24:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 13:24:42] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:24:42] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:24:42] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 82/164 variables, 82/94 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 0/164 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 94 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1380 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 82/164 variables, 82/94 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 81/175 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 13:24:44] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-30 13:24:44] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:24:44] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 3/178 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 13:24:44] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-30 13:24:44] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 13:24:45] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 13:24:45] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 13:24:46] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/164 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 13 (OVERLAPS) 0/164 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 183 constraints, problems are : Problem set: 0 solved, 81 unsolved in 4325 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 11/11 constraints]
After SMT, in 5718ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 5720ms
Starting structural reductions in LTL mode, iteration 1 : 82/100 places, 82/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5824 ms. Remains : 82/100 places, 82/100 transitions.
[2024-05-30 13:24:48] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:24:48] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:24:48] [INFO ] Input system was already deterministic with 82 transitions.
[2024-05-30 13:24:48] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:24:48] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:24:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality14366845377726425135.gal : 1 ms
[2024-05-30 13:24:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality16770626405197783291.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/CTLCardinality14366845377726425135.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16770626405197783291.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.88153e+07,0.062261,6296,2,572,5,9789,6,0,412,16829,0


Converting to forward existential form...Done !
original formula: EG((EF(AX((p68==0))) + AX(((p97!=0)||(p79!=1)))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U !(EX(!((p68==0))))) + !(EX(!(((p97!=0)||(p79!=1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t34, t39, t43, t48, t52, t61, t64, t68, t71, t76, Intersection w...238
(forward)formula 0,1,0.30696,16328,1,0,200,58485,192,95,2462,70875,219
FORMULA ShieldRVt-PT-002B-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 85 transition count 85
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 85 transition count 85
Applied a total of 30 rules in 5 ms. Remains 85 /100 variables (removed 15) and now considering 85/100 (removed 15) transitions.
// Phase 1: matrix 85 rows 85 cols
[2024-05-30 13:24:48] [INFO ] Computed 9 invariants in 2 ms
[2024-05-30 13:24:48] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-30 13:24:48] [INFO ] Invariant cache hit.
[2024-05-30 13:24:48] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2024-05-30 13:24:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-30 13:24:49] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-30 13:24:49] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:24:49] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-30 13:24:49] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 85/170 variables, 85/98 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/170 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 98 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1656 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-30 13:24:50] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:24:50] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 85/170 variables, 85/100 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 84/184 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-30 13:24:50] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:24:51] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:24:51] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:24:51] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-05-30 13:24:51] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 5/189 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-30 13:24:51] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-05-30 13:24:51] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:24:51] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:24:51] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:24:51] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:24:51] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/170 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 195 constraints, problems are : Problem set: 0 solved, 84 unsolved in 3051 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 17/17 constraints]
After SMT, in 4733ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 4734ms
Starting structural reductions in LTL mode, iteration 1 : 85/100 places, 85/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4895 ms. Remains : 85/100 places, 85/100 transitions.
[2024-05-30 13:24:53] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:24:53] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:24:53] [INFO ] Input system was already deterministic with 85 transitions.
[2024-05-30 13:24:53] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:24:53] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:24:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality5520969204338756725.gal : 1 ms
[2024-05-30 13:24:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality788076741241396823.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/CTLCardinality5520969204338756725.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality788076741241396823.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.9613e+07,0.097753,7896,2,773,5,14066,6,0,427,29018,0


Converting to forward existential form...Done !
original formula: AG((((E((p12==1) U AG(E(((p2==0)||(p69==1)) U ((p69==0)||(p92==1))))) + AG(((p19==0)&&(p92==1)))) + (AX((p59==1)) + ((p38==0)&&(p98==1)))...205
=> equivalent forward existential formula: [(EY((((FwdU(Init,TRUE) * !((((p83==0)&&(p18==1))||((p59==0)&&(p13==1))))) * !((E((p12==1) U !(E(TRUE U !(E(((p2...292
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t17, t22, t26, t29, t30, t34, t36, t40, t44, t49, t53, t62, t66, t70, t72, ...263
(forward)formula 0,1,0.296306,14496,1,0,189,51504,205,97,2371,62310,202
FORMULA ShieldRVt-PT-002B-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 99 transition count 71
Reduce places removed 28 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 30 rules applied. Total rules applied 58 place count 71 transition count 69
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 62 place count 70 transition count 66
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 65 place count 67 transition count 66
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 65 place count 67 transition count 57
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 83 place count 58 transition count 57
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 94 place count 47 transition count 46
Iterating global reduction 4 with 11 rules applied. Total rules applied 105 place count 47 transition count 46
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 105 place count 47 transition count 42
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 113 place count 43 transition count 42
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 139 place count 30 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 29 transition count 28
Applied a total of 140 rules in 14 ms. Remains 29 /100 variables (removed 71) and now considering 28/100 (removed 72) transitions.
// Phase 1: matrix 28 rows 29 cols
[2024-05-30 13:24:53] [INFO ] Computed 9 invariants in 0 ms
[2024-05-30 13:24:53] [INFO ] Implicit Places using invariants in 29 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 28/100 places, 28/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 47 ms. Remains : 28/100 places, 28/100 transitions.
[2024-05-30 13:24:53] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:24:53] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:24:53] [INFO ] Input system was already deterministic with 28 transitions.
[2024-05-30 13:24:53] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:24:53] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:24:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality3658264363517892316.gal : 1 ms
[2024-05-30 13:24:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality14526547540962523173.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/CTLCardinality3658264363517892316.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14526547540962523173.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,5836,0.007312,3516,2,84,5,1086,6,0,142,1310,0


Converting to forward existential form...Done !
original formula: AF(E((p15!=0) U !(EF(!(AF(((p91==0)||(p55==1))))))))
=> equivalent forward existential formula: [FwdG(Init,!(E((p15!=0) U !(E(TRUE U !(!(EG(!(((p91==0)||(p55==1)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t9, t11, t15, t16, t19, Intersection with reachable at each step enabled. (destroyed...191
(forward)formula 0,1,0.016495,4100,1,0,75,2312,90,34,852,2422,80
FORMULA ShieldRVt-PT-002B-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 99 transition count 69
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 62 place count 69 transition count 67
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 65 place count 68 transition count 65
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 67 place count 66 transition count 65
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 67 place count 66 transition count 57
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 83 place count 58 transition count 57
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 94 place count 47 transition count 46
Iterating global reduction 4 with 11 rules applied. Total rules applied 105 place count 47 transition count 46
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 105 place count 47 transition count 41
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 115 place count 42 transition count 41
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 135 place count 32 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 136 place count 31 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 137 place count 30 transition count 30
Applied a total of 137 rules in 10 ms. Remains 30 /100 variables (removed 70) and now considering 30/100 (removed 70) transitions.
// Phase 1: matrix 30 rows 30 cols
[2024-05-30 13:24:53] [INFO ] Computed 8 invariants in 1 ms
[2024-05-30 13:24:53] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-30 13:24:53] [INFO ] Invariant cache hit.
[2024-05-30 13:24:53] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-30 13:24:53] [INFO ] Redundant transitions in 0 ms returned []
Running 28 sub problems to find dead transitions.
[2024-05-30 13:24:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 2/30 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 30/60 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 0/60 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 38 constraints, problems are : Problem set: 0 solved, 28 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 2/30 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 30/60 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 28/66 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/60 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 66 constraints, problems are : Problem set: 0 solved, 28 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 487ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 488ms
Starting structural reductions in SI_CTL mode, iteration 1 : 30/100 places, 30/100 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 562 ms. Remains : 30/100 places, 30/100 transitions.
[2024-05-30 13:24:54] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:24:54] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:24:54] [INFO ] Input system was already deterministic with 30 transitions.
[2024-05-30 13:24:54] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:24:54] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:24:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality18385373504520287463.gal : 1 ms
[2024-05-30 13:24:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality11882674818593811064.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/CTLCardinality18385373504520287463.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11882674818593811064.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,11458,0.016058,3852,2,110,5,1734,6,0,151,2525,0


Converting to forward existential form...Done !
original formula: AF(!(E(EG((p91!=0)) U AF(E(((p21==0)||(p2==1)) U (p28==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(EG((p91!=0)) U !(EG(!(E(((p21==0)||(p2==1)) U (p28==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t7, t9, t11, t15, t17, t19, t21, t22, Intersection with reachable at each step enabled. ...201
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.172728,12036,1,0,403,43430,100,240,938,71750,390
FORMULA ShieldRVt-PT-002B-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 82 transition count 82
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 82 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 81 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 80 transition count 80
Applied a total of 40 rules in 8 ms. Remains 80 /100 variables (removed 20) and now considering 80/100 (removed 20) transitions.
// Phase 1: matrix 80 rows 80 cols
[2024-05-30 13:24:54] [INFO ] Computed 9 invariants in 0 ms
[2024-05-30 13:24:54] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-05-30 13:24:54] [INFO ] Invariant cache hit.
[2024-05-30 13:24:54] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2024-05-30 13:24:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 13:24:55] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:24:55] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:24:56] [INFO ] Deduced a trap composed of 18 places in 695 ms of which 23 ms to minimize.
[2024-05-30 13:24:56] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:24:56] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 80/160 variables, 80/94 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 0/160 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 94 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2152 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 80/160 variables, 80/94 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 79/173 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 13:24:57] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:24:57] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 0 ms to minimize.
[2024-05-30 13:24:57] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:24:57] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:24:57] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 13:24:58] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:24:58] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 13:24:58] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/160 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 181 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2816 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 13/13 constraints]
After SMT, in 4981ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 4984ms
Starting structural reductions in LTL mode, iteration 1 : 80/100 places, 80/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5402 ms. Remains : 80/100 places, 80/100 transitions.
[2024-05-30 13:24:59] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:24:59] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:24:59] [INFO ] Input system was already deterministic with 80 transitions.
[2024-05-30 13:24:59] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:24:59] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:24:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality4658764944238185927.gal : 0 ms
[2024-05-30 13:24:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality15944685954323131402.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/CTLCardinality4658764944238185927.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15944685954323131402.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.996e+07,0.061129,6284,2,554,5,9792,6,0,402,16695,0


Converting to forward existential form...Done !
original formula: (AG(((EG((((p80==0)||(p18==1))&&(p28==1))) + (p65==0)) + (p59==1))) * AX((p84==0)))
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * !((p59==1))) * !((p65==0))) * !(EG((((p80==0)||(p18==1))&&(p28==1)))))] = FALSE * [(EY(In...183
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t28, t30, t31, t33, t37, t41, t46, t50, t59, t62, t66, t69, Inte...248
(forward)formula 0,0,3.07158,123304,1,0,1093,649248,188,515,2195,1.06255e+06,1156
FORMULA ShieldRVt-PT-002B-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 81 transition count 81
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 80 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 79 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 79 transition count 79
Applied a total of 42 rules in 10 ms. Remains 79 /100 variables (removed 21) and now considering 79/100 (removed 21) transitions.
// Phase 1: matrix 79 rows 79 cols
[2024-05-30 13:25:03] [INFO ] Computed 9 invariants in 0 ms
[2024-05-30 13:25:03] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-30 13:25:03] [INFO ] Invariant cache hit.
[2024-05-30 13:25:03] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-30 13:25:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 13:25:03] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:25:03] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:25:03] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 79/158 variables, 79/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 0/158 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 91 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1284 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 79/158 variables, 79/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 78/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 13:25:04] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:25:05] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-05-30 13:25:05] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 3/172 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 13:25:05] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:25:05] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:25:05] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 13:25:06] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/158 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 13:25:06] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 13:25:07] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/158 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 14 (OVERLAPS) 0/158 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 178 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4188 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 12/12 constraints]
After SMT, in 5481ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 5482ms
Starting structural reductions in LTL mode, iteration 1 : 79/100 places, 79/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5585 ms. Remains : 79/100 places, 79/100 transitions.
[2024-05-30 13:25:08] [INFO ] Flatten gal took : 10 ms
[2024-05-30 13:25:08] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:25:08] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-30 13:25:08] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:25:08] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:25:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality13047661472420196543.gal : 1 ms
[2024-05-30 13:25:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality5053676806661450678.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/CTLCardinality13047661472420196543.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5053676806661450678.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.75398e+07,0.064625,6268,2,544,5,9344,6,0,397,16022,0


Converting to forward existential form...Done !
original formula: EX(E(AF(!(((p2==0)||(p85==1)))) U !(EF(!((((p25==0)||(p43==1))&&(p28==0)))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),!(EG(!(!(((p2==0)||(p85==1))))))) * !(E(TRUE U !((((p25==0)||(p43==1))&&(p28==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t45, t49, t58, t61, t65, t68, t73, Intersect...243
(forward)formula 0,0,19.4507,550376,1,0,1073,2.85542e+06,191,488,2272,5.18758e+06,1193
FORMULA ShieldRVt-PT-002B-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 84 transition count 84
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 84 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 83 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 83 transition count 83
Applied a total of 34 rules in 2 ms. Remains 83 /100 variables (removed 17) and now considering 83/100 (removed 17) transitions.
// Phase 1: matrix 83 rows 83 cols
[2024-05-30 13:25:28] [INFO ] Computed 9 invariants in 0 ms
[2024-05-30 13:25:28] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-30 13:25:28] [INFO ] Invariant cache hit.
[2024-05-30 13:25:28] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2024-05-30 13:25:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 13:25:28] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:25:28] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:25:28] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:25:28] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:25:28] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/166 variables, 83/97 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 13:25:29] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 0/166 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 98 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1724 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 13:25:30] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-30 13:25:30] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 83/166 variables, 83/100 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 82/182 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 13:25:30] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:25:30] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:25:30] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:25:30] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:25:31] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-30 13:25:31] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:25:31] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 13:25:31] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:25:31] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:25:31] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:25:31] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 4/193 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/166 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 193 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2767 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 19/19 constraints]
After SMT, in 4499ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 4500ms
Starting structural reductions in LTL mode, iteration 1 : 83/100 places, 83/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4591 ms. Remains : 83/100 places, 83/100 transitions.
[2024-05-30 13:25:32] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:25:32] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:25:32] [INFO ] Input system was already deterministic with 83 transitions.
[2024-05-30 13:25:32] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:25:32] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:25:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality15890560218635980350.gal : 1 ms
[2024-05-30 13:25:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality968724495732683920.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/CTLCardinality15890560218635980350.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality968724495732683920.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.13547e+07,0.092652,7616,2,889,5,13426,6,0,417,25842,0


Converting to forward existential form...Done !
original formula: E((!((EG(((AX((p21==1)) + (p6==1)) + (p73==1))) * !((((p3==0)||(p77==0))||(p45==1))))) * ((p35==0)||(p93==1))) U EG(!(E(!(((p51==1)||(p67...176
=> equivalent forward existential formula: [FwdG(FwdU(Init,(!((EG(((!(EX(!((p21==1)))) + (p6==1)) + (p73==1))) * !((((p3==0)||(p77==0))||(p45==1))))) * ((p...226
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t10, t13, t17, t22, t26, t28, t31, t32, t38, t39, t43, t45, t46, t49, t53, t58, t62, ...268
Using saturation style SCC detection
(forward)formula 0,1,15.0376,423064,1,0,1655,1.99052e+06,210,1067,2389,3.55957e+06,1528
FORMULA ShieldRVt-PT-002B-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 84 transition count 84
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 84 transition count 84
Applied a total of 32 rules in 3 ms. Remains 84 /100 variables (removed 16) and now considering 84/100 (removed 16) transitions.
// Phase 1: matrix 84 rows 84 cols
[2024-05-30 13:25:48] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 13:25:48] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-30 13:25:48] [INFO ] Invariant cache hit.
[2024-05-30 13:25:48] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2024-05-30 13:25:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-30 13:25:48] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:25:48] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:25:48] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-30 13:25:48] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 84/168 variables, 84/97 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 0/168 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 97 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1576 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 84/84 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 84/168 variables, 84/97 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 83/180 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-30 13:25:50] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:25:50] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:25:50] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-30 13:25:50] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:25:50] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:25:50] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 6/186 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-30 13:25:50] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:25:50] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:25:51] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-30 13:25:51] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-30 13:25:51] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-30 13:25:52] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 11 (OVERLAPS) 0/168 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 192 constraints, problems are : Problem set: 0 solved, 83 unsolved in 3622 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 84/84 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 16/16 constraints]
After SMT, in 5205ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 5206ms
Starting structural reductions in LTL mode, iteration 1 : 84/100 places, 84/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5308 ms. Remains : 84/100 places, 84/100 transitions.
[2024-05-30 13:25:53] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:25:53] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:25:53] [INFO ] Input system was already deterministic with 84 transitions.
[2024-05-30 13:25:53] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:25:53] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:25:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality14847807158900602542.gal : 1 ms
[2024-05-30 13:25:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality6038856106104876122.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/CTLCardinality14847807158900602542.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6038856106104876122.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.7139e+07,0.060425,6568,2,597,5,10328,6,0,422,18200,0


Converting to forward existential form...Done !
original formula: EG(((EX(((p16==0)||(p91==1))) + (((p86==0)||(p78==1))&&((p71==0)||(p61==1)))) + (AG(A(AF((p86==1)) U ((p7==0)&&(p97==0)))) * E(AG(((p58==...184
=> equivalent forward existential formula: [FwdG(Init,((EX(((p16==0)||(p91==1))) + (((p86==0)||(p78==1))&&((p71==0)||(p61==1)))) + (!(E(TRUE U !(!((E(!(((p...324
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t22, t26, t28, t30, t34, t35, t41, t45, t50, t54, t63, t66, t70, t73, t78, ...253
(forward)formula 0,1,7.87589,254976,1,0,1614,1.43409e+06,212,741,2524,2.15066e+06,1791
FORMULA ShieldRVt-PT-002B-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 81 transition count 81
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 80 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 79 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 79 transition count 79
Applied a total of 42 rules in 2 ms. Remains 79 /100 variables (removed 21) and now considering 79/100 (removed 21) transitions.
// Phase 1: matrix 79 rows 79 cols
[2024-05-30 13:26:01] [INFO ] Computed 9 invariants in 0 ms
[2024-05-30 13:26:01] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-30 13:26:01] [INFO ] Invariant cache hit.
[2024-05-30 13:26:01] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-30 13:26:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 13:26:01] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:26:01] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:26:01] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 79/158 variables, 79/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 0/158 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 91 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1344 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 79/158 variables, 79/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 78/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 13:26:03] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:26:03] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:26:03] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 3/172 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 13:26:03] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-30 13:26:03] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:26:03] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 13:26:04] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/158 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 13:26:05] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 13:26:05] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/158 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 14 (OVERLAPS) 0/158 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 178 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4155 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 12/12 constraints]
After SMT, in 5518ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 5520ms
Starting structural reductions in LTL mode, iteration 1 : 79/100 places, 79/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5682 ms. Remains : 79/100 places, 79/100 transitions.
[2024-05-30 13:26:07] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:26:07] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:26:07] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-30 13:26:07] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:26:07] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:26:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality14305666286547765147.gal : 1 ms
[2024-05-30 13:26:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality4006047947829493090.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/CTLCardinality14305666286547765147.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4006047947829493090.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.75398e+07,0.067104,6272,2,544,5,9344,6,0,397,16022,0


Converting to forward existential form...Done !
original formula: EX(AF((EG(AF((p70==0))) * AG(EX(((p76==0)||(p47==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((EG(!(EG(!((p70==0))))) * !(E(TRUE U !(EX(((p76==0)||(p47==1)))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t45, t49, t58, t61, t65, t68, t73, Intersect...243
(forward)formula 0,0,2.37113,79540,1,0,411,423999,184,197,2262,502207,444
FORMULA ShieldRVt-PT-002B-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 85 transition count 85
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 85 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 84 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 84 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 83 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 83 transition count 83
Applied a total of 34 rules in 7 ms. Remains 83 /100 variables (removed 17) and now considering 83/100 (removed 17) transitions.
// Phase 1: matrix 83 rows 83 cols
[2024-05-30 13:26:09] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 13:26:09] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-30 13:26:09] [INFO ] Invariant cache hit.
[2024-05-30 13:26:09] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2024-05-30 13:26:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 13:26:09] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:26:09] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-30 13:26:10] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-30 13:26:10] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:26:10] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:26:10] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-30 13:26:10] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 13:26:10] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:26:10] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 13:26:10] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 83/166 variables, 83/102 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/166 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 102 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1933 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/166 variables, 83/102 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 82/184 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 13:26:11] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:26:12] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:26:12] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:26:12] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:26:12] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:26:12] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 6/190 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 13:26:12] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 0/166 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 191 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2595 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 17/17 constraints]
After SMT, in 4536ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 4537ms
Starting structural reductions in LTL mode, iteration 1 : 83/100 places, 83/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4665 ms. Remains : 83/100 places, 83/100 transitions.
[2024-05-30 13:26:14] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:26:14] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:26:14] [INFO ] Input system was already deterministic with 83 transitions.
[2024-05-30 13:26:14] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:26:14] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:26:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality8634776504384517954.gal : 1 ms
[2024-05-30 13:26:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality14274715292992151316.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/CTLCardinality8634776504384517954.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14274715292992151316.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.79341e+07,0.100939,7620,2,914,5,13541,6,0,417,26943,0


Converting to forward existential form...Done !
original formula: AG((((p93==0)||(p30==1)) + ((EX(((p101==0)||(p90==1))) * AF((p21==1))) + (((p45==0)||(p89==1))&&(((p100==1)||(p0==0))||(p11==1))))))
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * !(((p93==0)||(p30==1)))) * !((((p45==0)||(p89==1))&&(((p100==1)||(p0==0))||(p11==1))))) *...333
Hit Full ! (commute/partial/dont) 81/0/2
(forward)formula 0,0,0.223617,11580,1,0,47,38850,24,8,1923,32100,42
FORMULA ShieldRVt-PT-002B-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-30 13:26:14] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:26:14] [INFO ] Flatten gal took : 3 ms
Total runtime 217112 ms.

BK_STOP 1717075574440

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="ShieldRVt-PT-002B"
export BK_EXAMINATION="CTLCardinality"
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 ShieldRVt-PT-002B, examination is CTLCardinality"
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-171683762100905"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-002B.tgz
mv ShieldRVt-PT-002B execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;