fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r356-tall-171683760900361
Last Updated
July 7, 2024

About the Execution of ITS-Tools for ShieldPPPs-PT-001B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1245.180 221938.00 248764.00 647.60 TTTFFFFTTTTTTTTF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 13 11:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 13 11:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 11:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K Apr 13 11:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 18K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716950887180

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-001B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-29 02:48:08] [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-29 02:48:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 02:48:08] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2024-05-29 02:48:08] [INFO ] Transformed 71 places.
[2024-05-29 02:48:08] [INFO ] Transformed 66 transitions.
[2024-05-29 02:48:08] [INFO ] Found NUPN structural information;
[2024-05-29 02:48:08] [INFO ] Parsed PT model containing 71 places and 66 transitions and 180 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-001B-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-001B-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Applied a total of 0 rules in 15 ms. Remains 71 /71 variables (removed 0) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 71 cols
[2024-05-29 02:48:08] [INFO ] Computed 12 invariants in 10 ms
[2024-05-29 02:48:08] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-29 02:48:08] [INFO ] Invariant cache hit.
[2024-05-29 02:48:08] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-29 02:48:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 12/82 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-29 02:48:09] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 11 ms to minimize.
[2024-05-29 02:48:09] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-29 02:48:09] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-29 02:48:09] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-29 02:48:09] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 02:48:09] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 02:48:09] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-29 02:48:09] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 1 ms to minimize.
[2024-05-29 02:48:09] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-29 02:48:09] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-29 02:48:09] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-29 02:48:09] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 02:48:09] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-29 02:48:09] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-29 02:48:10] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
[2024-05-29 02:48:10] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-29 02:48:10] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-05-29 02:48:10] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 0 ms to minimize.
[2024-05-29 02:48:10] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-29 02:48:10] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 0 ms to minimize.
[2024-05-29 02:48:10] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 02:48:10] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 66/137 variables, 71/176 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-29 02:48:10] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/137 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 177 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2373 ms.
Refiners :[Domain max(s): 71/71 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 12/82 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 23/106 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 66/137 variables, 71/177 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 65/242 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-29 02:48:11] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 2 ms to minimize.
[2024-05-29 02:48:11] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 02:48:12] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 3/245 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-29 02:48:12] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 11 (OVERLAPS) 0/137 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 246 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2766 ms.
Refiners :[Domain max(s): 71/71 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 27/27 constraints]
After SMT, in 5189ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 5204ms
Finished structural reductions in LTL mode , in 1 iterations and 5546 ms. Remains : 71/71 places, 66/66 transitions.
Support contains 56 out of 71 places after structural reductions.
[2024-05-29 02:48:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-29 02:48:14] [INFO ] Flatten gal took : 23 ms
FORMULA ShieldPPPs-PT-001B-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 02:48:14] [INFO ] Flatten gal took : 8 ms
[2024-05-29 02:48:14] [INFO ] Input system was already deterministic with 66 transitions.
Support contains 53 out of 71 places (down from 56) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 57 to 53
RANDOM walk for 40000 steps (126 resets) in 764 ms. (52 steps per ms) remains 1/53 properties
BEST_FIRST walk for 40003 steps (54 resets) in 298 ms. (133 steps per ms) remains 1/1 properties
[2024-05-29 02:48:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp52 is UNSAT
After SMT solving in domain Real declared 37/137 variables, and 11 constraints, problems are : Problem set: 1 solved, 0 unsolved in 26 ms.
Refiners :[Domain max(s): 5/71 constraints, Positive P Invariants (semi-flows): 6/12 constraints, State Equation: 0/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 33ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2024-05-29 02:48:14] [INFO ] Flatten gal took : 6 ms
[2024-05-29 02:48:14] [INFO ] Flatten gal took : 5 ms
[2024-05-29 02:48:14] [INFO ] Input system was already deterministic with 66 transitions.
Computed a total of 16 stabilizing places and 16 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 60
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 64 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 64 transition count 59
Applied a total of 14 rules in 20 ms. Remains 64 /71 variables (removed 7) and now considering 59/66 (removed 7) transitions.
// Phase 1: matrix 59 rows 64 cols
[2024-05-29 02:48:14] [INFO ] Computed 12 invariants in 7 ms
[2024-05-29 02:48:14] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 02:48:14] [INFO ] Invariant cache hit.
[2024-05-29 02:48:14] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-05-29 02:48:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:48:15] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-29 02:48:15] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-29 02:48:15] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-29 02:48:15] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:48:15] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 02:48:15] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 02:48:15] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:48:15] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 59/123 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:48:15] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/123 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 85 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1423 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:48:16] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 02:48:16] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/123 variables, 64/87 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 58/145 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:48:16] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-29 02:48:16] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-29 02:48:16] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-29 02:48:16] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 4/149 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/123 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 149 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1503 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 15/15 constraints]
After SMT, in 2940ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 2942ms
Starting structural reductions in LTL mode, iteration 1 : 64/71 places, 59/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3053 ms. Remains : 64/71 places, 59/66 transitions.
[2024-05-29 02:48:17] [INFO ] Flatten gal took : 6 ms
[2024-05-29 02:48:17] [INFO ] Flatten gal took : 4 ms
[2024-05-29 02:48:17] [INFO ] Input system was already deterministic with 59 transitions.
[2024-05-29 02:48:17] [INFO ] Flatten gal took : 3 ms
[2024-05-29 02:48:17] [INFO ] Flatten gal took : 4 ms
[2024-05-29 02:48:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality17523063979306617776.gal : 2 ms
[2024-05-29 02:48:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality10809985559272193563.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/CTLCardinality17523063979306617776.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10809985559272193563.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX(EF(EG((p55==0))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U EG((p55==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t16, t21, t30, t32, t33, t35, t36, t38, t39, t40, ...253
(forward)formula 0,1,28.0502,863456,1,0,932,5.12468e+06,145,423,1887,6.26938e+06,957
FORMULA ShieldPPPs-PT-001B-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

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


Converting to forward existential form...Done !
original formula: EG(EF((p52==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (p52==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t22, t25, t26, Intersection with reachable at each step ...211
(forward)formula 0,1,0.13344,8596,1,0,91,25628,79,40,1027,32191,86
FORMULA ShieldPPPs-PT-001B-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 70 transition count 56
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 61 transition count 56
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 18 place count 61 transition count 51
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 28 place count 56 transition count 51
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 34 place count 50 transition count 45
Iterating global reduction 2 with 6 rules applied. Total rules applied 40 place count 50 transition count 45
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 40 place count 50 transition count 42
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 46 place count 47 transition count 42
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 72 place count 34 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 33 transition count 28
Applied a total of 73 rules in 13 ms. Remains 33 /71 variables (removed 38) and now considering 28/66 (removed 38) transitions.
// Phase 1: matrix 28 rows 33 cols
[2024-05-29 02:48:46] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 02:48:46] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-29 02:48:46] [INFO ] Invariant cache hit.
[2024-05-29 02:48:46] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-05-29 02:48:46] [INFO ] Redundant transitions in 0 ms returned []
Running 26 sub problems to find dead transitions.
[2024-05-29 02:48:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 28/61 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 0/61 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/61 variables, and 45 constraints, problems are : Problem set: 0 solved, 26 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 28/61 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 26/71 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 0/61 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/61 variables, and 71 constraints, problems are : Problem set: 0 solved, 26 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
After SMT, in 423ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 424ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/71 places, 28/66 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 522 ms. Remains : 33/71 places, 28/66 transitions.
[2024-05-29 02:48:47] [INFO ] Flatten gal took : 3 ms
[2024-05-29 02:48:47] [INFO ] Flatten gal took : 3 ms
[2024-05-29 02:48:47] [INFO ] Input system was already deterministic with 28 transitions.
[2024-05-29 02:48:47] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:48:47] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:48:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality1982188052845685393.gal : 1 ms
[2024-05-29 02:48:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality13687965932750986743.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/CTLCardinality1982188052845685393.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13687965932750986743.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,55108,0.084597,7544,2,942,5,13808,6,0,163,28650,0


Converting to forward existential form...Done !
original formula: AF(EG(AG(((p17==0)&&(p66==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(E(TRUE U !(((p17==0)&&(p66==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t22, t25, t26, t27, Intersection with reachable at each ...216
(forward)formula 0,0,0.224313,11504,1,0,87,32220,87,37,1058,51364,78
FORMULA ShieldPPPs-PT-001B-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 71 transition count 60
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 65 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 64 transition count 59
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 14 place count 64 transition count 54
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 24 place count 59 transition count 54
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 30 place count 53 transition count 48
Iterating global reduction 3 with 6 rules applied. Total rules applied 36 place count 53 transition count 48
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 36 place count 53 transition count 46
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 51 transition count 46
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 64 place count 39 transition count 34
Applied a total of 64 rules in 9 ms. Remains 39 /71 variables (removed 32) and now considering 34/66 (removed 32) transitions.
// Phase 1: matrix 34 rows 39 cols
[2024-05-29 02:48:47] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 02:48:47] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 02:48:47] [INFO ] Invariant cache hit.
[2024-05-29 02:48:47] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-29 02:48:47] [INFO ] Redundant transitions in 0 ms returned []
Running 33 sub problems to find dead transitions.
[2024-05-29 02:48:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-29 02:48:47] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 34/73 variables, 39/52 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 0/73 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 52 constraints, problems are : Problem set: 0 solved, 33 unsolved in 348 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 39/39 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 34/73 variables, 39/52 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 33/85 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-29 02:48:48] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/73 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/73 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 86 constraints, problems are : Problem set: 0 solved, 33 unsolved in 568 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 39/39 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 2/2 constraints]
After SMT, in 923ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 924ms
Starting structural reductions in SI_CTL mode, iteration 1 : 39/71 places, 34/66 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1006 ms. Remains : 39/71 places, 34/66 transitions.
[2024-05-29 02:48:48] [INFO ] Flatten gal took : 3 ms
[2024-05-29 02:48:48] [INFO ] Flatten gal took : 4 ms
[2024-05-29 02:48:48] [INFO ] Input system was already deterministic with 34 transitions.
[2024-05-29 02:48:48] [INFO ] Flatten gal took : 1 ms
[2024-05-29 02:48:48] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:48:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality5009757405439263857.gal : 1 ms
[2024-05-29 02:48:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality6431230572834609241.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/CTLCardinality5009757405439263857.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6431230572834609241.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,106113,0.23076,13400,2,1230,5,39179,6,0,192,64714,0


Converting to forward existential form...Done !
original formula: AG(((EF((p24==1)) * EF((p67==1))) * ((EF(((p18==0)||(p69==1))) * AF(((p4==0)||(p41==1)))) + ((p5==1) * A(((p35==0)||(p54==1)) U (p20==1))...159
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(E(TRUE U (p24==1))))] = FALSE * [(FwdU(Init,TRUE) * !(E(TRUE U (p67==1))))] = FALSE) * (...475
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t27, t28, t30, t31, t32, t33, Intersection with reachabl...226
Hit Full ! (commute/partial/dont) 30/4/4
(forward)formula 0,0,3.11881,101180,1,0,625,529138,112,269,1296,714481,722
FORMULA ShieldPPPs-PT-001B-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 66 transition count 61
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 66 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 65 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 65 transition count 60
Applied a total of 12 rules in 9 ms. Remains 65 /71 variables (removed 6) and now considering 60/66 (removed 6) transitions.
// Phase 1: matrix 60 rows 65 cols
[2024-05-29 02:48:51] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 02:48:51] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 02:48:51] [INFO ] Invariant cache hit.
[2024-05-29 02:48:51] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2024-05-29 02:48:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-29 02:48:52] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-29 02:48:52] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-29 02:48:52] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-29 02:48:52] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-29 02:48:52] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 02:48:52] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-29 02:48:52] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-29 02:48:52] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 02:48:52] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-29 02:48:52] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-29 02:48:52] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 60/125 variables, 65/88 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-29 02:48:52] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-29 02:48:53] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/125 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-29 02:48:53] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/125 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 91 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1968 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/125 variables, 65/91 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/150 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-29 02:48:54] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 02:48:54] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 02:48:54] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-29 02:48:54] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-29 02:48:54] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/125 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 155 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1952 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 19/19 constraints]
After SMT, in 3929ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3930ms
Starting structural reductions in LTL mode, iteration 1 : 65/71 places, 60/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4039 ms. Remains : 65/71 places, 60/66 transitions.
[2024-05-29 02:48:55] [INFO ] Flatten gal took : 8 ms
[2024-05-29 02:48:55] [INFO ] Flatten gal took : 3 ms
[2024-05-29 02:48:55] [INFO ] Input system was already deterministic with 60 transitions.
[2024-05-29 02:48:55] [INFO ] Flatten gal took : 3 ms
[2024-05-29 02:48:55] [INFO ] Flatten gal took : 3 ms
[2024-05-29 02:48:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality17168342868325552090.gal : 1 ms
[2024-05-29 02:48:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality11869047164432259562.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/CTLCardinality17168342868325552090.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11869047164432259562.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF(((p59==1) * AG((EX(((p61==0)&&(p49==1))) + AF(EX(TRUE))))))
=> equivalent forward existential formula: [FwdG(Init,!(((p59==1) * !(E(TRUE U !((EX(((p61==0)&&(p49==1))) + !(EG(!(EX(TRUE)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t16, t19, t22, t24, t31, t33, t34, t36, t37, t39, t40, ...258
Using saturation style SCC detection
(forward)formula 0,0,14.9678,441940,1,0,343,2.33798e+06,152,141,2075,2.54379e+06,369
FORMULA ShieldPPPs-PT-001B-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 70 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 70 transition count 65
Applied a total of 2 rules in 9 ms. Remains 70 /71 variables (removed 1) and now considering 65/66 (removed 1) transitions.
// Phase 1: matrix 65 rows 70 cols
[2024-05-29 02:49:10] [INFO ] Computed 12 invariants in 2 ms
[2024-05-29 02:49:10] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 02:49:10] [INFO ] Invariant cache hit.
[2024-05-29 02:49:10] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-29 02:49:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-29 02:49:11] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 02:49:11] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 02:49:11] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-29 02:49:11] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-29 02:49:11] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-29 02:49:11] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-29 02:49:11] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-29 02:49:11] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 0 ms to minimize.
[2024-05-29 02:49:11] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-29 02:49:11] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-05-29 02:49:11] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 02:49:11] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-29 02:49:11] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 13/25 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-29 02:49:11] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-29 02:49:11] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-29 02:49:11] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-29 02:49:11] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-29 02:49:11] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-29 02:49:11] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-29 02:49:11] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2024-05-29 02:49:11] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-29 02:49:12] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-29 02:49:12] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 02:49:12] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-29 02:49:12] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 65/135 variables, 70/107 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/135 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 107 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1877 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-29 02:49:12] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 65/135 variables, 70/108 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 64/172 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-29 02:49:13] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-29 02:49:13] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
[2024-05-29 02:49:13] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 02:49:13] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 02:49:13] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-29 02:49:13] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-29 02:49:13] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 7/179 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-29 02:49:13] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 02:49:14] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 0/135 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 181 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2351 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 35/35 constraints]
After SMT, in 4235ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 4236ms
Starting structural reductions in LTL mode, iteration 1 : 70/71 places, 65/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4341 ms. Remains : 70/71 places, 65/66 transitions.
[2024-05-29 02:49:15] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:49:15] [INFO ] Flatten gal took : 3 ms
[2024-05-29 02:49:15] [INFO ] Input system was already deterministic with 65 transitions.
[2024-05-29 02:49:15] [INFO ] Flatten gal took : 3 ms
[2024-05-29 02:49:15] [INFO ] Flatten gal took : 3 ms
[2024-05-29 02:49:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality3393834025182152061.gal : 3 ms
[2024-05-29 02:49:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality9057576769338825156.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/CTLCardinality3393834025182152061.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9057576769338825156.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.64171e+06,1.86345,63808,2,6590,5,201376,6,0,347,403734,0


Converting to forward existential form...Done !
original formula: AG((((EF((((EF((p53==0)) + A(((p22==0)||(p51==1)) U ((p60==0)||(p5==1)))) + ((p37==0)||(p20==1))) + (p40==0))) + AF(((p50==1)&&(p39==0)))...307
=> equivalent forward existential formula: (([(EY((((FwdU(Init,TRUE) * !((!((E(!(((p70==0)||(p6==1))) U (!((p56==1)) * !(((p70==0)||(p6==1))))) + EG(!(((p7...1432
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t18, t21, t24, t26, t28, t29, t32, t34, t35, ...288
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-29 02:49:45] [INFO ] Flatten gal took : 8 ms
[2024-05-29 02:49:45] [INFO ] Applying decomposition
[2024-05-29 02:49:45] [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/graph7073700648111119094.txt' '-o' '/tmp/graph7073700648111119094.bin' '-w' '/tmp/graph7073700648111119094.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7073700648111119094.bin' '-l' '-1' '-v' '-w' '/tmp/graph7073700648111119094.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:49:45] [INFO ] Decomposing Gal with order
[2024-05-29 02:49:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:49:45] [INFO ] Removed a total of 9 redundant transitions.
[2024-05-29 02:49:45] [INFO ] Flatten gal took : 30 ms
[2024-05-29 02:49:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 02:49:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality8496078473315077652.gal : 2 ms
[2024-05-29 02:49:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality3868114998751142873.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/CTLCardinality8496078473315077652.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3868114998751142873.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.64171e+06,0.16446,11408,629,40,16835,234,209,23020,45,701,0


Converting to forward existential form...Done !
original formula: AG((((EF((((EF((u21.p53==0)) + A(((i4.u9.p22==0)||(i7.u20.p51==1)) U ((i8.u22.p60==0)||(i0.u1.p5==1)))) + ((i6.u16.p37==0)||(i2.u8.p20==1...439
=> equivalent forward existential formula: (([(EY((((FwdU(Init,TRUE) * !((!((E(!(((i8.u22.p70==0)||(i1.i1.u2.p6==1))) U (!((u21.p56==1)) * !(((i8.u22.p70==...1962
Reverse transition relation is NOT exact ! Due to transitions t35, t38, t41, u21.t7, u21.t8, u21.t9, u21.t10, u23.t11, u23.t12, u23.t13, i0.u0.t45, i1.i0.u...428
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
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,2.51277,120440,1,0,266454,383,1159,323380,239,1068,417006
FORMULA ShieldPPPs-PT-001B-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

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

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX(((p14==0)||(p18==1)))
=> equivalent forward existential formula: [(EY(Init) * !(((p14==0)||(p18==1))))] = FALSE
(forward)formula 0,1,1.15528,42588,1,0,9,136158,9,2,403,235490,2
FORMULA ShieldPPPs-PT-001B-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 67 transition count 62
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 67 transition count 62
Applied a total of 8 rules in 5 ms. Remains 67 /71 variables (removed 4) and now considering 62/66 (removed 4) transitions.
// Phase 1: matrix 62 rows 67 cols
[2024-05-29 02:49:52] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 02:49:52] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-29 02:49:52] [INFO ] Invariant cache hit.
[2024-05-29 02:49:52] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2024-05-29 02:49:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-29 02:49:52] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-29 02:49:53] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 02:49:53] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-29 02:49:53] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-29 02:49:53] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-29 02:49:53] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-29 02:49:53] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-29 02:49:53] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-29 02:49:53] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-05-29 02:49:53] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 62/129 variables, 67/89 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-29 02:49:53] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-29 02:49:53] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-29 02:49:53] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/129 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (OVERLAPS) 0/129 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 92 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1480 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 13/25 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-29 02:49:54] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 62/129 variables, 67/93 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 61/154 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-29 02:49:54] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-29 02:49:54] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-29 02:49:54] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-29 02:49:54] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 02:49:54] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-29 02:49:55] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-29 02:49:55] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 7/161 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-29 02:49:55] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-29 02:49:55] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/129 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 163 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 23/23 constraints]
After SMT, in 3512ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 3513ms
Starting structural reductions in LTL mode, iteration 1 : 67/71 places, 62/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3596 ms. Remains : 67/71 places, 62/66 transitions.
[2024-05-29 02:49:56] [INFO ] Flatten gal took : 3 ms
[2024-05-29 02:49:56] [INFO ] Flatten gal took : 3 ms
[2024-05-29 02:49:56] [INFO ] Input system was already deterministic with 62 transitions.
[2024-05-29 02:49:56] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:49:56] [INFO ] Flatten gal took : 3 ms
[2024-05-29 02:49:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality15195287501660521389.gal : 0 ms
[2024-05-29 02:49:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality2493680655172828037.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/CTLCardinality15195287501660521389.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2493680655172828037.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (AG(E((!(AX((p7==1))) * ((EX((p62==1)) + EG((p49==1))) + ((p49!=1)||(((p15==0)||(p3==1))&&((p45==0)||(p69==1)))))) U (AG(((p56==0)||(p68=...303
=> equivalent forward existential formula: [(FwdU((Init * !(EG((!(EX(!(((p48==0)||(p26==1))))) + (EG(!(EX(!((p55==1))))) * EG(((p11==0)||(p7==1)))))))),TRU...402
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t16, t22, t24, t29, t31, t32, t34, t35, t37, t38, ...268
Detected timeout of ITS tools.
[2024-05-29 02:50:26] [INFO ] Flatten gal took : 6 ms
[2024-05-29 02:50:26] [INFO ] Applying decomposition
[2024-05-29 02:50:26] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9366577619029919866.txt' '-o' '/tmp/graph9366577619029919866.bin' '-w' '/tmp/graph9366577619029919866.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9366577619029919866.bin' '-l' '-1' '-v' '-w' '/tmp/graph9366577619029919866.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:50:26] [INFO ] Decomposing Gal with order
[2024-05-29 02:50:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:50:26] [INFO ] Removed a total of 9 redundant transitions.
[2024-05-29 02:50:26] [INFO ] Flatten gal took : 6 ms
[2024-05-29 02:50:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 02:50:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality13452832798832675658.gal : 1 ms
[2024-05-29 02:50:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality14187030121064527999.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/CTLCardinality13452832798832675658.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14187030121064527999.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.07635e+06,0.109226,8520,482,40,10310,211,222,15031,46,723,0


Converting to forward existential form...Done !
original formula: (AG(E((!(AX((i1.i0.u2.p7==1))) * ((EX((i8.u23.p62==1)) + EG((i1.i0.u18.p49==1))) + ((i1.i0.u18.p49!=1)||(((i2.u6.p15==0)||(i0.u0.p3==1))&...443
=> equivalent forward existential formula: [(FwdU((Init * !(EG((!(EX(!(((i1.i0.u18.p48==0)||(i4.u10.p26==1))))) + (EG(!(EX(!((u20.p55==1))))) * EG(((i1.i1....542
Reverse transition relation is NOT exact ! Due to transitions t32, t35, t38, u20.t6, u20.t7, u20.t8, u20.t9, i0.u0.t42, i1.i1.u5.t41, i2.u6.t40, i4.u9.t37,...387
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,12.0731,445812,1,0,967109,440,1204,1.15934e+06,239,1214,1115855
FORMULA ShieldPPPs-PT-001B-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 60
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 64 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 64 transition count 59
Applied a total of 14 rules in 8 ms. Remains 64 /71 variables (removed 7) and now considering 59/66 (removed 7) transitions.
// Phase 1: matrix 59 rows 64 cols
[2024-05-29 02:50:38] [INFO ] Computed 12 invariants in 5 ms
[2024-05-29 02:50:38] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-29 02:50:38] [INFO ] Invariant cache hit.
[2024-05-29 02:50:38] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-05-29 02:50:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:50:38] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-29 02:50:38] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 02:50:38] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-29 02:50:38] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:50:39] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 02:50:39] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:50:39] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 59/123 variables, 64/83 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:50:39] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:50:39] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/123 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (OVERLAPS) 0/123 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 85 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1718 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:50:40] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/123 variables, 64/86 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 58/144 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:50:40] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 02:50:40] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:50:41] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 02:50:41] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:50:41] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/123 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:50:42] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/123 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 13 (OVERLAPS) 0/123 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 150 constraints, problems are : Problem set: 0 solved, 58 unsolved in 2856 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 16/16 constraints]
After SMT, in 4583ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 4584ms
Starting structural reductions in LTL mode, iteration 1 : 64/71 places, 59/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4685 ms. Remains : 64/71 places, 59/66 transitions.
[2024-05-29 02:50:43] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:50:43] [INFO ] Flatten gal took : 3 ms
[2024-05-29 02:50:43] [INFO ] Input system was already deterministic with 59 transitions.
[2024-05-29 02:50:43] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:50:43] [INFO ] Flatten gal took : 1 ms
[2024-05-29 02:50:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality2927081369119818707.gal : 0 ms
[2024-05-29 02:50:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality5687879374983772189.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/CTLCardinality2927081369119818707.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5687879374983772189.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (EG((p35==0)) * (!(A(AX((p4==0)) U AG(((p41==0)||(p32==1))))) + AG((p10!=0))))
=> equivalent forward existential formula: ([(Init * !(EG((p35==0))))] = FALSE * [(FwdU((Init * !(!(!((E(!(!(E(TRUE U !(((p41==0)||(p32==1)))))) U (!(!(EX(...294
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t16, t21, t30, t32, t33, t35, t36, t38, t39, t40, ...253
Using saturation style SCC detection
(forward)formula 0,1,19.7874,557072,1,0,692,3.35594e+06,157,326,1963,2.88315e+06,750
FORMULA ShieldPPPs-PT-001B-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 71 transition count 59
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 64 transition count 59
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 14 place count 64 transition count 56
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 61 transition count 56
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 56 transition count 51
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 56 transition count 51
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 30 place count 56 transition count 50
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 55 transition count 50
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 39 transition count 34
Applied a total of 64 rules in 21 ms. Remains 39 /71 variables (removed 32) and now considering 34/66 (removed 32) transitions.
// Phase 1: matrix 34 rows 39 cols
[2024-05-29 02:51:03] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 02:51:03] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-29 02:51:03] [INFO ] Invariant cache hit.
[2024-05-29 02:51:03] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-29 02:51:03] [INFO ] Redundant transitions in 0 ms returned []
Running 33 sub problems to find dead transitions.
[2024-05-29 02:51:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-29 02:51:03] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-29 02:51:03] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-29 02:51:03] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 34/73 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 0/73 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 54 constraints, problems are : Problem set: 0 solved, 33 unsolved in 420 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 39/39 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 34/73 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 33/87 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-29 02:51:03] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 0/73 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 88 constraints, problems are : Problem set: 0 solved, 33 unsolved in 440 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 39/39 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 4/4 constraints]
After SMT, in 884ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 896ms
Starting structural reductions in SI_CTL mode, iteration 1 : 39/71 places, 34/66 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1046 ms. Remains : 39/71 places, 34/66 transitions.
[2024-05-29 02:51:04] [INFO ] Flatten gal took : 3 ms
[2024-05-29 02:51:04] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:51:04] [INFO ] Input system was already deterministic with 34 transitions.
[2024-05-29 02:51:04] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:51:04] [INFO ] Flatten gal took : 1 ms
[2024-05-29 02:51:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality11898241772689878240.gal : 1 ms
[2024-05-29 02:51:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality7291939658629910203.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/CTLCardinality11898241772689878240.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7291939658629910203.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,95883,0.12657,8940,2,1618,5,20710,6,0,192,36473,0


Converting to forward existential form...Done !
original formula: ((EG((p14==1)) + EF((EG(((p68==1)||(p13==0))) * E(((p45==0)||(p43==1)) U ((p0==0)||(p70==1)))))) + AG((p54==1)))
=> equivalent forward existential formula: [(FwdU((Init * !((EG((p14==1)) + E(TRUE U (EG(((p68==1)||(p13==0))) * E(((p45==0)||(p43==1)) U ((p0==0)||(p70==1...193
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t7, t10, t12, t23, t25, t26, t28, t29, t30, t32, t33, Intersection w...238
(forward)formula 0,1,4.95392,170072,1,0,989,988763,107,440,1235,1.32046e+06,1101
FORMULA ShieldPPPs-PT-001B-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 60
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 64 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 64 transition count 59
Applied a total of 14 rules in 2 ms. Remains 64 /71 variables (removed 7) and now considering 59/66 (removed 7) transitions.
// Phase 1: matrix 59 rows 64 cols
[2024-05-29 02:51:09] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 02:51:09] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-29 02:51:09] [INFO ] Invariant cache hit.
[2024-05-29 02:51:09] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-05-29 02:51:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:51:09] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-29 02:51:09] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-29 02:51:09] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-29 02:51:09] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 02:51:09] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-29 02:51:09] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:51:09] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:51:10] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 59/123 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:51:10] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/123 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 85 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1506 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:51:11] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:51:11] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 59/123 variables, 64/87 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 58/145 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 02:51:11] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-29 02:51:11] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-29 02:51:11] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-29 02:51:11] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-29 02:51:11] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 5/150 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 0/123 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 150 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1618 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 16/16 constraints]
After SMT, in 3147ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 3148ms
Starting structural reductions in LTL mode, iteration 1 : 64/71 places, 59/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3238 ms. Remains : 64/71 places, 59/66 transitions.
[2024-05-29 02:51:12] [INFO ] Flatten gal took : 4 ms
[2024-05-29 02:51:12] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:51:12] [INFO ] Input system was already deterministic with 59 transitions.
[2024-05-29 02:51:12] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:51:12] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:51:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality15109638839747170945.gal : 1 ms
[2024-05-29 02:51:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality10220142502614671938.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/CTLCardinality15109638839747170945.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10220142502614671938.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (E(EF(!(EX((p27!=0)))) U (p25!=0)) + EX(EG(AG(!(E((p35==1) U (p51==0)))))))
=> equivalent forward existential formula: ([(FwdU(Init,E(TRUE U !(EX((p27!=0))))) * (p25!=0))] != FALSE + [FwdG(EY(Init),!(E(TRUE U !(!(E((p35==1) U (p51=...175
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t15, t21, t23, t30, t32, t33, t35, t36, t38, t39, t40, ...253
(forward)formula 0,1,4.21326,119788,1,0,174,515423,141,79,1933,630575,168
FORMULA ShieldPPPs-PT-001B-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

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


Converting to forward existential form...Done !
original formula: EG(((EF((p49==1)) + AF(AG((p11!=1)))) + (EF((p29==1)) * ((p63==0) + EF((p51==0))))))
=> equivalent forward existential formula: [FwdG(Init,((E(TRUE U (p49==1)) + !(EG(!(!(E(TRUE U !((p11!=1)))))))) + (E(TRUE U (p29==1)) * ((p63==0) + E(TRUE...181
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t10, t12, t13, t14, t20, t31, t32, t33, Intersection wit...236
Using saturation style SCC detection
(forward)formula 0,1,0.673796,29616,1,0,279,133031,104,155,1297,166088,335
FORMULA ShieldPPPs-PT-001B-CTLCardinality-2023-14 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 : 71/71 places, 66/66 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 64 transition count 59
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 63 transition count 58
Applied a total of 16 rules in 1 ms. Remains 63 /71 variables (removed 8) and now considering 58/66 (removed 8) transitions.
// Phase 1: matrix 58 rows 63 cols
[2024-05-29 02:51:18] [INFO ] Computed 12 invariants in 0 ms
[2024-05-29 02:51:18] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-29 02:51:18] [INFO ] Invariant cache hit.
[2024-05-29 02:51:18] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2024-05-29 02:51:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:51:18] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-29 02:51:18] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-29 02:51:18] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-29 02:51:18] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:51:18] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-29 02:51:18] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:51:19] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 02:51:19] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:51:19] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 58/121 variables, 63/84 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:51:19] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/121 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 85 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1420 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:51:19] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 58/121 variables, 63/86 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 57/143 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:51:20] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 7 ms to minimize.
[2024-05-29 02:51:20] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 02:51:20] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-29 02:51:20] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-29 02:51:20] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 5/148 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 02:51:20] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/121 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 149 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1992 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 17/17 constraints]
After SMT, in 3433ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 3434ms
Starting structural reductions in LTL mode, iteration 1 : 63/71 places, 58/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3527 ms. Remains : 63/71 places, 58/66 transitions.
[2024-05-29 02:51:21] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:51:21] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:51:21] [INFO ] Input system was already deterministic with 58 transitions.
[2024-05-29 02:51:21] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:51:21] [INFO ] Flatten gal took : 2 ms
[2024-05-29 02:51:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality16496384734083349117.gal : 1 ms
[2024-05-29 02:51:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality11239359080577253607.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/CTLCardinality16496384734083349117.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11239359080577253607.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF(E(!(AX(((p29==0)||(p40==1)))) U AX(FALSE)))
=> equivalent forward existential formula: [FwdG(Init,!(E(!(!(EX(!(((p29==0)||(p40==1)))))) U !(EX(!(FALSE))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t15, t20, t29, t31, t32, t34, t35, t37, t38, t39, Inte...248
(forward)formula 0,0,26.9986,730084,1,0,542,3.16805e+06,142,352,1805,5.5775e+06,476
FORMULA ShieldPPPs-PT-001B-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 02:51:49] [INFO ] Flatten gal took : 7 ms
[2024-05-29 02:51:49] [INFO ] Flatten gal took : 2 ms
Total runtime 220726 ms.

BK_STOP 1716951109118

--------------------
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="ShieldPPPs-PT-001B"
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 ShieldPPPs-PT-001B, 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-171683760900361"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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