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.r136-tall-171631132600394.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 DiscoveryGPU-PT-08a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132600394
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 01:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Apr 12 01:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 01:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K Apr 12 01:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 28K May 18 16:42 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 DiscoveryGPU-PT-08a-CTLFireability-2024-00
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-2024-01
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-2024-02
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-2024-03
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-2024-04
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-2024-05
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-2024-06
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-2024-07
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-2024-08
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-2024-09
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-2024-10
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-2024-11
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-2023-12
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-2023-13
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-2023-14
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716374630135

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-08a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 10:43:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 10:43:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 10:43:51] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2024-05-22 10:43:51] [INFO ] Transformed 83 places.
[2024-05-22 10:43:51] [INFO ] Transformed 113 transitions.
[2024-05-22 10:43:51] [INFO ] Found NUPN structural information;
[2024-05-22 10:43:51] [INFO ] Parsed PT model containing 83 places and 113 transitions and 363 arcs in 148 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Support contains 67 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 113/113 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 83 transition count 105
Applied a total of 8 rules in 25 ms. Remains 83 /83 variables (removed 0) and now considering 105/113 (removed 8) transitions.
// Phase 1: matrix 105 rows 83 cols
[2024-05-22 10:43:51] [INFO ] Computed 2 invariants in 7 ms
[2024-05-22 10:43:51] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-22 10:43:51] [INFO ] Invariant cache hit.
[2024-05-22 10:43:52] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-22 10:43:52] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Running 104 sub problems to find dead transitions.
[2024-05-22 10:43:52] [INFO ] Invariant cache hit.
[2024-05-22 10:43:52] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 105/188 variables, 83/168 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 64/232 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 0/188 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 232 constraints, problems are : Problem set: 0 solved, 104 unsolved in 2655 ms.
Refiners :[Domain max(s): 83/83 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 105/188 variables, 83/168 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 64/232 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 104/336 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 0/188 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 336 constraints, problems are : Problem set: 0 solved, 104 unsolved in 1797 ms.
Refiners :[Domain max(s): 83/83 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
After SMT, in 4523ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 4541ms
Starting structural reductions in LTL mode, iteration 1 : 83/83 places, 105/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5017 ms. Remains : 83/83 places, 105/113 transitions.
Support contains 67 out of 83 places after structural reductions.
[2024-05-22 10:43:56] [INFO ] Flatten gal took : 26 ms
[2024-05-22 10:43:56] [INFO ] Flatten gal took : 9 ms
[2024-05-22 10:43:56] [INFO ] Input system was already deterministic with 105 transitions.
Support contains 66 out of 83 places (down from 67) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 87 to 84
RANDOM walk for 40000 steps (459 resets) in 1577 ms. (25 steps per ms) remains 4/84 properties
BEST_FIRST walk for 40004 steps (60 resets) in 252 ms. (158 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (49 resets) in 191 ms. (208 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (54 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (15 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
[2024-05-22 10:43:57] [INFO ] Invariant cache hit.
[2024-05-22 10:43:57] [INFO ] State equation strengthened by 64 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 24/36 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp61 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 15/41 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 6 (OVERLAPS) 45/81 variables, 22/63 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 22/85 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 18/103 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 0/103 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem AtomicPropp40 is UNSAT
At refinement iteration 10 (OVERLAPS) 40/121 variables, 17/120 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 17/137 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/121 variables, 12/149 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/121 variables, 0/149 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem AtomicPropp18 is UNSAT
After SMT solving in domain Real declared 138/188 variables, and 158 constraints, problems are : Problem set: 4 solved, 0 unsolved in 67 ms.
Refiners :[Domain max(s): 51/83 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 60/83 constraints, ReadFeed: 45/64 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 74ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2024-05-22 10:43:57] [INFO ] Flatten gal took : 17 ms
[2024-05-22 10:43:57] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:43:57] [INFO ] Input system was already deterministic with 105 transitions.
Support contains 61 out of 83 places (down from 62) after GAL structural reductions.
Computed a total of 11 stabilizing places and 9 stable transitions
Graph (complete) has 228 edges and 83 vertex of which 75 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 105/105 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 79 transition count 101
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 79 transition count 101
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 75 transition count 97
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 75 transition count 97
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 73 transition count 95
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 73 transition count 95
Applied a total of 20 rules in 11 ms. Remains 73 /83 variables (removed 10) and now considering 95/105 (removed 10) transitions.
// Phase 1: matrix 95 rows 73 cols
[2024-05-22 10:43:57] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 10:43:57] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 10:43:57] [INFO ] Invariant cache hit.
[2024-05-22 10:43:57] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-22 10:43:57] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2024-05-22 10:43:57] [INFO ] Invariant cache hit.
[2024-05-22 10:43:57] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 95/168 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 60/135 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 0/168 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 135 constraints, problems are : Problem set: 0 solved, 94 unsolved in 1603 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 95/168 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 60/135 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 94/229 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 0/168 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 229 constraints, problems are : Problem set: 0 solved, 94 unsolved in 1613 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints]
After SMT, in 3233ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 3236ms
Starting structural reductions in LTL mode, iteration 1 : 73/83 places, 95/105 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3361 ms. Remains : 73/83 places, 95/105 transitions.
[2024-05-22 10:44:01] [INFO ] Flatten gal took : 9 ms
[2024-05-22 10:44:01] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:44:01] [INFO ] Input system was already deterministic with 95 transitions.
[2024-05-22 10:44:01] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:44:01] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:44:01] [INFO ] Time to serialize gal into /tmp/CTLFireability17029061645144176737.gal : 2 ms
[2024-05-22 10:44:01] [INFO ] Time to serialize properties into /tmp/CTLFireability8170622916540244206.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/CTLFireability17029061645144176737.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8170622916540244206.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.65013e+08,0.255638,14236,2,2031,5,68600,6,0,373,43728,0


Converting to forward existential form...Done !
original formula: ((AX(E(EF(((p51==1)&&(((p64==1)&&(p82==1))||(p1==1)))) U (EX(AF((p21==1))) + AX(((p7==1)&&(p81==1)))))) * AG((E(((!((p60==1)&&(p81==1)))|...401
=> equivalent forward existential formula: (([(EY(Init) * !(E(E(TRUE U ((p51==1)&&(((p64==1)&&(p82==1))||(p1==1)))) U (EX(!(EG(!((p21==1))))) + !(EX(!(((p7...627
Hit Full ! (commute/partial/dont) 49/45/46
(forward)formula 0,0,0.584709,22144,1,0,11,82284,20,2,1905,99374,10
FORMULA DiscoveryGPU-PT-08a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 105/105 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 76 transition count 98
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 76 transition count 98
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 70 transition count 92
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 70 transition count 92
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 64 transition count 86
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 64 transition count 86
Applied a total of 38 rules in 6 ms. Remains 64 /83 variables (removed 19) and now considering 86/105 (removed 19) transitions.
// Phase 1: matrix 86 rows 64 cols
[2024-05-22 10:44:01] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:44:01] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-22 10:44:01] [INFO ] Invariant cache hit.
[2024-05-22 10:44:01] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-22 10:44:01] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2024-05-22 10:44:01] [INFO ] Invariant cache hit.
[2024-05-22 10:44:01] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 86/150 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 58/124 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 0/150 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 124 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1354 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 64/64 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 86/150 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 58/124 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 85/209 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 0/150 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 209 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1073 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 64/64 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
After SMT, in 2439ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 2440ms
Starting structural reductions in LTL mode, iteration 1 : 64/83 places, 86/105 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2560 ms. Remains : 64/83 places, 86/105 transitions.
[2024-05-22 10:44:04] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:44:04] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:44:04] [INFO ] Input system was already deterministic with 86 transitions.
[2024-05-22 10:44:04] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:44:04] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:44:04] [INFO ] Time to serialize gal into /tmp/CTLFireability18226552445569248616.gal : 2 ms
[2024-05-22 10:44:04] [INFO ] Time to serialize properties into /tmp/CTLFireability15906922168528896072.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/CTLFireability18226552445569248616.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15906922168528896072.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,1.04554e+08,0.124991,9268,2,1299,5,36678,6,0,331,22716,0


Converting to forward existential form...Done !
original formula: A(AG(EX(AX(((p2==1)&&(p81==1))))) U EF(((p24==1)&&(p82==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U ((p24==1)&&(p82==1))))))) * !(E(!(E(TRUE U ((p24==1)&&(p82==1)))) U (!(!(E(TRUE U !(EX...240
Reverse transition relation is NOT exact ! Due to transitions t20, t22, t24, t26, t29, t31, t33, t71, t73, t77, t78, t79, t80, t81, t82, t83, t84, t85, In...250
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,3.11789,107704,1,0,486,601314,203,327,2116,742576,530
FORMULA DiscoveryGPU-PT-08a-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 83/83 places, 105/105 transitions.
Graph (complete) has 228 edges and 83 vertex of which 75 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 75 transition count 91
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 69 transition count 91
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 19 place count 63 transition count 85
Iterating global reduction 0 with 6 rules applied. Total rules applied 25 place count 63 transition count 85
Applied a total of 25 rules in 26 ms. Remains 63 /83 variables (removed 20) and now considering 85/105 (removed 20) transitions.
// Phase 1: matrix 85 rows 63 cols
[2024-05-22 10:44:07] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:44:07] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-22 10:44:07] [INFO ] Invariant cache hit.
[2024-05-22 10:44:07] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-22 10:44:07] [INFO ] Implicit Places using invariants and state equation in 90 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 137 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 62/83 places, 85/105 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 85
Applied a total of 1 rules in 9 ms. Remains 62 /62 variables (removed 0) and now considering 85/85 (removed 0) transitions.
// Phase 1: matrix 85 rows 62 cols
[2024-05-22 10:44:07] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 10:44:07] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-22 10:44:07] [INFO ] Invariant cache hit.
[2024-05-22 10:44:07] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 10:44:07] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 62/83 places, 85/105 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 291 ms. Remains : 62/83 places, 85/105 transitions.
[2024-05-22 10:44:07] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:44:07] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:44:07] [INFO ] Input system was already deterministic with 85 transitions.
[2024-05-22 10:44:07] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:44:07] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:44:07] [INFO ] Time to serialize gal into /tmp/CTLFireability17755130559514043799.gal : 1 ms
[2024-05-22 10:44:07] [INFO ] Time to serialize properties into /tmp/CTLFireability17697315419473723346.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/CTLFireability17755130559514043799.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17697315419473723346.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.39091e+07,0.15508,10536,2,3261,5,44430,6,0,325,27604,0


Converting to forward existential form...Done !
original formula: EF((E(((p22==1)&&(p81==1)) U (p53==1)) * AF((p4==1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * E(((p22==1)&&(p81==1)) U (p53==1))) * !(EG(!((p4==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t19, t23, t25, t27, t30, t32, t71, t75, t76, t77, t78, t79, t80, t81, t82, t83, Intersec...244
(forward)formula 0,1,7.08393,217248,1,0,474,1.23587e+06,197,257,1883,1.5422e+06,563
FORMULA DiscoveryGPU-PT-08a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 105/105 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 76 transition count 98
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 76 transition count 98
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 70 transition count 92
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 70 transition count 92
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 65 transition count 87
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 65 transition count 87
Applied a total of 36 rules in 14 ms. Remains 65 /83 variables (removed 18) and now considering 87/105 (removed 18) transitions.
// Phase 1: matrix 87 rows 65 cols
[2024-05-22 10:44:14] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:44:15] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-22 10:44:15] [INFO ] Invariant cache hit.
[2024-05-22 10:44:15] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-22 10:44:15] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2024-05-22 10:44:15] [INFO ] Invariant cache hit.
[2024-05-22 10:44:15] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 87/152 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 58/125 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 0/152 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 125 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1408 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 87/152 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 58/125 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 86/211 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 0/152 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 211 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1078 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints]
After SMT, in 2498ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 2499ms
Starting structural reductions in LTL mode, iteration 1 : 65/83 places, 87/105 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2604 ms. Remains : 65/83 places, 87/105 transitions.
[2024-05-22 10:44:17] [INFO ] Flatten gal took : 13 ms
[2024-05-22 10:44:17] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:44:17] [INFO ] Input system was already deterministic with 87 transitions.
[2024-05-22 10:44:17] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:44:17] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:44:17] [INFO ] Time to serialize gal into /tmp/CTLFireability10908846219453418560.gal : 4 ms
[2024-05-22 10:44:17] [INFO ] Time to serialize properties into /tmp/CTLFireability5256645507605079846.ctl : 2 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/CTLFireability10908846219453418560.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5256645507605079846.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.12853e+08,0.255864,14452,2,2761,5,67454,6,0,336,44694,0


Converting to forward existential form...Done !
original formula: ((EF((AG((((p18==1)&&(p23==1))&&(p82==1))) + (AG(((p9==1)&&(p81==1))) * EG(((p26==1)&&(p81==1)))))) + AF(((E((((p75==1)&&(p81==1))||((p70...324
=> equivalent forward existential formula: (([(FwdU((FwdU(FwdU((Init * !((E(TRUE U (!(E(TRUE U !((((p18==1)&&(p23==1))&&(p82==1))))) + (!(E(TRUE U !(((p9==...1388
Reverse transition relation is NOT exact ! Due to transitions t7, t17, t21, t23, t25, t27, t29, t34, t73, t74, t78, t79, t80, t81, t82, t83, t84, t85, t86,...254
(forward)formula 0,0,18.0457,525912,1,0,820,3.0051e+06,228,450,2178,3.44248e+06,1050
FORMULA DiscoveryGPU-PT-08a-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 83/83 places, 105/105 transitions.
Graph (complete) has 228 edges and 83 vertex of which 75 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 80 edges and 72 vertex of which 57 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Graph (trivial) has 64 edges and 57 vertex of which 32 / 57 are part of one of the 16 SCC in 3 ms
Free SCC test removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 41 transition count 73
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 37 place count 33 transition count 57
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 43 place count 27 transition count 45
Iterating global reduction 2 with 6 rules applied. Total rules applied 49 place count 27 transition count 45
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 55 place count 21 transition count 33
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 21 transition count 33
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 67 place count 15 transition count 21
Iterating global reduction 2 with 6 rules applied. Total rules applied 73 place count 15 transition count 21
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 79 place count 9 transition count 15
Iterating global reduction 2 with 6 rules applied. Total rules applied 85 place count 9 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 9 transition count 14
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 9 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 88 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 90 place count 6 transition count 11
Applied a total of 90 rules in 20 ms. Remains 6 /83 variables (removed 77) and now considering 11/105 (removed 94) transitions.
[2024-05-22 10:44:35] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2024-05-22 10:44:35] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 10:44:35] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-22 10:44:35] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-05-22 10:44:35] [INFO ] Invariant cache hit.
[2024-05-22 10:44:35] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-22 10:44:35] [INFO ] Redundant transitions in 1 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-22 10:44:35] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-05-22 10:44:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/13 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 6 constraints, problems are : Problem set: 0 solved, 7 unsolved in 42 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/13 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 13 constraints, problems are : Problem set: 0 solved, 7 unsolved in 45 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 91ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 91ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/83 places, 11/105 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 156 ms. Remains : 6/83 places, 11/105 transitions.
[2024-05-22 10:44:35] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:44:35] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:44:35] [INFO ] Input system was already deterministic with 11 transitions.
RANDOM walk for 182 steps (6 resets) in 7 ms. (22 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-08a-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 10:44:35] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:44:35] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:44:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15430099969585851399.gal : 1 ms
[2024-05-22 10:44:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1459369870397164484.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15430099969585851399.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1459369870397164484.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 83/83 places, 105/105 transitions.
Graph (complete) has 228 edges and 83 vertex of which 75 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 75 transition count 90
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 68 transition count 90
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 22 place count 61 transition count 83
Iterating global reduction 0 with 7 rules applied. Total rules applied 29 place count 61 transition count 83
Applied a total of 29 rules in 9 ms. Remains 61 /83 variables (removed 22) and now considering 83/105 (removed 22) transitions.
// Phase 1: matrix 83 rows 61 cols
[2024-05-22 10:44:35] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:44:36] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-22 10:44:36] [INFO ] Invariant cache hit.
[2024-05-22 10:44:36] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-22 10:44:36] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-22 10:44:36] [INFO ] Redundant transitions in 1 ms returned []
Running 82 sub problems to find dead transitions.
[2024-05-22 10:44:36] [INFO ] Invariant cache hit.
[2024-05-22 10:44:36] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 83/144 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 57/120 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 0/144 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 120 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1207 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 83/144 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 57/120 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 82/202 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 0/144 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 202 constraints, problems are : Problem set: 0 solved, 82 unsolved in 947 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints]
After SMT, in 2166ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 2167ms
Starting structural reductions in SI_CTL mode, iteration 1 : 61/83 places, 83/105 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2276 ms. Remains : 61/83 places, 83/105 transitions.
[2024-05-22 10:44:38] [INFO ] Flatten gal took : 8 ms
[2024-05-22 10:44:38] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:44:38] [INFO ] Input system was already deterministic with 83 transitions.
[2024-05-22 10:44:38] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:44:38] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:44:38] [INFO ] Time to serialize gal into /tmp/CTLFireability17598919341292749544.gal : 1 ms
[2024-05-22 10:44:38] [INFO ] Time to serialize properties into /tmp/CTLFireability13082731301445626006.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/CTLFireability17598919341292749544.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13082731301445626006.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(((E(EF((((p10==1)&&(p81==1))&&((p14==1)&&(p82==1)))) U AG(((p6==1)||(p74==1)))) + (p0==0)) + ((AG((p73==1)) * (p24==1)) * ((p49==1)&&(...166
=> equivalent forward existential formula: [FwdG(Init,((E(E(TRUE U (((p10==1)&&(p81==1))&&((p14==1)&&(p82==1)))) U !(E(TRUE U !(((p6==1)||(p74==1)))))) + (...239
Reverse transition relation is NOT exact ! Due to transitions t1, t21, t23, t25, t27, t28, t30, t32, t74, t75, t76, t77, t78, t79, t80, t81, t82, Intersec...244
(forward)formula 0,0,0.726002,29016,1,0,130,147978,203,83,1931,126129,197
FORMULA DiscoveryGPU-PT-08a-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 83/83 places, 105/105 transitions.
Graph (complete) has 228 edges and 83 vertex of which 75 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 80 edges and 72 vertex of which 57 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Graph (trivial) has 59 edges and 57 vertex of which 28 / 57 are part of one of the 14 SCC in 0 ms
Free SCC test removed 14 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 43 transition count 74
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 34 place count 36 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 35 transition count 59
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 41 place count 29 transition count 47
Iterating global reduction 3 with 6 rules applied. Total rules applied 47 place count 29 transition count 47
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 53 place count 23 transition count 35
Iterating global reduction 3 with 6 rules applied. Total rules applied 59 place count 23 transition count 35
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 65 place count 17 transition count 23
Iterating global reduction 3 with 6 rules applied. Total rules applied 71 place count 17 transition count 23
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 77 place count 11 transition count 17
Iterating global reduction 3 with 6 rules applied. Total rules applied 83 place count 11 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 11 transition count 16
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 85 place count 11 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 86 place count 10 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 88 place count 8 transition count 13
Applied a total of 88 rules in 13 ms. Remains 8 /83 variables (removed 75) and now considering 13/105 (removed 92) transitions.
[2024-05-22 10:44:39] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 8 cols
[2024-05-22 10:44:39] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 10:44:39] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-22 10:44:39] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2024-05-22 10:44:39] [INFO ] Invariant cache hit.
[2024-05-22 10:44:39] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2024-05-22 10:44:39] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2024-05-22 10:44:39] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2024-05-22 10:44:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 2/19 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/20 variables, and 8 constraints, problems are : Problem set: 0 solved, 10 unsolved in 58 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 2/19 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/20 variables, and 18 constraints, problems are : Problem set: 0 solved, 10 unsolved in 58 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 119ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 119ms
Starting structural reductions in SI_CTL mode, iteration 1 : 8/83 places, 13/105 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 167 ms. Remains : 8/83 places, 13/105 transitions.
[2024-05-22 10:44:39] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:44:39] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:44:39] [INFO ] Input system was already deterministic with 13 transitions.
[2024-05-22 10:44:39] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:44:39] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:44:39] [INFO ] Time to serialize gal into /tmp/CTLFireability10127917698541169243.gal : 0 ms
[2024-05-22 10:44:39] [INFO ] Time to serialize properties into /tmp/CTLFireability17533446820519801377.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/CTLFireability10127917698541169243.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17533446820519801377.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,252,0.002667,3332,2,21,5,125,6,0,42,115,0


Converting to forward existential form...Done !
original formula: AG(EF((E((p24==1) U (p23==1)) + EF((p28==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (E((p24==1) U (p23==1)) + E(TRUE U (p28==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t4, t11, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/...172
(forward)formula 0,1,0.006065,3648,1,0,34,495,50,20,229,538,50
FORMULA DiscoveryGPU-PT-08a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 105/105 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 77 transition count 99
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 77 transition count 99
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 73 transition count 95
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 73 transition count 95
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 71 transition count 93
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 71 transition count 93
Applied a total of 24 rules in 5 ms. Remains 71 /83 variables (removed 12) and now considering 93/105 (removed 12) transitions.
// Phase 1: matrix 93 rows 71 cols
[2024-05-22 10:44:39] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:44:39] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-22 10:44:39] [INFO ] Invariant cache hit.
[2024-05-22 10:44:39] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-22 10:44:39] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-05-22 10:44:39] [INFO ] Invariant cache hit.
[2024-05-22 10:44:39] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 93/164 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 60/133 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/164 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 133 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1546 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 93/164 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 60/133 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 92/225 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/164 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 225 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1228 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
After SMT, in 2786ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 2787ms
Starting structural reductions in LTL mode, iteration 1 : 71/83 places, 93/105 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2889 ms. Remains : 71/83 places, 93/105 transitions.
[2024-05-22 10:44:42] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:44:42] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:44:42] [INFO ] Input system was already deterministic with 93 transitions.
[2024-05-22 10:44:42] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:44:42] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:44:42] [INFO ] Time to serialize gal into /tmp/CTLFireability16397953273563865859.gal : 1 ms
[2024-05-22 10:44:42] [INFO ] Time to serialize properties into /tmp/CTLFireability200875254798589223.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/CTLFireability16397953273563865859.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability200875254798589223.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.55557e+08,0.349261,17228,2,3731,5,92552,6,0,365,54803,0


Converting to forward existential form...Done !
original formula: ((A(!((((E((p33==1) U ((p26==1)&&(p81==1))) * AG(((p80==1)&&(p81==1)))) * ((EF(((p34==1)&&(p82==1))) * !(((p80==1)&&(p81==1)))) + A(((p68...730
=> equivalent forward existential formula: (([((FwdU(((Init * !((!((E(!(E(TRUE U !(E(TRUE U !(!((((p18==1)&&(p82==1))&&(p74==1)))))))) U (!(!((((E((p33==1)...2798
Reverse transition relation is NOT exact ! Due to transitions t1, t11, t20, t26, t32, t37, t77, t78, t80, t83, t84, t85, t86, t87, t88, t89, t90, t91, t92,...254
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,13.5463,425800,1,0,1111,2.33634e+06,263,720,2354,3.20638e+06,1373
FORMULA DiscoveryGPU-PT-08a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 105/105 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 76 transition count 98
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 76 transition count 98
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 69 transition count 91
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 69 transition count 91
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 63 transition count 85
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 63 transition count 85
Applied a total of 40 rules in 9 ms. Remains 63 /83 variables (removed 20) and now considering 85/105 (removed 20) transitions.
// Phase 1: matrix 85 rows 63 cols
[2024-05-22 10:44:55] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:44:55] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-22 10:44:55] [INFO ] Invariant cache hit.
[2024-05-22 10:44:55] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-22 10:44:55] [INFO ] Implicit Places using invariants and state equation in 67 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 114 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/83 places, 85/105 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 125 ms. Remains : 62/83 places, 85/105 transitions.
[2024-05-22 10:44:55] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:44:55] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:44:55] [INFO ] Input system was already deterministic with 85 transitions.
[2024-05-22 10:44:55] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:44:55] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:44:55] [INFO ] Time to serialize gal into /tmp/CTLFireability3999426820286179582.gal : 1 ms
[2024-05-22 10:44:55] [INFO ] Time to serialize properties into /tmp/CTLFireability9748646177642862343.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/CTLFireability3999426820286179582.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9748646177642862343.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,9.86767e+07,0.409655,18592,2,5102,5,95581,6,0,324,60663,0


Converting to forward existential form...Done !
original formula: EF(EX(EF((p23==1))))
=> equivalent forward existential formula: [(FwdU(EY(FwdU(Init,TRUE)),TRUE) * (p23==1))] != FALSE
(forward)formula 0,1,0.565761,18856,1,0,8,95581,9,1,668,60663,4
FORMULA DiscoveryGPU-PT-08a-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 105/105 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 76 transition count 98
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 76 transition count 98
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 69 transition count 91
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 69 transition count 91
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 63 transition count 85
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 63 transition count 85
Applied a total of 40 rules in 9 ms. Remains 63 /83 variables (removed 20) and now considering 85/105 (removed 20) transitions.
// Phase 1: matrix 85 rows 63 cols
[2024-05-22 10:44:56] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 10:44:56] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-22 10:44:56] [INFO ] Invariant cache hit.
[2024-05-22 10:44:56] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-22 10:44:56] [INFO ] Implicit Places using invariants and state equation in 68 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 100 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/83 places, 85/105 transitions.
Applied a total of 0 rules in 0 ms. Remains 62 /62 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 109 ms. Remains : 62/83 places, 85/105 transitions.
[2024-05-22 10:44:56] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:44:56] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:44:56] [INFO ] Input system was already deterministic with 85 transitions.
[2024-05-22 10:44:56] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:44:56] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:44:56] [INFO ] Time to serialize gal into /tmp/CTLFireability5727408277648111365.gal : 1 ms
[2024-05-22 10:44:56] [INFO ] Time to serialize properties into /tmp/CTLFireability13973616460503296209.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/CTLFireability5727408277648111365.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13973616460503296209.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,9.86767e+07,0.481252,22640,2,6380,5,117539,6,0,324,81145,0


Converting to forward existential form...Done !
original formula: EF((AX(EG((p54==0))) * EX(((p63==0) * E(((p79==1)&&(p81==1)) U (p63==1))))))
=> equivalent forward existential formula: [(FwdU((EY((FwdU(Init,TRUE) * !(EX(!(EG((p54==0))))))) * (p63==0)),((p79==1)&&(p81==1))) * (p63==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t16, t20, t22, t24, t26, t28, t29, t31, t76, t77, t78, t79, t80, t81, t82, t83, t84, Int...249
Hit Full ! (commute/partial/dont) 42/41/43
(forward)formula 0,1,13.7864,435104,1,0,501,2.42766e+06,201,263,2098,3.23278e+06,596
FORMULA DiscoveryGPU-PT-08a-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 105/105 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 76 transition count 98
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 76 transition count 98
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 69 transition count 91
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 69 transition count 91
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 63 transition count 85
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 63 transition count 85
Applied a total of 40 rules in 3 ms. Remains 63 /83 variables (removed 20) and now considering 85/105 (removed 20) transitions.
[2024-05-22 10:45:10] [INFO ] Invariant cache hit.
[2024-05-22 10:45:10] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-22 10:45:10] [INFO ] Invariant cache hit.
[2024-05-22 10:45:10] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-22 10:45:10] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2024-05-22 10:45:10] [INFO ] Invariant cache hit.
[2024-05-22 10:45:10] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 85/148 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 57/122 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 0/148 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 122 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1295 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 85/148 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 57/122 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 84/206 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/148 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 206 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
After SMT, in 2321ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 2322ms
Starting structural reductions in LTL mode, iteration 1 : 63/83 places, 85/105 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2434 ms. Remains : 63/83 places, 85/105 transitions.
[2024-05-22 10:45:12] [INFO ] Flatten gal took : 14 ms
[2024-05-22 10:45:12] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:45:12] [INFO ] Input system was already deterministic with 85 transitions.
[2024-05-22 10:45:12] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:45:12] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:45:12] [INFO ] Time to serialize gal into /tmp/CTLFireability454961550783262577.gal : 1 ms
[2024-05-22 10:45:12] [INFO ] Time to serialize properties into /tmp/CTLFireability1994035257253080184.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/CTLFireability454961550783262577.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1994035257253080184.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.86767e+07,0.326663,15932,2,2240,5,79994,6,0,326,48617,0


Converting to forward existential form...Done !
original formula: ((AX(AF((p24==1))) + AG(EX(((p48==0) * EX(((p63==1)&&(p82==1))))))) + EG((E(((p6==1)&&(p81==1)) U !(A(((p10==1)&&(p81==1)) U ((p25==1)&&(...200
=> equivalent forward existential formula: [(FwdU(((Init * !(EG((E(((p6==1)&&(p81==1)) U !(!((E(!(((p25==1)&&(p81==1))) U (!(((p10==1)&&(p81==1))) * !(((p2...353
Reverse transition relation is NOT exact ! Due to transitions t3, t16, t20, t22, t24, t26, t28, t29, t31, t76, t77, t78, t79, t80, t81, t82, t83, t84, Int...249
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,9.80495,305504,1,0,915,1.70715e+06,221,521,2079,2.25866e+06,1146
FORMULA DiscoveryGPU-PT-08a-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 105/105 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 76 transition count 98
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 76 transition count 98
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 70 transition count 92
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 70 transition count 92
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 66 transition count 88
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 66 transition count 88
Applied a total of 34 rules in 3 ms. Remains 66 /83 variables (removed 17) and now considering 88/105 (removed 17) transitions.
// Phase 1: matrix 88 rows 66 cols
[2024-05-22 10:45:22] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:45:22] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-22 10:45:22] [INFO ] Invariant cache hit.
[2024-05-22 10:45:22] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-22 10:45:22] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2024-05-22 10:45:22] [INFO ] Invariant cache hit.
[2024-05-22 10:45:22] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 88/154 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 58/126 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 87 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/154 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 126 constraints, problems are : Problem set: 0 solved, 87 unsolved in 1396 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 88/154 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 58/126 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 87/213 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 0/154 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 213 constraints, problems are : Problem set: 0 solved, 87 unsolved in 1076 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints]
After SMT, in 2488ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 2490ms
Starting structural reductions in LTL mode, iteration 1 : 66/83 places, 88/105 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2579 ms. Remains : 66/83 places, 88/105 transitions.
[2024-05-22 10:45:25] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:45:25] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:45:25] [INFO ] Input system was already deterministic with 88 transitions.
[2024-05-22 10:45:25] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:45:25] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:45:25] [INFO ] Time to serialize gal into /tmp/CTLFireability13234222991004435607.gal : 0 ms
[2024-05-22 10:45:25] [INFO ] Time to serialize properties into /tmp/CTLFireability15031399323570762665.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/CTLFireability13234222991004435607.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15031399323570762665.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,1.20923e+08,0.210424,12444,2,1694,5,52647,6,0,341,38182,0


Converting to forward existential form...Done !
original formula: (!(A(A(AX(AX(((p8==1)&&(p82==1)))) U !(((p22==1)&&(p81==1)))) U E(AX(AG(((p56==1)&&(p81==1)))) U E(!(((p60==1)&&(p81==1))) U AX((p24==1))...449
=> equivalent forward existential formula: [FwdG((FwdU((Init * !(!((E(!(E(!(EX(!(!(E(TRUE U !(((p56==1)&&(p81==1)))))))) U E(!(((p60==1)&&(p81==1))) U !(EX...928
Reverse transition relation is NOT exact ! Due to transitions t9, t15, t18, t22, t24, t26, t33, t35, t74, t75, t79, t80, t81, t82, t83, t84, t85, t86, t87,...254
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 27/102/61
(forward)formula 0,1,8.65687,294792,1,0,1039,1.60392e+06,244,576,2422,2.23561e+06,1219
FORMULA DiscoveryGPU-PT-08a-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 105/105 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 77 transition count 99
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 77 transition count 99
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 72 transition count 94
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 72 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 70 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 70 transition count 92
Applied a total of 26 rules in 8 ms. Remains 70 /83 variables (removed 13) and now considering 92/105 (removed 13) transitions.
// Phase 1: matrix 92 rows 70 cols
[2024-05-22 10:45:34] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:45:34] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-22 10:45:34] [INFO ] Invariant cache hit.
[2024-05-22 10:45:34] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-22 10:45:34] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-05-22 10:45:34] [INFO ] Invariant cache hit.
[2024-05-22 10:45:34] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 92/162 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 59/131 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 0/162 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 131 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1591 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 92/162 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 59/131 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 91/222 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/162 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 222 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1062 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
After SMT, in 2666ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 2667ms
Starting structural reductions in LTL mode, iteration 1 : 70/83 places, 92/105 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3048 ms. Remains : 70/83 places, 92/105 transitions.
[2024-05-22 10:45:37] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:45:37] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:45:37] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-22 10:45:37] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:45:37] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:45:37] [INFO ] Time to serialize gal into /tmp/CTLFireability13596604240040292009.gal : 17 ms
[2024-05-22 10:45:37] [INFO ] Time to serialize properties into /tmp/CTLFireability7798190946679821713.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/CTLFireability13596604240040292009.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7798190946679821713.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.4786e+08,0.286955,15868,2,2413,5,77709,6,0,360,51629,0


Converting to forward existential form...Done !
original formula: EF((EG(A((((p25==1)&&(p81==1)) + EG(((p33==1)&&(p82==1)))) U ((p3==1) * AF(((p4==1)&&(p82==1)))))) * ((E(EF(((p35==1)&&(p81==1))) U (p76=...313
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,TRUE) * EG(!((E(!(((p3==1) * !(EG(!(((p4==1)&&(p82==1))))))) U (!((((p25==1)&&(p81==1)) + EG...1014
Reverse transition relation is NOT exact ! Due to transitions t6, t11, t17, t20, t24, t30, t35, t76, t77, t82, t83, t84, t85, t86, t87, t88, t89, t90, t91,...254
(forward)formula 0,0,18.4737,565652,1,0,1164,3.13307e+06,247,593,2220,3.99519e+06,1392
FORMULA DiscoveryGPU-PT-08a-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 83/83 places, 105/105 transitions.
Graph (complete) has 228 edges and 83 vertex of which 75 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 80 edges and 72 vertex of which 56 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Graph (trivial) has 61 edges and 56 vertex of which 30 / 56 are part of one of the 15 SCC in 0 ms
Free SCC test removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 41 transition count 73
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 35 place count 34 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 33 transition count 57
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 43 place count 26 transition count 43
Iterating global reduction 3 with 7 rules applied. Total rules applied 50 place count 26 transition count 43
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 57 place count 19 transition count 29
Iterating global reduction 3 with 7 rules applied. Total rules applied 64 place count 19 transition count 29
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 70 place count 13 transition count 17
Iterating global reduction 3 with 6 rules applied. Total rules applied 76 place count 13 transition count 17
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 82 place count 7 transition count 11
Iterating global reduction 3 with 6 rules applied. Total rules applied 88 place count 7 transition count 11
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 7 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 6 transition count 9
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 93 place count 4 transition count 7
Applied a total of 93 rules in 26 ms. Remains 4 /83 variables (removed 79) and now considering 7/105 (removed 98) transitions.
[2024-05-22 10:45:55] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 4 cols
[2024-05-22 10:45:55] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 10:45:55] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-22 10:45:55] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2024-05-22 10:45:55] [INFO ] Invariant cache hit.
[2024-05-22 10:45:55] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-22 10:45:55] [INFO ] Redundant transitions in 1 ms returned []
Running 4 sub problems to find dead transitions.
[2024-05-22 10:45:55] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2024-05-22 10:45:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/10 variables, and 4 constraints, problems are : Problem set: 0 solved, 4 unsolved in 27 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/9 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/10 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 29 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 83ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 84ms
Starting structural reductions in SI_CTL mode, iteration 1 : 4/83 places, 7/105 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 155 ms. Remains : 4/83 places, 7/105 transitions.
[2024-05-22 10:45:55] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:45:55] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:45:55] [INFO ] Input system was already deterministic with 7 transitions.
[2024-05-22 10:45:55] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:45:55] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:45:55] [INFO ] Time to serialize gal into /tmp/CTLFireability402521369527140502.gal : 1 ms
[2024-05-22 10:45:55] [INFO ] Time to serialize properties into /tmp/CTLFireability156571010366763465.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/CTLFireability402521369527140502.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability156571010366763465.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,116,0.002308,3304,2,14,5,183,6,0,22,221,0


Converting to forward existential form...Done !
original formula: AG(EF(AG((p68==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !((p68==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total...165
(forward)formula 0,1,0.003954,3620,1,0,28,251,34,14,118,277,33
FORMULA DiscoveryGPU-PT-08a-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 105/105 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 77 transition count 99
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 77 transition count 99
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 71 transition count 93
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 71 transition count 93
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 66 transition count 88
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 66 transition count 88
Applied a total of 34 rules in 2 ms. Remains 66 /83 variables (removed 17) and now considering 88/105 (removed 17) transitions.
// Phase 1: matrix 88 rows 66 cols
[2024-05-22 10:45:56] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:45:56] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-22 10:45:56] [INFO ] Invariant cache hit.
[2024-05-22 10:45:56] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-22 10:45:56] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2024-05-22 10:45:56] [INFO ] Invariant cache hit.
[2024-05-22 10:45:56] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 88/154 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 58/126 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 0/154 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 126 constraints, problems are : Problem set: 0 solved, 87 unsolved in 1824 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 88/154 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 58/126 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 87/213 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 0/154 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 213 constraints, problems are : Problem set: 0 solved, 87 unsolved in 1061 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints]
After SMT, in 2919ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 2920ms
Starting structural reductions in LTL mode, iteration 1 : 66/83 places, 88/105 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3047 ms. Remains : 66/83 places, 88/105 transitions.
[2024-05-22 10:45:59] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:45:59] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:45:59] [INFO ] Input system was already deterministic with 88 transitions.
[2024-05-22 10:45:59] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:45:59] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:45:59] [INFO ] Time to serialize gal into /tmp/CTLFireability8979643299631616321.gal : 1 ms
[2024-05-22 10:45:59] [INFO ] Time to serialize properties into /tmp/CTLFireability7140325302321656443.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/CTLFireability8979643299631616321.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7140325302321656443.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.16537e+08,0.195056,11388,2,1240,5,48572,6,0,340,31691,0


Converting to forward existential form...Done !
original formula: (EF(AX(EG((EG((p41==1)) * AG(((p3==1)&&(p82==1))))))) * EX(((p14==0)||(p82==0))))
=> equivalent forward existential formula: [(EY((Init * E(TRUE U !(EX(!(EG((EG((p41==1)) * !(E(TRUE U !(((p3==1)&&(p82==1))))))))))))) * ((p14==0)||(p82==0...168
Reverse transition relation is NOT exact ! Due to transitions t14, t17, t21, t23, t25, t27, t30, t34, t78, t79, t80, t81, t82, t83, t84, t85, t86, t87, In...250
(forward)formula 0,1,2.46509,78824,1,0,214,433926,207,130,2093,409951,302
FORMULA DiscoveryGPU-PT-08a-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 105/105 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 77 transition count 99
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 77 transition count 99
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 72 transition count 94
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 72 transition count 94
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 67 transition count 89
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 67 transition count 89
Applied a total of 32 rules in 1 ms. Remains 67 /83 variables (removed 16) and now considering 89/105 (removed 16) transitions.
// Phase 1: matrix 89 rows 67 cols
[2024-05-22 10:46:01] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 10:46:01] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-22 10:46:01] [INFO ] Invariant cache hit.
[2024-05-22 10:46:01] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-22 10:46:01] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2024-05-22 10:46:01] [INFO ] Invariant cache hit.
[2024-05-22 10:46:01] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (OVERLAPS) 89/156 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 59/128 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 0/156 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 128 constraints, problems are : Problem set: 0 solved, 88 unsolved in 1465 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (OVERLAPS) 89/156 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 59/128 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 88/216 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 0/156 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 216 constraints, problems are : Problem set: 0 solved, 88 unsolved in 1082 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints]
After SMT, in 2594ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 2597ms
Starting structural reductions in LTL mode, iteration 1 : 67/83 places, 89/105 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2692 ms. Remains : 67/83 places, 89/105 transitions.
[2024-05-22 10:46:04] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:46:04] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:46:04] [INFO ] Input system was already deterministic with 89 transitions.
[2024-05-22 10:46:04] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:46:04] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:46:04] [INFO ] Time to serialize gal into /tmp/CTLFireability8578571602522527305.gal : 1 ms
[2024-05-22 10:46:04] [INFO ] Time to serialize properties into /tmp/CTLFireability10087308520446285623.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/CTLFireability8578571602522527305.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10087308520446285623.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.23003e+08,0.155092,10272,2,922,5,43272,6,0,345,25521,0


Converting to forward existential form...Done !
original formula: AX((AG(((EF(((p3==1)&&(p82==1))) + AF(((p2==1)&&(p81==1)))) + (p61==1))) + ((p24==1)&&((p50==0)||(p81==0)))))
=> equivalent forward existential formula: [FwdG(((FwdU((EY(Init) * !(((p24==1)&&((p50==0)||(p81==0))))),TRUE) * !((p61==1))) * !(E(TRUE U ((p3==1)&&(p82==...194
Reverse transition relation is NOT exact ! Due to transitions t21, t23, t25, t27, t30, t32, t72, t74, t79, t80, t81, t82, t83, t84, t85, t86, t87, t88, In...250
Hit Full ! (commute/partial/dont) 44/0/45
(forward)formula 0,0,0.805528,31296,1,0,141,169737,215,92,2294,138492,201
FORMULA DiscoveryGPU-PT-08a-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-22 10:46:05] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:46:05] [INFO ] Flatten gal took : 2 ms
Total runtime 133784 ms.

BK_STOP 1716374765169

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-08a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-08a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-tall-171631132600394"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-08a.tgz
mv DiscoveryGPU-PT-08a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;