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-171683760600201.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ShieldIIPt-PT-002B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760600201
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 12 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 20:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 12 20:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 34K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-002B-CTLCardinality-2024-00
FORMULA_NAME ShieldIIPt-PT-002B-CTLCardinality-2024-01
FORMULA_NAME ShieldIIPt-PT-002B-CTLCardinality-2024-02
FORMULA_NAME ShieldIIPt-PT-002B-CTLCardinality-2024-03
FORMULA_NAME ShieldIIPt-PT-002B-CTLCardinality-2024-04
FORMULA_NAME ShieldIIPt-PT-002B-CTLCardinality-2024-05
FORMULA_NAME ShieldIIPt-PT-002B-CTLCardinality-2024-06
FORMULA_NAME ShieldIIPt-PT-002B-CTLCardinality-2024-07
FORMULA_NAME ShieldIIPt-PT-002B-CTLCardinality-2024-08
FORMULA_NAME ShieldIIPt-PT-002B-CTLCardinality-2024-09
FORMULA_NAME ShieldIIPt-PT-002B-CTLCardinality-2024-10
FORMULA_NAME ShieldIIPt-PT-002B-CTLCardinality-2024-11
FORMULA_NAME ShieldIIPt-PT-002B-CTLCardinality-2023-12
FORMULA_NAME ShieldIIPt-PT-002B-CTLCardinality-2023-13
FORMULA_NAME ShieldIIPt-PT-002B-CTLCardinality-2023-14
FORMULA_NAME ShieldIIPt-PT-002B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716924646218

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-002B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-28 19:30:47] [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-28 19:30:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 19:30:47] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2024-05-28 19:30:47] [INFO ] Transformed 143 places.
[2024-05-28 19:30:47] [INFO ] Transformed 133 transitions.
[2024-05-28 19:30:47] [INFO ] Found NUPN structural information;
[2024-05-28 19:30:47] [INFO ] Parsed PT model containing 143 places and 133 transitions and 330 arcs in 148 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPt-PT-002B-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-002B-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 86 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 133/133 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 141 transition count 131
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 141 transition count 131
Applied a total of 4 rules in 22 ms. Remains 141 /143 variables (removed 2) and now considering 131/133 (removed 2) transitions.
// Phase 1: matrix 131 rows 141 cols
[2024-05-28 19:30:47] [INFO ] Computed 19 invariants in 11 ms
[2024-05-28 19:30:47] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-28 19:30:47] [INFO ] Invariant cache hit.
[2024-05-28 19:30:47] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-05-28 19:30:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-28 19:30:48] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 14 ms to minimize.
[2024-05-28 19:30:48] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-28 19:30:48] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:30:48] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:30:49] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:30:49] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:30:49] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-28 19:30:49] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 24 ms to minimize.
[2024-05-28 19:30:49] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-28 19:30:49] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:30:49] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-05-28 19:30:49] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:30:49] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:30:49] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:30:49] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-28 19:30:49] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-28 19:30:49] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:30:49] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:30:49] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:30:49] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-28 19:30:50] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-28 19:30:50] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:30:50] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:30:50] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 1 ms to minimize.
[2024-05-28 19:30:50] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-28 19:30:50] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:30:50] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:30:50] [INFO ] Deduced a trap composed of 22 places in 17 ms of which 1 ms to minimize.
[2024-05-28 19:30:50] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:30:50] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:30:50] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-28 19:30:50] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-28 19:30:51] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-28 19:30:51] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/272 variables, 141/194 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-28 19:30:52] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/272 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 195 constraints, problems are : Problem set: 0 solved, 130 unsolved in 6474 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 131/272 variables, 141/195 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 130/325 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-28 19:30:55] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-28 19:30:55] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:30:55] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-28 19:30:55] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-28 19:30:56] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 2 ms to minimize.
[2024-05-28 19:30:56] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:30:56] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:30:56] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 8/333 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-28 19:30:57] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-28 19:30:57] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-28 19:30:58] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-28 19:30:58] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-28 19:31:00] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-28 19:31:00] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-28 19:31:00] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 11 (OVERLAPS) 0/272 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 340 constraints, problems are : Problem set: 0 solved, 130 unsolved in 10219 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 50/50 constraints]
After SMT, in 16733ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 16745ms
Starting structural reductions in LTL mode, iteration 1 : 141/143 places, 131/133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17146 ms. Remains : 141/143 places, 131/133 transitions.
Support contains 86 out of 141 places after structural reductions.
[2024-05-28 19:31:04] [INFO ] Flatten gal took : 29 ms
[2024-05-28 19:31:04] [INFO ] Flatten gal took : 11 ms
[2024-05-28 19:31:04] [INFO ] Input system was already deterministic with 131 transitions.
Support contains 81 out of 141 places (down from 86) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1127 ms. (35 steps per ms) remains 1/62 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 1/1 properties
[2024-05-28 19:31:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 91/141 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 131/272 variables, 141/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/272 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 91/141 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 19:31:05] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:31:05] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:31:05] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:31:05] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-05-28 19:31:05] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:31:05] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-28 19:31:05] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 131/272 variables, 141/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 19:31:05] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/272 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 169 constraints, problems are : Problem set: 0 solved, 1 unsolved in 382 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 478ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2795 steps, including 76 resets, run visited all 1 properties in 6 ms. (steps per millisecond=465 )
Parikh walk visited 1 properties in 10 ms.
[2024-05-28 19:31:05] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:31:05] [INFO ] Flatten gal took : 8 ms
[2024-05-28 19:31:05] [INFO ] Input system was already deterministic with 131 transitions.
Computed a total of 39 stabilizing places and 39 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 141/141 places, 131/131 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 140 transition count 98
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 108 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 107 transition count 97
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 66 place count 107 transition count 88
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 84 place count 98 transition count 88
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 95 place count 87 transition count 77
Iterating global reduction 3 with 11 rules applied. Total rules applied 106 place count 87 transition count 77
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 106 place count 87 transition count 73
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 114 place count 83 transition count 73
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 178 place count 51 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 179 place count 51 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 181 place count 50 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 183 place count 48 transition count 37
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 185 place count 46 transition count 37
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 185 place count 46 transition count 36
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 187 place count 45 transition count 36
Applied a total of 187 rules in 37 ms. Remains 45 /141 variables (removed 96) and now considering 36/131 (removed 95) transitions.
// Phase 1: matrix 36 rows 45 cols
[2024-05-28 19:31:05] [INFO ] Computed 17 invariants in 3 ms
[2024-05-28 19:31:05] [INFO ] Implicit Places using invariants in 39 ms returned [29]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 44/141 places, 36/131 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 80 ms. Remains : 44/141 places, 36/131 transitions.
[2024-05-28 19:31:06] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:31:06] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:31:06] [INFO ] Input system was already deterministic with 36 transitions.
[2024-05-28 19:31:06] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:31:06] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:31:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality224084660673906893.gal : 2 ms
[2024-05-28 19:31:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality209825204430326385.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/CTLCardinality224084660673906893.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality209825204430326385.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 -...281
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.6655e+06,0.040977,4900,2,209,5,7390,6,0,215,10105,0


Converting to forward existential form...Done !
original formula: AG((EF((AG(((p125==0)&&(p91==1))) * AF((p53==0)))) + AG(AF((p121==0)))))
=> equivalent forward existential formula: [FwdG(FwdU((FwdU(Init,TRUE) * !(E(TRUE U (!(E(TRUE U !(((p125==0)&&(p91==1))))) * !(EG(!((p53==0)))))))),TRUE),!...176
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t8, t12, t16, t17, t20, Intersection with reachable at each step enabled. (destroyed...191
Hit Full ! (commute/partial/dont) 34/0/2
(forward)formula 0,0,0.681129,32172,1,0,457,164074,112,188,1380,224234,536
FORMULA ShieldIIPt-PT-002B-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 131/131 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 123 transition count 113
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 123 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 122 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 122 transition count 112
Applied a total of 38 rules in 15 ms. Remains 122 /141 variables (removed 19) and now considering 112/131 (removed 19) transitions.
// Phase 1: matrix 112 rows 122 cols
[2024-05-28 19:31:06] [INFO ] Computed 19 invariants in 6 ms
[2024-05-28 19:31:06] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-28 19:31:06] [INFO ] Invariant cache hit.
[2024-05-28 19:31:06] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2024-05-28 19:31:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-28 19:31:07] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-28 19:31:07] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 19:31:07] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:31:07] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:31:07] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-28 19:31:07] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:31:07] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:31:07] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-28 19:31:07] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:31:07] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:31:07] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:31:07] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:31:08] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:31:08] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:31:08] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-28 19:31:08] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:31:08] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-28 19:31:08] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-28 19:31:09] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:31:09] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 112/234 variables, 122/161 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-28 19:31:10] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 0/234 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 162 constraints, problems are : Problem set: 0 solved, 111 unsolved in 4562 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/234 variables, 122/162 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 111/273 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-28 19:31:12] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-05-28 19:31:12] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 19:31:12] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-28 19:31:12] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-28 19:31:12] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:31:12] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:31:12] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:31:12] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 8/281 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-28 19:31:13] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-28 19:31:13] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-28 19:31:14] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-28 19:31:14] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:31:15] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 3/286 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-28 19:31:16] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-28 19:31:17] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:31:17] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 12 (OVERLAPS) 0/234 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 289 constraints, problems are : Problem set: 0 solved, 111 unsolved in 9755 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 37/37 constraints]
After SMT, in 14332ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 14335ms
Starting structural reductions in LTL mode, iteration 1 : 122/141 places, 112/131 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14499 ms. Remains : 122/141 places, 112/131 transitions.
[2024-05-28 19:31:21] [INFO ] Flatten gal took : 10 ms
[2024-05-28 19:31:21] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:31:21] [INFO ] Input system was already deterministic with 112 transitions.
[2024-05-28 19:31:21] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:31:21] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:31:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality6275729244081753202.gal : 2 ms
[2024-05-28 19:31:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality5369064258433271465.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/CTLCardinality6275729244081753202.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5369064258433271465.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,7.90851e+11,1.31464,45164,2,1786,5,126276,6,0,602,287039,0


Converting to forward existential form...Done !
original formula: E(((AX(((p92==0)||(p30==1))) + AG(EF(((p80==0)||(p79==1))))) + EF((AF(((p45==0)||(p114==1))) * EX(((p71==0)||(p77==1)))))) U (p111==1))
=> equivalent forward existential formula: [(FwdU(Init,((!(EX(!(((p92==0)||(p30==1))))) + !(E(TRUE U !(E(TRUE U ((p80==0)||(p79==1))))))) + E(TRUE U (!(EG(...235
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t14, t18, t23, t29, t33, t34, t37, t38, t39, t40, t41, t43, t44, t48, t53, t55, t58, ...329
(forward)formula 0,1,13.81,414112,1,0,986,2.06043e+06,258,402,3619,3.53616e+06,1124
FORMULA ShieldIIPt-PT-002B-CTLCardinality-2024-02 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 : 141/141 places, 131/131 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 121 transition count 111
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 121 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 120 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 120 transition count 110
Applied a total of 42 rules in 8 ms. Remains 120 /141 variables (removed 21) and now considering 110/131 (removed 21) transitions.
// Phase 1: matrix 110 rows 120 cols
[2024-05-28 19:31:35] [INFO ] Computed 19 invariants in 1 ms
[2024-05-28 19:31:35] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-28 19:31:35] [INFO ] Invariant cache hit.
[2024-05-28 19:31:35] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2024-05-28 19:31:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 19:31:35] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:31:35] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:31:35] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:31:36] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:31:36] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 19:31:36] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:31:36] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:31:36] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:31:36] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-28 19:31:36] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-28 19:31:36] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:31:36] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:31:36] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-28 19:31:36] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-05-28 19:31:36] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-28 19:31:36] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-28 19:31:36] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-05-28 19:31:36] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:31:36] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 19:31:36] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 110/230 variables, 120/159 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/230 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 159 constraints, problems are : Problem set: 0 solved, 109 unsolved in 3271 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 19:31:39] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 110/230 variables, 120/160 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 109/269 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 19:31:39] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:31:39] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:31:39] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-28 19:31:40] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:31:40] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-28 19:31:40] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 6/275 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 19:31:40] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/230 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 276 constraints, problems are : Problem set: 0 solved, 109 unsolved in 5211 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 28/28 constraints]
After SMT, in 8493ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 8495ms
Starting structural reductions in LTL mode, iteration 1 : 120/141 places, 110/131 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8632 ms. Remains : 120/141 places, 110/131 transitions.
[2024-05-28 19:31:43] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:31:43] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:31:43] [INFO ] Input system was already deterministic with 110 transitions.
[2024-05-28 19:31:43] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:31:43] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:31:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality15750345251928969866.gal : 2 ms
[2024-05-28 19:31:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality3025925169397719861.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/CTLCardinality15750345251928969866.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3025925169397719861.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.06448e+11,1.03706,37908,2,1895,5,109244,6,0,592,235342,0


Converting to forward existential form...Done !
original formula: EG(EX(((p7==0) * ((p44==0) + AF(((p133==0)||(p110==1)))))))
=> equivalent forward existential formula: [FwdG(Init,EX(((p7==0) * ((p44==0) + !(EG(!(((p133==0)||(p110==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t10, t12, t15, t19, t24, t28, t33, t34, t37, t38, t39, t40, t41, t43, t44, t48, t52, t57,...320
Detected timeout of ITS tools.
[2024-05-28 19:32:13] [INFO ] Flatten gal took : 9 ms
[2024-05-28 19:32:13] [INFO ] Applying decomposition
[2024-05-28 19:32:13] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14345792067622126372.txt' '-o' '/tmp/graph14345792067622126372.bin' '-w' '/tmp/graph14345792067622126372.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14345792067622126372.bin' '-l' '-1' '-v' '-w' '/tmp/graph14345792067622126372.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:32:14] [INFO ] Decomposing Gal with order
[2024-05-28 19:32:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:32:14] [INFO ] Removed a total of 22 redundant transitions.
[2024-05-28 19:32:14] [INFO ] Flatten gal took : 48 ms
[2024-05-28 19:32:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-28 19:32:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality4860662667265279137.gal : 4 ms
[2024-05-28 19:32:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality2161697339170412611.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/CTLCardinality4860662667265279137.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2161697339170412611.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.06448e+11,0.048792,5536,317,29,3812,205,321,7548,49,422,0


Converting to forward existential form...Done !
original formula: EG(EX(((i1.i1.u3.p7==0) * ((i5.u15.p44==0) + AF(((i13.u44.p133==0)||(i11.u36.p110==1)))))))
=> equivalent forward existential formula: [FwdG(Init,EX(((i1.i1.u3.p7==0) * ((i5.u15.p44==0) + !(EG(!(((i13.u44.p133==0)||(i11.u36.p110==1)))))))))] != FA...158
Reverse transition relation is NOT exact ! Due to transitions t37, t41, t81, t85, i0.u32.t38, i1.i1.u10.t82, i2.u7.t87, i3.t83, i3.i0.u1.t89, i3.i0.u9.t84,...481
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,1,15.4418,414532,1,0,790692,398,1481,1.256e+06,239,1060,795727
FORMULA ShieldIIPt-PT-002B-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 141/141 places, 131/131 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 140 transition count 101
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 111 transition count 101
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 58 place count 111 transition count 91
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 78 place count 101 transition count 91
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 87 place count 92 transition count 82
Iterating global reduction 2 with 9 rules applied. Total rules applied 96 place count 92 transition count 82
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 96 place count 92 transition count 78
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 104 place count 88 transition count 78
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 166 place count 57 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 167 place count 57 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 169 place count 56 transition count 45
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 170 place count 56 transition count 45
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 172 place count 54 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 173 place count 53 transition count 43
Applied a total of 173 rules in 29 ms. Remains 53 /141 variables (removed 88) and now considering 43/131 (removed 88) transitions.
// Phase 1: matrix 43 rows 53 cols
[2024-05-28 19:32:29] [INFO ] Computed 18 invariants in 2 ms
[2024-05-28 19:32:29] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-28 19:32:29] [INFO ] Invariant cache hit.
[2024-05-28 19:32:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-28 19:32:29] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-28 19:32:29] [INFO ] Redundant transitions in 1 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-28 19:32:29] [INFO ] Invariant cache hit.
[2024-05-28 19:32:29] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/53 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-28 19:32:29] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-28 19:32:29] [INFO ] Deduced a trap composed of 6 places in 12 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 43/96 variables, 53/73 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 75 constraints, problems are : Problem set: 0 solved, 40 unsolved in 491 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 53/53 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 43/96 variables, 53/73 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 40/115 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 115 constraints, problems are : Problem set: 0 solved, 40 unsolved in 437 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 53/53 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 2/2 constraints]
After SMT, in 937ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 937ms
Starting structural reductions in SI_CTL mode, iteration 1 : 53/141 places, 43/131 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1060 ms. Remains : 53/141 places, 43/131 transitions.
[2024-05-28 19:32:30] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:32:30] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:32:30] [INFO ] Input system was already deterministic with 43 transitions.
[2024-05-28 19:32:30] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:32:30] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:32:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality16270333224464369773.gal : 1 ms
[2024-05-28 19:32:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality5332546995051038468.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/CTLCardinality16270333224464369773.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5332546995051038468.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.68724e+07,0.068944,6896,2,406,5,13914,6,0,254,21738,0


Converting to forward existential form...Done !
original formula: A(((p30==0)||(p109==1)) U !(((!(A((p39==1) U (p122==0))) + (p67==0)) + ((p54==1)||(p42==0)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(((!(!((E(!((p122==0)) U (!((p39==1)) * !((p122==0)))) + EG(!((p122==0)))))) + (p67==0)) + ((p...464
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t5, t6, t7, t8, t21, t36, t41, Intersection with reachable at each step enabled. (de...198
Detected timeout of ITS tools.
[2024-05-28 19:33:00] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:33:00] [INFO ] Applying decomposition
[2024-05-28 19:33:00] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5193336376015327795.txt' '-o' '/tmp/graph5193336376015327795.bin' '-w' '/tmp/graph5193336376015327795.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5193336376015327795.bin' '-l' '-1' '-v' '-w' '/tmp/graph5193336376015327795.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:33:00] [INFO ] Decomposing Gal with order
[2024-05-28 19:33:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:33:00] [INFO ] Removed a total of 6 redundant transitions.
[2024-05-28 19:33:00] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:33:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-28 19:33:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality6408034164426256828.gal : 1 ms
[2024-05-28 19:33:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality4500858262151718391.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/CTLCardinality6408034164426256828.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4500858262151718391.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.68724e+07,0.015879,4152,66,33,1142,111,168,1904,53,440,0


Converting to forward existential form...Done !
original formula: A(((i4.u6.p30==0)||(i7.u15.p109==1)) U !(((!(A((i4.u5.p39==1) U (i3.u17.p122==0))) + (i5.u9.p67==0)) + ((i2.u8.p54==1)||(i0.u7.p42==0))))...156
=> equivalent forward existential formula: [((Init * !(EG(!(!(((!(!((E(!((i3.u17.p122==0)) U (!((i4.u5.p39==1)) * !((i3.u17.p122==0)))) + EG(!((i3.u17.p122...612
Reverse transition relation is NOT exact ! Due to transitions t41, u2.t0, i0.u7.t6, i2.u8.t5, i4.t7, i4.u6.t8, i5.u10.t21, i7.t1, i7.u15.t36, Intersection...239
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
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 8
(forward)formula 0,0,7.61517,228024,1,0,357970,289,812,744885,241,1101,277339
FORMULA ShieldIIPt-PT-002B-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 141/141 places, 131/131 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 140 transition count 100
Reduce places removed 30 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 62 place count 110 transition count 98
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 108 transition count 98
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 64 place count 108 transition count 89
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 82 place count 99 transition count 89
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 93 place count 88 transition count 78
Iterating global reduction 3 with 11 rules applied. Total rules applied 104 place count 88 transition count 78
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 104 place count 88 transition count 73
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 114 place count 83 transition count 73
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 168 place count 56 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 169 place count 56 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 171 place count 55 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 173 place count 53 transition count 42
Applied a total of 173 rules in 13 ms. Remains 53 /141 variables (removed 88) and now considering 42/131 (removed 89) transitions.
// Phase 1: matrix 42 rows 53 cols
[2024-05-28 19:33:08] [INFO ] Computed 19 invariants in 1 ms
[2024-05-28 19:33:08] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-28 19:33:08] [INFO ] Invariant cache hit.
[2024-05-28 19:33:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-28 19:33:08] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-28 19:33:08] [INFO ] Redundant transitions in 0 ms returned []
Running 39 sub problems to find dead transitions.
[2024-05-28 19:33:08] [INFO ] Invariant cache hit.
[2024-05-28 19:33:08] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 3/53 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 42/95 variables, 53/72 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 0/95 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/95 variables, and 75 constraints, problems are : Problem set: 0 solved, 39 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 3/53 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 42/95 variables, 53/72 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 39/114 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/95 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/95 variables, and 114 constraints, problems are : Problem set: 0 solved, 39 unsolved in 398 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
After SMT, in 860ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 860ms
Starting structural reductions in SI_CTL mode, iteration 1 : 53/141 places, 42/131 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 990 ms. Remains : 53/141 places, 42/131 transitions.
[2024-05-28 19:33:09] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:33:09] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:33:09] [INFO ] Input system was already deterministic with 42 transitions.
[2024-05-28 19:33:09] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:33:09] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:33:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality6322876071131462883.gal : 1 ms
[2024-05-28 19:33:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality11259757383822576608.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/CTLCardinality6322876071131462883.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11259757383822576608.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(!(A(AG((p34==0)) U !((((p62==0)||(p17==1))||((p13==1)||(p98==1)))))))
=> equivalent forward existential formula: ([(FwdU((FwdU(FwdU(Init,TRUE),!(!((((p62==0)||(p17==1))||((p13==1)||(p98==1)))))) * !(!((((p62==0)||(p17==1))||(...296
Hit Full ! (commute/partial/dont) 33/0/9
(forward)formula 0,1,0.037612,5312,1,0,9,6748,17,3,538,10319,6
FORMULA ShieldIIPt-PT-002B-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 131/131 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 126 transition count 116
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 126 transition count 116
Applied a total of 30 rules in 3 ms. Remains 126 /141 variables (removed 15) and now considering 116/131 (removed 15) transitions.
// Phase 1: matrix 116 rows 126 cols
[2024-05-28 19:33:09] [INFO ] Computed 19 invariants in 4 ms
[2024-05-28 19:33:09] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-28 19:33:09] [INFO ] Invariant cache hit.
[2024-05-28 19:33:09] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2024-05-28 19:33:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-28 19:33:10] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:33:10] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:33:10] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-28 19:33:10] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:33:10] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:33:10] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:33:10] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:33:10] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:33:10] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-28 19:33:10] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:33:10] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
[2024-05-28 19:33:10] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-28 19:33:10] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2024-05-28 19:33:10] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:33:10] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:33:10] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:33:10] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:33:10] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-28 19:33:10] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:33:11] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-28 19:33:11] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:33:11] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 116/242 variables, 126/167 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-28 19:33:12] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 19:33:12] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:33:12] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 3/170 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/242 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 170 constraints, problems are : Problem set: 0 solved, 115 unsolved in 4041 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/242 variables, 126/170 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 115/285 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-28 19:33:14] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:33:15] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:33:15] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:33:15] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 4/289 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-28 19:33:15] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:33:16] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-28 19:33:16] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-28 19:33:17] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-28 19:33:18] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-28 19:33:19] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:33:19] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 12 (OVERLAPS) 0/242 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 296 constraints, problems are : Problem set: 0 solved, 115 unsolved in 8918 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 36/36 constraints]
After SMT, in 12969ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 12970ms
Starting structural reductions in LTL mode, iteration 1 : 126/141 places, 116/131 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13106 ms. Remains : 126/141 places, 116/131 transitions.
[2024-05-28 19:33:22] [INFO ] Flatten gal took : 9 ms
[2024-05-28 19:33:22] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:33:22] [INFO ] Input system was already deterministic with 116 transitions.
[2024-05-28 19:33:22] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:33:22] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:33:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality6386877166415182737.gal : 1 ms
[2024-05-28 19:33:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality8152414844955104698.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/CTLCardinality6386877166415182737.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8152414844955104698.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,1.11673e+12,1.87361,64488,2,2839,5,176389,6,0,622,430795,0


Converting to forward existential form...Done !
original formula: A(E(E(EX(TRUE) U ((p0==1) * ((p9!=1) + EF((p1==0))))) U EG(((!((p31==0)||(p139==1)))||(p121==0)))) U (EG(((p102==1) + AX(((p84==0)||(p112...287
=> equivalent forward existential formula: [((Init * !(EG(!((EG(((p102==1) + !(EX(!(((p84==0)||(p112==1))))))) * ((!((E(!(!(EX(!((p138!=1))))) U (!((E(TRUE...1112
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t14, t19, t20, t22, t25, t29, t30, t31, t34, t38, t41, t42, t43, t44, t45, t47, t48, ...354
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-28 19:33:52] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:33:52] [INFO ] Applying decomposition
[2024-05-28 19:33:52] [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/graph16732164033074834991.txt' '-o' '/tmp/graph16732164033074834991.bin' '-w' '/tmp/graph16732164033074834991.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16732164033074834991.bin' '-l' '-1' '-v' '-w' '/tmp/graph16732164033074834991.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:33:52] [INFO ] Decomposing Gal with order
[2024-05-28 19:33:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:33:52] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-28 19:33:52] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:33:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 19:33:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality5590485100745709660.gal : 2 ms
[2024-05-28 19:33:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality5864954758117736520.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/CTLCardinality5590485100745709660.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5864954758117736520.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,1.11673e+12,0.305979,15664,514,29,22622,263,350,49895,49,737,0


Converting to forward existential form...Done !
original formula: A(E(E(EX(TRUE) U ((i7.i0.u0.p0==1) * ((i1.i0.u3.p9!=1) + EF((i7.i0.u0.p1==0))))) U EG(((!((i3.u13.p31==0)||(i12.u47.p139==1)))||(i11.u42....430
=> equivalent forward existential formula: [((Init * !(EG(!((EG(((i9.u35.p102==1) + !(EX(!(((i8.i0.u29.p84==0)||(i10.u39.p112==1))))))) * ((!((E(!(!(EX(!((...1543
Reverse transition relation is NOT exact ! Due to transitions t41, t89, t91, i0.u1.t95, i0.u8.t90, i1.i1.t87, i1.i1.u5.t94, i1.i1.u9.t88, i2.u6.t93, i3.t83...579
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 131/131 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 124 transition count 114
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 124 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 123 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 123 transition count 113
Applied a total of 36 rules in 3 ms. Remains 123 /141 variables (removed 18) and now considering 113/131 (removed 18) transitions.
// Phase 1: matrix 113 rows 123 cols
[2024-05-28 19:34:22] [INFO ] Computed 19 invariants in 1 ms
[2024-05-28 19:34:22] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-28 19:34:22] [INFO ] Invariant cache hit.
[2024-05-28 19:34:22] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-28 19:34:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:34:23] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:34:23] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:34:23] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-28 19:34:23] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:34:23] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-28 19:34:23] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-28 19:34:23] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:34:23] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:34:23] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:34:23] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:34:23] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:34:23] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-05-28 19:34:24] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:34:24] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:34:24] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:34:24] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:34:24] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/236 variables, 123/159 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:34:25] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/236 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 160 constraints, problems are : Problem set: 0 solved, 112 unsolved in 3669 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:34:27] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/236 variables, 123/161 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 112/273 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:34:27] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:34:27] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-28 19:34:27] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:34:28] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-28 19:34:28] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 19:34:28] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:34:28] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:34:28] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 8/281 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:34:29] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:34:29] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:34:30] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:34:31] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:34:32] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-28 19:34:32] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:34:34] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/236 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/236 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 15 (OVERLAPS) 0/236 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 288 constraints, problems are : Problem set: 0 solved, 112 unsolved in 11013 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 34/34 constraints]
After SMT, in 14693ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 14694ms
Starting structural reductions in LTL mode, iteration 1 : 123/141 places, 113/131 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14818 ms. Remains : 123/141 places, 113/131 transitions.
[2024-05-28 19:34:37] [INFO ] Flatten gal took : 12 ms
[2024-05-28 19:34:37] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:34:37] [INFO ] Input system was already deterministic with 113 transitions.
[2024-05-28 19:34:37] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:34:37] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:34:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality15834756474018772734.gal : 1 ms
[2024-05-28 19:34:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality16072758697886534878.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/CTLCardinality15834756474018772734.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16072758697886534878.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,7.86188e+11,1.14309,47424,2,1973,5,130615,6,0,607,305452,0


Converting to forward existential form...Done !
original formula: EG((((AF(EX(AX(((p2==0)||(p30==1))))) + AF(AG(AX((p16==0))))) + (A((p25!=1) U ((((p68==1)||(p39==0))||((p134==1)||(p67==0)))||((p64==1)||...225
=> equivalent forward existential formula: [FwdG(Init,(((!(EG(!(EX(!(EX(!(((p2==0)||(p30==1))))))))) + !(EG(!(!(E(TRUE U !(!(EX(!((p16==0))))))))))) + (!((...471
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t11, t15, t19, t24, t28, t33, t34, t37, t38, t39, t40, t41, t43, t44, t48, t53, t55, ...334
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-28 19:35:07] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:35:07] [INFO ] Applying decomposition
[2024-05-28 19:35:07] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2271216567903055140.txt' '-o' '/tmp/graph2271216567903055140.bin' '-w' '/tmp/graph2271216567903055140.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2271216567903055140.bin' '-l' '-1' '-v' '-w' '/tmp/graph2271216567903055140.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:35:07] [INFO ] Decomposing Gal with order
[2024-05-28 19:35:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:35:07] [INFO ] Removed a total of 20 redundant transitions.
[2024-05-28 19:35:07] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:35:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 19:35:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality3394874374288164313.gal : 2 ms
[2024-05-28 19:35:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality14211142979950437508.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/CTLCardinality3394874374288164313.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14211142979950437508.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.86188e+11,0.140931,9524,396,29,11974,269,330,20890,47,522,0


Converting to forward existential form...Done !
original formula: EG((((AF(EX(AX(((i3.u1.p2==0)||(i4.u13.p30==1))))) + AF(AG(AX((i2.u6.p16==0))))) + (A((i3.u8.p25!=1) U ((((i7.u24.p68==1)||(i4.u14.p39==0...322
=> equivalent forward existential formula: [FwdG(Init,(((!(EG(!(EX(!(EX(!(((i3.u1.p2==0)||(i4.u13.p30==1))))))))) + !(EG(!(!(E(TRUE U !(!(EX(!((i2.u6.p16==...654
Reverse transition relation is NOT exact ! Due to transitions t41, t86, t88, i1.t84, i1.u5.t91, i1.u9.t85, i2.u6.t90, i3.u1.t92, i3.u8.t87, i4.t82, i4.u13....506
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,17.4349,618184,1,0,1.10984e+06,466,2361,1.50506e+06,283,1308,973327
FORMULA ShieldIIPt-PT-002B-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 131/131 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 124 transition count 114
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 124 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 123 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 123 transition count 113
Applied a total of 36 rules in 6 ms. Remains 123 /141 variables (removed 18) and now considering 113/131 (removed 18) transitions.
// Phase 1: matrix 113 rows 123 cols
[2024-05-28 19:35:25] [INFO ] Computed 19 invariants in 2 ms
[2024-05-28 19:35:25] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-28 19:35:25] [INFO ] Invariant cache hit.
[2024-05-28 19:35:25] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-28 19:35:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:35:26] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:35:26] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:35:26] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:35:26] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:35:26] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-28 19:35:26] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:35:26] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:35:26] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:35:26] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:35:26] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:35:26] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2024-05-28 19:35:26] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:35:26] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-28 19:35:26] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:35:26] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:35:26] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-28 19:35:26] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:35:26] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:35:27] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-28 19:35:27] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:35:27] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:35:27] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-28 19:35:27] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:35:27] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:35:28] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 113/236 variables, 123/167 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/236 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 167 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4425 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:35:30] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/236 variables, 123/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 112/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:35:31] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:35:31] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:35:31] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-28 19:35:31] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-05-28 19:35:31] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:35:31] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 6/286 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:35:32] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-28 19:35:32] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-05-28 19:35:33] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:35:33] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 4/290 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:35:33] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-28 19:35:33] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:35:34] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 3/293 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 19:35:34] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (OVERLAPS) 0/236 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 294 constraints, problems are : Problem set: 0 solved, 112 unsolved in 8249 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 40/40 constraints]
After SMT, in 12690ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 12692ms
Starting structural reductions in LTL mode, iteration 1 : 123/141 places, 113/131 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12825 ms. Remains : 123/141 places, 113/131 transitions.
[2024-05-28 19:35:38] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:35:38] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:35:38] [INFO ] Input system was already deterministic with 113 transitions.
[2024-05-28 19:35:38] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:35:38] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:35:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality8160080050759508503.gal : 1 ms
[2024-05-28 19:35:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality10972854986873177545.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/CTLCardinality8160080050759508503.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10972854986873177545.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,8.12685e+11,1.19731,43732,2,1991,5,122725,6,0,607,273126,0


Converting to forward existential form...Done !
original formula: (A((AF(((p34==0)||(p49==1))) + (p50==1)) U (p76==1)) + AX(EX(((p134==1)||((p123==0)&&(p111==1))))))
=> equivalent forward existential formula: [(EY((Init * !(!((E(!((p76==1)) U (!((!(EG(!(((p34==0)||(p49==1))))) + (p50==1))) * !((p76==1)))) + EG(!((p76==1...218
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t11, t15, t19, t20, t25, t31, t35, t36, t39, t40, t41, t42, t43, t45, t46, t50, t54, ...324
Detected timeout of ITS tools.
[2024-05-28 19:36:08] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:36:08] [INFO ] Applying decomposition
[2024-05-28 19:36:08] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8930575412773686500.txt' '-o' '/tmp/graph8930575412773686500.bin' '-w' '/tmp/graph8930575412773686500.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8930575412773686500.bin' '-l' '-1' '-v' '-w' '/tmp/graph8930575412773686500.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:36:08] [INFO ] Decomposing Gal with order
[2024-05-28 19:36:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:36:08] [INFO ] Removed a total of 17 redundant transitions.
[2024-05-28 19:36:08] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:36:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-28 19:36:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality10486784638438447463.gal : 1 ms
[2024-05-28 19:36:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality15456702348083505652.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/CTLCardinality10486784638438447463.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15456702348083505652.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.12685e+11,0.068752,6672,378,29,5919,185,347,11243,50,467,0


Converting to forward existential form...Done !
original formula: (A((AF(((i3.u11.p34==0)||(i4.u14.p49==1))) + (i4.u14.p50==1)) U (i0.i2.u24.p76==1)) + AX(EX(((i12.u47.p134==1)||((i11.u41.p123==0)&&(i10....172
=> equivalent forward existential formula: [(EY((Init * !(!((E(!((i0.i2.u24.p76==1)) U (!((!(EG(!(((i3.u11.p34==0)||(i4.u14.p49==1))))) + (i4.u14.p50==1)))...293
Reverse transition relation is NOT exact ! Due to transitions t43, t84, t88, i0.i1.u10.t85, i1.t86, i1.i0.u6.t91, i1.i1.u1.t92, i1.i1.u9.t87, i2.u7.t90, i3...518
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,1,17.3473,444356,1,0,678867,365,1807,1.79667e+06,264,1054,755749
FORMULA ShieldIIPt-PT-002B-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

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


Converting to forward existential form...Done !
original formula: AF((((p61==0) * EX(AX((p137==1)))) * ((AX((p92==1)) + AF(((p58==0)||(p132==1)))) + ((p51==1)||(p135==0)))))
=> equivalent forward existential formula: [FwdG(Init,!((((p61==0) * EX(!(EX(!((p137==1)))))) * ((!(EX(!((p92==1)))) + !(EG(!(((p58==0)||(p132==1)))))) + (...188
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t10, t15, t19, t24, t28, t33, t34, t37, t38, t39, t40, t41, t43, t44, t48, t52, t58, ...319
Detected timeout of ITS tools.
[2024-05-28 19:37:07] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:37:07] [INFO ] Applying decomposition
[2024-05-28 19:37:07] [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/graph12482126579133494298.txt' '-o' '/tmp/graph12482126579133494298.bin' '-w' '/tmp/graph12482126579133494298.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12482126579133494298.bin' '-l' '-1' '-v' '-w' '/tmp/graph12482126579133494298.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:37:07] [INFO ] Decomposing Gal with order
[2024-05-28 19:37:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:37:07] [INFO ] Removed a total of 22 redundant transitions.
[2024-05-28 19:37:07] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:37:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 19:37:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality9886194026084087028.gal : 1 ms
[2024-05-28 19:37:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality5246693065772616528.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/CTLCardinality9886194026084087028.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5246693065772616528.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.05504e+11,0.061147,6108,344,29,4710,191,327,9121,50,407,0


Converting to forward existential form...Done !
original formula: AF((((i5.u19.p61==0) * EX(AX((i12.u46.p137==1)))) * ((AX((i7.u32.p92==1)) + AF(((i5.u18.p58==0)||(i12.u44.p132==1)))) + ((i5.u21.p51==1)|...177
=> equivalent forward existential formula: [FwdG(Init,!((((i5.u19.p61==0) * EX(!(EX(!((i12.u46.p137==1)))))) * ((!(EX(!((i7.u32.p92==1)))) + !(EG(!(((i5.u1...240
Reverse transition relation is NOT exact ! Due to transitions t41, t82, t86, i0.i1.u10.t83, i1.u7.t88, i2.t84, i2.i0.u1.t90, i2.i0.u9.t85, i2.i1.u6.t89, i3...481
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,0,23.6738,529272,1,0,963649,333,1573,1.37114e+06,244,939,778562
FORMULA ShieldIIPt-PT-002B-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 131/131 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 120 transition count 110
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 120 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 119 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 119 transition count 109
Applied a total of 44 rules in 3 ms. Remains 119 /141 variables (removed 22) and now considering 109/131 (removed 22) transitions.
// Phase 1: matrix 109 rows 119 cols
[2024-05-28 19:37:31] [INFO ] Computed 19 invariants in 3 ms
[2024-05-28 19:37:31] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-28 19:37:31] [INFO ] Invariant cache hit.
[2024-05-28 19:37:31] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-05-28 19:37:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 19:37:31] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:37:31] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:37:31] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-28 19:37:31] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-28 19:37:31] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:37:32] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-28 19:37:32] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:37:32] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:37:32] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:37:32] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:37:32] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-28 19:37:32] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:37:32] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-28 19:37:32] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-28 19:37:32] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-05-28 19:37:32] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 19:37:32] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 19:37:33] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 109/228 variables, 119/156 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/228 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 156 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3420 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/228 variables, 119/156 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 108/264 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 19:37:35] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-28 19:37:35] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 19:37:35] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:37:35] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 19:37:35] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-28 19:37:36] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 6/270 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 19:37:36] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-28 19:37:37] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 19:37:38] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-28 19:37:38] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/228 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 19:37:39] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 19:37:40] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 13 (OVERLAPS) 0/228 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 276 constraints, problems are : Problem set: 0 solved, 108 unsolved in 8530 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 30/30 constraints]
After SMT, in 11961ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11962ms
Starting structural reductions in LTL mode, iteration 1 : 119/141 places, 109/131 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12102 ms. Remains : 119/141 places, 109/131 transitions.
[2024-05-28 19:37:43] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:37:43] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:37:43] [INFO ] Input system was already deterministic with 109 transitions.
[2024-05-28 19:37:43] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:37:43] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:37:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality10641032569355531132.gal : 1 ms
[2024-05-28 19:37:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality17411674651348816621.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/CTLCardinality10641032569355531132.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17411674651348816621.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,5.33119e+11,0.713764,30860,2,1479,5,87709,6,0,587,186199,0


Converting to forward existential form...Done !
original formula: EG(EX(TRUE))
=> equivalent forward existential formula: [FwdG(Init,EX(TRUE))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t14, t18, t23, t27, t32, t33, t36, t37, t38, t39, t40, t42, t43, t47, t51, t56, t60, ...314
Detected timeout of ITS tools.
[2024-05-28 19:38:13] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:38:13] [INFO ] Applying decomposition
[2024-05-28 19:38:13] [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/graph8637429210239876923.txt' '-o' '/tmp/graph8637429210239876923.bin' '-w' '/tmp/graph8637429210239876923.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8637429210239876923.bin' '-l' '-1' '-v' '-w' '/tmp/graph8637429210239876923.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:38:13] [INFO ] Decomposing Gal with order
[2024-05-28 19:38:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:38:13] [INFO ] Removed a total of 22 redundant transitions.
[2024-05-28 19:38:13] [INFO ] Flatten gal took : 9 ms
[2024-05-28 19:38:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 19:38:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality5544521411437818302.gal : 13 ms
[2024-05-28 19:38:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality9807911914113760520.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/CTLCardinality5544521411437818302.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9807911914113760520.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,5.33119e+11,0.05583,5812,324,43,4329,432,324,7166,56,802,0


Converting to forward existential form...Done !
original formula: EG(EX(TRUE))
=> equivalent forward existential formula: [FwdG(Init,EX(TRUE))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t36, t40, t82, t84, i0.i1.u31.t37, i1.u6.t86, i2.u1.t88, i2.u8.t83, i3.i1.t80, i3.i1.u5.t87, ...470
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,1,9.63674,285916,1,0,592022,500,1387,809603,270,1730,542968
FORMULA ShieldIIPt-PT-002B-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 131/131 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 122 transition count 112
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 122 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 121 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 121 transition count 111
Applied a total of 40 rules in 8 ms. Remains 121 /141 variables (removed 20) and now considering 111/131 (removed 20) transitions.
// Phase 1: matrix 111 rows 121 cols
[2024-05-28 19:38:23] [INFO ] Computed 19 invariants in 1 ms
[2024-05-28 19:38:23] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-28 19:38:23] [INFO ] Invariant cache hit.
[2024-05-28 19:38:23] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-28 19:38:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-28 19:38:23] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-28 19:38:23] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-28 19:38:23] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:38:23] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:38:23] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-28 19:38:24] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-05-28 19:38:24] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-28 19:38:24] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-28 19:38:24] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 0 ms to minimize.
[2024-05-28 19:38:24] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 19:38:24] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-05-28 19:38:24] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-28 19:38:24] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:38:24] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-28 19:38:24] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-28 19:38:24] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 19:38:24] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-28 19:38:25] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-28 19:38:25] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 111/232 variables, 121/159 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 0/232 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 159 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4133 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/232 variables, 121/159 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 110/269 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-28 19:38:28] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2024-05-28 19:38:28] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2024-05-28 19:38:28] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-28 19:38:28] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-28 19:38:28] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-28 19:38:28] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-28 19:38:28] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 7/276 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-28 19:38:29] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-28 19:38:30] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:38:31] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-28 19:38:32] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:38:32] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/232 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 12 (OVERLAPS) 0/232 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 281 constraints, problems are : Problem set: 0 solved, 110 unsolved in 8471 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 31/31 constraints]
After SMT, in 12619ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 12620ms
Starting structural reductions in LTL mode, iteration 1 : 121/141 places, 111/131 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12793 ms. Remains : 121/141 places, 111/131 transitions.
[2024-05-28 19:38:35] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:38:35] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:38:35] [INFO ] Input system was already deterministic with 111 transitions.
[2024-05-28 19:38:35] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:38:35] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:38:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality15079320490554582988.gal : 2 ms
[2024-05-28 19:38:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality13674412000656521511.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/CTLCardinality15079320490554582988.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13674412000656521511.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,6.77693e+11,0.831632,35000,2,1542,5,99510,6,0,597,217266,0


Converting to forward existential form...Done !
original formula: EG((EF(EG((((p131==1)||(p79==0))||(p99==1)))) + AX(E((p100==1) U ((p79==1)||(p139==0))))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U EG((((p131==1)||(p79==0))||(p99==1)))) + !(EX(!(E((p100==1) U ((p79==1)||(p139==0))))))))] ...163
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t14, t18, t23, t27, t31, t33, t36, t37, t38, t39, t40, t41, t42, t44, t45, t49, t53, ...324
Detected timeout of ITS tools.
[2024-05-28 19:39:05] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:39:05] [INFO ] Applying decomposition
[2024-05-28 19:39:05] [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/graph3494024601777440400.txt' '-o' '/tmp/graph3494024601777440400.bin' '-w' '/tmp/graph3494024601777440400.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3494024601777440400.bin' '-l' '-1' '-v' '-w' '/tmp/graph3494024601777440400.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:39:05] [INFO ] Decomposing Gal with order
[2024-05-28 19:39:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:39:05] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-28 19:39:05] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:39:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 19:39:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality3560549463612925596.gal : 2 ms
[2024-05-28 19:39:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality5573522970507697997.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/CTLCardinality3560549463612925596.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5573522970507697997.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.77693e+11,0.144451,10312,329,37,14012,328,326,25658,58,678,0


Converting to forward existential form...Done !
original formula: EG((EF(EG((((i11.u42.p131==1)||(i8.u26.p79==0))||(i9.u34.p99==1)))) + AX(E((i9.u35.p100==1) U ((i8.u26.p79==1)||(i12.u44.p139==0))))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U EG((((i11.u42.p131==1)||(i8.u26.p79==0))||(i9.u34.p99==1)))) + !(EX(!(E((i9.u35.p100==1) U ...207
Reverse transition relation is NOT exact ! Due to transitions t42, t82, i0.i0.u1.t90, i1.u10.t83, i2.t86, i2.i0.u7.t88, i2.i1.t84, i2.i1.u6.t89, i2.i1.u9.t...510
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,1,17.7321,616804,1,0,990281,647,2126,2.85095e+06,327,1781,702524
FORMULA ShieldIIPt-PT-002B-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 131/131 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 120 transition count 110
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 120 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 119 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 119 transition count 109
Applied a total of 44 rules in 3 ms. Remains 119 /141 variables (removed 22) and now considering 109/131 (removed 22) transitions.
// Phase 1: matrix 109 rows 119 cols
[2024-05-28 19:39:23] [INFO ] Computed 19 invariants in 3 ms
[2024-05-28 19:39:23] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-28 19:39:23] [INFO ] Invariant cache hit.
[2024-05-28 19:39:23] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-05-28 19:39:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 19:39:24] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:39:24] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 19:39:24] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:39:24] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:39:24] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:39:24] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 19:39:24] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:39:24] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:39:24] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:39:24] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-28 19:39:24] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:39:24] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2024-05-28 19:39:25] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:39:25] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:39:25] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:39:25] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 19:39:25] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 19:39:25] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 109/228 variables, 119/156 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/228 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 156 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3490 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/228 variables, 119/156 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 108/264 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 19:39:28] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-28 19:39:28] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:39:28] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-28 19:39:28] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:39:28] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-28 19:39:28] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 6/270 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 19:39:29] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-28 19:39:29] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 19:39:31] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-28 19:39:31] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/228 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 19:39:32] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 19:39:33] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 13 (OVERLAPS) 0/228 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 276 constraints, problems are : Problem set: 0 solved, 108 unsolved in 8679 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 30/30 constraints]
After SMT, in 12189ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 12194ms
Starting structural reductions in LTL mode, iteration 1 : 119/141 places, 109/131 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12325 ms. Remains : 119/141 places, 109/131 transitions.
[2024-05-28 19:39:36] [INFO ] Flatten gal took : 8 ms
[2024-05-28 19:39:36] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:39:36] [INFO ] Input system was already deterministic with 109 transitions.
[2024-05-28 19:39:36] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:39:36] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:39:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality1890207008338561916.gal : 1 ms
[2024-05-28 19:39:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality15643646543415364867.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/CTLCardinality1890207008338561916.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15643646543415364867.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,5.33119e+11,0.621727,30864,2,1479,5,87709,6,0,587,186199,0


Converting to forward existential form...Done !
original formula: AG((EX((((p95==0)&&(p50==1))&&((p29==0)&&(p97==1)))) + AF((p116==1))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(EX((((p95==0)&&(p50==1))&&((p29==0)&&(p97==1)))))),!((p116==1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t14, t18, t23, t27, t32, t33, t36, t37, t38, t39, t40, t42, t43, t47, t51, t56, t60, ...314
Hit Full ! (commute/partial/dont) 107/0/2
(forward)formula 0,0,1.06692,32836,1,0,278,133815,245,117,3413,186199,271
FORMULA ShieldIIPt-PT-002B-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

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

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: A(((p114==0)||(p136==1)) U (EX(((p140==0)||(p127==1))) * E(!(A(((p99==0)||(p116==1)) U ((p37==0)||(p65==1)))) U EG((p69==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!((EX(((p140==0)||(p127==1))) * E(!(!((E(!(((p37==0)||(p65==1))) U (!(((p99==0)||(p116==1))) * !(...627
Reverse transition relation is NOT exact ! Due to transitions t5, t10, t12, t15, t19, t24, t28, t32, t34, t35, t37, t38, t39, t40, t41, t42, t44, t45, t49,...345
Detected timeout of ITS tools.
[2024-05-28 19:40:18] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:40:18] [INFO ] Applying decomposition
[2024-05-28 19:40:18] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12368900163540964013.txt' '-o' '/tmp/graph12368900163540964013.bin' '-w' '/tmp/graph12368900163540964013.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12368900163540964013.bin' '-l' '-1' '-v' '-w' '/tmp/graph12368900163540964013.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:40:18] [INFO ] Decomposing Gal with order
[2024-05-28 19:40:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:40:18] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-28 19:40:18] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:40:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 19:40:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality15685269777295809175.gal : 3 ms
[2024-05-28 19:40:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality11316972084739003403.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/CTLCardinality15685269777295809175.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11316972084739003403.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.79999e+11,0.155793,10604,488,29,15046,287,345,23659,49,696,0


Converting to forward existential form...Done !
original formula: A(((i10.u37.p114==0)||(i12.u44.p136==1)) U (EX(((i12.u43.p140==0)||(i11.u39.p127==1))) * E(!(A(((i9.u34.p99==0)||(i10.u38.p116==1)) U ((i...213
=> equivalent forward existential formula: [((Init * !(EG(!((EX(((i12.u43.p140==0)||(i11.u39.p127==1))) * E(!(!((E(!(((i3.u11.p37==0)||(i6.u21.p65==1))) U ...883
Reverse transition relation is NOT exact ! Due to transitions t42, t86, t88, i0.i1.u1.t92, i0.i1.u8.t87, i1.i1.t84, i1.i1.u5.t91, i1.i1.u9.t85, i2.u6.t90, ...548
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 131/131 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 123 transition count 113
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 123 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 122 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 122 transition count 112
Applied a total of 38 rules in 2 ms. Remains 122 /141 variables (removed 19) and now considering 112/131 (removed 19) transitions.
// Phase 1: matrix 112 rows 122 cols
[2024-05-28 19:40:48] [INFO ] Computed 19 invariants in 7 ms
[2024-05-28 19:40:48] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-28 19:40:48] [INFO ] Invariant cache hit.
[2024-05-28 19:40:48] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2024-05-28 19:40:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-28 19:40:49] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:40:49] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:40:49] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:40:49] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:40:49] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:40:49] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-28 19:40:49] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-28 19:40:49] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 1 ms to minimize.
[2024-05-28 19:40:49] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:40:49] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:40:49] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2024-05-28 19:40:49] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:40:49] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 13/32 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/234 variables, 122/154 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-28 19:40:50] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-28 19:40:50] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-28 19:40:50] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-28 19:40:52] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/234 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 158 constraints, problems are : Problem set: 0 solved, 111 unsolved in 4908 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/234 variables, 122/158 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 111/269 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-28 19:40:54] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-28 19:40:54] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:40:54] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-05-28 19:40:54] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-28 19:40:54] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-28 19:40:54] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:40:55] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 7/276 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-28 19:40:55] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-28 19:40:55] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-28 19:40:56] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 3/279 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-28 19:40:56] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-28 19:40:57] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-28 19:40:57] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 19:40:58] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-28 19:41:00] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/234 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 13 (OVERLAPS) 0/234 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 284 constraints, problems are : Problem set: 0 solved, 111 unsolved in 9853 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 32/32 constraints]
After SMT, in 14770ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 14772ms
Starting structural reductions in LTL mode, iteration 1 : 122/141 places, 112/131 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14905 ms. Remains : 122/141 places, 112/131 transitions.
[2024-05-28 19:41:03] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:41:03] [INFO ] Flatten gal took : 8 ms
[2024-05-28 19:41:03] [INFO ] Input system was already deterministic with 112 transitions.
[2024-05-28 19:41:03] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:41:03] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:41:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality2217673588012655938.gal : 2 ms
[2024-05-28 19:41:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality5234096404065743052.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/CTLCardinality2217673588012655938.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5234096404065743052.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,7.87711e+11,1.0836,43428,2,1632,5,123015,6,0,602,274748,0


Converting to forward existential form...Done !
original formula: A((EX(((!((EF((p116==0)) + (p46!=1))) * (p27!=0)) * AF((p78==0)))) * (EG(EF((((p36==0)||(p106==1))||(p99==0)))) + AX((p24==1)))) U AF(EG(...192
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(EG(E(((p42==0)||(p30==1)) U (p47==1)))))))))) * !(E(!(!(EG(!(EG(E(((p42==0)||(p30==1)) U...395
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t14, t18, t23, t27, t31, t33, t34, t36, t37, t38, t39, t40, t41, t43, t44, t48, t52, ...334
Detected timeout of ITS tools.
[2024-05-28 19:41:33] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:41:33] [INFO ] Applying decomposition
[2024-05-28 19:41:33] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1675589148924979702.txt' '-o' '/tmp/graph1675589148924979702.bin' '-w' '/tmp/graph1675589148924979702.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1675589148924979702.bin' '-l' '-1' '-v' '-w' '/tmp/graph1675589148924979702.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:41:33] [INFO ] Decomposing Gal with order
[2024-05-28 19:41:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:41:33] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-28 19:41:33] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:41:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 19:41:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality9796050208603627234.gal : 2 ms
[2024-05-28 19:41:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality2238275918122261878.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/CTLCardinality9796050208603627234.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2238275918122261878.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,7.87711e+11,0.088569,7948,341,32,8652,301,325,17763,52,685,0


Converting to forward existential form...Done !
original formula: A((EX(((!((EF((i10.u38.p116==0)) + (i4.u17.p46!=1))) * (i1.u10.p27!=0)) * AF((i7.u26.p78==0)))) * (EG(EF((((i3.u13.p36==0)||(i9.u34.p106=...272
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(EG(E(((i4.u15.p42==0)||(i3.u13.p30==1)) U (i4.u17.p47==1)))))))))) * !(E(!(!(EG(!(EG(E((...517
Reverse transition relation is NOT exact ! Due to transitions t37, t83, i0.u1.t91, i1.u10.t84, i2.t87, i2.i0.u7.t89, i2.i1.t85, i2.i1.u6.t90, i2.i1.u9.t86,...543
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-28 19:42:03] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:42:03] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:42:03] [INFO ] Applying decomposition
[2024-05-28 19:42:03] [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/graph12519952496873984102.txt' '-o' '/tmp/graph12519952496873984102.bin' '-w' '/tmp/graph12519952496873984102.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12519952496873984102.bin' '-l' '-1' '-v' '-w' '/tmp/graph12519952496873984102.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:42:03] [INFO ] Decomposing Gal with order
[2024-05-28 19:42:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:42:03] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-28 19:42:03] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:42:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 19:42:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality4646806711779651485.gal : 2 ms
[2024-05-28 19:42:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality6075870940244979202.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/CTLCardinality4646806711779651485.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6075870940244979202.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 3 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.9698e+12,1.5626,46148,901,32,75866,198,362,183063,47,497,0


Converting to forward existential form...Done !
original formula: A(E(E(EX(TRUE) U ((i9.i1.u0.p0==1) * ((i1.i0.u3.p9!=1) + EF((i9.i1.u0.p1==0))))) U EG(((!((i2.u12.p31==0)||(i11.u51.p139==1)))||(i10.u46....429
=> equivalent forward existential formula: [((Init * !(EG(!((EG(((i7.u37.p102==1) + !(EX(!(((i6.i0.u32.p84==0)||(i8.u43.p112==1))))))) * ((!((E(!(!(EX(!((i...1540
Reverse transition relation is NOT exact ! Due to transitions t48, t104, t106, i0.u6.t108, i1.i1.t102, i1.i1.u5.t109, i1.i1.u9.t103, i2.t100, i2.t93, i2.u1...704
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,507.571,7078120,1,0,9.26412e+06,516,1255,2.05835e+07,138,1389,5042792
FORMULA ShieldIIPt-PT-002B-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A(((i8.u42.p114==0)||(i11.u49.p136==1)) U (EX(((i11.u51.p140==0)||(i10.u46.p127==1))) * E(!(A(((i7.u38.p99==0)||(i8.u43.p116==1)) U ((i2....211
=> equivalent forward existential formula: [((Init * !(EG(!((EX(((i11.u51.p140==0)||(i10.u46.p127==1))) * E(!(!((E(!(((i2.u13.p37==0)||(i5.u24.p65==1))) U ...879
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 1,0,1018.94,7861348,1,0,1.0579e+07,516,813,2.14935e+07,113,1389,6613868
FORMULA ShieldIIPt-PT-002B-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A((EX(((!((EF((i8.u43.p116==0)) + (i3.u16.p46!=1))) * (i1.i1.u9.p27!=0)) * AF((i9.i0.u30.p78==0)))) * (EG(EF((((i2.u13.p36==0)||(i7.u38.p...274
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(EG(E(((i3.u16.p42==0)||(i2.u13.p30==1)) U (i3.u16.p47==1)))))))))) * !(E(!(!(EG(!(EG(E((...519
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 2,1,1200.79,8451124,1,0,1.10061e+07,533,1252,2.14935e+07,141,1389,10187756
FORMULA ShieldIIPt-PT-002B-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1878434 ms.

BK_STOP 1716926525778

--------------------
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="ShieldIIPt-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 ShieldIIPt-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-171683760600201"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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