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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
379.716 17224.00 32770.00 57.80 TFFTFTFTTTTTTFTT 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-171683762100889.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ShieldRVt-PT-001B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683762100889
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 23 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 21:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 11 21:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 21:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 11 21:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 13K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717075200207

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-001B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-30 13:20:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 13:20:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 13:20:01] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2024-05-30 13:20:01] [INFO ] Transformed 53 places.
[2024-05-30 13:20:01] [INFO ] Transformed 53 transitions.
[2024-05-30 13:20:01] [INFO ] Found NUPN structural information;
[2024-05-30 13:20:01] [INFO ] Parsed PT model containing 53 places and 53 transitions and 124 arcs in 140 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVt-PT-001B-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 52 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 52 transition count 52
Applied a total of 2 rules in 25 ms. Remains 52 /53 variables (removed 1) and now considering 52/53 (removed 1) transitions.
// Phase 1: matrix 52 rows 52 cols
[2024-05-30 13:20:01] [INFO ] Computed 5 invariants in 9 ms
[2024-05-30 13:20:01] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-30 13:20:01] [INFO ] Invariant cache hit.
[2024-05-30 13:20:01] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 51 sub problems to find dead transitions.
[2024-05-30 13:20:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-30 13:20:02] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 7 ms to minimize.
[2024-05-30 13:20:02] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
[2024-05-30 13:20:02] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:20:02] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 1 ms to minimize.
[2024-05-30 13:20:02] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:20:02] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-30 13:20:02] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
[2024-05-30 13:20:02] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-30 13:20:02] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:20:02] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 52/104 variables, 52/67 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-30 13:20:02] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-30 13:20:03] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 5 ms to minimize.
[2024-05-30 13:20:03] [INFO ] Deduced a trap composed of 31 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:20:03] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:20:03] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-30 13:20:03] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 73 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1668 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-30 13:20:03] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
[2024-05-30 13:20:03] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:20:03] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-30 13:20:04] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:20:04] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:20:04] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 0 ms to minimize.
[2024-05-30 13:20:04] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-05-30 13:20:04] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-05-30 13:20:04] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-05-30 13:20:04] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 0 ms to minimize.
[2024-05-30 13:20:04] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 52/104 variables, 52/84 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 51/135 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-30 13:20:04] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:20:04] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 10 (OVERLAPS) 0/104 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 137 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1359 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 29/29 constraints]
After SMT, in 3071ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 3083ms
Starting structural reductions in LTL mode, iteration 1 : 52/53 places, 52/53 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3452 ms. Remains : 52/53 places, 52/53 transitions.
Support contains 37 out of 52 places after structural reductions.
[2024-05-30 13:20:05] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-30 13:20:05] [INFO ] Flatten gal took : 21 ms
[2024-05-30 13:20:05] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA ShieldRVt-PT-001B-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001B-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001B-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001B-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 13:20:05] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:20:05] [INFO ] Input system was already deterministic with 52 transitions.
Support contains 31 out of 52 places (down from 37) after GAL structural reductions.
RANDOM walk for 39512 steps (53 resets) in 744 ms. (53 steps per ms) remains 0/28 properties
[2024-05-30 13:20:05] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:20:05] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:20:05] [INFO ] Input system was already deterministic with 52 transitions.
Computed a total of 16 stabilizing places and 16 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 52/52 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 46 transition count 46
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 46 transition count 46
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 45 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 45 transition count 45
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 44 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 44 transition count 44
Applied a total of 16 rules in 4 ms. Remains 44 /52 variables (removed 8) and now considering 44/52 (removed 8) transitions.
// Phase 1: matrix 44 rows 44 cols
[2024-05-30 13:20:05] [INFO ] Computed 5 invariants in 2 ms
[2024-05-30 13:20:05] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-30 13:20:05] [INFO ] Invariant cache hit.
[2024-05-30 13:20:05] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Running 43 sub problems to find dead transitions.
[2024-05-30 13:20:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-30 13:20:05] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:20:05] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/88 variables, 44/51 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (OVERLAPS) 0/88 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 51 constraints, problems are : Problem set: 0 solved, 43 unsolved in 586 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/88 variables, 44/51 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 43/94 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-30 13:20:06] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:20:06] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-30 13:20:06] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/88 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 0/88 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 97 constraints, problems are : Problem set: 0 solved, 43 unsolved in 880 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 5/5 constraints]
After SMT, in 1481ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1482ms
Starting structural reductions in LTL mode, iteration 1 : 44/52 places, 44/52 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1551 ms. Remains : 44/52 places, 44/52 transitions.
[2024-05-30 13:20:07] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:20:07] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:20:07] [INFO ] Input system was already deterministic with 44 transitions.
[2024-05-30 13:20:07] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:20:07] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:20:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality15772026738486108668.gal : 2 ms
[2024-05-30 13:20:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality2175623877270278739.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/CTLCardinality15772026738486108668.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2175623877270278739.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,11593,0.029376,4344,2,324,5,3434,6,0,222,4534,0


Converting to forward existential form...Done !
original formula: EX((EX(((p21==0)||(p52==1))) * (EF(AG((p23!=1))) + EG(AG(((p28==0)||(p44==1)))))))
=> equivalent forward existential formula: ([(FwdU((EY(Init) * EX(((p21==0)||(p52==1)))),TRUE) * !(E(TRUE U !((p23!=1)))))] != FALSE + [FwdG((EY(Init) * EX...227
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t10, t14, t18, t21, t24, t28, t30, t33, t34, t37, Intersection with reachable at eac...218
(forward)formula 0,0,0.111415,8292,1,0,137,26062,119,64,1265,24826,156
FORMULA ShieldRVt-PT-001B-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 52/52 places, 52/52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 51 transition count 39
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 15 rules applied. Total rules applied 27 place count 39 transition count 36
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 32 place count 37 transition count 33
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 35 place count 34 transition count 33
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 35 place count 34 transition count 30
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 41 place count 31 transition count 30
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 46 place count 26 transition count 25
Iterating global reduction 4 with 5 rules applied. Total rules applied 51 place count 26 transition count 25
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 51 place count 26 transition count 24
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 53 place count 25 transition count 24
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 65 place count 19 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 18 transition count 17
Applied a total of 66 rules in 18 ms. Remains 18 /52 variables (removed 34) and now considering 17/52 (removed 35) transitions.
// Phase 1: matrix 17 rows 18 cols
[2024-05-30 13:20:07] [INFO ] Computed 5 invariants in 1 ms
[2024-05-30 13:20:07] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-30 13:20:07] [INFO ] Invariant cache hit.
[2024-05-30 13:20:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 13:20:07] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-30 13:20:07] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-30 13:20:07] [INFO ] Invariant cache hit.
[2024-05-30 13:20:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 1/18 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 17/35 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/35 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 24 constraints, problems are : Problem set: 0 solved, 16 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 1/18 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 17/35 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/35 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 40 constraints, problems are : Problem set: 0 solved, 16 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 270ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 270ms
Starting structural reductions in SI_CTL mode, iteration 1 : 18/52 places, 17/52 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 351 ms. Remains : 18/52 places, 17/52 transitions.
[2024-05-30 13:20:07] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:20:07] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:20:07] [INFO ] Input system was already deterministic with 17 transitions.
[2024-05-30 13:20:07] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:20:07] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:20:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality1926880861405189170.gal : 1 ms
[2024-05-30 13:20:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality10174630224228862761.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/CTLCardinality1926880861405189170.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10174630224228862761.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,313,0.004312,3412,2,60,5,585,6,0,91,605,0


Converting to forward existential form...Done !
original formula: EG(E(EF((p48!=1)) U EF((AG(((p9==0)||(p19==1))) * EG((p7==0))))))
=> equivalent forward existential formula: [FwdG(Init,E(E(TRUE U (p48!=1)) U E(TRUE U (!(E(TRUE U !(((p9==0)||(p19==1))))) * EG((p7==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t14, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tota...168
(forward)formula 0,1,0.023423,4520,1,0,109,5934,66,71,560,6196,187
FORMULA ShieldRVt-PT-001B-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 52/52 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 44 transition count 44
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 44 transition count 44
Applied a total of 16 rules in 2 ms. Remains 44 /52 variables (removed 8) and now considering 44/52 (removed 8) transitions.
// Phase 1: matrix 44 rows 44 cols
[2024-05-30 13:20:07] [INFO ] Computed 5 invariants in 1 ms
[2024-05-30 13:20:07] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-30 13:20:07] [INFO ] Invariant cache hit.
[2024-05-30 13:20:07] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Running 43 sub problems to find dead transitions.
[2024-05-30 13:20:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-30 13:20:07] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 2 ms to minimize.
[2024-05-30 13:20:07] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/88 variables, 44/51 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (OVERLAPS) 0/88 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 51 constraints, problems are : Problem set: 0 solved, 43 unsolved in 538 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/88 variables, 44/51 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 43/94 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-30 13:20:08] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:20:08] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
[2024-05-30 13:20:08] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/88 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 97 constraints, problems are : Problem set: 0 solved, 43 unsolved in 643 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 5/5 constraints]
After SMT, in 1189ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1190ms
Starting structural reductions in LTL mode, iteration 1 : 44/52 places, 44/52 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1251 ms. Remains : 44/52 places, 44/52 transitions.
[2024-05-30 13:20:08] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:20:08] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:20:08] [INFO ] Input system was already deterministic with 44 transitions.
[2024-05-30 13:20:09] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:20:09] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:20:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality9595630314371790185.gal : 1 ms
[2024-05-30 13:20:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality8615508901901304743.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/CTLCardinality9595630314371790185.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8615508901901304743.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,12175,0.026482,4416,2,349,5,4651,6,0,222,5783,0


Converting to forward existential form...Done !
original formula: EF(AG((AG((p4==1)) * !(E(AX((p18==1)) U ((p33==1)&&((p29==0)||(p24==1))))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(E(TRUE U !((p4==1)))) * !(E(!(EX(!((p18==1)))) U ((p33==1)&&((p29==0)||(p24=...177
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t17, t26, t30, t35, t37, Intersection with reachable at each step enabled....202
(forward)formula 0,0,0.085853,6792,1,0,99,18400,116,53,1239,16153,111
FORMULA ShieldRVt-PT-001B-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 52/52 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 44 transition count 44
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 44 transition count 44
Applied a total of 16 rules in 2 ms. Remains 44 /52 variables (removed 8) and now considering 44/52 (removed 8) transitions.
// Phase 1: matrix 44 rows 44 cols
[2024-05-30 13:20:09] [INFO ] Computed 5 invariants in 1 ms
[2024-05-30 13:20:09] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-30 13:20:09] [INFO ] Invariant cache hit.
[2024-05-30 13:20:09] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 43 sub problems to find dead transitions.
[2024-05-30 13:20:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-30 13:20:09] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/88 variables, 44/50 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (OVERLAPS) 0/88 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 50 constraints, problems are : Problem set: 0 solved, 43 unsolved in 488 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/88 variables, 44/50 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 43/93 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-30 13:20:09] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:20:09] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:20:10] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-30 13:20:10] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-30 13:20:10] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-30 13:20:10] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 0/88 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 99 constraints, problems are : Problem set: 0 solved, 43 unsolved in 943 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 7/7 constraints]
After SMT, in 1446ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1446ms
Starting structural reductions in LTL mode, iteration 1 : 44/52 places, 44/52 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1522 ms. Remains : 44/52 places, 44/52 transitions.
[2024-05-30 13:20:10] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:20:10] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:20:10] [INFO ] Input system was already deterministic with 44 transitions.
[2024-05-30 13:20:10] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:20:10] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:20:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality3019039105667955900.gal : 1 ms
[2024-05-30 13:20:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality1735903674150377395.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/CTLCardinality3019039105667955900.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1735903674150377395.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,10956,0.016355,4152,2,295,5,3159,6,0,222,4078,0


Converting to forward existential form...Done !
original formula: E((((p16==1) + AX((p7==1))) + (EG(((((p41==0)||(p40==1))&&(p25==1))&&((p19==1)||(p25==0)))) + (p41!=1))) U !(E(EF(AX((p42==0))) U EX(AG((...179
=> equivalent forward existential formula: [(FwdU(Init,(((p16==1) + !(EX(!((p7==1))))) + (EG(((((p41==0)||(p40==1))&&(p25==1))&&((p19==1)||(p25==0)))) + (p...255
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t13, t18, t22, t26, t29, t34, t36, t37, t38, Intersection with reachable at each ste...213
(forward)formula 0,0,0.094075,8112,1,0,211,25074,127,115,1270,26072,249
FORMULA ShieldRVt-PT-001B-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 52/52 places, 52/52 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 51 transition count 42
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 21 place count 42 transition count 39
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 24 place count 40 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 25 place count 39 transition count 38
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 25 place count 39 transition count 33
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 35 place count 34 transition count 33
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 39 place count 30 transition count 29
Iterating global reduction 4 with 4 rules applied. Total rules applied 43 place count 30 transition count 29
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 57 place count 23 transition count 22
Applied a total of 57 rules in 6 ms. Remains 23 /52 variables (removed 29) and now considering 22/52 (removed 30) transitions.
// Phase 1: matrix 22 rows 23 cols
[2024-05-30 13:20:10] [INFO ] Computed 5 invariants in 1 ms
[2024-05-30 13:20:10] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-30 13:20:10] [INFO ] Invariant cache hit.
[2024-05-30 13:20:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-30 13:20:10] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-30 13:20:10] [INFO ] Redundant transitions in 0 ms returned []
Running 21 sub problems to find dead transitions.
[2024-05-30 13:20:10] [INFO ] Invariant cache hit.
[2024-05-30 13:20:10] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-30 13:20:10] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:20:10] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-30 13:20:10] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:20:11] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/45 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/45 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/45 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 45/45 variables, and 34 constraints, problems are : Problem set: 0 solved, 21 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 23/23 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/23 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 22/45 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/45 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/45 variables, 21/55 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/45 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 0/45 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 45/45 variables, and 55 constraints, problems are : Problem set: 0 solved, 21 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 23/23 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 4/4 constraints]
After SMT, in 491ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 494ms
Starting structural reductions in SI_CTL mode, iteration 1 : 23/52 places, 22/52 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 574 ms. Remains : 23/52 places, 22/52 transitions.
[2024-05-30 13:20:11] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:20:11] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:20:11] [INFO ] Input system was already deterministic with 22 transitions.
[2024-05-30 13:20:11] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:20:11] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:20:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality17711024991787065102.gal : 1 ms
[2024-05-30 13:20:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality7666885143110460971.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/CTLCardinality17711024991787065102.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7666885143110460971.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,494,0.006116,3436,2,130,5,778,6,0,114,828,0


Converting to forward existential form...Done !
original formula: AG((((p40==0)||(p51==1)) + EG((((p44==0)||(p42==1))||(((p19==0)||(p37==1))&&(p43==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(((p40==0)||(p51==1)))) * !(EG((((p44==0)||(p42==1))||(((p19==0)||(p37==1))&&(p43==1))))))...164
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t7, t11, t13, Intersection with reachable at each step enabled. (destroyed/r...189
(forward)formula 0,1,0.050685,6128,1,0,201,14548,68,102,654,17959,213
FORMULA ShieldRVt-PT-001B-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 52/52 places, 52/52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 51 transition count 36
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 18 rules applied. Total rules applied 33 place count 36 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 35 place count 34 transition count 33
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 35 place count 34 transition count 29
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 43 place count 30 transition count 29
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 50 place count 23 transition count 22
Iterating global reduction 3 with 7 rules applied. Total rules applied 57 place count 23 transition count 22
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 57 place count 23 transition count 19
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 63 place count 20 transition count 19
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 75 place count 14 transition count 13
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 14 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 13 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 12 transition count 12
Applied a total of 78 rules in 6 ms. Remains 12 /52 variables (removed 40) and now considering 12/52 (removed 40) transitions.
// Phase 1: matrix 12 rows 12 cols
[2024-05-30 13:20:11] [INFO ] Computed 4 invariants in 0 ms
[2024-05-30 13:20:11] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-30 13:20:11] [INFO ] Invariant cache hit.
[2024-05-30 13:20:11] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-30 13:20:11] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2024-05-30 13:20:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 12/24 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 11 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 12/24 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 0/24 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 27 constraints, problems are : Problem set: 0 solved, 11 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 126ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 126ms
Starting structural reductions in SI_CTL mode, iteration 1 : 12/52 places, 12/52 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 193 ms. Remains : 12/52 places, 12/52 transitions.
[2024-05-30 13:20:11] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:20:11] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:20:11] [INFO ] Input system was already deterministic with 12 transitions.
[2024-05-30 13:20:11] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:20:11] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:20:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality15747610750344390911.gal : 0 ms
[2024-05-30 13:20:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality14594318143833339679.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/CTLCardinality15747610750344390911.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14594318143833339679.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,72,0.002962,3372,2,31,5,297,6,0,63,262,0


Converting to forward existential form...Done !
original formula: AG(EF((p21==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p21==0))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.004431,3688,1,0,7,403,14,1,282,262,5
FORMULA ShieldRVt-PT-001B-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 52/52 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 42 transition count 42
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 41 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 41 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 40 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 40 transition count 40
Applied a total of 24 rules in 3 ms. Remains 40 /52 variables (removed 12) and now considering 40/52 (removed 12) transitions.
// Phase 1: matrix 40 rows 40 cols
[2024-05-30 13:20:11] [INFO ] Computed 5 invariants in 1 ms
[2024-05-30 13:20:11] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-30 13:20:11] [INFO ] Invariant cache hit.
[2024-05-30 13:20:11] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Running 39 sub problems to find dead transitions.
[2024-05-30 13:20:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-30 13:20:11] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 40/80 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 0/80 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 46 constraints, problems are : Problem set: 0 solved, 39 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 40/80 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 39/85 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-30 13:20:12] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-30 13:20:12] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/80 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 87 constraints, problems are : Problem set: 0 solved, 39 unsolved in 636 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 3/3 constraints]
After SMT, in 1065ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1067ms
Starting structural reductions in LTL mode, iteration 1 : 40/52 places, 40/52 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1139 ms. Remains : 40/52 places, 40/52 transitions.
[2024-05-30 13:20:12] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:20:12] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:20:12] [INFO ] Input system was already deterministic with 40 transitions.
[2024-05-30 13:20:12] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:20:12] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:20:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality10458599570072875696.gal : 2 ms
[2024-05-30 13:20:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality12503975380842937001.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/CTLCardinality10458599570072875696.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12503975380842937001.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,8472,0.020333,4128,2,239,5,2438,6,0,202,3140,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.020902,4128,1,0,6,2438,7,1,244,3140,1
FORMULA ShieldRVt-PT-001B-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 52/52 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 42 transition count 42
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 41 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 41 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 40 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 40 transition count 40
Applied a total of 24 rules in 8 ms. Remains 40 /52 variables (removed 12) and now considering 40/52 (removed 12) transitions.
[2024-05-30 13:20:12] [INFO ] Invariant cache hit.
[2024-05-30 13:20:12] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-30 13:20:12] [INFO ] Invariant cache hit.
[2024-05-30 13:20:12] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Running 39 sub problems to find dead transitions.
[2024-05-30 13:20:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-30 13:20:13] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 40/80 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 0/80 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 46 constraints, problems are : Problem set: 0 solved, 39 unsolved in 411 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 40/80 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 39/85 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-30 13:20:13] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-30 13:20:13] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/80 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 87 constraints, problems are : Problem set: 0 solved, 39 unsolved in 618 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 3/3 constraints]
After SMT, in 1034ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1035ms
Starting structural reductions in LTL mode, iteration 1 : 40/52 places, 40/52 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1111 ms. Remains : 40/52 places, 40/52 transitions.
[2024-05-30 13:20:13] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:20:13] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:20:13] [INFO ] Input system was already deterministic with 40 transitions.
[2024-05-30 13:20:13] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:20:13] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:20:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality11445506704861812833.gal : 2 ms
[2024-05-30 13:20:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality3614510620976679685.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/CTLCardinality11445506704861812833.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3614510620976679685.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,8472,0.021786,4128,2,239,5,2438,6,0,202,3140,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.02221,4128,1,0,6,2438,7,1,244,3140,1
FORMULA ShieldRVt-PT-001B-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 52/52 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 46 transition count 46
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 46 transition count 46
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 45 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 45 transition count 45
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 44 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 44 transition count 44
Applied a total of 16 rules in 5 ms. Remains 44 /52 variables (removed 8) and now considering 44/52 (removed 8) transitions.
// Phase 1: matrix 44 rows 44 cols
[2024-05-30 13:20:13] [INFO ] Computed 5 invariants in 1 ms
[2024-05-30 13:20:14] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-30 13:20:14] [INFO ] Invariant cache hit.
[2024-05-30 13:20:14] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Running 43 sub problems to find dead transitions.
[2024-05-30 13:20:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-30 13:20:14] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-30 13:20:14] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:20:14] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (OVERLAPS) 44/88 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-30 13:20:14] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/88 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 53 constraints, problems are : Problem set: 0 solved, 43 unsolved in 711 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/88 variables, 44/53 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 43/96 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-30 13:20:15] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-30 13:20:15] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (OVERLAPS) 0/88 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 98 constraints, problems are : Problem set: 0 solved, 43 unsolved in 736 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 6/6 constraints]
After SMT, in 1451ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1452ms
Starting structural reductions in LTL mode, iteration 1 : 44/52 places, 44/52 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1523 ms. Remains : 44/52 places, 44/52 transitions.
[2024-05-30 13:20:15] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:20:15] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:20:15] [INFO ] Input system was already deterministic with 44 transitions.
[2024-05-30 13:20:15] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:20:15] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:20:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality1902345886416577257.gal : 1 ms
[2024-05-30 13:20:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality11517412801506060437.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/CTLCardinality1902345886416577257.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11517412801506060437.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,11642,0.018387,4152,2,314,5,2945,6,0,222,4508,0


Converting to forward existential form...Done !
original formula: ((AX(((p25==0) + AF(((p45==0)&&(p17==1))))) * AX((p40==1))) * !(A(EG((AG((p27==0)) * EF(((p50==0)||(p49==1))))) U (!(AF(((p22==0)||(p46==...194
=> equivalent forward existential formula: (([FwdG((EY(Init) * !((p25==0))),!(((p45==0)&&(p17==1))))] = FALSE * [(EY(Init) * !((p40==1)))] = FALSE) * [((In...466
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t9, t11, t15, t19, t20, t22, t24, t28, t29, t30, t33, t34, t37, Intersection with re...232
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,0.549619,25764,1,0,519,130672,132,333,1294,161069,596
FORMULA ShieldRVt-PT-001B-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 52/52 places, 52/52 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 52 transition count 37
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 18 rules applied. Total rules applied 33 place count 37 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 35 place count 35 transition count 34
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 35 place count 35 transition count 30
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 43 place count 31 transition count 30
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 50 place count 24 transition count 23
Iterating global reduction 3 with 7 rules applied. Total rules applied 57 place count 24 transition count 23
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 57 place count 24 transition count 20
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 63 place count 21 transition count 20
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 77 place count 14 transition count 13
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 14 transition count 13
Applied a total of 78 rules in 10 ms. Remains 14 /52 variables (removed 38) and now considering 13/52 (removed 39) transitions.
// Phase 1: matrix 13 rows 14 cols
[2024-05-30 13:20:16] [INFO ] Computed 5 invariants in 0 ms
[2024-05-30 13:20:16] [INFO ] Implicit Places using invariants in 23 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 13/52 places, 13/52 transitions.
Applied a total of 0 rules in 2 ms. Remains 13 /13 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 37 ms. Remains : 13/52 places, 13/52 transitions.
[2024-05-30 13:20:16] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:20:16] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:20:16] [INFO ] Input system was already deterministic with 13 transitions.
[2024-05-30 13:20:16] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:20:16] [INFO ] Flatten gal took : 0 ms
[2024-05-30 13:20:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality10680227596837422101.gal : 1 ms
[2024-05-30 13:20:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality17967989611611171766.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/CTLCardinality10680227596837422101.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17967989611611171766.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,73,0.004213,3380,2,47,5,270,6,0,67,224,0


Converting to forward existential form...Done !
original formula: EF(!(E((p24==0) U (p0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((p24==0) U (p0==1))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 11/0/2
Hit Full ! (commute/partial/dont) 0/0/2
(forward)formula 0,1,0.006776,3696,1,0,8,540,17,3,315,271,6
FORMULA ShieldRVt-PT-001B-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 52/52 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 44 transition count 44
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 44 transition count 44
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 43 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 42 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 42 transition count 42
Applied a total of 20 rules in 3 ms. Remains 42 /52 variables (removed 10) and now considering 42/52 (removed 10) transitions.
// Phase 1: matrix 42 rows 42 cols
[2024-05-30 13:20:16] [INFO ] Computed 5 invariants in 1 ms
[2024-05-30 13:20:16] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-30 13:20:16] [INFO ] Invariant cache hit.
[2024-05-30 13:20:16] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Running 41 sub problems to find dead transitions.
[2024-05-30 13:20:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-30 13:20:16] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-30 13:20:16] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 42/84 variables, 42/49 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 0/84 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 49 constraints, problems are : Problem set: 0 solved, 41 unsolved in 487 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 42/84 variables, 42/49 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 41/90 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-30 13:20:16] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:20:16] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:20:16] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 0/84 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 93 constraints, problems are : Problem set: 0 solved, 41 unsolved in 605 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 5/5 constraints]
After SMT, in 1099ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 1100ms
Starting structural reductions in LTL mode, iteration 1 : 42/52 places, 42/52 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1166 ms. Remains : 42/52 places, 42/52 transitions.
[2024-05-30 13:20:17] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:20:17] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:20:17] [INFO ] Input system was already deterministic with 42 transitions.
[2024-05-30 13:20:17] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:20:17] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:20:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality16962508465779184442.gal : 0 ms
[2024-05-30 13:20:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality12423532660341889918.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/CTLCardinality16962508465779184442.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12423532660341889918.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,10831,0.017556,4140,2,275,5,3042,6,0,212,3991,0


Converting to forward existential form...Done !
original formula: EF(EX(!(E((p33==0) U ((p28==0)||(p23==1))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E((p33==0) U ((p28==0)||(p23==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t17, t20, t28, t31, t32, t35, Intersection with reachable at each step ena...208
(forward)formula 0,1,0.046192,5460,1,0,97,9614,104,49,1152,9670,102
FORMULA ShieldRVt-PT-001B-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-30 13:20:17] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:20:17] [INFO ] Flatten gal took : 2 ms
Total runtime 15977 ms.

BK_STOP 1717075217431

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

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

Sequence of Actions to be Executed by the VM

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

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

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