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.r114-smll-171624275500194.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 DLCround-PT-08a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-171624275500194
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 940K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 13 15:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 13 15:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 13 14:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 13 14:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:38 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 479K 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 DLCround-PT-08a-CTLFireability-2024-00
FORMULA_NAME DLCround-PT-08a-CTLFireability-2024-01
FORMULA_NAME DLCround-PT-08a-CTLFireability-2024-02
FORMULA_NAME DLCround-PT-08a-CTLFireability-2024-03
FORMULA_NAME DLCround-PT-08a-CTLFireability-2024-04
FORMULA_NAME DLCround-PT-08a-CTLFireability-2024-05
FORMULA_NAME DLCround-PT-08a-CTLFireability-2024-06
FORMULA_NAME DLCround-PT-08a-CTLFireability-2024-07
FORMULA_NAME DLCround-PT-08a-CTLFireability-2024-08
FORMULA_NAME DLCround-PT-08a-CTLFireability-2024-09
FORMULA_NAME DLCround-PT-08a-CTLFireability-2024-10
FORMULA_NAME DLCround-PT-08a-CTLFireability-2024-11
FORMULA_NAME DLCround-PT-08a-CTLFireability-2023-12
FORMULA_NAME DLCround-PT-08a-CTLFireability-2023-13
FORMULA_NAME DLCround-PT-08a-CTLFireability-2023-14
FORMULA_NAME DLCround-PT-08a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716368620247

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-08a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 09:03:42] [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 09:03:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 09:03:42] [INFO ] Load time of PNML (sax parser for PT used): 243 ms
[2024-05-22 09:03:42] [INFO ] Transformed 263 places.
[2024-05-22 09:03:42] [INFO ] Transformed 1907 transitions.
[2024-05-22 09:03:42] [INFO ] Found NUPN structural information;
[2024-05-22 09:03:42] [INFO ] Parsed PT model containing 263 places and 1907 transitions and 7354 arcs in 429 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 95 ms.
Ensure Unique test removed 187 transitions
Reduce redundant transitions removed 187 transitions.
Support contains 136 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 1720/1720 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 256 transition count 1642
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 256 transition count 1642
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 256 transition count 1639
Drop transitions (Redundant composition of simpler transitions.) removed 588 transitions
Redundant transition composition rules discarded 588 transitions
Iterating global reduction 1 with 588 rules applied. Total rules applied 605 place count 256 transition count 1051
Applied a total of 605 rules in 133 ms. Remains 256 /263 variables (removed 7) and now considering 1051/1720 (removed 669) transitions.
[2024-05-22 09:03:42] [INFO ] Flow matrix only has 176 transitions (discarded 875 similar events)
// Phase 1: matrix 176 rows 256 cols
[2024-05-22 09:03:42] [INFO ] Computed 157 invariants in 24 ms
[2024-05-22 09:03:43] [INFO ] Implicit Places using invariants in 959 ms returned [112, 113, 114, 115, 116, 119, 121, 125, 129, 130, 131, 132, 134, 135, 136, 137, 138, 141, 144, 146, 148, 151, 152, 153, 154, 155, 156, 157, 158, 162, 163, 164, 166, 168, 170, 173, 174, 177, 178, 179, 181, 182, 185, 191, 194, 195, 198, 199, 205, 208, 210, 212, 216, 221, 222, 223, 224, 225, 226, 228, 230, 237, 238, 240, 241, 242, 243, 250, 252, 253]
Discarding 70 places :
Ensure Unique test removed 335 transitions
Reduce isomorphic transitions removed 335 transitions.
Implicit Place search using SMT only with invariants took 1009 ms to find 70 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/263 places, 716/1720 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 478 transitions
Redundant transition composition rules discarded 478 transitions
Iterating global reduction 0 with 478 rules applied. Total rules applied 478 place count 186 transition count 238
Applied a total of 478 rules in 19 ms. Remains 186 /186 variables (removed 0) and now considering 238/716 (removed 478) transitions.
[2024-05-22 09:03:43] [INFO ] Flow matrix only has 176 transitions (discarded 62 similar events)
// Phase 1: matrix 176 rows 186 cols
[2024-05-22 09:03:43] [INFO ] Computed 87 invariants in 3 ms
[2024-05-22 09:03:43] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-22 09:03:43] [INFO ] Flow matrix only has 176 transitions (discarded 62 similar events)
[2024-05-22 09:03:43] [INFO ] Invariant cache hit.
[2024-05-22 09:03:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 09:03:44] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/263 places, 238/1720 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1490 ms. Remains : 186/263 places, 238/1720 transitions.
Support contains 136 out of 186 places after structural reductions.
[2024-05-22 09:03:44] [INFO ] Flatten gal took : 75 ms
[2024-05-22 09:03:44] [INFO ] Flatten gal took : 31 ms
[2024-05-22 09:03:44] [INFO ] Input system was already deterministic with 238 transitions.
RANDOM walk for 40000 steps (8 resets) in 2154 ms. (18 steps per ms) remains 2/79 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 2/2 properties
[2024-05-22 09:03:45] [INFO ] Flow matrix only has 176 transitions (discarded 62 similar events)
[2024-05-22 09:03:45] [INFO ] Invariant cache hit.
[2024-05-22 09:03:45] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp10 is UNSAT
After SMT solving in domain Real declared 48/362 variables, and 11 constraints, problems are : Problem set: 2 solved, 0 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 11/87 constraints, State Equation: 0/186 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 119ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-05-22 09:03:45] [INFO ] Flatten gal took : 18 ms
[2024-05-22 09:03:45] [INFO ] Flatten gal took : 16 ms
[2024-05-22 09:03:45] [INFO ] Input system was already deterministic with 238 transitions.
Computed a total of 75 stabilizing places and 1 stable transitions
Graph (complete) has 324 edges and 186 vertex of which 112 are kept as prefixes of interest. Removing 74 places using SCC suffix rule.4 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 186/186 places, 238/238 transitions.
Graph (trivial) has 234 edges and 186 vertex of which 108 / 186 are part of one of the 13 SCC in 3 ms
Free SCC test removed 95 places
Ensure Unique test removed 218 transitions
Reduce isomorphic transitions removed 218 transitions.
Graph (complete) has 106 edges and 91 vertex of which 18 are kept as prefixes of interest. Removing 73 places using SCC suffix rule.0 ms
Discarding 73 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 18 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 17 transition count 19
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 15 place count 6 transition count 8
Iterating global reduction 2 with 11 rules applied. Total rules applied 26 place count 6 transition count 8
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 27 place count 6 transition count 7
Applied a total of 27 rules in 28 ms. Remains 6 /186 variables (removed 180) and now considering 7/238 (removed 231) transitions.
[2024-05-22 09:03:45] [INFO ] Flow matrix only has 5 transitions (discarded 2 similar events)
// Phase 1: matrix 5 rows 6 cols
[2024-05-22 09:03:45] [INFO ] Computed 3 invariants in 1 ms
[2024-05-22 09:03:45] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-22 09:03:45] [INFO ] Flow matrix only has 5 transitions (discarded 2 similar events)
[2024-05-22 09:03:45] [INFO ] Invariant cache hit.
[2024-05-22 09:03:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 09:03:45] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-22 09:03:45] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-22 09:03:45] [INFO ] Flow matrix only has 5 transitions (discarded 2 similar events)
[2024-05-22 09:03:45] [INFO ] Invariant cache hit.
[2024-05-22 09:03:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 4/10 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/11 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/11 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/11 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 10 constraints, problems are : Problem set: 0 solved, 6 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 4/10 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 16 constraints, problems are : Problem set: 0 solved, 6 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 259ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 259ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/186 places, 7/238 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 345 ms. Remains : 6/186 places, 7/238 transitions.
[2024-05-22 09:03:46] [INFO ] Flatten gal took : 1 ms
[2024-05-22 09:03:46] [INFO ] Flatten gal took : 1 ms
[2024-05-22 09:03:46] [INFO ] Input system was already deterministic with 7 transitions.
[2024-05-22 09:03:46] [INFO ] Flatten gal took : 1 ms
[2024-05-22 09:03:46] [INFO ] Flatten gal took : 1 ms
[2024-05-22 09:03:46] [INFO ] Time to serialize gal into /tmp/CTLFireability248656036738032938.gal : 1 ms
[2024-05-22 09:03:46] [INFO ] Time to serialize properties into /tmp/CTLFireability4481514503367820006.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/CTLFireability248656036738032938.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4481514503367820006.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(AG(AF(((p86!=1)||(p234!=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!(((p86!=1)||(p234!=1)))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.014889,3496,1,0,7,87,23,0,122,51,9
FORMULA DLCround-PT-08a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 238/238 transitions.
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 113 transition count 238
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 91 place count 95 transition count 202
Iterating global reduction 1 with 18 rules applied. Total rules applied 109 place count 95 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 110 place count 95 transition count 201
Applied a total of 110 rules in 6 ms. Remains 95 /186 variables (removed 91) and now considering 201/238 (removed 37) transitions.
[2024-05-22 09:03:46] [INFO ] Flow matrix only has 157 transitions (discarded 44 similar events)
// Phase 1: matrix 157 rows 95 cols
[2024-05-22 09:03:46] [INFO ] Computed 14 invariants in 2 ms
[2024-05-22 09:03:46] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 09:03:46] [INFO ] Flow matrix only has 157 transitions (discarded 44 similar events)
[2024-05-22 09:03:46] [INFO ] Invariant cache hit.
[2024-05-22 09:03:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 09:03:46] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-22 09:03:46] [INFO ] Flow matrix only has 157 transitions (discarded 44 similar events)
[2024-05-22 09:03:46] [INFO ] Invariant cache hit.
[2024-05-22 09:03:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 156/251 variables, 95/109 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 1/252 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (OVERLAPS) 0/252 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 110 constraints, problems are : Problem set: 0 solved, 200 unsolved in 7832 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 95/95 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 156/251 variables, 95/109 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 200/309 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 1/252 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 10 (OVERLAPS) 0/252 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 310 constraints, problems are : Problem set: 0 solved, 200 unsolved in 7150 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 95/95 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 15069ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 15088ms
Starting structural reductions in LTL mode, iteration 1 : 95/186 places, 201/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15255 ms. Remains : 95/186 places, 201/238 transitions.
[2024-05-22 09:04:01] [INFO ] Flatten gal took : 10 ms
[2024-05-22 09:04:01] [INFO ] Flatten gal took : 30 ms
[2024-05-22 09:04:01] [INFO ] Input system was already deterministic with 201 transitions.
[2024-05-22 09:04:01] [INFO ] Flatten gal took : 9 ms
[2024-05-22 09:04:01] [INFO ] Flatten gal took : 8 ms
[2024-05-22 09:04:01] [INFO ] Time to serialize gal into /tmp/CTLFireability7668420724212057317.gal : 5 ms
[2024-05-22 09:04:01] [INFO ] Time to serialize properties into /tmp/CTLFireability11189645633164900593.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/CTLFireability7668420724212057317.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11189645633164900593.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.43718e+10,0.035738,4180,2,270,5,1087,6,0,535,783,0


Converting to forward existential form...Done !
original formula: EF(AX(AG(((p51==0)||(p214==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !(((p51==0)||(p214==0)))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.121017,5552,1,0,6,10776,15,0,2226,1362,5
FORMULA DLCround-PT-08a-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 186/186 places, 238/238 transitions.
Graph (trivial) has 165 edges and 186 vertex of which 57 / 186 are part of one of the 12 SCC in 1 ms
Free SCC test removed 45 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Graph (complete) has 226 edges and 141 vertex of which 80 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.2 ms
Discarding 61 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 80 transition count 134
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 74 transition count 134
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 23 place count 65 transition count 120
Iterating global reduction 2 with 9 rules applied. Total rules applied 32 place count 65 transition count 120
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 41 place count 65 transition count 111
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 46 place count 65 transition count 111
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 50 place count 61 transition count 107
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 61 transition count 107
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 58 place count 61 transition count 103
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 61 place count 61 transition count 100
Applied a total of 61 rules in 30 ms. Remains 61 /186 variables (removed 125) and now considering 100/238 (removed 138) transitions.
[2024-05-22 09:04:01] [INFO ] Flow matrix only has 64 transitions (discarded 36 similar events)
// Phase 1: matrix 64 rows 61 cols
[2024-05-22 09:04:01] [INFO ] Computed 22 invariants in 7 ms
[2024-05-22 09:04:01] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 09:04:01] [INFO ] Flow matrix only has 64 transitions (discarded 36 similar events)
[2024-05-22 09:04:01] [INFO ] Invariant cache hit.
[2024-05-22 09:04:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 09:04:01] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-22 09:04:01] [INFO ] Redundant transitions in 2 ms returned []
Running 99 sub problems to find dead transitions.
[2024-05-22 09:04:01] [INFO ] Flow matrix only has 64 transitions (discarded 36 similar events)
[2024-05-22 09:04:01] [INFO ] Invariant cache hit.
[2024-05-22 09:04:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 13/61 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 63/124 variables, 61/83 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 1/125 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/125 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 84 constraints, problems are : Problem set: 0 solved, 99 unsolved in 2634 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 13/61 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 63/124 variables, 61/83 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 99/182 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 1/125 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (OVERLAPS) 0/125 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 183 constraints, problems are : Problem set: 0 solved, 99 unsolved in 2234 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
After SMT, in 4890ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 4894ms
Starting structural reductions in SI_CTL mode, iteration 1 : 61/186 places, 100/238 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5063 ms. Remains : 61/186 places, 100/238 transitions.
[2024-05-22 09:04:06] [INFO ] Flatten gal took : 4 ms
[2024-05-22 09:04:06] [INFO ] Flatten gal took : 4 ms
[2024-05-22 09:04:06] [INFO ] Input system was already deterministic with 100 transitions.
[2024-05-22 09:04:06] [INFO ] Flatten gal took : 4 ms
[2024-05-22 09:04:06] [INFO ] Flatten gal took : 4 ms
[2024-05-22 09:04:06] [INFO ] Time to serialize gal into /tmp/CTLFireability8916530795799978503.gal : 2 ms
[2024-05-22 09:04:06] [INFO ] Time to serialize properties into /tmp/CTLFireability7025833991016862825.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/CTLFireability8916530795799978503.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7025833991016862825.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,705601,0.014092,3788,2,160,5,573,6,0,268,392,0


Converting to forward existential form...Done !
original formula: EF((A(((p37==1)&&(p199==1)) U EF(EG(((p97==1)&&(p253==1))))) + (((p40==1) * (EF(((p73==1)&&(p227==1))) + (((p67==1)&&(p209==1))&&((p16==1...415
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!(E(TRUE U EG(((p97==1)&&(p253==1)))))))) * !(E(!(E(TRUE U EG(((p97==1)&&(p253==1))))...798
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.041065,4632,1,0,7,3908,29,0,1282,836,9
FORMULA DLCround-PT-08a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 238/238 transitions.
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 121 transition count 238
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 84 place count 102 transition count 200
Iterating global reduction 1 with 19 rules applied. Total rules applied 103 place count 102 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 104 place count 102 transition count 199
Applied a total of 104 rules in 3 ms. Remains 102 /186 variables (removed 84) and now considering 199/238 (removed 39) transitions.
[2024-05-22 09:04:06] [INFO ] Flow matrix only has 156 transitions (discarded 43 similar events)
// Phase 1: matrix 156 rows 102 cols
[2024-05-22 09:04:06] [INFO ] Computed 22 invariants in 2 ms
[2024-05-22 09:04:06] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-22 09:04:06] [INFO ] Flow matrix only has 156 transitions (discarded 43 similar events)
[2024-05-22 09:04:06] [INFO ] Invariant cache hit.
[2024-05-22 09:04:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 09:04:07] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-22 09:04:07] [INFO ] Flow matrix only has 156 transitions (discarded 43 similar events)
[2024-05-22 09:04:07] [INFO ] Invariant cache hit.
[2024-05-22 09:04:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 9/102 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 155/257 variables, 102/124 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 1/258 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 0/258 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 125 constraints, problems are : Problem set: 0 solved, 198 unsolved in 7581 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 102/102 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 9/102 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 155/257 variables, 102/124 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 198/322 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 1/258 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/258 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 323 constraints, problems are : Problem set: 0 solved, 198 unsolved in 6461 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 102/102 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
After SMT, in 14082ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 14086ms
Starting structural reductions in LTL mode, iteration 1 : 102/186 places, 199/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14275 ms. Remains : 102/186 places, 199/238 transitions.
[2024-05-22 09:04:21] [INFO ] Flatten gal took : 8 ms
[2024-05-22 09:04:21] [INFO ] Flatten gal took : 8 ms
[2024-05-22 09:04:21] [INFO ] Input system was already deterministic with 199 transitions.
[2024-05-22 09:04:21] [INFO ] Flatten gal took : 8 ms
[2024-05-22 09:04:21] [INFO ] Flatten gal took : 8 ms
[2024-05-22 09:04:21] [INFO ] Time to serialize gal into /tmp/CTLFireability8500550325969796043.gal : 3 ms
[2024-05-22 09:04:21] [INFO ] Time to serialize properties into /tmp/CTLFireability13788857489518635775.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/CTLFireability8500550325969796043.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13788857489518635775.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.38861e+10,0.030249,4188,2,283,5,1121,6,0,538,799,0


Converting to forward existential form...Done !
original formula: (AG(EF(((p87==1)&&(p227==1)))) * EX(((EF(((p45==1)&&(p200==1))) + ((EF(((p53==0)||(p140==0))) * ((p66==0)||(p216==0))) * ((p46==1)&&(p204...267
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U ((p87==1)&&(p227==1)))))] = FALSE * [(Init * !(EX(((E(TRUE U ((p45==1)&&(p200==1...361
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.093534,6352,1,0,12,11959,19,4,2302,2484,14
FORMULA DLCround-PT-08a-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 186/186 places, 238/238 transitions.
Graph (trivial) has 227 edges and 186 vertex of which 104 / 186 are part of one of the 13 SCC in 1 ms
Free SCC test removed 91 places
Ensure Unique test removed 207 transitions
Reduce isomorphic transitions removed 207 transitions.
Graph (complete) has 117 edges and 95 vertex of which 22 are kept as prefixes of interest. Removing 73 places using SCC suffix rule.0 ms
Discarding 73 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 22 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 21 transition count 30
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 16 place count 9 transition count 17
Iterating global reduction 2 with 12 rules applied. Total rules applied 28 place count 9 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 9 transition count 15
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 9 transition count 15
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 8 transition count 14
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 8 transition count 14
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 8 transition count 13
Applied a total of 34 rules in 23 ms. Remains 8 /186 variables (removed 178) and now considering 13/238 (removed 225) transitions.
[2024-05-22 09:04:21] [INFO ] Flow matrix only has 9 transitions (discarded 4 similar events)
// Phase 1: matrix 9 rows 8 cols
[2024-05-22 09:04:21] [INFO ] Computed 3 invariants in 0 ms
[2024-05-22 09:04:21] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-22 09:04:21] [INFO ] Flow matrix only has 9 transitions (discarded 4 similar events)
[2024-05-22 09:04:21] [INFO ] Invariant cache hit.
[2024-05-22 09:04:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 09:04:21] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-05-22 09:04:21] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-22 09:04:21] [INFO ] Flow matrix only has 9 transitions (discarded 4 similar events)
[2024-05-22 09:04:21] [INFO ] Invariant cache hit.
[2024-05-22 09:04:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 8/16 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 1/17 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/17 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/17 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/17 variables, and 12 constraints, problems are : Problem set: 0 solved, 12 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 8/16 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/17 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/17 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/17 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/17 variables, and 24 constraints, problems are : Problem set: 0 solved, 12 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 337ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 338ms
Starting structural reductions in SI_CTL mode, iteration 1 : 8/186 places, 13/238 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 427 ms. Remains : 8/186 places, 13/238 transitions.
[2024-05-22 09:04:21] [INFO ] Flatten gal took : 2 ms
[2024-05-22 09:04:21] [INFO ] Flatten gal took : 1 ms
[2024-05-22 09:04:21] [INFO ] Input system was already deterministic with 13 transitions.
[2024-05-22 09:04:21] [INFO ] Flatten gal took : 1 ms
[2024-05-22 09:04:21] [INFO ] Flatten gal took : 1 ms
[2024-05-22 09:04:21] [INFO ] Time to serialize gal into /tmp/CTLFireability12199690243254868681.gal : 1 ms
[2024-05-22 09:04:21] [INFO ] Time to serialize properties into /tmp/CTLFireability5437332512775142852.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/CTLFireability12199690243254868681.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5437332512775142852.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6,0.003354,3336,2,16,5,62,6,0,37,39,0


Converting to forward existential form...Done !
original formula: EF(EG(((p117==1)&&(p190==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((p117==1)&&(p190==1)))] != FALSE
Hit Full ! (commute/partial/dont) 6/7/7
(forward)formula 0,1,0.004889,3652,1,0,7,131,19,0,181,88,9
FORMULA DLCround-PT-08a-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 238/238 transitions.
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 113 transition count 238
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 91 place count 95 transition count 202
Iterating global reduction 1 with 18 rules applied. Total rules applied 109 place count 95 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 110 place count 95 transition count 201
Applied a total of 110 rules in 4 ms. Remains 95 /186 variables (removed 91) and now considering 201/238 (removed 37) transitions.
[2024-05-22 09:04:21] [INFO ] Flow matrix only has 157 transitions (discarded 44 similar events)
// Phase 1: matrix 157 rows 95 cols
[2024-05-22 09:04:21] [INFO ] Computed 14 invariants in 1 ms
[2024-05-22 09:04:21] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 09:04:21] [INFO ] Flow matrix only has 157 transitions (discarded 44 similar events)
[2024-05-22 09:04:21] [INFO ] Invariant cache hit.
[2024-05-22 09:04:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 09:04:21] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-22 09:04:21] [INFO ] Flow matrix only has 157 transitions (discarded 44 similar events)
[2024-05-22 09:04:21] [INFO ] Invariant cache hit.
[2024-05-22 09:04:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 156/251 variables, 95/109 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 1/252 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (OVERLAPS) 0/252 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 110 constraints, problems are : Problem set: 0 solved, 200 unsolved in 7494 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 95/95 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 156/251 variables, 95/109 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 200/309 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 1/252 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 10 (OVERLAPS) 0/252 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 310 constraints, problems are : Problem set: 0 solved, 200 unsolved in 6737 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 95/95 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 14285ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 14291ms
Starting structural reductions in LTL mode, iteration 1 : 95/186 places, 201/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14435 ms. Remains : 95/186 places, 201/238 transitions.
[2024-05-22 09:04:36] [INFO ] Flatten gal took : 10 ms
[2024-05-22 09:04:36] [INFO ] Flatten gal took : 6 ms
[2024-05-22 09:04:36] [INFO ] Input system was already deterministic with 201 transitions.
[2024-05-22 09:04:36] [INFO ] Flatten gal took : 7 ms
[2024-05-22 09:04:36] [INFO ] Flatten gal took : 6 ms
[2024-05-22 09:04:36] [INFO ] Time to serialize gal into /tmp/CTLFireability18230467413801781419.gal : 2 ms
[2024-05-22 09:04:36] [INFO ] Time to serialize properties into /tmp/CTLFireability3987404229824392518.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/CTLFireability18230467413801781419.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3987404229824392518.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.43718e+10,0.031996,4180,2,270,5,1088,6,0,535,786,0


Converting to forward existential form...Done !
original formula: AF(AX(EF(((p94==1)&&(p243==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(E(TRUE U ((p94==1)&&(p243==1))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.09405,5552,1,0,7,10934,20,0,2317,1680,8
FORMULA DLCround-PT-08a-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 238/238 transitions.
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 121 transition count 238
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 83 place count 103 transition count 202
Iterating global reduction 1 with 18 rules applied. Total rules applied 101 place count 103 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 102 place count 103 transition count 201
Applied a total of 102 rules in 4 ms. Remains 103 /186 variables (removed 83) and now considering 201/238 (removed 37) transitions.
[2024-05-22 09:04:36] [INFO ] Flow matrix only has 157 transitions (discarded 44 similar events)
// Phase 1: matrix 157 rows 103 cols
[2024-05-22 09:04:36] [INFO ] Computed 22 invariants in 1 ms
[2024-05-22 09:04:36] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-22 09:04:36] [INFO ] Flow matrix only has 157 transitions (discarded 44 similar events)
[2024-05-22 09:04:36] [INFO ] Invariant cache hit.
[2024-05-22 09:04:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 09:04:36] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-22 09:04:36] [INFO ] Flow matrix only has 157 transitions (discarded 44 similar events)
[2024-05-22 09:04:36] [INFO ] Invariant cache hit.
[2024-05-22 09:04:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (OVERLAPS) 9/103 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 156/259 variables, 103/125 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 1/260 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (OVERLAPS) 0/260 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 126 constraints, problems are : Problem set: 0 solved, 200 unsolved in 8084 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 103/103 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (OVERLAPS) 9/103 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 156/259 variables, 103/125 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 200/325 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 1/260 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/260 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 10 (OVERLAPS) 0/260 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 326 constraints, problems are : Problem set: 0 solved, 200 unsolved in 6730 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 103/103 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 14858ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 14861ms
Starting structural reductions in LTL mode, iteration 1 : 103/186 places, 201/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15117 ms. Remains : 103/186 places, 201/238 transitions.
[2024-05-22 09:04:51] [INFO ] Flatten gal took : 7 ms
[2024-05-22 09:04:51] [INFO ] Flatten gal took : 16 ms
[2024-05-22 09:04:51] [INFO ] Input system was already deterministic with 201 transitions.
[2024-05-22 09:04:51] [INFO ] Flatten gal took : 14 ms
[2024-05-22 09:04:51] [INFO ] Flatten gal took : 6 ms
[2024-05-22 09:04:51] [INFO ] Time to serialize gal into /tmp/CTLFireability992470019646467960.gal : 3 ms
[2024-05-22 09:04:51] [INFO ] Time to serialize properties into /tmp/CTLFireability11442904372497686088.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/CTLFireability992470019646467960.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11442904372497686088.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.43718e+10,0.033684,4192,2,286,5,1135,6,0,543,807,0


Converting to forward existential form...Done !
original formula: EF((((EX(((p57==0)||(p213==0))) * (p107==1)) * ((p221==1)&&(p37==1))) * (((p207==1) * ((A((p70==1) U ((p66==1)&&(p150==1))) + ((p14==1)&&...269
=> equivalent forward existential formula: (([(((((FwdU(Init,TRUE) * ((EX(((p57==0)||(p213==0))) * (p107==1)) * ((p221==1)&&(p37==1)))) * (((p71==0)||(p226...777
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 197/0/4
(forward)formula 0,1,0.118409,6356,1,0,16,14155,29,8,2441,3807,16
FORMULA DLCround-PT-08a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 238/238 transitions.
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 125 transition count 238
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 77 place count 109 transition count 206
Iterating global reduction 1 with 16 rules applied. Total rules applied 93 place count 109 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 94 place count 109 transition count 205
Applied a total of 94 rules in 4 ms. Remains 109 /186 variables (removed 77) and now considering 205/238 (removed 33) transitions.
[2024-05-22 09:04:51] [INFO ] Flow matrix only has 159 transitions (discarded 46 similar events)
// Phase 1: matrix 159 rows 109 cols
[2024-05-22 09:04:51] [INFO ] Computed 26 invariants in 1 ms
[2024-05-22 09:04:51] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-22 09:04:51] [INFO ] Flow matrix only has 159 transitions (discarded 46 similar events)
[2024-05-22 09:04:51] [INFO ] Invariant cache hit.
[2024-05-22 09:04:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 09:04:52] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2024-05-22 09:04:52] [INFO ] Flow matrix only has 159 transitions (discarded 46 similar events)
[2024-05-22 09:04:52] [INFO ] Invariant cache hit.
[2024-05-22 09:04:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (OVERLAPS) 13/109 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 158/267 variables, 109/135 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (OVERLAPS) 1/268 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (OVERLAPS) 0/268 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 136 constraints, problems are : Problem set: 0 solved, 204 unsolved in 8396 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 109/109 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (OVERLAPS) 13/109 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 158/267 variables, 109/135 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 204/339 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 1/268 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 10 (OVERLAPS) 0/268 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 340 constraints, problems are : Problem set: 0 solved, 204 unsolved in 7010 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 109/109 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
After SMT, in 15450ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 15453ms
Starting structural reductions in LTL mode, iteration 1 : 109/186 places, 205/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15799 ms. Remains : 109/186 places, 205/238 transitions.
[2024-05-22 09:05:07] [INFO ] Flatten gal took : 7 ms
[2024-05-22 09:05:07] [INFO ] Flatten gal took : 7 ms
[2024-05-22 09:05:07] [INFO ] Input system was already deterministic with 205 transitions.
[2024-05-22 09:05:07] [INFO ] Flatten gal took : 7 ms
[2024-05-22 09:05:07] [INFO ] Flatten gal took : 7 ms
[2024-05-22 09:05:07] [INFO ] Time to serialize gal into /tmp/CTLFireability8081367796291967819.gal : 3 ms
[2024-05-22 09:05:07] [INFO ] Time to serialize properties into /tmp/CTLFireability15343360853299931996.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/CTLFireability8081367796291967819.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15343360853299931996.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.27402e+11,0.04848,4216,2,300,5,1189,6,0,557,837,0


Converting to forward existential form...Done !
original formula: (EG((((((((((p47==1)&&(p127==1))||((p53==1)&&(p207==1))) * AG(((p67==1)&&(p149==1)))) + (((p95==1)&&(p174==1))&&((p7==1)&&(p183==1)))) + ...444
=> equivalent forward existential formula: ([FwdG(((FwdU((Init * !(EG((((((((((p47==1)&&(p127==1))||((p53==1)&&(p207==1))) * !(E(TRUE U !(((p67==1)&&(p149=...1017
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 200/0/5
Using saturation style SCC detection
(forward)formula 0,0,0.151574,6908,1,0,14,15365,55,4,2741,3692,22
FORMULA DLCround-PT-08a-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 238/238 transitions.
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 130 transition count 238
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 65 place count 121 transition count 220
Iterating global reduction 1 with 9 rules applied. Total rules applied 74 place count 121 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 121 transition count 219
Applied a total of 75 rules in 4 ms. Remains 121 /186 variables (removed 65) and now considering 219/238 (removed 19) transitions.
[2024-05-22 09:05:07] [INFO ] Flow matrix only has 166 transitions (discarded 53 similar events)
// Phase 1: matrix 166 rows 121 cols
[2024-05-22 09:05:07] [INFO ] Computed 31 invariants in 1 ms
[2024-05-22 09:05:07] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-22 09:05:07] [INFO ] Flow matrix only has 166 transitions (discarded 53 similar events)
[2024-05-22 09:05:07] [INFO ] Invariant cache hit.
[2024-05-22 09:05:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 09:05:07] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-05-22 09:05:07] [INFO ] Flow matrix only has 166 transitions (discarded 53 similar events)
[2024-05-22 09:05:07] [INFO ] Invariant cache hit.
[2024-05-22 09:05:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 18/121 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 165/286 variables, 121/152 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 1/287 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 153 constraints, problems are : Problem set: 0 solved, 218 unsolved in 9050 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 121/121 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 18/121 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 165/286 variables, 121/152 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 218/370 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 1/287 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 371 constraints, problems are : Problem set: 0 solved, 218 unsolved in 7983 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 121/121 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
After SMT, in 17061ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 17064ms
Starting structural reductions in LTL mode, iteration 1 : 121/186 places, 219/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17228 ms. Remains : 121/186 places, 219/238 transitions.
[2024-05-22 09:05:24] [INFO ] Flatten gal took : 8 ms
[2024-05-22 09:05:24] [INFO ] Flatten gal took : 7 ms
[2024-05-22 09:05:25] [INFO ] Input system was already deterministic with 219 transitions.
[2024-05-22 09:05:25] [INFO ] Flatten gal took : 7 ms
[2024-05-22 09:05:25] [INFO ] Flatten gal took : 6 ms
[2024-05-22 09:05:25] [INFO ] Time to serialize gal into /tmp/CTLFireability6375836016533637845.gal : 3 ms
[2024-05-22 09:05:25] [INFO ] Time to serialize properties into /tmp/CTLFireability12567941229638138989.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/CTLFireability6375836016533637845.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12567941229638138989.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (((AF(EX(AG(((p18==0)||(p179==0))))) + E(!(EF(((p59==1)&&(p216==1)))) U AF(EX(((p84==1)&&(p166==1)))))) + (AG((E((p64==1) U ((p76==1)&&(p...609
=> equivalent forward existential formula: ([(FwdU((((Init * !((E(TRUE U ((E(TRUE U ((p57==0)||(p225==0))) * (p33==1)) * (p197==1))) * E((!(EX(!(!(E(TRUE U...1670
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 208/0/11
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 216/0/3
(forward)formula 0,1,0.212241,8296,1,0,31,23195,71,9,3232,7623,49
FORMULA DLCround-PT-08a-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 186/186 places, 238/238 transitions.
Graph (trivial) has 234 edges and 186 vertex of which 110 / 186 are part of one of the 13 SCC in 1 ms
Free SCC test removed 97 places
Ensure Unique test removed 221 transitions
Reduce isomorphic transitions removed 221 transitions.
Graph (complete) has 103 edges and 89 vertex of which 16 are kept as prefixes of interest. Removing 73 places using SCC suffix rule.1 ms
Discarding 73 places :
Also discarding 0 output transitions
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 13 place count 5 transition count 6
Iterating global reduction 0 with 11 rules applied. Total rules applied 24 place count 5 transition count 6
Applied a total of 24 rules in 3 ms. Remains 5 /186 variables (removed 181) and now considering 6/238 (removed 232) transitions.
[2024-05-22 09:05:25] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
// Phase 1: matrix 4 rows 5 cols
[2024-05-22 09:05:25] [INFO ] Computed 3 invariants in 0 ms
[2024-05-22 09:05:25] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-22 09:05:25] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
[2024-05-22 09:05:25] [INFO ] Invariant cache hit.
[2024-05-22 09:05:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 09:05:25] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-22 09:05:25] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-22 09:05:25] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
[2024-05-22 09:05:25] [INFO ] Invariant cache hit.
[2024-05-22 09:05:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/5 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3/8 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/9 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/9 variables, and 9 constraints, problems are : Problem set: 0 solved, 5 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/5 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3/8 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/9 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/9 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/9 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/9 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 200ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 200ms
Starting structural reductions in SI_CTL mode, iteration 1 : 5/186 places, 6/238 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 253 ms. Remains : 5/186 places, 6/238 transitions.
[2024-05-22 09:05:25] [INFO ] Flatten gal took : 0 ms
[2024-05-22 09:05:25] [INFO ] Flatten gal took : 0 ms
[2024-05-22 09:05:25] [INFO ] Input system was already deterministic with 6 transitions.
RANDOM walk for 8 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
FORMULA DLCround-PT-08a-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 09:05:25] [INFO ] Flatten gal took : 0 ms
[2024-05-22 09:05:25] [INFO ] Flatten gal took : 0 ms
[2024-05-22 09:05:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3742822768951658203.gal : 0 ms
[2024-05-22 09:05:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3970586270522480723.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3742822768951658203.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3970586270522480723.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 LTL mode, iteration 0 : 186/186 places, 238/238 transitions.
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 115 transition count 238
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 90 place count 96 transition count 200
Iterating global reduction 1 with 19 rules applied. Total rules applied 109 place count 96 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 110 place count 96 transition count 199
Applied a total of 110 rules in 3 ms. Remains 96 /186 variables (removed 90) and now considering 199/238 (removed 39) transitions.
[2024-05-22 09:05:25] [INFO ] Flow matrix only has 156 transitions (discarded 43 similar events)
// Phase 1: matrix 156 rows 96 cols
[2024-05-22 09:05:25] [INFO ] Computed 16 invariants in 1 ms
[2024-05-22 09:05:25] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 09:05:25] [INFO ] Flow matrix only has 156 transitions (discarded 43 similar events)
[2024-05-22 09:05:25] [INFO ] Invariant cache hit.
[2024-05-22 09:05:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 09:05:25] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-22 09:05:25] [INFO ] Flow matrix only has 156 transitions (discarded 43 similar events)
[2024-05-22 09:05:25] [INFO ] Invariant cache hit.
[2024-05-22 09:05:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 3/96 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 155/251 variables, 96/112 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 1/252 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 0/252 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 113 constraints, problems are : Problem set: 0 solved, 198 unsolved in 7623 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 96/96 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 3/96 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 155/251 variables, 96/112 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 198/310 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 1/252 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/252 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 311 constraints, problems are : Problem set: 0 solved, 198 unsolved in 6552 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 96/96 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
After SMT, in 14202ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 14208ms
Starting structural reductions in LTL mode, iteration 1 : 96/186 places, 199/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14353 ms. Remains : 96/186 places, 199/238 transitions.
[2024-05-22 09:05:39] [INFO ] Flatten gal took : 6 ms
[2024-05-22 09:05:39] [INFO ] Flatten gal took : 7 ms
[2024-05-22 09:05:39] [INFO ] Input system was already deterministic with 199 transitions.
[2024-05-22 09:05:39] [INFO ] Flatten gal took : 5 ms
[2024-05-22 09:05:39] [INFO ] Flatten gal took : 5 ms
[2024-05-22 09:05:39] [INFO ] Time to serialize gal into /tmp/CTLFireability3358225420786259547.gal : 2 ms
[2024-05-22 09:05:39] [INFO ] Time to serialize properties into /tmp/CTLFireability5503551686018734433.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/CTLFireability3358225420786259547.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5503551686018734433.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.38861e+10,0.051806,4176,2,271,5,1085,6,0,532,781,0


Converting to forward existential form...Done !
original formula: EX((AX(EG((((p107==0)||(p251==0))||((p36==0)||(p191==0))))) + ((p105==1)&&(p176==1))))
=> equivalent forward existential formula: ([(EY(Init) * !(EX(!(EG((((p107==0)||(p251==0))||((p36==0)||(p191==0))))))))] != FALSE + [(EY(Init) * ((p105==1)...179
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.118956,5812,1,0,11,13344,18,3,2164,3818,9
FORMULA DLCround-PT-08a-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 186/186 places, 238/238 transitions.
Graph (trivial) has 224 edges and 186 vertex of which 103 / 186 are part of one of the 14 SCC in 0 ms
Free SCC test removed 89 places
Ensure Unique test removed 202 transitions
Reduce isomorphic transitions removed 202 transitions.
Graph (complete) has 122 edges and 97 vertex of which 27 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.0 ms
Discarding 70 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 27 transition count 35
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 26 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 25 transition count 33
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 15 place count 17 transition count 25
Iterating global reduction 3 with 8 rules applied. Total rules applied 23 place count 17 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 17 transition count 23
Applied a total of 25 rules in 8 ms. Remains 17 /186 variables (removed 169) and now considering 23/238 (removed 215) transitions.
[2024-05-22 09:05:40] [INFO ] Flow matrix only has 13 transitions (discarded 10 similar events)
// Phase 1: matrix 13 rows 17 cols
[2024-05-22 09:05:40] [INFO ] Computed 9 invariants in 0 ms
[2024-05-22 09:05:40] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-22 09:05:40] [INFO ] Flow matrix only has 13 transitions (discarded 10 similar events)
[2024-05-22 09:05:40] [INFO ] Invariant cache hit.
[2024-05-22 09:05:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 09:05:40] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-22 09:05:40] [INFO ] Redundant transitions in 0 ms returned []
Running 22 sub problems to find dead transitions.
[2024-05-22 09:05:40] [INFO ] Flow matrix only has 13 transitions (discarded 10 similar events)
[2024-05-22 09:05:40] [INFO ] Invariant cache hit.
[2024-05-22 09:05:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 4/17 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 12/29 variables, 17/26 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 1/30 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/30 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 0/30 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 27 constraints, problems are : Problem set: 0 solved, 22 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 4/17 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 12/29 variables, 17/26 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 22/48 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 1/30 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 0/30 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 49 constraints, problems are : Problem set: 0 solved, 22 unsolved in 311 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 687ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 688ms
Starting structural reductions in SI_CTL mode, iteration 1 : 17/186 places, 23/238 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 769 ms. Remains : 17/186 places, 23/238 transitions.
[2024-05-22 09:05:40] [INFO ] Flatten gal took : 8 ms
[2024-05-22 09:05:40] [INFO ] Flatten gal took : 1 ms
[2024-05-22 09:05:40] [INFO ] Input system was already deterministic with 23 transitions.
[2024-05-22 09:05:40] [INFO ] Flatten gal took : 1 ms
[2024-05-22 09:05:40] [INFO ] Flatten gal took : 1 ms
[2024-05-22 09:05:40] [INFO ] Time to serialize gal into /tmp/CTLFireability804017475849346793.gal : 1 ms
[2024-05-22 09:05:40] [INFO ] Time to serialize properties into /tmp/CTLFireability17264700304364904717.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/CTLFireability804017475849346793.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17264700304364904717.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,49,0.003534,3392,2,37,5,129,6,0,68,81,0


Converting to forward existential form...Done !
original formula: EG(A(EF(AG((((p36==1)&&(p196==1))&&((p15==1)&&(p179==1))))) U (((p118==1)&&(p190==1))&&(!((p101==1)&&(p176==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!((((p118==1)&&(p190==1))&&(!((p101==1)&&(p176==1))))) U (!(E(TRUE U !(E(TRUE U !((((p36==1)&&(p...325
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 16/0/7
(forward)formula 0,0,0.012226,3972,1,0,10,432,30,5,388,269,13
FORMULA DLCround-PT-08a-CTLFireability-2024-11 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 : 186/186 places, 238/238 transitions.
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 117 transition count 238
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 86 place count 100 transition count 204
Iterating global reduction 1 with 17 rules applied. Total rules applied 103 place count 100 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 104 place count 100 transition count 203
Applied a total of 104 rules in 2 ms. Remains 100 /186 variables (removed 86) and now considering 203/238 (removed 35) transitions.
[2024-05-22 09:05:40] [INFO ] Flow matrix only has 158 transitions (discarded 45 similar events)
// Phase 1: matrix 158 rows 100 cols
[2024-05-22 09:05:40] [INFO ] Computed 18 invariants in 0 ms
[2024-05-22 09:05:40] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 09:05:40] [INFO ] Flow matrix only has 158 transitions (discarded 45 similar events)
[2024-05-22 09:05:40] [INFO ] Invariant cache hit.
[2024-05-22 09:05:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 09:05:41] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2024-05-22 09:05:41] [INFO ] Flow matrix only has 158 transitions (discarded 45 similar events)
[2024-05-22 09:05:41] [INFO ] Invariant cache hit.
[2024-05-22 09:05:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (OVERLAPS) 5/100 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 157/257 variables, 100/118 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (OVERLAPS) 1/258 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (OVERLAPS) 0/258 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 119 constraints, problems are : Problem set: 0 solved, 202 unsolved in 7956 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 100/100 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (OVERLAPS) 5/100 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 157/257 variables, 100/118 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 202/320 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (OVERLAPS) 1/258 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (OVERLAPS) 0/258 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 321 constraints, problems are : Problem set: 0 solved, 202 unsolved in 6355 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 100/100 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
After SMT, in 14359ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 14362ms
Starting structural reductions in LTL mode, iteration 1 : 100/186 places, 203/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14576 ms. Remains : 100/186 places, 203/238 transitions.
[2024-05-22 09:05:55] [INFO ] Flatten gal took : 6 ms
[2024-05-22 09:05:55] [INFO ] Flatten gal took : 5 ms
[2024-05-22 09:05:55] [INFO ] Input system was already deterministic with 203 transitions.
[2024-05-22 09:05:55] [INFO ] Flatten gal took : 5 ms
[2024-05-22 09:05:55] [INFO ] Flatten gal took : 4 ms
[2024-05-22 09:05:55] [INFO ] Time to serialize gal into /tmp/CTLFireability8711377412754507890.gal : 2 ms
[2024-05-22 09:05:55] [INFO ] Time to serialize properties into /tmp/CTLFireability17957615916391571040.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/CTLFireability8711377412754507890.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17957615916391571040.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.06168e+11,0.032046,4196,2,281,5,1126,6,0,544,806,0


Converting to forward existential form...Done !
original formula: A(EF((AG((((p29==1)&&(p194==1))||(!((p46==1)&&(p203==1))))) * (E(AF((p40==1)) U !(((p38==1)&&(p124==1)))) + EX(AG(((p37==1)&&(p125==1))))...187
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(((p72==1)&&(p226==1))))))))) * !(E(!(!(EX(!(((p72==1)&&(p226==1)))))) U (!(E(TRUE U (!(E...368
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.1289,6888,1,0,13,16650,34,4,2416,5549,23
FORMULA DLCround-PT-08a-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 238/238 transitions.
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 120 transition count 238
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 82 place count 104 transition count 206
Iterating global reduction 1 with 16 rules applied. Total rules applied 98 place count 104 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 99 place count 104 transition count 205
Applied a total of 99 rules in 3 ms. Remains 104 /186 variables (removed 82) and now considering 205/238 (removed 33) transitions.
[2024-05-22 09:05:55] [INFO ] Flow matrix only has 159 transitions (discarded 46 similar events)
// Phase 1: matrix 159 rows 104 cols
[2024-05-22 09:05:55] [INFO ] Computed 21 invariants in 1 ms
[2024-05-22 09:05:55] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 09:05:55] [INFO ] Flow matrix only has 159 transitions (discarded 46 similar events)
[2024-05-22 09:05:55] [INFO ] Invariant cache hit.
[2024-05-22 09:05:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 09:05:55] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2024-05-22 09:05:55] [INFO ] Flow matrix only has 159 transitions (discarded 46 similar events)
[2024-05-22 09:05:55] [INFO ] Invariant cache hit.
[2024-05-22 09:05:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (OVERLAPS) 8/104 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 158/262 variables, 104/125 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (OVERLAPS) 1/263 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (OVERLAPS) 0/263 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 126 constraints, problems are : Problem set: 0 solved, 204 unsolved in 7888 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 104/104 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (OVERLAPS) 8/104 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 158/262 variables, 104/125 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 204/329 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 1/263 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 10 (OVERLAPS) 0/263 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 330 constraints, problems are : Problem set: 0 solved, 204 unsolved in 6717 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 104/104 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
After SMT, in 14632ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 14634ms
Starting structural reductions in LTL mode, iteration 1 : 104/186 places, 205/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14844 ms. Remains : 104/186 places, 205/238 transitions.
[2024-05-22 09:06:10] [INFO ] Flatten gal took : 9 ms
[2024-05-22 09:06:10] [INFO ] Flatten gal took : 4 ms
[2024-05-22 09:06:10] [INFO ] Input system was already deterministic with 205 transitions.
[2024-05-22 09:06:10] [INFO ] Flatten gal took : 5 ms
[2024-05-22 09:06:10] [INFO ] Flatten gal took : 5 ms
[2024-05-22 09:06:10] [INFO ] Time to serialize gal into /tmp/CTLFireability4066303710106828882.gal : 2 ms
[2024-05-22 09:06:10] [INFO ] Time to serialize properties into /tmp/CTLFireability163081540500885254.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/CTLFireability4066303710106828882.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability163081540500885254.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,1.27402e+11,0.035297,4212,2,290,5,1160,6,0,552,825,0


Converting to forward existential form...Done !
original formula: AX(((p72==0) * ((AG(((p7==1)&&(p152==1))) + (p56==0)) + ((p210==0) + ((!(E(E(((p25==1)&&(p125==1)) U ((p76==1)&&(p154==1))) U EF(((p94==1...256
=> equivalent forward existential formula: ([(EY(Init) * !((p72==0)))] = FALSE * (([(FwdU(FwdU(((EY(Init) * !((!(E(TRUE U !(((p7==1)&&(p152==1))))) + (p56=...556
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 201/4/4
(forward)formula 0,1,0.170648,6640,1,0,22,14040,37,7,2625,3278,16
FORMULA DLCround-PT-08a-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 186/186 places, 238/238 transitions.
Graph (trivial) has 186 edges and 186 vertex of which 70 / 186 are part of one of the 11 SCC in 0 ms
Free SCC test removed 59 places
Ensure Unique test removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Graph (complete) has 187 edges and 127 vertex of which 61 are kept as prefixes of interest. Removing 66 places using SCC suffix rule.1 ms
Discarding 66 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 61 transition count 98
Reduce places removed 3 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 10 rules applied. Total rules applied 15 place count 58 transition count 91
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 25 place count 51 transition count 88
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 32 place count 44 transition count 78
Iterating global reduction 3 with 7 rules applied. Total rules applied 39 place count 44 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 45 place count 44 transition count 72
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 48 place count 44 transition count 72
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 51 place count 41 transition count 69
Iterating global reduction 3 with 3 rules applied. Total rules applied 54 place count 41 transition count 69
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 57 place count 41 transition count 66
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 59 place count 41 transition count 64
Applied a total of 59 rules in 16 ms. Remains 41 /186 variables (removed 145) and now considering 64/238 (removed 174) transitions.
[2024-05-22 09:06:10] [INFO ] Flow matrix only has 41 transitions (discarded 23 similar events)
// Phase 1: matrix 41 rows 41 cols
[2024-05-22 09:06:10] [INFO ] Computed 17 invariants in 1 ms
[2024-05-22 09:06:10] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-22 09:06:10] [INFO ] Flow matrix only has 41 transitions (discarded 23 similar events)
[2024-05-22 09:06:10] [INFO ] Invariant cache hit.
[2024-05-22 09:06:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 09:06:10] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-05-22 09:06:10] [INFO ] Redundant transitions in 1 ms returned []
Running 63 sub problems to find dead transitions.
[2024-05-22 09:06:10] [INFO ] Flow matrix only has 41 transitions (discarded 23 similar events)
[2024-05-22 09:06:10] [INFO ] Invariant cache hit.
[2024-05-22 09:06:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/33 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 8/41 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 40/81 variables, 41/58 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 1/82 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 0/82 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 59 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1364 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/33 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 8/41 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 40/81 variables, 41/58 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 63/121 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 1/82 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/82 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 122 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1181 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 2567ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 2568ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/186 places, 64/238 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2770 ms. Remains : 41/186 places, 64/238 transitions.
[2024-05-22 09:06:13] [INFO ] Flatten gal took : 1 ms
[2024-05-22 09:06:13] [INFO ] Flatten gal took : 1 ms
[2024-05-22 09:06:13] [INFO ] Input system was already deterministic with 64 transitions.
[2024-05-22 09:06:13] [INFO ] Flatten gal took : 2 ms
[2024-05-22 09:06:13] [INFO ] Flatten gal took : 1 ms
[2024-05-22 09:06:13] [INFO ] Time to serialize gal into /tmp/CTLFireability11041045041160469710.gal : 1 ms
[2024-05-22 09:06:13] [INFO ] Time to serialize properties into /tmp/CTLFireability14831998184139536938.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/CTLFireability11041045041160469710.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14831998184139536938.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,29161,0.00866,3604,2,105,5,355,6,0,180,239,0


Converting to forward existential form...Done !
original formula: E(((!((E((((p14==1)&&(p178==1))&&((p106==1)&&(p182==1))) U !(((p7==1)&&(p167==1)))) * E(((p116==1)&&(p262==1)) U ((p47==1)&&(p224==1)))))...233
=> equivalent forward existential formula: [(FwdU(Init,((!((E((((p14==1)&&(p178==1))&&((p106==1)&&(p182==1))) U !(((p7==1)&&(p167==1)))) * E(((p116==1)&&(p...279
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 61/3/3
Hit Full ! (commute/partial/dont) 56/22/8
(forward)formula 0,1,0.077501,5240,1,0,70,7417,34,45,964,12715,74
FORMULA DLCround-PT-08a-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 186/186 places, 238/238 transitions.
Graph (trivial) has 207 edges and 186 vertex of which 88 / 186 are part of one of the 12 SCC in 0 ms
Free SCC test removed 76 places
Ensure Unique test removed 175 transitions
Reduce isomorphic transitions removed 175 transitions.
Graph (complete) has 149 edges and 110 vertex of which 42 are kept as prefixes of interest. Removing 68 places using SCC suffix rule.0 ms
Discarding 68 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 42 transition count 62
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 41 transition count 60
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 39 transition count 60
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 18 place count 29 transition count 47
Iterating global reduction 3 with 10 rules applied. Total rules applied 28 place count 29 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 30 place count 29 transition count 45
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 32 place count 28 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 34 place count 28 transition count 42
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 35 place count 28 transition count 42
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 36 place count 27 transition count 41
Iterating global reduction 5 with 1 rules applied. Total rules applied 37 place count 27 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 38 place count 27 transition count 40
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 39 place count 27 transition count 39
Applied a total of 39 rules in 14 ms. Remains 27 /186 variables (removed 159) and now considering 39/238 (removed 199) transitions.
[2024-05-22 09:06:13] [INFO ] Flow matrix only has 25 transitions (discarded 14 similar events)
// Phase 1: matrix 25 rows 27 cols
[2024-05-22 09:06:13] [INFO ] Computed 12 invariants in 0 ms
[2024-05-22 09:06:13] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-22 09:06:13] [INFO ] Flow matrix only has 25 transitions (discarded 14 similar events)
[2024-05-22 09:06:13] [INFO ] Invariant cache hit.
[2024-05-22 09:06:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 09:06:13] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-22 09:06:13] [INFO ] Redundant transitions in 1 ms returned []
Running 38 sub problems to find dead transitions.
[2024-05-22 09:06:13] [INFO ] Flow matrix only has 25 transitions (discarded 14 similar events)
[2024-05-22 09:06:13] [INFO ] Invariant cache hit.
[2024-05-22 09:06:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 6/27 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 24/51 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 1/52 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 40 constraints, problems are : Problem set: 0 solved, 38 unsolved in 665 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 27/27 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 6/27 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 24/51 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 38/77 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 1/52 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/52 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 78 constraints, problems are : Problem set: 0 solved, 38 unsolved in 609 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 27/27 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
After SMT, in 1306ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1307ms
Starting structural reductions in SI_CTL mode, iteration 1 : 27/186 places, 39/238 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1422 ms. Remains : 27/186 places, 39/238 transitions.
[2024-05-22 09:06:15] [INFO ] Flatten gal took : 1 ms
[2024-05-22 09:06:15] [INFO ] Flatten gal took : 1 ms
[2024-05-22 09:06:15] [INFO ] Input system was already deterministic with 39 transitions.
[2024-05-22 09:06:15] [INFO ] Flatten gal took : 1 ms
[2024-05-22 09:06:15] [INFO ] Flatten gal took : 1 ms
[2024-05-22 09:06:15] [INFO ] Time to serialize gal into /tmp/CTLFireability17606795540454510406.gal : 1 ms
[2024-05-22 09:06:15] [INFO ] Time to serialize properties into /tmp/CTLFireability13526477413850940476.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/CTLFireability17606795540454510406.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13526477413850940476.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,649,0.005308,3484,2,64,5,221,6,0,114,143,0


Converting to forward existential form...Done !
original formula: AG((AG((((p97==0)||(p253==0))||((p62==0)||(p150==0)))) * (((AF(((p66==0)||(p216==0))) + (p104==0)) + ((p251==0)||(p84==0))) + (((p236==0)...181
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),TRUE) * !((((p97==0)||(p253==0))||((p62==0)||(p150==0)))))] = FALSE * [FwdG((((FwdU(Init...282
Hit Full ! (commute/partial/dont) 36/3/3
(forward)formula 0,0,0.012185,3800,1,0,16,1074,26,7,586,698,12
FORMULA DLCround-PT-08a-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-22 09:06:15] [INFO ] Flatten gal took : 6 ms
[2024-05-22 09:06:15] [INFO ] Flatten gal took : 6 ms
Total runtime 153076 ms.

BK_STOP 1716368775164

--------------------
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="DLCround-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 DLCround-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 r114-smll-171624275500194"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-08a.tgz
mv DLCround-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 ;