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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 17:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 13 17:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 16:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K Apr 13 16:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 762K 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-11a-CTLFireability-2024-00
FORMULA_NAME DLCround-PT-11a-CTLFireability-2024-01
FORMULA_NAME DLCround-PT-11a-CTLFireability-2024-02
FORMULA_NAME DLCround-PT-11a-CTLFireability-2024-03
FORMULA_NAME DLCround-PT-11a-CTLFireability-2024-04
FORMULA_NAME DLCround-PT-11a-CTLFireability-2024-05
FORMULA_NAME DLCround-PT-11a-CTLFireability-2024-06
FORMULA_NAME DLCround-PT-11a-CTLFireability-2024-07
FORMULA_NAME DLCround-PT-11a-CTLFireability-2024-08
FORMULA_NAME DLCround-PT-11a-CTLFireability-2024-09
FORMULA_NAME DLCround-PT-11a-CTLFireability-2024-10
FORMULA_NAME DLCround-PT-11a-CTLFireability-2024-11
FORMULA_NAME DLCround-PT-11a-CTLFireability-2023-12
FORMULA_NAME DLCround-PT-11a-CTLFireability-2023-13
FORMULA_NAME DLCround-PT-11a-CTLFireability-2023-14
FORMULA_NAME DLCround-PT-11a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716388646968

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-11a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 14:37:29] [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 14:37:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 14:37:30] [INFO ] Load time of PNML (sax parser for PT used): 505 ms
[2024-05-22 14:37:30] [INFO ] Transformed 377 places.
[2024-05-22 14:37:30] [INFO ] Transformed 2993 transitions.
[2024-05-22 14:37:30] [INFO ] Found NUPN structural information;
[2024-05-22 14:37:30] [INFO ] Parsed PT model containing 377 places and 2993 transitions and 11677 arcs in 785 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 29 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 280 transitions
Reduce redundant transitions removed 280 transitions.
FORMULA DLCround-PT-11a-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 147 out of 377 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 377/377 places, 2713/2713 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 369 transition count 2585
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 369 transition count 2585
Drop transitions (Redundant composition of simpler transitions.) removed 906 transitions
Redundant transition composition rules discarded 906 transitions
Iterating global reduction 0 with 906 rules applied. Total rules applied 922 place count 369 transition count 1679
Applied a total of 922 rules in 294 ms. Remains 369 /377 variables (removed 8) and now considering 1679/2713 (removed 1034) transitions.
[2024-05-22 14:37:30] [INFO ] Flow matrix only has 226 transitions (discarded 1453 similar events)
// Phase 1: matrix 226 rows 369 cols
[2024-05-22 14:37:30] [INFO ] Computed 244 invariants in 26 ms
[2024-05-22 14:37:32] [INFO ] Implicit Places using invariants in 1931 ms returned [141, 143, 144, 145, 146, 147, 149, 150, 151, 155, 156, 157, 158, 159, 161, 162, 163, 165, 167, 169, 170, 171, 173, 174, 176, 179, 180, 181, 183, 184, 185, 187, 188, 189, 190, 191, 192, 193, 195, 197, 198, 199, 200, 204, 205, 206, 207, 209, 210, 211, 212, 214, 215, 216, 219, 221, 223, 224, 225, 226, 227, 228, 229, 235, 237, 241, 242, 244, 245, 247, 248, 249, 250, 251, 252, 254, 255, 256, 257, 259, 260, 262, 263, 265, 266, 268, 271, 272, 273, 274, 275, 276, 277, 278, 279, 281, 282, 283, 289, 290, 291, 293, 295, 296, 297, 298, 301, 303, 304, 305, 306, 308, 312, 313, 316, 317, 319, 321, 322, 325, 328, 329, 330, 331, 334, 335, 336, 338, 339, 340, 342, 343, 344, 345, 346, 348, 349, 351, 352, 354, 356, 357, 359, 360, 361, 362, 363, 364, 366]
Discarding 149 places :
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 842 transitions.
Implicit Place search using SMT only with invariants took 2004 ms to find 149 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 220/377 places, 837/2713 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 532 transitions
Redundant transition composition rules discarded 532 transitions
Iterating global reduction 0 with 532 rules applied. Total rules applied 532 place count 220 transition count 305
Applied a total of 532 rules in 14 ms. Remains 220 /220 variables (removed 0) and now considering 305/837 (removed 532) transitions.
[2024-05-22 14:37:32] [INFO ] Flow matrix only has 226 transitions (discarded 79 similar events)
// Phase 1: matrix 226 rows 220 cols
[2024-05-22 14:37:32] [INFO ] Computed 95 invariants in 7 ms
[2024-05-22 14:37:32] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-22 14:37:32] [INFO ] Flow matrix only has 226 transitions (discarded 79 similar events)
[2024-05-22 14:37:32] [INFO ] Invariant cache hit.
[2024-05-22 14:37:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 14:37:33] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 220/377 places, 305/2713 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2841 ms. Remains : 220/377 places, 305/2713 transitions.
Support contains 147 out of 220 places after structural reductions.
[2024-05-22 14:37:33] [INFO ] Flatten gal took : 101 ms
[2024-05-22 14:37:33] [INFO ] Flatten gal took : 41 ms
[2024-05-22 14:37:33] [INFO ] Input system was already deterministic with 305 transitions.
RANDOM walk for 40000 steps (8 resets) in 2340 ms. (17 steps per ms) remains 2/80 properties
BEST_FIRST walk for 40004 steps (8 resets) in 404 ms. (98 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 354 ms. (112 steps per ms) remains 1/2 properties
[2024-05-22 14:37:34] [INFO ] Flow matrix only has 226 transitions (discarded 79 similar events)
[2024-05-22 14:37:34] [INFO ] Invariant cache hit.
[2024-05-22 14:37:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp31 is UNSAT
After SMT solving in domain Real declared 13/446 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 3/95 constraints, State Equation: 0/220 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 124ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2024-05-22 14:37:35] [INFO ] Flatten gal took : 27 ms
[2024-05-22 14:37:35] [INFO ] Flatten gal took : 27 ms
[2024-05-22 14:37:35] [INFO ] Input system was already deterministic with 305 transitions.
Support contains 140 out of 220 places (down from 144) after GAL structural reductions.
Computed a total of 80 stabilizing places and 1 stable transitions
Graph (complete) has 399 edges and 220 vertex of which 141 are kept as prefixes of interest. Removing 79 places using SCC suffix rule.5 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 220/220 places, 305/305 transitions.
Graph (trivial) has 294 edges and 220 vertex of which 132 / 220 are part of one of the 16 SCC in 5 ms
Free SCC test removed 116 places
Ensure Unique test removed 269 transitions
Reduce isomorphic transitions removed 269 transitions.
Graph (complete) has 130 edges and 104 vertex of which 26 are kept as prefixes of interest. Removing 78 places using SCC suffix rule.1 ms
Discarding 78 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 26 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 25 transition count 35
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 19 place count 10 transition count 19
Iterating global reduction 2 with 15 rules applied. Total rules applied 34 place count 10 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 10 transition count 18
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 10 transition count 18
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 9 transition count 17
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 9 transition count 17
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 9 transition count 16
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 40 place count 9 transition count 15
Applied a total of 40 rules in 36 ms. Remains 9 /220 variables (removed 211) and now considering 15/305 (removed 290) transitions.
[2024-05-22 14:37:35] [INFO ] Flow matrix only has 10 transitions (discarded 5 similar events)
// Phase 1: matrix 10 rows 9 cols
[2024-05-22 14:37:35] [INFO ] Computed 3 invariants in 0 ms
[2024-05-22 14:37:35] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-22 14:37:35] [INFO ] Flow matrix only has 10 transitions (discarded 5 similar events)
[2024-05-22 14:37:35] [INFO ] Invariant cache hit.
[2024-05-22 14:37:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 14:37:35] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-22 14:37:35] [INFO ] Redundant transitions in 0 ms returned []
Running 14 sub problems to find dead transitions.
[2024-05-22 14:37:35] [INFO ] Flow matrix only has 10 transitions (discarded 5 similar events)
[2024-05-22 14:37:35] [INFO ] Invariant cache hit.
[2024-05-22 14:37:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 1/9 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 9/18 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/19 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/19 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 13 constraints, problems are : Problem set: 0 solved, 14 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 1/9 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 9/18 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 1/19 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/19 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/19 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 27 constraints, problems are : Problem set: 0 solved, 14 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 503ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 504ms
Starting structural reductions in SI_CTL mode, iteration 1 : 9/220 places, 15/305 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 608 ms. Remains : 9/220 places, 15/305 transitions.
[2024-05-22 14:37:35] [INFO ] Flatten gal took : 1 ms
[2024-05-22 14:37:35] [INFO ] Flatten gal took : 1 ms
[2024-05-22 14:37:35] [INFO ] Input system was already deterministic with 15 transitions.
[2024-05-22 14:37:35] [INFO ] Flatten gal took : 1 ms
[2024-05-22 14:37:35] [INFO ] Flatten gal took : 1 ms
[2024-05-22 14:37:35] [INFO ] Time to serialize gal into /tmp/CTLFireability17253717429316546417.gal : 1 ms
[2024-05-22 14:37:35] [INFO ] Time to serialize properties into /tmp/CTLFireability7389886558364660084.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17253717429316546417.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7389886558364660084.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,7,0.01329,3192,2,18,5,70,6,0,42,43,0


Converting to forward existential form...Done !
original formula: EF(AG(((p117==0)||(p307==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p117==0)||(p307==0))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.015032,3540,1,0,6,156,15,0,182,85,5
FORMULA DLCround-PT-11a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 305/305 transitions.
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 143 transition count 305
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 100 place count 120 transition count 259
Iterating global reduction 1 with 23 rules applied. Total rules applied 123 place count 120 transition count 259
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 127 place count 120 transition count 255
Applied a total of 127 rules in 7 ms. Remains 120 /220 variables (removed 100) and now considering 255/305 (removed 50) transitions.
[2024-05-22 14:37:36] [INFO ] Flow matrix only has 199 transitions (discarded 56 similar events)
// Phase 1: matrix 199 rows 120 cols
[2024-05-22 14:37:36] [INFO ] Computed 18 invariants in 1 ms
[2024-05-22 14:37:36] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 14:37:36] [INFO ] Flow matrix only has 199 transitions (discarded 56 similar events)
[2024-05-22 14:37:36] [INFO ] Invariant cache hit.
[2024-05-22 14:37:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 14:37:36] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 254 sub problems to find dead transitions.
[2024-05-22 14:37:36] [INFO ] Flow matrix only has 199 transitions (discarded 56 similar events)
[2024-05-22 14:37:36] [INFO ] Invariant cache hit.
[2024-05-22 14:37:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 2/120 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (OVERLAPS) 198/318 variables, 120/138 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 1/319 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 9 (OVERLAPS) 0/319 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 139 constraints, problems are : Problem set: 0 solved, 254 unsolved in 16629 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 120/120 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 2/120 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (OVERLAPS) 198/318 variables, 120/138 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 254/392 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (OVERLAPS) 1/319 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 10 (OVERLAPS) 0/319 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 393 constraints, problems are : Problem set: 0 solved, 254 unsolved in 13833 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 120/120 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
After SMT, in 30571ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 30591ms
Starting structural reductions in LTL mode, iteration 1 : 120/220 places, 255/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30781 ms. Remains : 120/220 places, 255/305 transitions.
[2024-05-22 14:38:06] [INFO ] Flatten gal took : 12 ms
[2024-05-22 14:38:06] [INFO ] Flatten gal took : 12 ms
[2024-05-22 14:38:06] [INFO ] Input system was already deterministic with 255 transitions.
[2024-05-22 14:38:06] [INFO ] Flatten gal took : 11 ms
[2024-05-22 14:38:06] [INFO ] Flatten gal took : 11 ms
[2024-05-22 14:38:06] [INFO ] Time to serialize gal into /tmp/CTLFireability4260494095901513789.gal : 7 ms
[2024-05-22 14:38:06] [INFO ] Time to serialize properties into /tmp/CTLFireability5274545592844529484.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4260494095901513789.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5274545592844529484.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.83184e+13,0.049793,4420,2,341,5,1379,6,0,674,999,0


Converting to forward existential form...Done !
original formula: E(((p36==1)&&(p248==1)) U !(AX(AG(!(((p114==1)&&(p340==1)))))))
=> equivalent forward existential formula: [(FwdU(EY(FwdU(Init,((p36==1)&&(p248==1)))),TRUE) * ((p114==1)&&(p340==1)))] != FALSE
Hit Full ! (commute/partial/dont) 251/4/4
(forward)formula 0,1,0.076364,4736,1,0,10,1622,16,1,1253,999,7
FORMULA DLCround-PT-11a-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 305/305 transitions.
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 144 transition count 305
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 98 place count 122 transition count 261
Iterating global reduction 1 with 22 rules applied. Total rules applied 120 place count 122 transition count 261
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 124 place count 122 transition count 257
Applied a total of 124 rules in 6 ms. Remains 122 /220 variables (removed 98) and now considering 257/305 (removed 48) transitions.
[2024-05-22 14:38:06] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
// Phase 1: matrix 200 rows 122 cols
[2024-05-22 14:38:06] [INFO ] Computed 19 invariants in 5 ms
[2024-05-22 14:38:07] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-22 14:38:07] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
[2024-05-22 14:38:07] [INFO ] Invariant cache hit.
[2024-05-22 14:38:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 14:38:07] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-05-22 14:38:07] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
[2024-05-22 14:38:07] [INFO ] Invariant cache hit.
[2024-05-22 14:38:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 3/122 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 199/321 variables, 122/141 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 1/322 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 0/322 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 142 constraints, problems are : Problem set: 0 solved, 256 unsolved in 15869 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 122/122 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 3/122 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 199/321 variables, 122/141 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 256/397 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (OVERLAPS) 1/322 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 10 (OVERLAPS) 0/322 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 398 constraints, problems are : Problem set: 0 solved, 256 unsolved in 13191 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 122/122 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 29118ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 29122ms
Starting structural reductions in LTL mode, iteration 1 : 122/220 places, 257/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29313 ms. Remains : 122/220 places, 257/305 transitions.
[2024-05-22 14:38:36] [INFO ] Flatten gal took : 11 ms
[2024-05-22 14:38:36] [INFO ] Flatten gal took : 10 ms
[2024-05-22 14:38:36] [INFO ] Input system was already deterministic with 257 transitions.
[2024-05-22 14:38:36] [INFO ] Flatten gal took : 9 ms
[2024-05-22 14:38:36] [INFO ] Flatten gal took : 8 ms
[2024-05-22 14:38:36] [INFO ] Time to serialize gal into /tmp/CTLFireability11338467516420142461.gal : 5 ms
[2024-05-22 14:38:36] [INFO ] Time to serialize properties into /tmp/CTLFireability6733786797994228111.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/CTLFireability11338467516420142461.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6733786797994228111.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,5.36871e+13,0.041278,4484,2,346,5,1400,6,0,680,1010,0


Converting to forward existential form...Done !
original formula: AG(EF((EF(AG(((p21==0)||(p209==0)))) + EX((((p101==1)&&(p322==1))&&((p104==0)||(p328==0)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (E(TRUE U !(E(TRUE U !(((p21==0)||(p209==0)))))) + EX((((p101==1)&&(p322==1))&&((...190
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.127807,6912,1,0,8,17367,16,0,2846,2123,9
FORMULA DLCround-PT-11a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 305/305 transitions.
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 142 transition count 305
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 101 place count 119 transition count 259
Iterating global reduction 1 with 23 rules applied. Total rules applied 124 place count 119 transition count 259
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 128 place count 119 transition count 255
Applied a total of 128 rules in 4 ms. Remains 119 /220 variables (removed 101) and now considering 255/305 (removed 50) transitions.
[2024-05-22 14:38:36] [INFO ] Flow matrix only has 199 transitions (discarded 56 similar events)
// Phase 1: matrix 199 rows 119 cols
[2024-05-22 14:38:36] [INFO ] Computed 17 invariants in 2 ms
[2024-05-22 14:38:36] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 14:38:36] [INFO ] Flow matrix only has 199 transitions (discarded 56 similar events)
[2024-05-22 14:38:36] [INFO ] Invariant cache hit.
[2024-05-22 14:38:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 14:38:36] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 254 sub problems to find dead transitions.
[2024-05-22 14:38:36] [INFO ] Flow matrix only has 199 transitions (discarded 56 similar events)
[2024-05-22 14:38:36] [INFO ] Invariant cache hit.
[2024-05-22 14:38:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 1/119 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (OVERLAPS) 198/317 variables, 119/136 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 1/318 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 9 (OVERLAPS) 0/318 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 137 constraints, problems are : Problem set: 0 solved, 254 unsolved in 17665 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 119/119 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 1/119 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (OVERLAPS) 198/317 variables, 119/136 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 254/390 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (OVERLAPS) 1/318 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 10 (OVERLAPS) 0/318 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 391 constraints, problems are : Problem set: 0 solved, 254 unsolved in 14556 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 119/119 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
After SMT, in 32268ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 32271ms
Starting structural reductions in LTL mode, iteration 1 : 119/220 places, 255/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32434 ms. Remains : 119/220 places, 255/305 transitions.
[2024-05-22 14:39:08] [INFO ] Flatten gal took : 8 ms
[2024-05-22 14:39:08] [INFO ] Flatten gal took : 9 ms
[2024-05-22 14:39:08] [INFO ] Input system was already deterministic with 255 transitions.
[2024-05-22 14:39:08] [INFO ] Flatten gal took : 7 ms
[2024-05-22 14:39:08] [INFO ] Flatten gal took : 7 ms
[2024-05-22 14:39:08] [INFO ] Time to serialize gal into /tmp/CTLFireability13068436481344156327.gal : 2 ms
[2024-05-22 14:39:08] [INFO ] Time to serialize properties into /tmp/CTLFireability4519036471619131117.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/CTLFireability13068436481344156327.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4519036471619131117.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.83184e+13,0.039177,4416,2,339,5,1373,6,0,673,996,0


Converting to forward existential form...Done !
original formula: AF(EX(AX(AF(((p6==1)||((p52==1)&&(p168==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(EX(!(!(EG(!(((p6==1)||((p52==1)&&(p168==1))))))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.392462,15028,1,0,145,50972,23,96,2721,74949,105
FORMULA DLCround-PT-11a-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 305/305 transitions.
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 149 transition count 305
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 91 place count 129 transition count 265
Iterating global reduction 1 with 20 rules applied. Total rules applied 111 place count 129 transition count 265
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 115 place count 129 transition count 261
Applied a total of 115 rules in 6 ms. Remains 129 /220 variables (removed 91) and now considering 261/305 (removed 44) transitions.
[2024-05-22 14:39:09] [INFO ] Flow matrix only has 202 transitions (discarded 59 similar events)
// Phase 1: matrix 202 rows 129 cols
[2024-05-22 14:39:09] [INFO ] Computed 24 invariants in 2 ms
[2024-05-22 14:39:09] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-22 14:39:09] [INFO ] Flow matrix only has 202 transitions (discarded 59 similar events)
[2024-05-22 14:39:09] [INFO ] Invariant cache hit.
[2024-05-22 14:39:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 14:39:09] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2024-05-22 14:39:09] [INFO ] Flow matrix only has 202 transitions (discarded 59 similar events)
[2024-05-22 14:39:09] [INFO ] Invariant cache hit.
[2024-05-22 14:39:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 8/129 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 201/330 variables, 129/153 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 1/331 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/331 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (OVERLAPS) 0/331 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 154 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18056 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 129/129 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 8/129 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 201/330 variables, 129/153 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 260/413 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 1/331 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/331 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/331 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 331/331 variables, and 414 constraints, problems are : Problem set: 0 solved, 260 unsolved in 13899 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 129/129 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints]
After SMT, in 32013ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 32016ms
Starting structural reductions in LTL mode, iteration 1 : 129/220 places, 261/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32242 ms. Remains : 129/220 places, 261/305 transitions.
[2024-05-22 14:39:41] [INFO ] Flatten gal took : 14 ms
[2024-05-22 14:39:41] [INFO ] Flatten gal took : 8 ms
[2024-05-22 14:39:41] [INFO ] Input system was already deterministic with 261 transitions.
[2024-05-22 14:39:41] [INFO ] Flatten gal took : 8 ms
[2024-05-22 14:39:41] [INFO ] Flatten gal took : 8 ms
[2024-05-22 14:39:41] [INFO ] Time to serialize gal into /tmp/CTLFireability15656377084907465329.gal : 1 ms
[2024-05-22 14:39:41] [INFO ] Time to serialize properties into /tmp/CTLFireability3204467113663435770.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/CTLFireability15656377084907465329.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3204467113663435770.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,7.33835e+13,0.041231,4492,2,362,5,1460,6,0,695,1046,0


Converting to forward existential form...Done !
original formula: (EX(AG(A(((p82==1)&&(p300==1)) U ((p86==1)&&(p308==1))))) + EX(((((AF(((p105==0)||(p326==0))) * EX(((p112==0)||(p341==0)))) + AX(((p55==0...278
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U !(!((E(!(((p86==1)&&(p308==1))) U (!(((p82==1)&&(p300==1))) * !(((p86==1)&&(p308==1))))...474
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 257/0/4
(forward)formula 0,0,0.241854,7976,1,0,13,21262,38,4,3185,4742,18
FORMULA DLCround-PT-11a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 305/305 transitions.
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 154 transition count 305
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 86 place count 134 transition count 265
Iterating global reduction 1 with 20 rules applied. Total rules applied 106 place count 134 transition count 265
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 108 place count 134 transition count 263
Applied a total of 108 rules in 6 ms. Remains 134 /220 variables (removed 86) and now considering 263/305 (removed 42) transitions.
[2024-05-22 14:39:41] [INFO ] Flow matrix only has 204 transitions (discarded 59 similar events)
// Phase 1: matrix 204 rows 134 cols
[2024-05-22 14:39:41] [INFO ] Computed 29 invariants in 2 ms
[2024-05-22 14:39:41] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-22 14:39:41] [INFO ] Flow matrix only has 204 transitions (discarded 59 similar events)
[2024-05-22 14:39:42] [INFO ] Invariant cache hit.
[2024-05-22 14:39:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 14:39:42] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-22 14:39:42] [INFO ] Flow matrix only has 204 transitions (discarded 59 similar events)
[2024-05-22 14:39:42] [INFO ] Invariant cache hit.
[2024-05-22 14:39:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 13/134 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 203/337 variables, 134/163 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 1/338 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/338 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 164 constraints, problems are : Problem set: 0 solved, 262 unsolved in 17349 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, State Equation: 134/134 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 13/134 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 203/337 variables, 134/163 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 262/425 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 1/338 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (OVERLAPS) 0/338 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/338 variables, and 426 constraints, problems are : Problem set: 0 solved, 262 unsolved in 12561 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, State Equation: 134/134 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints]
After SMT, in 29956ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 29959ms
Starting structural reductions in LTL mode, iteration 1 : 134/220 places, 263/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30188 ms. Remains : 134/220 places, 263/305 transitions.
[2024-05-22 14:40:12] [INFO ] Flatten gal took : 9 ms
[2024-05-22 14:40:12] [INFO ] Flatten gal took : 9 ms
[2024-05-22 14:40:12] [INFO ] Input system was already deterministic with 263 transitions.
[2024-05-22 14:40:12] [INFO ] Flatten gal took : 9 ms
[2024-05-22 14:40:12] [INFO ] Flatten gal took : 8 ms
[2024-05-22 14:40:12] [INFO ] Time to serialize gal into /tmp/CTLFireability4984993812497215817.gal : 2 ms
[2024-05-22 14:40:12] [INFO ] Time to serialize properties into /tmp/CTLFireability15859745550563458204.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/CTLFireability4984993812497215817.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15859745550563458204.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,7.82758e+13,0.043564,4496,2,372,5,1490,6,0,702,1058,0


Converting to forward existential form...Done !
original formula: EF(((E(!((((p136==1)&&(p355==1))||((p127==1)&&(p225==1)))) U ((((p43==1)&&(p160==1))&&((p136==1)&&(p358==1)))||(((p16==1)&&(p241==1))&&((...394
=> equivalent forward existential formula: (((([(FwdU(((FwdU(Init,TRUE) * (E(!((((p136==1)&&(p355==1))||((p127==1)&&(p225==1)))) U ((((p43==1)&&(p160==1))&...1607
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 250/3/13
(forward)formula 0,1,0.206512,7980,1,0,19,22578,37,6,3620,5664,20
FORMULA DLCround-PT-11a-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 305/305 transitions.
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 147 transition count 305
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 96 place count 124 transition count 259
Iterating global reduction 1 with 23 rules applied. Total rules applied 119 place count 124 transition count 259
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 123 place count 124 transition count 255
Applied a total of 123 rules in 4 ms. Remains 124 /220 variables (removed 96) and now considering 255/305 (removed 50) transitions.
[2024-05-22 14:40:12] [INFO ] Flow matrix only has 199 transitions (discarded 56 similar events)
// Phase 1: matrix 199 rows 124 cols
[2024-05-22 14:40:12] [INFO ] Computed 22 invariants in 3 ms
[2024-05-22 14:40:12] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 14:40:12] [INFO ] Flow matrix only has 199 transitions (discarded 56 similar events)
[2024-05-22 14:40:12] [INFO ] Invariant cache hit.
[2024-05-22 14:40:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 14:40:12] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 254 sub problems to find dead transitions.
[2024-05-22 14:40:12] [INFO ] Flow matrix only has 199 transitions (discarded 56 similar events)
[2024-05-22 14:40:12] [INFO ] Invariant cache hit.
[2024-05-22 14:40:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 6/124 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (OVERLAPS) 198/322 variables, 124/146 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 1/323 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/323 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 9 (OVERLAPS) 0/323 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 147 constraints, problems are : Problem set: 0 solved, 254 unsolved in 16127 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 124/124 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 6/124 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (OVERLAPS) 198/322 variables, 124/146 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 254/400 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (OVERLAPS) 1/323 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/323 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 10 (OVERLAPS) 0/323 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 323/323 variables, and 401 constraints, problems are : Problem set: 0 solved, 254 unsolved in 13633 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 124/124 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
After SMT, in 29803ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 29806ms
Starting structural reductions in LTL mode, iteration 1 : 124/220 places, 255/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29976 ms. Remains : 124/220 places, 255/305 transitions.
[2024-05-22 14:40:42] [INFO ] Flatten gal took : 11 ms
[2024-05-22 14:40:42] [INFO ] Flatten gal took : 10 ms
[2024-05-22 14:40:42] [INFO ] Input system was already deterministic with 255 transitions.
[2024-05-22 14:40:42] [INFO ] Flatten gal took : 8 ms
[2024-05-22 14:40:42] [INFO ] Flatten gal took : 9 ms
[2024-05-22 14:40:42] [INFO ] Time to serialize gal into /tmp/CTLFireability18143459403583938115.gal : 3 ms
[2024-05-22 14:40:42] [INFO ] Time to serialize properties into /tmp/CTLFireability4562473631590114749.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/CTLFireability18143459403583938115.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4562473631590114749.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.83184e+13,0.077547,4424,2,349,5,1403,6,0,678,1011,0


Converting to forward existential form...Done !
original formula: (EF(AX(EX((((p7==0)||(p238==0))&&((p96==0)||(p319==0)))))) * EF((((EF(((p83==1)&&(p310==1))) * AF(((p77==1)&&(p294==1)))) * ((p84==1)&&(p...196
=> equivalent forward existential formula: ([(((FwdU((Init * E(TRUE U !(EX(!(EX((((p7==0)||(p238==0))&&((p96==0)||(p319==0))))))))),TRUE) * ((p84==1)&&(p19...389
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.219841,7908,1,0,16,22944,27,6,3188,7030,18
FORMULA DLCround-PT-11a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 220/220 places, 305/305 transitions.
Graph (trivial) has 292 edges and 220 vertex of which 132 / 220 are part of one of the 16 SCC in 2 ms
Free SCC test removed 116 places
Ensure Unique test removed 268 transitions
Reduce isomorphic transitions removed 268 transitions.
Graph (complete) has 131 edges and 104 vertex of which 26 are kept as prefixes of interest. Removing 78 places using SCC suffix rule.0 ms
Discarding 78 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 26 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 25 transition count 36
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 17 place count 12 transition count 23
Iterating global reduction 2 with 13 rules applied. Total rules applied 30 place count 12 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 12 transition count 22
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 12 transition count 22
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 11 transition count 21
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 11 transition count 21
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 11 transition count 20
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 36 place count 11 transition count 19
Applied a total of 36 rules in 13 ms. Remains 11 /220 variables (removed 209) and now considering 19/305 (removed 286) transitions.
[2024-05-22 14:40:42] [INFO ] Flow matrix only has 12 transitions (discarded 7 similar events)
// Phase 1: matrix 12 rows 11 cols
[2024-05-22 14:40:42] [INFO ] Computed 4 invariants in 0 ms
[2024-05-22 14:40:42] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-22 14:40:42] [INFO ] Flow matrix only has 12 transitions (discarded 7 similar events)
[2024-05-22 14:40:42] [INFO ] Invariant cache hit.
[2024-05-22 14:40:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 14:40:42] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-22 14:40:42] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2024-05-22 14:40:42] [INFO ] Flow matrix only has 12 transitions (discarded 7 similar events)
[2024-05-22 14:40:42] [INFO ] Invariant cache hit.
[2024-05-22 14:40:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 1/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 1/11 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 11/22 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1/23 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/23 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 16 constraints, problems are : Problem set: 0 solved, 18 unsolved in 395 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 1/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 1/11 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 11/22 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 1/23 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/23 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/23 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 34 constraints, problems are : Problem set: 0 solved, 18 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 691ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 692ms
Starting structural reductions in SI_CTL mode, iteration 1 : 11/220 places, 19/305 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 786 ms. Remains : 11/220 places, 19/305 transitions.
[2024-05-22 14:40:43] [INFO ] Flatten gal took : 1 ms
[2024-05-22 14:40:43] [INFO ] Flatten gal took : 1 ms
[2024-05-22 14:40:43] [INFO ] Input system was already deterministic with 19 transitions.
RANDOM walk for 50 steps (0 resets) in 5 ms. (8 steps per ms) remains 0/1 properties
FORMULA DLCround-PT-11a-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 14:40:43] [INFO ] Flatten gal took : 1 ms
[2024-05-22 14:40:43] [INFO ] Flatten gal took : 1 ms
[2024-05-22 14:40:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6892923256148456002.gal : 1 ms
[2024-05-22 14:40:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18243238088263521594.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6892923256148456002.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18243238088263521594.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 220/220 places, 305/305 transitions.
Graph (trivial) has 291 edges and 220 vertex of which 131 / 220 are part of one of the 16 SCC in 0 ms
Free SCC test removed 115 places
Ensure Unique test removed 266 transitions
Reduce isomorphic transitions removed 266 transitions.
Graph (complete) has 133 edges and 105 vertex of which 28 are kept as prefixes of interest. Removing 77 places using SCC suffix rule.0 ms
Discarding 77 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 28 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 27 transition count 38
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 18 place count 13 transition count 23
Iterating global reduction 2 with 14 rules applied. Total rules applied 32 place count 13 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 13 transition count 22
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 13 transition count 22
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 12 transition count 21
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 12 transition count 21
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 12 transition count 20
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 38 place count 12 transition count 19
Applied a total of 38 rules in 11 ms. Remains 12 /220 variables (removed 208) and now considering 19/305 (removed 286) transitions.
[2024-05-22 14:40:43] [INFO ] Flow matrix only has 12 transitions (discarded 7 similar events)
// Phase 1: matrix 12 rows 12 cols
[2024-05-22 14:40:43] [INFO ] Computed 5 invariants in 0 ms
[2024-05-22 14:40:43] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-22 14:40:43] [INFO ] Flow matrix only has 12 transitions (discarded 7 similar events)
[2024-05-22 14:40:43] [INFO ] Invariant cache hit.
[2024-05-22 14:40:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 14:40:43] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-22 14:40:43] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2024-05-22 14:40:43] [INFO ] Flow matrix only has 12 transitions (discarded 7 similar events)
[2024-05-22 14:40:43] [INFO ] Invariant cache hit.
[2024-05-22 14:40:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 1/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 2/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 11/23 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/24 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 18 constraints, problems are : Problem set: 0 solved, 18 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 1/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 2/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 11/23 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 1/24 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 36 constraints, problems are : Problem set: 0 solved, 18 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 661ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 661ms
Starting structural reductions in SI_CTL mode, iteration 1 : 12/220 places, 19/305 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 749 ms. Remains : 12/220 places, 19/305 transitions.
[2024-05-22 14:40:44] [INFO ] Flatten gal took : 1 ms
[2024-05-22 14:40:44] [INFO ] Flatten gal took : 1 ms
[2024-05-22 14:40:44] [INFO ] Input system was already deterministic with 19 transitions.
[2024-05-22 14:40:44] [INFO ] Flatten gal took : 1 ms
[2024-05-22 14:40:44] [INFO ] Flatten gal took : 1 ms
[2024-05-22 14:40:44] [INFO ] Time to serialize gal into /tmp/CTLFireability9818927247581041376.gal : 0 ms
[2024-05-22 14:40:44] [INFO ] Time to serialize properties into /tmp/CTLFireability4584638747567992654.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/CTLFireability9818927247581041376.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4584638747567992654.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,13,0.017907,3376,2,24,5,88,6,0,53,56,0


Converting to forward existential form...Done !
original formula: EF((AG(((p91==1)&&(p202==1))) * ((p77==0)||(p186==0))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * ((p77==0)||(p186==0))) * !(E(TRUE U !(((p91==1)&&(p202==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.019708,3692,1,0,6,219,15,0,234,108,5
FORMULA DLCround-PT-11a-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 305/305 transitions.
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 149 transition count 305
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 92 place count 128 transition count 263
Iterating global reduction 1 with 21 rules applied. Total rules applied 113 place count 128 transition count 263
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 117 place count 128 transition count 259
Applied a total of 117 rules in 6 ms. Remains 128 /220 variables (removed 92) and now considering 259/305 (removed 46) transitions.
[2024-05-22 14:40:44] [INFO ] Flow matrix only has 201 transitions (discarded 58 similar events)
// Phase 1: matrix 201 rows 128 cols
[2024-05-22 14:40:44] [INFO ] Computed 24 invariants in 1 ms
[2024-05-22 14:40:44] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-22 14:40:44] [INFO ] Flow matrix only has 201 transitions (discarded 58 similar events)
[2024-05-22 14:40:44] [INFO ] Invariant cache hit.
[2024-05-22 14:40:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 14:40:44] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2024-05-22 14:40:44] [INFO ] Flow matrix only has 201 transitions (discarded 58 similar events)
[2024-05-22 14:40:44] [INFO ] Invariant cache hit.
[2024-05-22 14:40:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 8/128 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (OVERLAPS) 200/328 variables, 128/152 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 1/329 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 9 (OVERLAPS) 0/329 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 153 constraints, problems are : Problem set: 0 solved, 258 unsolved in 18171 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 128/128 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 8/128 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (OVERLAPS) 200/328 variables, 128/152 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 258/410 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (OVERLAPS) 1/329 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 10 (OVERLAPS) 0/329 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 411 constraints, problems are : Problem set: 0 solved, 258 unsolved in 13676 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 128/128 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 31899ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 31904ms
Starting structural reductions in LTL mode, iteration 1 : 128/220 places, 259/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32115 ms. Remains : 128/220 places, 259/305 transitions.
[2024-05-22 14:41:16] [INFO ] Flatten gal took : 6 ms
[2024-05-22 14:41:16] [INFO ] Flatten gal took : 6 ms
[2024-05-22 14:41:16] [INFO ] Input system was already deterministic with 259 transitions.
[2024-05-22 14:41:16] [INFO ] Flatten gal took : 5 ms
[2024-05-22 14:41:16] [INFO ] Flatten gal took : 5 ms
[2024-05-22 14:41:16] [INFO ] Time to serialize gal into /tmp/CTLFireability4990283644345970610.gal : 3 ms
[2024-05-22 14:41:16] [INFO ] Time to serialize properties into /tmp/CTLFireability5302849351127082049.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/CTLFireability4990283644345970610.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5302849351127082049.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,6.1153e+13,0.03986,4488,2,359,5,1443,6,0,690,1033,0


Converting to forward existential form...Done !
original formula: E(AF((EF(AX(((p96==1)&&(p318==1)))) + AG(((p7==1)&&(p150==1))))) U (!(EX((AG(((p21==1)&&(p242==1))) + EF(((p137==1)&&(p331==1)))))) * A(E...286
=> equivalent forward existential formula: [(((FwdU(Init,!(EG(!((E(TRUE U !(EX(!(((p96==1)&&(p318==1)))))) + !(E(TRUE U !(((p7==1)&&(p150==1)))))))))) * !(...554
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.174184,8236,1,0,22,23083,37,11,3269,6105,30
FORMULA DLCround-PT-11a-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 305/305 transitions.
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 145 transition count 305
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 99 place count 121 transition count 257
Iterating global reduction 1 with 24 rules applied. Total rules applied 123 place count 121 transition count 257
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 127 place count 121 transition count 253
Applied a total of 127 rules in 3 ms. Remains 121 /220 variables (removed 99) and now considering 253/305 (removed 52) transitions.
[2024-05-22 14:41:16] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
// Phase 1: matrix 198 rows 121 cols
[2024-05-22 14:41:16] [INFO ] Computed 20 invariants in 2 ms
[2024-05-22 14:41:16] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 14:41:16] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
[2024-05-22 14:41:16] [INFO ] Invariant cache hit.
[2024-05-22 14:41:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 14:41:16] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2024-05-22 14:41:16] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
[2024-05-22 14:41:16] [INFO ] Invariant cache hit.
[2024-05-22 14:41:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 4/121 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 197/318 variables, 121/141 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 1/319 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (OVERLAPS) 0/319 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 142 constraints, problems are : Problem set: 0 solved, 252 unsolved in 16444 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 121/121 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 4/121 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 197/318 variables, 121/141 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 252/393 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 1/319 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (OVERLAPS) 0/319 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 394 constraints, problems are : Problem set: 0 solved, 252 unsolved in 11402 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 121/121 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
After SMT, in 27893ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 27901ms
Starting structural reductions in LTL mode, iteration 1 : 121/220 places, 253/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28079 ms. Remains : 121/220 places, 253/305 transitions.
[2024-05-22 14:41:44] [INFO ] Flatten gal took : 7 ms
[2024-05-22 14:41:44] [INFO ] Flatten gal took : 5 ms
[2024-05-22 14:41:44] [INFO ] Input system was already deterministic with 253 transitions.
[2024-05-22 14:41:44] [INFO ] Flatten gal took : 5 ms
[2024-05-22 14:41:44] [INFO ] Flatten gal took : 5 ms
[2024-05-22 14:41:44] [INFO ] Time to serialize gal into /tmp/CTLFireability16509654070121875792.gal : 2 ms
[2024-05-22 14:41:44] [INFO ] Time to serialize properties into /tmp/CTLFireability8988597704065604913.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/CTLFireability16509654070121875792.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8988597704065604913.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.29497e+13,0.03818,4416,2,342,5,1376,6,0,671,994,0


Converting to forward existential form...Done !
original formula: EF(EX(AG(((!(E(((p77==1)&&(p294==1)) U ((p108==1)&&(p326==1)))) * ((p107==0)||(p317==0))) * ((p45==0)||(p261==0))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(TRUE U !(((!(E(((p77==1)&&(p294==1)) U ((p108==1)&&(p326==1)))) * ((p107==0)||(p317=...199
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 243/10/10
(forward)formula 0,0,0.137706,6844,1,0,14,18048,23,4,2934,3155,10
FORMULA DLCround-PT-11a-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 305/305 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 156 transition count 305
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 85 place count 135 transition count 263
Iterating global reduction 1 with 21 rules applied. Total rules applied 106 place count 135 transition count 263
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 109 place count 135 transition count 260
Applied a total of 109 rules in 3 ms. Remains 135 /220 variables (removed 85) and now considering 260/305 (removed 45) transitions.
[2024-05-22 14:41:44] [INFO ] Flow matrix only has 202 transitions (discarded 58 similar events)
// Phase 1: matrix 202 rows 135 cols
[2024-05-22 14:41:44] [INFO ] Computed 31 invariants in 1 ms
[2024-05-22 14:41:44] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 14:41:44] [INFO ] Flow matrix only has 202 transitions (discarded 58 similar events)
[2024-05-22 14:41:44] [INFO ] Invariant cache hit.
[2024-05-22 14:41:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 14:41:45] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2024-05-22 14:41:45] [INFO ] Flow matrix only has 202 transitions (discarded 58 similar events)
[2024-05-22 14:41:45] [INFO ] Invariant cache hit.
[2024-05-22 14:41:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 15/135 variables, 15/31 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 201/336 variables, 135/166 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 1/337 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (OVERLAPS) 0/337 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 167 constraints, problems are : Problem set: 0 solved, 259 unsolved in 18557 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 135/135 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 15/135 variables, 15/31 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 201/336 variables, 135/166 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 259/425 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (OVERLAPS) 1/337 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 10 (OVERLAPS) 0/337 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 426 constraints, problems are : Problem set: 0 solved, 259 unsolved in 14463 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 135/135 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 0/0 constraints]
After SMT, in 33052ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 33055ms
Starting structural reductions in LTL mode, iteration 1 : 135/220 places, 260/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33222 ms. Remains : 135/220 places, 260/305 transitions.
[2024-05-22 14:42:18] [INFO ] Flatten gal took : 6 ms
[2024-05-22 14:42:18] [INFO ] Flatten gal took : 5 ms
[2024-05-22 14:42:18] [INFO ] Input system was already deterministic with 260 transitions.
[2024-05-22 14:42:18] [INFO ] Flatten gal took : 5 ms
[2024-05-22 14:42:18] [INFO ] Flatten gal took : 4 ms
[2024-05-22 14:42:18] [INFO ] Time to serialize gal into /tmp/CTLFireability2574896272517801064.gal : 1 ms
[2024-05-22 14:42:18] [INFO ] Time to serialize properties into /tmp/CTLFireability14902025840949994369.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/CTLFireability2574896272517801064.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14902025840949994369.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E(((EX(!(AX(E(((p14==1)&&(p216==1)) U ((p109==1)&&(p335==1)))))) + A((((((p145==1)&&(p375==1))&&((p57==1)&&(p246==1)))&&(((p145==1)&&(p24...499
=> equivalent forward existential formula: [FwdG(FwdU(FwdU(Init,((EX(!(!(EX(!(E(((p14==1)&&(p216==1)) U ((p109==1)&&(p335==1)))))))) + !((E(!(!(E(TRUE U !(...671
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 252/7/8
Hit Full ! (commute/partial/dont) 250/10/10
Hit Full ! (commute/partial/dont) 246/0/14
(forward)formula 0,1,0.342693,10364,1,0,27,33717,62,7,3992,15326,37
FORMULA DLCround-PT-11a-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 305/305 transitions.
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 151 transition count 305
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 89 place count 131 transition count 265
Iterating global reduction 1 with 20 rules applied. Total rules applied 109 place count 131 transition count 265
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 112 place count 131 transition count 262
Applied a total of 112 rules in 3 ms. Remains 131 /220 variables (removed 89) and now considering 262/305 (removed 43) transitions.
[2024-05-22 14:42:18] [INFO ] Flow matrix only has 203 transitions (discarded 59 similar events)
// Phase 1: matrix 203 rows 131 cols
[2024-05-22 14:42:18] [INFO ] Computed 26 invariants in 1 ms
[2024-05-22 14:42:18] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 14:42:18] [INFO ] Flow matrix only has 203 transitions (discarded 59 similar events)
[2024-05-22 14:42:18] [INFO ] Invariant cache hit.
[2024-05-22 14:42:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 14:42:18] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2024-05-22 14:42:18] [INFO ] Flow matrix only has 203 transitions (discarded 59 similar events)
[2024-05-22 14:42:18] [INFO ] Invariant cache hit.
[2024-05-22 14:42:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 10/131 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 202/333 variables, 131/157 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 1/334 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (OVERLAPS) 0/334 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 158 constraints, problems are : Problem set: 0 solved, 261 unsolved in 15978 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 131/131 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 10/131 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 202/333 variables, 131/157 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 261/418 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (OVERLAPS) 1/334 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/334 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (OVERLAPS) 0/334 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 419 constraints, problems are : Problem set: 0 solved, 261 unsolved in 11772 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 131/131 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 0/0 constraints]
After SMT, in 27797ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 27801ms
Starting structural reductions in LTL mode, iteration 1 : 131/220 places, 262/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27984 ms. Remains : 131/220 places, 262/305 transitions.
[2024-05-22 14:42:46] [INFO ] Flatten gal took : 9 ms
[2024-05-22 14:42:46] [INFO ] Flatten gal took : 8 ms
[2024-05-22 14:42:46] [INFO ] Input system was already deterministic with 262 transitions.
[2024-05-22 14:42:46] [INFO ] Flatten gal took : 8 ms
[2024-05-22 14:42:46] [INFO ] Flatten gal took : 9 ms
[2024-05-22 14:42:46] [INFO ] Time to serialize gal into /tmp/CTLFireability3341340405276975147.gal : 2 ms
[2024-05-22 14:42:46] [INFO ] Time to serialize properties into /tmp/CTLFireability702514822489239847.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3341340405276975147.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability702514822489239847.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.33835e+13,0.042389,4496,2,366,5,1472,6,0,698,1051,0


Converting to forward existential form...Done !
original formula: (EG((AF(((EF(((p21==1)&&(p161==1))) + (p140==0)) + ((p38==1)&&(p248==1)))) + ((AX(EF(((p107==1)&&(p251==1)))) * !(A(((p89==1)&&(p204==1))...349
=> equivalent forward existential formula: ([(Init * !(EG((!(EG(!(((E(TRUE U ((p21==1)&&(p161==1))) + (p140==0)) + ((p38==1)&&(p248==1)))))) + ((!(EX(!(E(T...524
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.162713,7452,1,0,13,19762,22,6,3096,4326,14
FORMULA DLCround-PT-11a-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 305/305 transitions.
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 146 transition count 305
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 96 place count 124 transition count 261
Iterating global reduction 1 with 22 rules applied. Total rules applied 118 place count 124 transition count 261
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 122 place count 124 transition count 257
Applied a total of 122 rules in 4 ms. Remains 124 /220 variables (removed 96) and now considering 257/305 (removed 48) transitions.
[2024-05-22 14:42:46] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
// Phase 1: matrix 200 rows 124 cols
[2024-05-22 14:42:46] [INFO ] Computed 21 invariants in 1 ms
[2024-05-22 14:42:46] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-22 14:42:46] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
[2024-05-22 14:42:46] [INFO ] Invariant cache hit.
[2024-05-22 14:42:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 14:42:46] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-05-22 14:42:46] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
[2024-05-22 14:42:46] [INFO ] Invariant cache hit.
[2024-05-22 14:42:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 5/124 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 199/323 variables, 124/145 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 1/324 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 0/324 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 146 constraints, problems are : Problem set: 0 solved, 256 unsolved in 15212 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 124/124 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 5/124 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 199/323 variables, 124/145 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 256/401 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (OVERLAPS) 1/324 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 10 (OVERLAPS) 0/324 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 402 constraints, problems are : Problem set: 0 solved, 256 unsolved in 11569 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 124/124 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 26831ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 26836ms
Starting structural reductions in LTL mode, iteration 1 : 124/220 places, 257/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27075 ms. Remains : 124/220 places, 257/305 transitions.
[2024-05-22 14:43:13] [INFO ] Flatten gal took : 5 ms
[2024-05-22 14:43:13] [INFO ] Flatten gal took : 5 ms
[2024-05-22 14:43:13] [INFO ] Input system was already deterministic with 257 transitions.
[2024-05-22 14:43:13] [INFO ] Flatten gal took : 5 ms
[2024-05-22 14:43:13] [INFO ] Flatten gal took : 4 ms
[2024-05-22 14:43:13] [INFO ] Time to serialize gal into /tmp/CTLFireability2540319979654937230.gal : 1 ms
[2024-05-22 14:43:13] [INFO ] Time to serialize properties into /tmp/CTLFireability7788383870076228118.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/CTLFireability2540319979654937230.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7788383870076228118.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,5.43582e+13,0.039221,4480,2,350,5,1411,6,0,682,1016,0


Converting to forward existential form...Done !
original formula: A((AF((AF(!(((p65==1)&&(p180==1)))) + !(AX((p70==1))))) + E(EF(!(A(((p107==1)&&(p340==1)) U ((p7==1)&&(p230==1))))) U (((p144==1)&&(p366=...213
=> equivalent forward existential formula: [((Init * !(EG(!(!(!(EG(!(!(EX(!((p49==1)))))))))))) * !(E(!(!(!(EG(!(!(EX(!((p49==1))))))))) U (!((!(EG(!((!(EG...463
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.133897,7172,1,0,7,18581,23,1,2781,3005,8
FORMULA DLCround-PT-11a-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 220/220 places, 305/305 transitions.
Graph (trivial) has 253 edges and 220 vertex of which 102 / 220 are part of one of the 15 SCC in 1 ms
Free SCC test removed 87 places
Ensure Unique test removed 203 transitions
Reduce isomorphic transitions removed 203 transitions.
Graph (complete) has 196 edges and 133 vertex of which 63 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.1 ms
Discarding 70 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 63 transition count 99
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 60 transition count 96
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 14 place count 57 transition count 96
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 26 place count 45 transition count 80
Iterating global reduction 3 with 12 rules applied. Total rules applied 38 place count 45 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 40 place count 45 transition count 78
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 42 place count 44 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 46 place count 44 transition count 73
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 49 place count 44 transition count 73
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 52 place count 41 transition count 70
Iterating global reduction 5 with 3 rules applied. Total rules applied 55 place count 41 transition count 70
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 58 place count 41 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 61 place count 41 transition count 64
Applied a total of 61 rules in 19 ms. Remains 41 /220 variables (removed 179) and now considering 64/305 (removed 241) transitions.
[2024-05-22 14:43:14] [INFO ] Flow matrix only has 40 transitions (discarded 24 similar events)
// Phase 1: matrix 40 rows 41 cols
[2024-05-22 14:43:14] [INFO ] Computed 17 invariants in 1 ms
[2024-05-22 14:43:14] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-22 14:43:14] [INFO ] Flow matrix only has 40 transitions (discarded 24 similar events)
[2024-05-22 14:43:14] [INFO ] Invariant cache hit.
[2024-05-22 14:43:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 14:43:14] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-05-22 14:43:14] [INFO ] Redundant transitions in 1 ms returned []
Running 63 sub problems to find dead transitions.
[2024-05-22 14:43:14] [INFO ] Flow matrix only has 40 transitions (discarded 24 similar events)
[2024-05-22 14:43:14] [INFO ] Invariant cache hit.
[2024-05-22 14:43:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/32 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 9/41 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 39/80 variables, 41/58 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 1/81 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 59 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1557 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/32 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 9/41 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 39/80 variables, 41/58 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 63/121 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 1/81 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/81 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 122 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1677 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 3242ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 3243ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/220 places, 64/305 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3340 ms. Remains : 41/220 places, 64/305 transitions.
[2024-05-22 14:43:17] [INFO ] Flatten gal took : 4 ms
[2024-05-22 14:43:17] [INFO ] Flatten gal took : 1 ms
[2024-05-22 14:43:17] [INFO ] Input system was already deterministic with 64 transitions.
[2024-05-22 14:43:17] [INFO ] Flatten gal took : 2 ms
[2024-05-22 14:43:17] [INFO ] Flatten gal took : 1 ms
[2024-05-22 14:43:17] [INFO ] Time to serialize gal into /tmp/CTLFireability2157656881608486121.gal : 1 ms
[2024-05-22 14:43:17] [INFO ] Time to serialize properties into /tmp/CTLFireability2299278029736623376.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/CTLFireability2157656881608486121.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2299278029736623376.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,13609,0.014528,3608,2,118,5,437,6,0,176,292,0


Converting to forward existential form...Done !
original formula: E(((p106==1)&&(p323==1)) U A(AG(((EF(((p71==1)&&(p295==1))) + ((p117==1)&&(p216==1))) + (((p77==1)&&(p248==1))&&((p97==1)&&(p361==1))))) ...270
=> equivalent forward existential formula: [((FwdU(Init,((p106==1)&&(p323==1))) * !(EG(!((!((E(!(!((E(!(((p56==1)&&(p275==1))) U (!(((p21==1)&&(p226==1))) ...1656
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.046646,4452,1,0,10,2162,27,2,875,799,14
FORMULA DLCround-PT-11a-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-22 14:43:17] [INFO ] Flatten gal took : 10 ms
[2024-05-22 14:43:17] [INFO ] Flatten gal took : 10 ms
Total runtime 347992 ms.

BK_STOP 1716388997531

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

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