fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r114-smll-171624275400130
Last Updated
July 7, 2024

About the Execution of ITS-Tools for DLCround-PT-04a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
357.443 111675.00 138727.00 560.30 FTFTFFFFTTFFTTFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r114-smll-171624275400130.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-04a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-171624275400130
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 13:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 13 13:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 13:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Apr 13 13:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:37 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 200K 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-04a-CTLFireability-2024-00
FORMULA_NAME DLCround-PT-04a-CTLFireability-2024-01
FORMULA_NAME DLCround-PT-04a-CTLFireability-2024-02
FORMULA_NAME DLCround-PT-04a-CTLFireability-2024-03
FORMULA_NAME DLCround-PT-04a-CTLFireability-2024-04
FORMULA_NAME DLCround-PT-04a-CTLFireability-2024-05
FORMULA_NAME DLCround-PT-04a-CTLFireability-2024-06
FORMULA_NAME DLCround-PT-04a-CTLFireability-2024-07
FORMULA_NAME DLCround-PT-04a-CTLFireability-2024-08
FORMULA_NAME DLCround-PT-04a-CTLFireability-2024-09
FORMULA_NAME DLCround-PT-04a-CTLFireability-2024-10
FORMULA_NAME DLCround-PT-04a-CTLFireability-2024-11
FORMULA_NAME DLCround-PT-04a-CTLFireability-2023-12
FORMULA_NAME DLCround-PT-04a-CTLFireability-2023-13
FORMULA_NAME DLCround-PT-04a-CTLFireability-2023-14
FORMULA_NAME DLCround-PT-04a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716344057276

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-04a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 02:14:19] [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 02:14:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 02:14:19] [INFO ] Load time of PNML (sax parser for PT used): 354 ms
[2024-05-22 02:14:19] [INFO ] Transformed 139 places.
[2024-05-22 02:14:19] [INFO ] Transformed 823 transitions.
[2024-05-22 02:14:19] [INFO ] Found NUPN structural information;
[2024-05-22 02:14:19] [INFO ] Parsed PT model containing 139 places and 823 transitions and 3074 arcs in 546 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 91 transitions
Reduce redundant transitions removed 91 transitions.
FORMULA DLCround-PT-04a-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04a-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04a-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 68 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 732/732 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 136 transition count 714
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 136 transition count 714
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 9 place count 136 transition count 711
Drop transitions (Redundant composition of simpler transitions.) removed 240 transitions
Redundant transition composition rules discarded 240 transitions
Iterating global reduction 1 with 240 rules applied. Total rules applied 249 place count 136 transition count 471
Applied a total of 249 rules in 71 ms. Remains 136 /139 variables (removed 3) and now considering 471/732 (removed 261) transitions.
[2024-05-22 02:14:20] [INFO ] Flow matrix only has 116 transitions (discarded 355 similar events)
// Phase 1: matrix 116 rows 136 cols
[2024-05-22 02:14:20] [INFO ] Computed 69 invariants in 13 ms
[2024-05-22 02:14:20] [INFO ] Implicit Places using invariants in 578 ms returned [76, 78, 79, 83, 84, 85, 86, 88, 89, 90, 92, 98, 99, 100, 101, 104, 106, 107, 110, 111, 112, 114, 115, 117, 119, 123, 125, 126, 128, 131, 132]
Discarding 31 places :
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Implicit Place search using SMT only with invariants took 633 ms to find 31 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/139 places, 344/732 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 186 transitions
Redundant transition composition rules discarded 186 transitions
Iterating global reduction 0 with 186 rules applied. Total rules applied 186 place count 105 transition count 158
Applied a total of 186 rules in 9 ms. Remains 105 /105 variables (removed 0) and now considering 158/344 (removed 186) transitions.
[2024-05-22 02:14:20] [INFO ] Flow matrix only has 116 transitions (discarded 42 similar events)
// Phase 1: matrix 116 rows 105 cols
[2024-05-22 02:14:20] [INFO ] Computed 38 invariants in 3 ms
[2024-05-22 02:14:20] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-22 02:14:20] [INFO ] Flow matrix only has 116 transitions (discarded 42 similar events)
[2024-05-22 02:14:20] [INFO ] Invariant cache hit.
[2024-05-22 02:14:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:14:20] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 105/139 places, 158/732 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1059 ms. Remains : 105/139 places, 158/732 transitions.
Support contains 68 out of 105 places after structural reductions.
[2024-05-22 02:14:21] [INFO ] Flatten gal took : 67 ms
[2024-05-22 02:14:21] [INFO ] Flatten gal took : 25 ms
[2024-05-22 02:14:21] [INFO ] Input system was already deterministic with 158 transitions.
RANDOM walk for 40000 steps (8 resets) in 1274 ms. (31 steps per ms) remains 1/55 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 1/1 properties
[2024-05-22 02:14:22] [INFO ] Flow matrix only has 116 transitions (discarded 42 similar events)
[2024-05-22 02:14:22] [INFO ] Invariant cache hit.
[2024-05-22 02:14:22] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 92/105 variables, 35/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 115/220 variables, 105/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/221 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/221 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 144 constraints, problems are : Problem set: 0 solved, 1 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 105/105 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp44 is UNSAT
After SMT solving in domain Int declared 13/221 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 3/38 constraints, State Equation: 0/105 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 251ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2024-05-22 02:14:22] [INFO ] Flatten gal took : 11 ms
[2024-05-22 02:14:22] [INFO ] Flatten gal took : 11 ms
[2024-05-22 02:14:22] [INFO ] Input system was already deterministic with 158 transitions.
Computed a total of 30 stabilizing places and 1 stable transitions
Graph (complete) has 195 edges and 105 vertex of which 76 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 158/158 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 80 transition count 158
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 36 place count 69 transition count 136
Iterating global reduction 1 with 11 rules applied. Total rules applied 47 place count 69 transition count 136
Applied a total of 47 rules in 9 ms. Remains 69 /105 variables (removed 36) and now considering 136/158 (removed 22) transitions.
[2024-05-22 02:14:22] [INFO ] Flow matrix only has 105 transitions (discarded 31 similar events)
// Phase 1: matrix 105 rows 69 cols
[2024-05-22 02:14:22] [INFO ] Computed 13 invariants in 5 ms
[2024-05-22 02:14:22] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 02:14:22] [INFO ] Flow matrix only has 105 transitions (discarded 31 similar events)
[2024-05-22 02:14:22] [INFO ] Invariant cache hit.
[2024-05-22 02:14:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:14:22] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Running 135 sub problems to find dead transitions.
[2024-05-22 02:14:22] [INFO ] Flow matrix only has 105 transitions (discarded 31 similar events)
[2024-05-22 02:14:22] [INFO ] Invariant cache hit.
[2024-05-22 02:14:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 4/69 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 104/173 variables, 69/82 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (OVERLAPS) 1/174 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (OVERLAPS) 0/174 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 83 constraints, problems are : Problem set: 0 solved, 135 unsolved in 5806 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 4/69 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 104/173 variables, 69/82 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 135/217 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (OVERLAPS) 1/174 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 10 (OVERLAPS) 0/174 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 218 constraints, problems are : Problem set: 0 solved, 135 unsolved in 4148 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints]
After SMT, in 10020ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 10025ms
Starting structural reductions in LTL mode, iteration 1 : 69/105 places, 136/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10203 ms. Remains : 69/105 places, 136/158 transitions.
[2024-05-22 02:14:32] [INFO ] Flatten gal took : 11 ms
[2024-05-22 02:14:32] [INFO ] Flatten gal took : 10 ms
[2024-05-22 02:14:32] [INFO ] Input system was already deterministic with 136 transitions.
[2024-05-22 02:14:32] [INFO ] Flatten gal took : 11 ms
[2024-05-22 02:14:32] [INFO ] Flatten gal took : 10 ms
[2024-05-22 02:14:32] [INFO ] Time to serialize gal into /tmp/CTLFireability11147191107435778739.gal : 6 ms
[2024-05-22 02:14:32] [INFO ] Time to serialize properties into /tmp/CTLFireability8830747037679151541.ctl : 4 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/CTLFireability11147191107435778739.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8830747037679151541.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF(EX(E(!((((((p41==1)&&(p90==1))||((p34==1)&&(p84==1)))&&(p4==1))&&(p111==1))) U !(EF(((p23==1)&&(p85==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(E(!((((((p41==1)&&(p90==1))||((p34==1)&&(p84==1)))&&(p4==1))&&(p111==1))) U !(E(TRUE U ((p23==1)...181
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.073663,4660,1,0,8,6329,25,1,1758,1357,12
FORMULA DLCround-PT-04a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 158/158 transitions.
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 76 transition count 158
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 44 place count 61 transition count 128
Iterating global reduction 1 with 15 rules applied. Total rules applied 59 place count 61 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 61 transition count 127
Applied a total of 60 rules in 9 ms. Remains 61 /105 variables (removed 44) and now considering 127/158 (removed 31) transitions.
[2024-05-22 02:14:32] [INFO ] Flow matrix only has 100 transitions (discarded 27 similar events)
// Phase 1: matrix 100 rows 61 cols
[2024-05-22 02:14:32] [INFO ] Computed 9 invariants in 3 ms
[2024-05-22 02:14:32] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-22 02:14:32] [INFO ] Flow matrix only has 100 transitions (discarded 27 similar events)
[2024-05-22 02:14:32] [INFO ] Invariant cache hit.
[2024-05-22 02:14:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:14:32] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-05-22 02:14:32] [INFO ] Flow matrix only has 100 transitions (discarded 27 similar events)
[2024-05-22 02:14:32] [INFO ] Invariant cache hit.
[2024-05-22 02:14:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 99/160 variables, 61/70 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 0/161 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 71 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3435 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 99/160 variables, 61/70 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 126/196 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 1/161 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 0/161 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 197 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3131 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints]
After SMT, in 6610ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 6615ms
Starting structural reductions in LTL mode, iteration 1 : 61/105 places, 127/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6769 ms. Remains : 61/105 places, 127/158 transitions.
[2024-05-22 02:14:39] [INFO ] Flatten gal took : 10 ms
[2024-05-22 02:14:39] [INFO ] Flatten gal took : 8 ms
[2024-05-22 02:14:39] [INFO ] Input system was already deterministic with 127 transitions.
[2024-05-22 02:14:39] [INFO ] Flatten gal took : 6 ms
[2024-05-22 02:14:39] [INFO ] Flatten gal took : 6 ms
[2024-05-22 02:14:39] [INFO ] Time to serialize gal into /tmp/CTLFireability15503066886101340208.gal : 4 ms
[2024-05-22 02:14:39] [INFO ] Time to serialize properties into /tmp/CTLFireability13063170237905461212.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/CTLFireability15503066886101340208.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13063170237905461212.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,2.048e+07,0.016933,3844,2,162,5,703,6,0,345,500,0


Converting to forward existential form...Done !
original formula: AG(AX(EF(EG((p12==1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(TRUE U EG((p12==1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.045488,4424,1,0,7,5873,22,0,1483,1572,9
FORMULA DLCround-PT-04a-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 158/158 transitions.
Graph (trivial) has 143 edges and 105 vertex of which 66 / 105 are part of one of the 9 SCC in 4 ms
Free SCC test removed 57 places
Ensure Unique test removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Graph (complete) has 70 edges and 48 vertex of which 23 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 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 23 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 22 transition count 32
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 9 place count 17 transition count 26
Iterating global reduction 2 with 5 rules applied. Total rules applied 14 place count 17 transition count 26
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 16 place count 17 transition count 24
Applied a total of 16 rules in 22 ms. Remains 17 /105 variables (removed 88) and now considering 24/158 (removed 134) transitions.
[2024-05-22 02:14:39] [INFO ] Flow matrix only has 14 transitions (discarded 10 similar events)
// Phase 1: matrix 14 rows 17 cols
[2024-05-22 02:14:39] [INFO ] Computed 9 invariants in 0 ms
[2024-05-22 02:14:39] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-22 02:14:39] [INFO ] Flow matrix only has 14 transitions (discarded 10 similar events)
[2024-05-22 02:14:39] [INFO ] Invariant cache hit.
[2024-05-22 02:14:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:14:39] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-22 02:14:39] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
[2024-05-22 02:14:39] [INFO ] Flow matrix only has 14 transitions (discarded 10 similar events)
[2024-05-22 02:14:39] [INFO ] Invariant cache hit.
[2024-05-22 02:14:39] [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, 23 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 4/17 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 13/30 variables, 17/26 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 1/31 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 0/31 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 27 constraints, problems are : Problem set: 0 solved, 23 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 4/17 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 13/30 variables, 17/26 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 23/49 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 1/31 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/31 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 0/31 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 50 constraints, problems are : Problem set: 0 solved, 23 unsolved in 492 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
After SMT, in 870ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 871ms
Starting structural reductions in SI_CTL mode, iteration 1 : 17/105 places, 24/158 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 951 ms. Remains : 17/105 places, 24/158 transitions.
[2024-05-22 02:14:40] [INFO ] Flatten gal took : 3 ms
[2024-05-22 02:14:40] [INFO ] Flatten gal took : 2 ms
[2024-05-22 02:14:40] [INFO ] Input system was already deterministic with 24 transitions.
[2024-05-22 02:14:40] [INFO ] Flatten gal took : 2 ms
[2024-05-22 02:14:40] [INFO ] Flatten gal took : 2 ms
[2024-05-22 02:14:40] [INFO ] Time to serialize gal into /tmp/CTLFireability4221715594609026883.gal : 1 ms
[2024-05-22 02:14:40] [INFO ] Time to serialize properties into /tmp/CTLFireability15462830194614547985.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/CTLFireability4221715594609026883.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15462830194614547985.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,41,0.005545,3400,2,41,5,130,6,0,69,84,0


Converting to forward existential form...Done !
original formula: EF(AG((((p51==0)||(p127==0)) + (A(((p39==1)&&(p125==1)) U ((p23==1)&&(p85==1))) * EG(((p73==0)||(p138==0)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((p51==0)||(p127==0)) + (!((E(!(((p23==1)&&(p85==1))) U (!(((p39==1)&&(p125==1...262
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 20/0/4
(forward)formula 0,0,0.021007,3980,1,0,14,572,36,4,397,429,15
FORMULA DLCround-PT-04a-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 158/158 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 83 transition count 158
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 34 place count 71 transition count 134
Iterating global reduction 1 with 12 rules applied. Total rules applied 46 place count 71 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 71 transition count 133
Applied a total of 47 rules in 7 ms. Remains 71 /105 variables (removed 34) and now considering 133/158 (removed 25) transitions.
[2024-05-22 02:14:40] [INFO ] Flow matrix only has 103 transitions (discarded 30 similar events)
// Phase 1: matrix 103 rows 71 cols
[2024-05-22 02:14:40] [INFO ] Computed 16 invariants in 1 ms
[2024-05-22 02:14:40] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-22 02:14:40] [INFO ] Flow matrix only has 103 transitions (discarded 30 similar events)
[2024-05-22 02:14:40] [INFO ] Invariant cache hit.
[2024-05-22 02:14:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:14:40] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-05-22 02:14:40] [INFO ] Flow matrix only has 103 transitions (discarded 30 similar events)
[2024-05-22 02:14:40] [INFO ] Invariant cache hit.
[2024-05-22 02:14:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (OVERLAPS) 7/71 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 102/173 variables, 71/87 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 1/174 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/174 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 88 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4668 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (OVERLAPS) 7/71 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 102/173 variables, 71/87 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 132/219 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 1/174 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (OVERLAPS) 0/174 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 220 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4307 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 9013ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 9017ms
Starting structural reductions in LTL mode, iteration 1 : 71/105 places, 133/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9147 ms. Remains : 71/105 places, 133/158 transitions.
[2024-05-22 02:14:49] [INFO ] Flatten gal took : 9 ms
[2024-05-22 02:14:49] [INFO ] Flatten gal took : 8 ms
[2024-05-22 02:14:49] [INFO ] Input system was already deterministic with 133 transitions.
[2024-05-22 02:14:49] [INFO ] Flatten gal took : 9 ms
[2024-05-22 02:14:49] [INFO ] Flatten gal took : 8 ms
[2024-05-22 02:14:49] [INFO ] Time to serialize gal into /tmp/CTLFireability1244167206614038519.gal : 4 ms
[2024-05-22 02:14:49] [INFO ] Time to serialize properties into /tmp/CTLFireability10503291989200031419.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/CTLFireability1244167206614038519.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10503291989200031419.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(E((A(!(A(((p36==1)&&(p121==1)) U ((p11==1)&&(p105==1)))) U (AF(((p14==1)&&(p105==1))) + (((p72==1)&&(p136==1))&&((p67==1)&&(p125==1)))...260
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((!((E(!((!(EG(!(((p14==1)&&(p105==1))))) + (((p72==1)&&(p136==1))&&((p67==1)&&(p125==1))...614
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.054116,5004,1,0,8,6289,23,0,1574,1090,11
FORMULA DLCround-PT-04a-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 158/158 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 79 transition count 158
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 39 place count 66 transition count 132
Iterating global reduction 1 with 13 rules applied. Total rules applied 52 place count 66 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 66 transition count 131
Applied a total of 53 rules in 6 ms. Remains 66 /105 variables (removed 39) and now considering 131/158 (removed 27) transitions.
[2024-05-22 02:14:49] [INFO ] Flow matrix only has 102 transitions (discarded 29 similar events)
// Phase 1: matrix 102 rows 66 cols
[2024-05-22 02:14:49] [INFO ] Computed 12 invariants in 1 ms
[2024-05-22 02:14:50] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 02:14:50] [INFO ] Flow matrix only has 102 transitions (discarded 29 similar events)
[2024-05-22 02:14:50] [INFO ] Invariant cache hit.
[2024-05-22 02:14:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:14:50] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-05-22 02:14:50] [INFO ] Flow matrix only has 102 transitions (discarded 29 similar events)
[2024-05-22 02:14:50] [INFO ] Invariant cache hit.
[2024-05-22 02:14:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 3/66 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 101/167 variables, 66/78 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 1/168 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/168 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 79 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5078 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 3/66 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 101/167 variables, 66/78 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 130/208 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 1/168 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/168 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 209 constraints, problems are : Problem set: 0 solved, 130 unsolved in 4104 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
After SMT, in 9213ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 9216ms
Starting structural reductions in LTL mode, iteration 1 : 66/105 places, 131/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9361 ms. Remains : 66/105 places, 131/158 transitions.
[2024-05-22 02:14:59] [INFO ] Flatten gal took : 8 ms
[2024-05-22 02:14:59] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:14:59] [INFO ] Input system was already deterministic with 131 transitions.
[2024-05-22 02:14:59] [INFO ] Flatten gal took : 4 ms
[2024-05-22 02:14:59] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:14:59] [INFO ] Time to serialize gal into /tmp/CTLFireability5187272566942937317.gal : 2 ms
[2024-05-22 02:14:59] [INFO ] Time to serialize properties into /tmp/CTLFireability8562269304587957778.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/CTLFireability5187272566942937317.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8562269304587957778.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,2.7648e+07,0.027247,3884,2,185,5,735,6,0,358,519,0


Converting to forward existential form...Done !
original formula: EX((AG(AX((((p57==0)||(p99==0))||((p64==0)||(p132==0))))) * ((p18==0)||(p83==0))))
=> equivalent forward existential formula: [((EY(Init) * ((p18==0)||(p83==0))) * !(E(TRUE U !(!(EX(!((((p57==0)||(p99==0))||((p64==0)||(p132==0))))))))))] ...163
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.070024,4464,1,0,7,5844,15,0,1508,1076,6
FORMULA DLCround-PT-04a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 158/158 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 79 transition count 158
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 38 place count 67 transition count 134
Iterating global reduction 1 with 12 rules applied. Total rules applied 50 place count 67 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 67 transition count 133
Applied a total of 51 rules in 5 ms. Remains 67 /105 variables (removed 38) and now considering 133/158 (removed 25) transitions.
[2024-05-22 02:14:59] [INFO ] Flow matrix only has 103 transitions (discarded 30 similar events)
// Phase 1: matrix 103 rows 67 cols
[2024-05-22 02:14:59] [INFO ] Computed 12 invariants in 2 ms
[2024-05-22 02:14:59] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 02:14:59] [INFO ] Flow matrix only has 103 transitions (discarded 30 similar events)
[2024-05-22 02:14:59] [INFO ] Invariant cache hit.
[2024-05-22 02:14:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:14:59] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-05-22 02:14:59] [INFO ] Flow matrix only has 103 transitions (discarded 30 similar events)
[2024-05-22 02:14:59] [INFO ] Invariant cache hit.
[2024-05-22 02:14:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (OVERLAPS) 3/67 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 102/169 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 1/170 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/170 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 80 constraints, problems are : Problem set: 0 solved, 132 unsolved in 5120 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 67/67 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (OVERLAPS) 3/67 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 102/169 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 132/211 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 1/170 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (OVERLAPS) 0/170 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 212 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4942 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 67/67 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 10086ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 10088ms
Starting structural reductions in LTL mode, iteration 1 : 67/105 places, 133/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10225 ms. Remains : 67/105 places, 133/158 transitions.
[2024-05-22 02:15:09] [INFO ] Flatten gal took : 9 ms
[2024-05-22 02:15:09] [INFO ] Flatten gal took : 8 ms
[2024-05-22 02:15:09] [INFO ] Input system was already deterministic with 133 transitions.
[2024-05-22 02:15:09] [INFO ] Flatten gal took : 8 ms
[2024-05-22 02:15:09] [INFO ] Flatten gal took : 7 ms
[2024-05-22 02:15:09] [INFO ] Time to serialize gal into /tmp/CTLFireability8804182411752988128.gal : 2 ms
[2024-05-22 02:15:09] [INFO ] Time to serialize properties into /tmp/CTLFireability10507643012408897290.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/CTLFireability8804182411752988128.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10507643012408897290.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.88e+07,0.030273,3892,2,200,5,917,6,0,363,642,0


Converting to forward existential form...Done !
original formula: AF(EX(E((EX(((p46==1)&&(p94==1))) + !(AX((p34==1)))) U (AX(((p72==1)&&(p137==1))) * ((!((p45==1)&&(p123==1)))||((p71==1)&&(p137==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(E((EX(((p46==1)&&(p94==1))) + !(!(EX(!((p34==1)))))) U (!(EX(!(((p72==1)&&(p137==1))))) * ((!((p...212
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.101117,5264,1,0,11,8571,22,2,1598,2761,15
FORMULA DLCround-PT-04a-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 158/158 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 83 transition count 158
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 73 transition count 138
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 73 transition count 138
Applied a total of 42 rules in 7 ms. Remains 73 /105 variables (removed 32) and now considering 138/158 (removed 20) transitions.
[2024-05-22 02:15:09] [INFO ] Flow matrix only has 106 transitions (discarded 32 similar events)
// Phase 1: matrix 106 rows 73 cols
[2024-05-22 02:15:09] [INFO ] Computed 16 invariants in 1 ms
[2024-05-22 02:15:09] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 02:15:09] [INFO ] Flow matrix only has 106 transitions (discarded 32 similar events)
[2024-05-22 02:15:09] [INFO ] Invariant cache hit.
[2024-05-22 02:15:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:15:10] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 137 sub problems to find dead transitions.
[2024-05-22 02:15:10] [INFO ] Flow matrix only has 106 transitions (discarded 32 similar events)
[2024-05-22 02:15:10] [INFO ] Invariant cache hit.
[2024-05-22 02:15:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 7/73 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (OVERLAPS) 105/178 variables, 73/89 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 1/179 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (OVERLAPS) 0/179 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 90 constraints, problems are : Problem set: 0 solved, 137 unsolved in 5667 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 7/73 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (OVERLAPS) 105/178 variables, 73/89 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 137/226 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (OVERLAPS) 1/179 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 10 (OVERLAPS) 0/179 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 227 constraints, problems are : Problem set: 0 solved, 137 unsolved in 3899 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints]
After SMT, in 9597ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 9601ms
Starting structural reductions in LTL mode, iteration 1 : 73/105 places, 138/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9779 ms. Remains : 73/105 places, 138/158 transitions.
[2024-05-22 02:15:19] [INFO ] Flatten gal took : 8 ms
[2024-05-22 02:15:19] [INFO ] Flatten gal took : 7 ms
[2024-05-22 02:15:19] [INFO ] Input system was already deterministic with 138 transitions.
[2024-05-22 02:15:19] [INFO ] Flatten gal took : 8 ms
[2024-05-22 02:15:19] [INFO ] Flatten gal took : 7 ms
[2024-05-22 02:15:19] [INFO ] Time to serialize gal into /tmp/CTLFireability6370248263007185796.gal : 2 ms
[2024-05-22 02:15:19] [INFO ] Time to serialize properties into /tmp/CTLFireability17173321554267679383.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/CTLFireability6370248263007185796.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17173321554267679383.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF((E(!(AF(((p57==1)&&(p97==1)))) U (((AG(((p51==1)&&(p100==1))) + AG(((p42==1)&&(p124==1)))) * AF((p4==1))) * (!(((p67==1)&&(p133==1))) ...276
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * E(!(!(EG(!(((p57==1)&&(p97==1)))))) U (((!(E(TRUE U !(((p51==1)&&(p100==1))))) + !(E(T...612
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 135/3/3
(forward)formula 0,0,0.118352,5548,1,0,16,8899,55,2,1738,2834,25
FORMULA DLCround-PT-04a-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 158/158 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 78 transition count 158
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 41 place count 64 transition count 130
Iterating global reduction 1 with 14 rules applied. Total rules applied 55 place count 64 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 64 transition count 129
Applied a total of 56 rules in 4 ms. Remains 64 /105 variables (removed 41) and now considering 129/158 (removed 29) transitions.
[2024-05-22 02:15:19] [INFO ] Flow matrix only has 101 transitions (discarded 28 similar events)
// Phase 1: matrix 101 rows 64 cols
[2024-05-22 02:15:19] [INFO ] Computed 11 invariants in 2 ms
[2024-05-22 02:15:19] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 02:15:19] [INFO ] Flow matrix only has 101 transitions (discarded 28 similar events)
[2024-05-22 02:15:19] [INFO ] Invariant cache hit.
[2024-05-22 02:15:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:15:19] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2024-05-22 02:15:19] [INFO ] Flow matrix only has 101 transitions (discarded 28 similar events)
[2024-05-22 02:15:19] [INFO ] Invariant cache hit.
[2024-05-22 02:15:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 2/64 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 100/164 variables, 64/75 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 1/165 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 0/165 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 76 constraints, problems are : Problem set: 0 solved, 128 unsolved in 5612 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 2/64 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 100/164 variables, 64/75 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 128/203 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 1/165 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 0/165 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 204 constraints, problems are : Problem set: 0 solved, 128 unsolved in 4998 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 10641ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 10643ms
Starting structural reductions in LTL mode, iteration 1 : 64/105 places, 129/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10775 ms. Remains : 64/105 places, 129/158 transitions.
[2024-05-22 02:15:30] [INFO ] Flatten gal took : 12 ms
[2024-05-22 02:15:30] [INFO ] Flatten gal took : 7 ms
[2024-05-22 02:15:30] [INFO ] Input system was already deterministic with 129 transitions.
[2024-05-22 02:15:30] [INFO ] Flatten gal took : 8 ms
[2024-05-22 02:15:30] [INFO ] Flatten gal took : 6 ms
[2024-05-22 02:15:30] [INFO ] Time to serialize gal into /tmp/CTLFireability1480119029644756904.gal : 1 ms
[2024-05-22 02:15:30] [INFO ] Time to serialize properties into /tmp/CTLFireability16829603728096828099.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/CTLFireability1480119029644756904.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16829603728096828099.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.304e+07,0.028798,3884,2,180,5,714,6,0,352,509,0


Converting to forward existential form...Done !
original formula: EF(EX(EG((AG(((p67==1)&&(p121==1))) + AX(((p32==1)&&(p119==1)))))))
=> equivalent forward existential formula: [FwdG(EY(FwdU(Init,TRUE)),(!(E(TRUE U !(((p67==1)&&(p121==1))))) + !(EX(!(((p32==1)&&(p119==1)))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.078812,4728,1,0,8,6022,23,0,1541,1457,11
FORMULA DLCround-PT-04a-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 158/158 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 81 transition count 158
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 36 place count 69 transition count 134
Iterating global reduction 1 with 12 rules applied. Total rules applied 48 place count 69 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 49 place count 69 transition count 133
Applied a total of 49 rules in 6 ms. Remains 69 /105 variables (removed 36) and now considering 133/158 (removed 25) transitions.
[2024-05-22 02:15:30] [INFO ] Flow matrix only has 103 transitions (discarded 30 similar events)
// Phase 1: matrix 103 rows 69 cols
[2024-05-22 02:15:30] [INFO ] Computed 14 invariants in 1 ms
[2024-05-22 02:15:30] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 02:15:30] [INFO ] Flow matrix only has 103 transitions (discarded 30 similar events)
[2024-05-22 02:15:30] [INFO ] Invariant cache hit.
[2024-05-22 02:15:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:15:30] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-05-22 02:15:30] [INFO ] Flow matrix only has 103 transitions (discarded 30 similar events)
[2024-05-22 02:15:30] [INFO ] Invariant cache hit.
[2024-05-22 02:15:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (OVERLAPS) 5/69 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 102/171 variables, 69/83 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 1/172 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/172 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 84 constraints, problems are : Problem set: 0 solved, 132 unsolved in 5492 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (OVERLAPS) 5/69 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 102/171 variables, 69/83 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 132/215 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 1/172 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (OVERLAPS) 0/172 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 216 constraints, problems are : Problem set: 0 solved, 132 unsolved in 5317 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 10841ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 10844ms
Starting structural reductions in LTL mode, iteration 1 : 69/105 places, 133/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11030 ms. Remains : 69/105 places, 133/158 transitions.
[2024-05-22 02:15:41] [INFO ] Flatten gal took : 7 ms
[2024-05-22 02:15:41] [INFO ] Flatten gal took : 7 ms
[2024-05-22 02:15:41] [INFO ] Input system was already deterministic with 133 transitions.
[2024-05-22 02:15:41] [INFO ] Flatten gal took : 7 ms
[2024-05-22 02:15:41] [INFO ] Flatten gal took : 6 ms
[2024-05-22 02:15:41] [INFO ] Time to serialize gal into /tmp/CTLFireability17367236756227542878.gal : 2 ms
[2024-05-22 02:15:41] [INFO ] Time to serialize properties into /tmp/CTLFireability5221641719859148678.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/CTLFireability17367236756227542878.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5221641719859148678.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.916e+07,0.02779,3896,2,192,5,762,6,0,365,540,0


Converting to forward existential form...Done !
original formula: (EF(((p34==1)&&(p80==1))) + AF((AG((EX(((p62==0)||(p106==0))) + !(E(((p53==1)&&(p98==1)) U ((p42==1)&&(p123==1)))))) * AF(((AG((p40==1)) ...182
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U ((p34==1)&&(p80==1))))),!((!(E(TRUE U !((EX(((p62==0)||(p106==0))) + !(E(((p53==1)&&(p9...266
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.081255,5004,1,0,9,6033,23,0,1617,1181,14
FORMULA DLCround-PT-04a-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 158/158 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 81 transition count 158
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 35 place count 70 transition count 136
Iterating global reduction 1 with 11 rules applied. Total rules applied 46 place count 70 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 70 transition count 135
Applied a total of 47 rules in 5 ms. Remains 70 /105 variables (removed 35) and now considering 135/158 (removed 23) transitions.
[2024-05-22 02:15:41] [INFO ] Flow matrix only has 104 transitions (discarded 31 similar events)
// Phase 1: matrix 104 rows 70 cols
[2024-05-22 02:15:41] [INFO ] Computed 14 invariants in 1 ms
[2024-05-22 02:15:41] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-22 02:15:41] [INFO ] Flow matrix only has 104 transitions (discarded 31 similar events)
[2024-05-22 02:15:41] [INFO ] Invariant cache hit.
[2024-05-22 02:15:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:15:42] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2024-05-22 02:15:42] [INFO ] Flow matrix only has 104 transitions (discarded 31 similar events)
[2024-05-22 02:15:42] [INFO ] Invariant cache hit.
[2024-05-22 02:15:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 5/70 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 103/173 variables, 70/84 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 1/174 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (OVERLAPS) 0/174 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 85 constraints, problems are : Problem set: 0 solved, 134 unsolved in 6155 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 5/70 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 103/173 variables, 70/84 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 134/218 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 1/174 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (OVERLAPS) 0/174 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 219 constraints, problems are : Problem set: 0 solved, 134 unsolved in 5315 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
After SMT, in 11497ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 11500ms
Starting structural reductions in LTL mode, iteration 1 : 70/105 places, 135/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11660 ms. Remains : 70/105 places, 135/158 transitions.
[2024-05-22 02:15:53] [INFO ] Flatten gal took : 10 ms
[2024-05-22 02:15:53] [INFO ] Flatten gal took : 7 ms
[2024-05-22 02:15:53] [INFO ] Input system was already deterministic with 135 transitions.
[2024-05-22 02:15:53] [INFO ] Flatten gal took : 6 ms
[2024-05-22 02:15:53] [INFO ] Flatten gal took : 6 ms
[2024-05-22 02:15:53] [INFO ] Time to serialize gal into /tmp/CTLFireability16192676096603508012.gal : 1 ms
[2024-05-22 02:15:53] [INFO ] Time to serialize properties into /tmp/CTLFireability12417232395569993901.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/CTLFireability16192676096603508012.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12417232395569993901.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(A(AX(((p39==1)&&(p125==1))) U ((EX((EX(((p69==1)&&(p138==1))) + AG((p41==1)))) + EX((p51!=1))) + (EG(((p55==1)&&(p130==1))) * ((!((p31...199
=> equivalent forward existential formula: ([((((FwdU(FwdU(Init,TRUE),!(((EX((EX(((p69==1)&&(p138==1))) + !(E(TRUE U !((p41==1)))))) + EX((p51!=1))) + (EG(...645
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.096987,5272,1,0,15,7445,31,4,1651,2112,16
FORMULA DLCround-PT-04a-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 158/158 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 78 transition count 158
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 39 place count 66 transition count 134
Iterating global reduction 1 with 12 rules applied. Total rules applied 51 place count 66 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 66 transition count 133
Applied a total of 52 rules in 6 ms. Remains 66 /105 variables (removed 39) and now considering 133/158 (removed 25) transitions.
[2024-05-22 02:15:53] [INFO ] Flow matrix only has 103 transitions (discarded 30 similar events)
// Phase 1: matrix 103 rows 66 cols
[2024-05-22 02:15:53] [INFO ] Computed 11 invariants in 1 ms
[2024-05-22 02:15:53] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 02:15:53] [INFO ] Flow matrix only has 103 transitions (discarded 30 similar events)
[2024-05-22 02:15:53] [INFO ] Invariant cache hit.
[2024-05-22 02:15:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:15:53] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-05-22 02:15:53] [INFO ] Flow matrix only has 103 transitions (discarded 30 similar events)
[2024-05-22 02:15:53] [INFO ] Invariant cache hit.
[2024-05-22 02:15:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 102/168 variables, 66/77 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 1/169 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/169 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 78 constraints, problems are : Problem set: 0 solved, 132 unsolved in 5706 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 102/168 variables, 66/77 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 132/209 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 1/169 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (OVERLAPS) 0/169 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 210 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4922 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 10653ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 10658ms
Starting structural reductions in LTL mode, iteration 1 : 66/105 places, 133/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10817 ms. Remains : 66/105 places, 133/158 transitions.
[2024-05-22 02:16:04] [INFO ] Flatten gal took : 8 ms
[2024-05-22 02:16:04] [INFO ] Flatten gal took : 6 ms
[2024-05-22 02:16:04] [INFO ] Input system was already deterministic with 133 transitions.
[2024-05-22 02:16:04] [INFO ] Flatten gal took : 6 ms
[2024-05-22 02:16:04] [INFO ] Flatten gal took : 6 ms
[2024-05-22 02:16:04] [INFO ] Time to serialize gal into /tmp/CTLFireability17654467668960884171.gal : 2 ms
[2024-05-22 02:16:04] [INFO ] Time to serialize properties into /tmp/CTLFireability5759946022299145031.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/CTLFireability17654467668960884171.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5759946022299145031.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.88e+07,0.032205,3892,2,186,5,744,6,0,362,528,0


Converting to forward existential form...Done !
original formula: AX((AX(((((p52==1)&&(p98==1))||(p59==0))||(p106==0))) * AF(EG(EF((p62==1))))))
=> equivalent forward existential formula: ([(EY(EY(Init)) * !(((((p52==1)&&(p98==1))||(p59==0))||(p106==0))))] = FALSE * [FwdG(EY(Init),!(EG(E(TRUE U (p62...173
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.0796,5000,1,0,13,5996,23,2,1589,1425,12
FORMULA DLCround-PT-04a-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 158/158 transitions.
Graph (trivial) has 136 edges and 105 vertex of which 60 / 105 are part of one of the 8 SCC in 1 ms
Free SCC test removed 52 places
Ensure Unique test removed 118 transitions
Reduce isomorphic transitions removed 118 transitions.
Graph (complete) has 77 edges and 53 vertex of which 28 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 0 output transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 28 transition count 37
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 25 transition count 37
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 21 transition count 32
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 21 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 21 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 21 transition count 30
Applied a total of 18 rules in 17 ms. Remains 21 /105 variables (removed 84) and now considering 30/158 (removed 128) transitions.
[2024-05-22 02:16:04] [INFO ] Flow matrix only has 19 transitions (discarded 11 similar events)
// Phase 1: matrix 19 rows 21 cols
[2024-05-22 02:16:04] [INFO ] Computed 10 invariants in 0 ms
[2024-05-22 02:16:04] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-22 02:16:04] [INFO ] Flow matrix only has 19 transitions (discarded 11 similar events)
[2024-05-22 02:16:04] [INFO ] Invariant cache hit.
[2024-05-22 02:16:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:16:04] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-05-22 02:16:04] [INFO ] Redundant transitions in 0 ms returned []
Running 29 sub problems to find dead transitions.
[2024-05-22 02:16:04] [INFO ] Flow matrix only has 19 transitions (discarded 11 similar events)
[2024-05-22 02:16:04] [INFO ] Invariant cache hit.
[2024-05-22 02:16:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 1/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 4/21 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 18/39 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 1/40 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/40 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 32 constraints, problems are : Problem set: 0 solved, 29 unsolved in 693 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 1/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 4/21 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 18/39 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 29/60 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 1/40 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 0/40 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 61 constraints, problems are : Problem set: 0 solved, 29 unsolved in 682 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
After SMT, in 1384ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 1385ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/105 places, 30/158 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1491 ms. Remains : 21/105 places, 30/158 transitions.
[2024-05-22 02:16:06] [INFO ] Flatten gal took : 2 ms
[2024-05-22 02:16:06] [INFO ] Flatten gal took : 2 ms
[2024-05-22 02:16:06] [INFO ] Input system was already deterministic with 30 transitions.
[2024-05-22 02:16:06] [INFO ] Flatten gal took : 1 ms
[2024-05-22 02:16:06] [INFO ] Flatten gal took : 1 ms
[2024-05-22 02:16:06] [INFO ] Time to serialize gal into /tmp/CTLFireability14358355757160683452.gal : 1 ms
[2024-05-22 02:16:06] [INFO ] Time to serialize properties into /tmp/CTLFireability10925132404227829030.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/CTLFireability14358355757160683452.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10925132404227829030.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,217,0.007376,3436,2,48,5,167,6,0,90,107,0


Converting to forward existential form...Done !
original formula: AG(A(EF(((p55==1)&&(p130==1))) U (EG(((p7==1)&&(p112==1))) * (A(AG((p61==1)) U !(((p34==1)&&(p80==1)))) + ((AG((p52==1)) * (p76==1)) * (p...167
=> equivalent forward existential formula: (([((FwdU(FwdU(Init,TRUE),!((EG(((p7==1)&&(p112==1))) * (!((E(!(!(((p34==1)&&(p80==1)))) U (!(!(E(TRUE U !((p61=...1959
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 26/4/4
(forward)formula 0,0,0.022874,4016,1,0,15,878,40,7,488,651,23
FORMULA DLCround-PT-04a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 158/158 transitions.
Graph (trivial) has 123 edges and 105 vertex of which 49 / 105 are part of one of the 9 SCC in 1 ms
Free SCC test removed 40 places
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Graph (complete) has 108 edges and 65 vertex of which 41 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 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 41 transition count 68
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 38 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 37 transition count 67
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 16 place count 31 transition count 58
Iterating global reduction 3 with 6 rules applied. Total rules applied 22 place count 31 transition count 58
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 26 place count 31 transition count 54
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 31 transition count 54
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 30 place count 29 transition count 52
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 29 transition count 52
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 34 place count 29 transition count 50
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 36 place count 29 transition count 48
Applied a total of 36 rules in 22 ms. Remains 29 /105 variables (removed 76) and now considering 48/158 (removed 110) transitions.
[2024-05-22 02:16:06] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
// Phase 1: matrix 30 rows 29 cols
[2024-05-22 02:16:06] [INFO ] Computed 11 invariants in 1 ms
[2024-05-22 02:16:06] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-22 02:16:06] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
[2024-05-22 02:16:06] [INFO ] Invariant cache hit.
[2024-05-22 02:16:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:16:06] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2024-05-22 02:16:06] [INFO ] Redundant transitions in 0 ms returned []
Running 47 sub problems to find dead transitions.
[2024-05-22 02:16:06] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
[2024-05-22 02:16:06] [INFO ] Invariant cache hit.
[2024-05-22 02:16:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 5/29 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 29/58 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 1/59 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/59 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 59/59 variables, and 41 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1306 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 29/29 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 5/29 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 29/58 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 47/87 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 1/59 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/59 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 59/59 variables, and 88 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1147 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 29/29 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
After SMT, in 2463ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 2463ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/105 places, 48/158 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2591 ms. Remains : 29/105 places, 48/158 transitions.
[2024-05-22 02:16:08] [INFO ] Flatten gal took : 3 ms
[2024-05-22 02:16:08] [INFO ] Flatten gal took : 3 ms
[2024-05-22 02:16:08] [INFO ] Input system was already deterministic with 48 transitions.
[2024-05-22 02:16:08] [INFO ] Flatten gal took : 2 ms
[2024-05-22 02:16:08] [INFO ] Flatten gal took : 2 ms
[2024-05-22 02:16:08] [INFO ] Time to serialize gal into /tmp/CTLFireability14763899727837507502.gal : 1 ms
[2024-05-22 02:16:08] [INFO ] Time to serialize properties into /tmp/CTLFireability9411953251315319733.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/CTLFireability14763899727837507502.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9411953251315319733.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,1081,0.009509,3524,2,66,5,251,6,0,130,163,0


Converting to forward existential form...Done !
original formula: EF((AF((EG(A(((p46==1)&&(p124==1)) U ((p57==1)&&(p99==1)))) * ((AF(((p37==1)&&(p123==1))) * ((p38==0)||(p84==0))) + (p73==1)))) + ((p61==...171
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EG(!((EG(!((E(!(((p57==1)&&(p99==1))) U (!(((p46==1)&&(p124==1))) * !(((p57==1)&&(p99==1)...335
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 41/0/7
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,0.033029,4104,1,0,18,1694,42,8,693,1217,16
FORMULA DLCround-PT-04a-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-22 02:16:08] [INFO ] Flatten gal took : 8 ms
[2024-05-22 02:16:08] [INFO ] Flatten gal took : 9 ms
Total runtime 109755 ms.

BK_STOP 1716344168951

--------------------
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-04a"
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-04a, 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-171624275400130"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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