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.r268-smll-171654406800066.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 Parking-PT-208, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654406800066
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 11 16:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 11 16:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 49K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716655109275

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-208
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-25 16:38:31] [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-25 16:38:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:38:31] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2024-05-25 16:38:32] [INFO ] Transformed 137 places.
[2024-05-25 16:38:32] [INFO ] Transformed 201 transitions.
[2024-05-25 16:38:32] [INFO ] Found NUPN structural information;
[2024-05-25 16:38:32] [INFO ] Parsed PT model containing 137 places and 201 transitions and 593 arcs in 380 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 32 ms.
Ensure Unique test removed 84 transitions
Reduce redundant transitions removed 84 transitions.
Support contains 70 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 117/117 transitions.
Applied a total of 0 rules in 26 ms. Remains 137 /137 variables (removed 0) and now considering 117/117 (removed 0) transitions.
// Phase 1: matrix 117 rows 137 cols
[2024-05-25 16:38:32] [INFO ] Computed 34 invariants in 22 ms
[2024-05-25 16:38:32] [INFO ] Implicit Places using invariants in 509 ms returned [28, 44, 64, 94, 102, 110, 118, 130, 132]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 570 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 128/137 places, 117/117 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 124 transition count 113
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 124 transition count 113
Applied a total of 8 rules in 35 ms. Remains 124 /128 variables (removed 4) and now considering 113/117 (removed 4) transitions.
// Phase 1: matrix 113 rows 124 cols
[2024-05-25 16:38:32] [INFO ] Computed 25 invariants in 5 ms
[2024-05-25 16:38:33] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-25 16:38:33] [INFO ] Invariant cache hit.
[2024-05-25 16:38:33] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-25 16:38:33] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 124/137 places, 113/117 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1106 ms. Remains : 124/137 places, 113/117 transitions.
Support contains 70 out of 124 places after structural reductions.
[2024-05-25 16:38:33] [INFO ] Flatten gal took : 47 ms
[2024-05-25 16:38:33] [INFO ] Flatten gal took : 23 ms
[2024-05-25 16:38:33] [INFO ] Input system was already deterministic with 113 transitions.
RANDOM walk for 40000 steps (1155 resets) in 3314 ms. (12 steps per ms) remains 14/67 properties
BEST_FIRST walk for 40004 steps (102 resets) in 353 ms. (113 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (100 resets) in 297 ms. (134 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (101 resets) in 262 ms. (152 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (102 resets) in 234 ms. (170 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (100 resets) in 197 ms. (202 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (100 resets) in 143 ms. (277 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (105 resets) in 244 ms. (163 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (98 resets) in 358 ms. (111 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (100 resets) in 91 ms. (434 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (106 resets) in 88 ms. (449 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (102 resets) in 97 ms. (408 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (98 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (101 resets) in 96 ms. (412 steps per ms) remains 10/10 properties
[2024-05-25 16:38:35] [INFO ] Invariant cache hit.
[2024-05-25 16:38:35] [INFO ] State equation strengthened by 26 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp66 is UNSAT
At refinement iteration 1 (OVERLAPS) 92/124 variables, 25/25 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/25 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 113/237 variables, 124/149 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 26/175 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/175 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/237 variables, 0/175 constraints. Problems are: Problem set: 5 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 175 constraints, problems are : Problem set: 5 solved, 5 unsolved in 464 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 124/124 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 5 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 1 (OVERLAPS) 106/124 variables, 25/25 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/25 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 113/237 variables, 124/149 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 26/175 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 4/179 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/179 constraints. Problems are: Problem set: 6 solved, 4 unsolved
[2024-05-25 16:38:36] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 22 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/237 variables, 1/180 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/180 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/237 variables, 0/180 constraints. Problems are: Problem set: 6 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 180 constraints, problems are : Problem set: 6 solved, 4 unsolved in 732 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 124/124 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 4/10 constraints, Known Traps: 1/1 constraints]
After SMT, in 1260ms problems are : Problem set: 6 solved, 4 unsolved
Parikh walk visited 1 properties in 808 ms.
Support contains 13 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 113/113 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 124 transition count 109
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 120 transition count 109
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 120 transition count 105
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 116 transition count 105
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 113 transition count 102
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 113 transition count 102
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 32 place count 108 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 107 transition count 116
Free-agglomeration rule applied 15 times.
Iterating global reduction 2 with 15 rules applied. Total rules applied 49 place count 107 transition count 101
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 64 place count 92 transition count 101
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 92 transition count 101
Applied a total of 65 rules in 74 ms. Remains 92 /124 variables (removed 32) and now considering 101/113 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 92/124 places, 101/113 transitions.
RANDOM walk for 40000 steps (1262 resets) in 393 ms. (101 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (231 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
// Phase 1: matrix 101 rows 92 cols
[2024-05-25 16:38:37] [INFO ] Computed 25 invariants in 2 ms
[2024-05-25 16:38:37] [INFO ] State equation strengthened by 74 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/92 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/193 variables, 92/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 74/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/193 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 191 constraints, problems are : Problem set: 0 solved, 1 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 92/92 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/92 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/193 variables, 92/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 74/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 92/92 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 279ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 9 ms.
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
FORMULA Parking-PT-208-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 16:38:38] [INFO ] Flatten gal took : 23 ms
[2024-05-25 16:38:38] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA Parking-PT-208-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 16:38:38] [INFO ] Flatten gal took : 13 ms
[2024-05-25 16:38:38] [INFO ] Input system was already deterministic with 113 transitions.
Support contains 56 out of 124 places (down from 62) after GAL structural reductions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 109
Applied a total of 8 rules in 14 ms. Remains 120 /124 variables (removed 4) and now considering 109/113 (removed 4) transitions.
// Phase 1: matrix 109 rows 120 cols
[2024-05-25 16:38:38] [INFO ] Computed 25 invariants in 1 ms
[2024-05-25 16:38:38] [INFO ] Implicit Places using invariants in 163 ms returned [35, 49, 61]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 165 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/124 places, 109/113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 115 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 115 transition count 107
Applied a total of 4 rules in 5 ms. Remains 115 /117 variables (removed 2) and now considering 107/109 (removed 2) transitions.
// Phase 1: matrix 107 rows 115 cols
[2024-05-25 16:38:38] [INFO ] Computed 22 invariants in 2 ms
[2024-05-25 16:38:38] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-25 16:38:38] [INFO ] Invariant cache hit.
[2024-05-25 16:38:38] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-25 16:38:38] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/124 places, 107/113 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 480 ms. Remains : 115/124 places, 107/113 transitions.
[2024-05-25 16:38:38] [INFO ] Flatten gal took : 9 ms
[2024-05-25 16:38:38] [INFO ] Flatten gal took : 9 ms
[2024-05-25 16:38:38] [INFO ] Input system was already deterministic with 107 transitions.
[2024-05-25 16:38:38] [INFO ] Flatten gal took : 9 ms
[2024-05-25 16:38:38] [INFO ] Flatten gal took : 8 ms
[2024-05-25 16:38:38] [INFO ] Time to serialize gal into /tmp/CTLFireability12726315249312310541.gal : 4 ms
[2024-05-25 16:38:38] [INFO ] Time to serialize properties into /tmp/CTLFireability7525150613556430007.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/CTLFireability12726315249312310541.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7525150613556430007.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.62144e+09,0.095262,5612,2,1003,5,8607,6,0,569,9967,0


Converting to forward existential form...Done !
original formula: EF((EX(AF(((p80==1)&&(p104==1)))) + AG(((AF((p114==0)) + AF((p70==1))) + ((p72==0)||(p88==0))))))
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * !(EG(!(((p80==1)&&(p104==1))))))] != FALSE + [(FwdU(Init,TRUE) * !(E(TRUE U !(((!(EG(!(...228
Reverse transition relation is NOT exact ! Due to transitions t2, t20, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tota...170
(forward)formula 0,1,12.1992,312672,1,0,675,1.87882e+06,237,317,3372,1.88847e+06,761
FORMULA Parking-PT-208-CTLFireability-2024-00 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 : 124/124 places, 113/113 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 110
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 110
Applied a total of 6 rules in 8 ms. Remains 121 /124 variables (removed 3) and now considering 110/113 (removed 3) transitions.
// Phase 1: matrix 110 rows 121 cols
[2024-05-25 16:38:51] [INFO ] Computed 25 invariants in 2 ms
[2024-05-25 16:38:51] [INFO ] Implicit Places using invariants in 192 ms returned [35, 49, 61]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 195 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/124 places, 110/113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 116 transition count 108
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 116 transition count 108
Applied a total of 4 rules in 6 ms. Remains 116 /118 variables (removed 2) and now considering 108/110 (removed 2) transitions.
// Phase 1: matrix 108 rows 116 cols
[2024-05-25 16:38:51] [INFO ] Computed 22 invariants in 2 ms
[2024-05-25 16:38:51] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-25 16:38:51] [INFO ] Invariant cache hit.
[2024-05-25 16:38:51] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-25 16:38:51] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 116/124 places, 108/113 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 527 ms. Remains : 116/124 places, 108/113 transitions.
[2024-05-25 16:38:51] [INFO ] Flatten gal took : 13 ms
[2024-05-25 16:38:51] [INFO ] Flatten gal took : 13 ms
[2024-05-25 16:38:51] [INFO ] Input system was already deterministic with 108 transitions.
[2024-05-25 16:38:51] [INFO ] Flatten gal took : 12 ms
[2024-05-25 16:38:51] [INFO ] Flatten gal took : 12 ms
[2024-05-25 16:38:51] [INFO ] Time to serialize gal into /tmp/CTLFireability17131231971187865542.gal : 4 ms
[2024-05-25 16:38:51] [INFO ] Time to serialize properties into /tmp/CTLFireability12335353930783781570.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/CTLFireability17131231971187865542.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12335353930783781570.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.14573e+09,0.083443,5956,2,1136,5,9160,6,0,574,10936,0


Converting to forward existential form...Done !
original formula: AG((((!(A((p48==1) U ((p98==1)||((p105==1)&&(p136==1))))) + EF(!(A((p40==1) U (p84==1))))) + ((AG((p134==1)) * (p115==0)) * ((p114==0)&&(...281
=> equivalent forward existential formula: ((([(FwdU((FwdU(Init,TRUE) * !((!(!((E(!(((p98==1)||((p105==1)&&(p136==1)))) U (!((p48==1)) * !(((p98==1)||((p10...1096
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t21, t61, t64, t67, t68, Intersection with reachable at each step enabled. (destroye...194
(forward)formula 0,0,3.11765,93164,1,0,407,569751,246,185,3555,453448,467
FORMULA Parking-PT-208-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 110
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 110
Applied a total of 6 rules in 6 ms. Remains 121 /124 variables (removed 3) and now considering 110/113 (removed 3) transitions.
// Phase 1: matrix 110 rows 121 cols
[2024-05-25 16:38:55] [INFO ] Computed 25 invariants in 2 ms
[2024-05-25 16:38:55] [INFO ] Implicit Places using invariants in 165 ms returned [35, 49, 61]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 167 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/124 places, 110/113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 116 transition count 108
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 116 transition count 108
Applied a total of 4 rules in 7 ms. Remains 116 /118 variables (removed 2) and now considering 108/110 (removed 2) transitions.
// Phase 1: matrix 108 rows 116 cols
[2024-05-25 16:38:55] [INFO ] Computed 22 invariants in 1 ms
[2024-05-25 16:38:55] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-25 16:38:55] [INFO ] Invariant cache hit.
[2024-05-25 16:38:55] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-25 16:38:55] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 116/124 places, 108/113 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 625 ms. Remains : 116/124 places, 108/113 transitions.
[2024-05-25 16:38:55] [INFO ] Flatten gal took : 12 ms
[2024-05-25 16:38:55] [INFO ] Flatten gal took : 11 ms
[2024-05-25 16:38:55] [INFO ] Input system was already deterministic with 108 transitions.
[2024-05-25 16:38:55] [INFO ] Flatten gal took : 11 ms
[2024-05-25 16:38:55] [INFO ] Flatten gal took : 12 ms
[2024-05-25 16:38:55] [INFO ] Time to serialize gal into /tmp/CTLFireability11136125213938108495.gal : 3 ms
[2024-05-25 16:38:55] [INFO ] Time to serialize properties into /tmp/CTLFireability1389513755612393219.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/CTLFireability11136125213938108495.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1389513755612393219.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.14573e+09,0.134161,5948,2,1196,5,9578,6,0,574,11931,0


Converting to forward existential form...Done !
original formula: AF(((EF(((EX((p106==1)) + ((p67==1)&&(p2==1))) + (p48==1))) + (p40==1)) + (p48==1)))
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U ((EX((p106==1)) + ((p67==1)&&(p2==1))) + (p48==1))) + (p40==1)) + (p48==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t20, t21, t85, t88, t91, t92, Intersection with reachable at each step enabled. (destroy...195
(forward)formula 0,1,4.24295,114136,1,0,231,664621,246,114,3561,518934,250
FORMULA Parking-PT-208-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 109
Applied a total of 8 rules in 6 ms. Remains 120 /124 variables (removed 4) and now considering 109/113 (removed 4) transitions.
// Phase 1: matrix 109 rows 120 cols
[2024-05-25 16:39:00] [INFO ] Computed 25 invariants in 4 ms
[2024-05-25 16:39:00] [INFO ] Implicit Places using invariants in 159 ms returned [35, 49, 61]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 172 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/124 places, 109/113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 115 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 115 transition count 107
Applied a total of 4 rules in 4 ms. Remains 115 /117 variables (removed 2) and now considering 107/109 (removed 2) transitions.
// Phase 1: matrix 107 rows 115 cols
[2024-05-25 16:39:00] [INFO ] Computed 22 invariants in 2 ms
[2024-05-25 16:39:00] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-25 16:39:00] [INFO ] Invariant cache hit.
[2024-05-25 16:39:00] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-25 16:39:00] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/124 places, 107/113 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 646 ms. Remains : 115/124 places, 107/113 transitions.
[2024-05-25 16:39:00] [INFO ] Flatten gal took : 10 ms
[2024-05-25 16:39:00] [INFO ] Flatten gal took : 22 ms
[2024-05-25 16:39:00] [INFO ] Input system was already deterministic with 107 transitions.
[2024-05-25 16:39:00] [INFO ] Flatten gal took : 9 ms
[2024-05-25 16:39:00] [INFO ] Flatten gal took : 9 ms
[2024-05-25 16:39:00] [INFO ] Time to serialize gal into /tmp/CTLFireability7776702290789863874.gal : 2 ms
[2024-05-25 16:39:00] [INFO ] Time to serialize properties into /tmp/CTLFireability1200762315154083180.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/CTLFireability7776702290789863874.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1200762315154083180.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.62144e+09,0.073724,5680,2,1003,5,8607,6,0,569,9967,0


Converting to forward existential form...Done !
original formula: AX(E(AF((p90==1)) U (p106==1)))
=> equivalent forward existential formula: [(EY(Init) * !(E(!(EG(!((p90==1)))) U (p106==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t20, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tota...170
(forward)formula 0,0,12.8114,336396,1,0,687,2.06931e+06,241,324,3368,1.9719e+06,775
FORMULA Parking-PT-208-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Reduce places removed 1 places and 1 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 3 place count 123 transition count 109
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 120 transition count 109
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 120 transition count 106
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 117 transition count 106
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 16 place count 113 transition count 102
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 113 transition count 102
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 110 transition count 99
Applied a total of 26 rules in 31 ms. Remains 110 /124 variables (removed 14) and now considering 99/113 (removed 14) transitions.
// Phase 1: matrix 99 rows 110 cols
[2024-05-25 16:39:13] [INFO ] Computed 25 invariants in 1 ms
[2024-05-25 16:39:13] [INFO ] Implicit Places using invariants in 150 ms returned [34, 46, 58]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 151 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 107/124 places, 99/113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 105 transition count 97
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 105 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 104 transition count 96
Applied a total of 6 rules in 9 ms. Remains 104 /107 variables (removed 3) and now considering 96/99 (removed 3) transitions.
// Phase 1: matrix 96 rows 104 cols
[2024-05-25 16:39:13] [INFO ] Computed 22 invariants in 1 ms
[2024-05-25 16:39:13] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-25 16:39:13] [INFO ] Invariant cache hit.
[2024-05-25 16:39:14] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 104/124 places, 96/113 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 504 ms. Remains : 104/124 places, 96/113 transitions.
[2024-05-25 16:39:14] [INFO ] Flatten gal took : 9 ms
[2024-05-25 16:39:14] [INFO ] Flatten gal took : 8 ms
[2024-05-25 16:39:14] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-25 16:39:14] [INFO ] Flatten gal took : 8 ms
[2024-05-25 16:39:14] [INFO ] Flatten gal took : 8 ms
[2024-05-25 16:39:14] [INFO ] Time to serialize gal into /tmp/CTLFireability13925064499838661515.gal : 3 ms
[2024-05-25 16:39:14] [INFO ] Time to serialize properties into /tmp/CTLFireability4399473677260366180.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/CTLFireability13925064499838661515.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4399473677260366180.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(AG((p48==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p48==1)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.105788,6660,1,0,7,20286,15,1,2317,3786,5
FORMULA Parking-PT-208-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 113/113 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 3 place count 124 transition count 110
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 121 transition count 110
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 121 transition count 107
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 118 transition count 107
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 16 place count 114 transition count 103
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 114 transition count 103
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 112 transition count 101
Applied a total of 24 rules in 24 ms. Remains 112 /124 variables (removed 12) and now considering 101/113 (removed 12) transitions.
// Phase 1: matrix 101 rows 112 cols
[2024-05-25 16:39:14] [INFO ] Computed 25 invariants in 0 ms
[2024-05-25 16:39:14] [INFO ] Implicit Places using invariants in 115 ms returned [35, 45, 57]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 116 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 109/124 places, 101/113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 107 transition count 99
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 107 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 106 transition count 98
Applied a total of 6 rules in 15 ms. Remains 106 /109 variables (removed 3) and now considering 98/101 (removed 3) transitions.
// Phase 1: matrix 98 rows 106 cols
[2024-05-25 16:39:14] [INFO ] Computed 22 invariants in 1 ms
[2024-05-25 16:39:14] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-25 16:39:14] [INFO ] Invariant cache hit.
[2024-05-25 16:39:14] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-25 16:39:14] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 106/124 places, 98/113 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 496 ms. Remains : 106/124 places, 98/113 transitions.
[2024-05-25 16:39:14] [INFO ] Flatten gal took : 8 ms
[2024-05-25 16:39:14] [INFO ] Flatten gal took : 8 ms
[2024-05-25 16:39:14] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-25 16:39:14] [INFO ] Flatten gal took : 9 ms
[2024-05-25 16:39:14] [INFO ] Flatten gal took : 9 ms
[2024-05-25 16:39:14] [INFO ] Time to serialize gal into /tmp/CTLFireability6736039156761513756.gal : 2 ms
[2024-05-25 16:39:14] [INFO ] Time to serialize properties into /tmp/CTLFireability6199113891182566216.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/CTLFireability6736039156761513756.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6199113891182566216.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.53983e+09,0.066523,5364,2,822,5,7278,6,0,524,8535,0


Converting to forward existential form...Done !
original formula: EG((AG(((p33==0)||(p70==0))) + (p106==1)))
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !(((p33==0)||(p70==0))))) + (p106==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t17, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,0,1.07509,32720,1,0,191,190211,223,96,3206,121512,218
FORMULA Parking-PT-208-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 109
Applied a total of 8 rules in 3 ms. Remains 120 /124 variables (removed 4) and now considering 109/113 (removed 4) transitions.
// Phase 1: matrix 109 rows 120 cols
[2024-05-25 16:39:15] [INFO ] Computed 25 invariants in 0 ms
[2024-05-25 16:39:16] [INFO ] Implicit Places using invariants in 127 ms returned [35, 49, 61]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 128 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/124 places, 109/113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 115 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 115 transition count 107
Applied a total of 4 rules in 4 ms. Remains 115 /117 variables (removed 2) and now considering 107/109 (removed 2) transitions.
// Phase 1: matrix 107 rows 115 cols
[2024-05-25 16:39:16] [INFO ] Computed 22 invariants in 1 ms
[2024-05-25 16:39:16] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-25 16:39:16] [INFO ] Invariant cache hit.
[2024-05-25 16:39:16] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-25 16:39:16] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/124 places, 107/113 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 440 ms. Remains : 115/124 places, 107/113 transitions.
[2024-05-25 16:39:16] [INFO ] Flatten gal took : 9 ms
[2024-05-25 16:39:16] [INFO ] Flatten gal took : 10 ms
[2024-05-25 16:39:16] [INFO ] Input system was already deterministic with 107 transitions.
[2024-05-25 16:39:16] [INFO ] Flatten gal took : 9 ms
[2024-05-25 16:39:16] [INFO ] Flatten gal took : 10 ms
[2024-05-25 16:39:16] [INFO ] Time to serialize gal into /tmp/CTLFireability4008834680483145624.gal : 1 ms
[2024-05-25 16:39:16] [INFO ] Time to serialize properties into /tmp/CTLFireability10575678102488750912.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/CTLFireability4008834680483145624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10575678102488750912.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.62144e+09,0.077587,5680,2,1003,5,8607,6,0,569,9967,0


Converting to forward existential form...Done !
original formula: (AF((((EF((p40==1)) + (((p80==1)&&(p104==1))&&(((p76==0)||(p97==0))&&((((p0==1)&&(p6==1))||(p90==1))||((p16==1)&&(p57==1)))))) * EX(A(((p...255
=> equivalent forward existential formula: [FwdG((Init * !(EG((p48==1)))),!((((E(TRUE U (p40==1)) + (((p80==1)&&(p104==1))&&(((p76==0)||(p97==0))&&((((p0==...354
Reverse transition relation is NOT exact ! Due to transitions t2, t20, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tota...170
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,26.4972,575720,1,0,1437,3.48952e+06,268,730,3703,3.42399e+06,1557
FORMULA Parking-PT-208-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 113/113 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 3 place count 124 transition count 110
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 121 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 120 transition count 109
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 120 transition count 106
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 117 transition count 106
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 18 place count 113 transition count 102
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 113 transition count 102
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 28 place count 110 transition count 99
Applied a total of 28 rules in 14 ms. Remains 110 /124 variables (removed 14) and now considering 99/113 (removed 14) transitions.
// Phase 1: matrix 99 rows 110 cols
[2024-05-25 16:39:43] [INFO ] Computed 25 invariants in 1 ms
[2024-05-25 16:39:43] [INFO ] Implicit Places using invariants in 105 ms returned [35, 45, 57]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 110 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 107/124 places, 99/113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 105 transition count 97
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 105 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 104 transition count 96
Applied a total of 6 rules in 8 ms. Remains 104 /107 variables (removed 3) and now considering 96/99 (removed 3) transitions.
// Phase 1: matrix 96 rows 104 cols
[2024-05-25 16:39:43] [INFO ] Computed 22 invariants in 0 ms
[2024-05-25 16:39:43] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-25 16:39:43] [INFO ] Invariant cache hit.
[2024-05-25 16:39:43] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-25 16:39:43] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 104/124 places, 96/113 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 464 ms. Remains : 104/124 places, 96/113 transitions.
[2024-05-25 16:39:43] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:39:43] [INFO ] Flatten gal took : 15 ms
[2024-05-25 16:39:43] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-25 16:39:43] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:39:43] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:39:43] [INFO ] Time to serialize gal into /tmp/CTLFireability8159829489608011867.gal : 2 ms
[2024-05-25 16:39:43] [INFO ] Time to serialize properties into /tmp/CTLFireability15016577903579025917.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/CTLFireability8159829489608011867.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15016577903579025917.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.04019e+09,0.061567,5084,2,890,5,6531,6,0,514,6898,0


Converting to forward existential form...Done !
original formula: EF((A((p107==1) U (p24==1)) * ((p14==1)||(p16==0))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * ((p14==1)||(p16==0))) * !(EG(!((p24==1))))) * !(E(!((p24==1)) U (!((p107==1)) * !((p24==1)...170
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 93/0/3
Hit Full ! (commute/partial/dont) 93/0/3
(forward)formula 0,1,7.27963,177636,1,0,14,1.0305e+06,25,8,2569,858519,13
FORMULA Parking-PT-208-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 109
Applied a total of 8 rules in 2 ms. Remains 120 /124 variables (removed 4) and now considering 109/113 (removed 4) transitions.
// Phase 1: matrix 109 rows 120 cols
[2024-05-25 16:39:51] [INFO ] Computed 25 invariants in 1 ms
[2024-05-25 16:39:51] [INFO ] Implicit Places using invariants in 144 ms returned [35, 49, 61]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 145 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/124 places, 109/113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 115 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 115 transition count 107
Applied a total of 4 rules in 1 ms. Remains 115 /117 variables (removed 2) and now considering 107/109 (removed 2) transitions.
// Phase 1: matrix 107 rows 115 cols
[2024-05-25 16:39:51] [INFO ] Computed 22 invariants in 1 ms
[2024-05-25 16:39:51] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-25 16:39:51] [INFO ] Invariant cache hit.
[2024-05-25 16:39:51] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-25 16:39:51] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/124 places, 107/113 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 475 ms. Remains : 115/124 places, 107/113 transitions.
[2024-05-25 16:39:51] [INFO ] Flatten gal took : 7 ms
[2024-05-25 16:39:51] [INFO ] Flatten gal took : 7 ms
[2024-05-25 16:39:51] [INFO ] Input system was already deterministic with 107 transitions.
[2024-05-25 16:39:51] [INFO ] Flatten gal took : 7 ms
[2024-05-25 16:39:51] [INFO ] Flatten gal took : 7 ms
[2024-05-25 16:39:51] [INFO ] Time to serialize gal into /tmp/CTLFireability16036331342832405730.gal : 7 ms
[2024-05-25 16:39:51] [INFO ] Time to serialize properties into /tmp/CTLFireability1579721768478696325.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/CTLFireability16036331342832405730.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1579721768478696325.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.62144e+09,0.120248,5680,2,1003,5,8607,6,0,569,9967,0


Converting to forward existential form...Done !
original formula: EF(AG(AX((p6==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EX(!((p6==0))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t20, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tota...170
(forward)formula 0,1,1.87712,49700,1,0,207,284912,236,104,3444,205215,231
FORMULA Parking-PT-208-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 122 transition count 111
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 122 transition count 111
Applied a total of 4 rules in 2 ms. Remains 122 /124 variables (removed 2) and now considering 111/113 (removed 2) transitions.
// Phase 1: matrix 111 rows 122 cols
[2024-05-25 16:39:53] [INFO ] Computed 25 invariants in 1 ms
[2024-05-25 16:39:53] [INFO ] Implicit Places using invariants in 87 ms returned [35, 49]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 89 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 120/124 places, 111/113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 118 transition count 109
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 118 transition count 109
Applied a total of 4 rules in 1 ms. Remains 118 /120 variables (removed 2) and now considering 109/111 (removed 2) transitions.
// Phase 1: matrix 109 rows 118 cols
[2024-05-25 16:39:53] [INFO ] Computed 23 invariants in 1 ms
[2024-05-25 16:39:53] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-25 16:39:53] [INFO ] Invariant cache hit.
[2024-05-25 16:39:53] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-25 16:39:53] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 118/124 places, 109/113 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 369 ms. Remains : 118/124 places, 109/113 transitions.
[2024-05-25 16:39:53] [INFO ] Flatten gal took : 6 ms
[2024-05-25 16:39:53] [INFO ] Flatten gal took : 5 ms
[2024-05-25 16:39:53] [INFO ] Input system was already deterministic with 109 transitions.
[2024-05-25 16:39:53] [INFO ] Flatten gal took : 6 ms
[2024-05-25 16:39:53] [INFO ] Flatten gal took : 6 ms
[2024-05-25 16:39:53] [INFO ] Time to serialize gal into /tmp/CTLFireability10835439562570765575.gal : 2 ms
[2024-05-25 16:39:53] [INFO ] Time to serialize properties into /tmp/CTLFireability7430047187988361758.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/CTLFireability10835439562570765575.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7430047187988361758.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.25059e+09,0.113877,6228,2,1252,5,10389,6,0,583,12821,0


Converting to forward existential form...Done !
original formula: A((!(((E(E(((p26==1)&&(p69==1)) U (p40==1)) U E((p32==1) U (p14==1))) * AX(((p76==1)||(p2==1)))) * EF(EX((p40==1))))) * EG((AX(AF((p114==...492
=> equivalent forward existential formula: [((Init * !(EG(!(((((!(EX(!((p106!=1)))) * E(TRUE U (p18==1))) * (E((EG(((p84==1)&&(p112==1))) * (p114!=1)) U E(...1239
Reverse transition relation is NOT exact ! Due to transitions t2, t20, t21, t85, t88, t91, t92, Intersection with reachable at each step enabled. (destroy...195
Detected timeout of ITS tools.
[2024-05-25 16:40:23] [INFO ] Flatten gal took : 5 ms
[2024-05-25 16:40:23] [INFO ] Applying decomposition
[2024-05-25 16:40:23] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1603747782005053406.txt' '-o' '/tmp/graph1603747782005053406.bin' '-w' '/tmp/graph1603747782005053406.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1603747782005053406.bin' '-l' '-1' '-v' '-w' '/tmp/graph1603747782005053406.weights' '-q' '0' '-e' '0.001'
[2024-05-25 16:40:24] [INFO ] Decomposing Gal with order
[2024-05-25 16:40:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 16:40:24] [INFO ] Removed a total of 13 redundant transitions.
[2024-05-25 16:40:24] [INFO ] Flatten gal took : 50 ms
[2024-05-25 16:40:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-25 16:40:24] [INFO ] Time to serialize gal into /tmp/CTLFireability1388306070117070513.gal : 5 ms
[2024-05-25 16:40:24] [INFO ] Time to serialize properties into /tmp/CTLFireability3918513201923240189.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/CTLFireability1388306070117070513.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3918513201923240189.ctl'

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 -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.25059e+09,0.041681,4616,135,62,1693,668,343,1952,77,1439,0


Converting to forward existential form...Done !
original formula: A((!(((E(E(((i3.u21.p26==1)&&(i3.u21.p69==1)) U (i3.u13.p40==1)) U E((i2.u12.p32==1) U (i2.u6.p14==1))) * AX(((i7.u24.p76==1)||(i1.u0.p2=...719
=> equivalent forward existential formula: [((Init * !(EG(!(((((!(EX(!((i8.u33.p106!=1)))) * E(TRUE U (i2.u8.p18==1))) * (E((EG(((i10.i1.u28.p84==1)&&(i10....1746
Reverse transition relation is NOT exact ! Due to transitions t91, i2.t92, i2.t88, i2.t85, i3.u21.t20, i3.u21.t21, i8.u40.t2, Intersection with reachable ...225
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 109
Applied a total of 8 rules in 2 ms. Remains 120 /124 variables (removed 4) and now considering 109/113 (removed 4) transitions.
// Phase 1: matrix 109 rows 120 cols
[2024-05-25 16:40:54] [INFO ] Computed 25 invariants in 0 ms
[2024-05-25 16:40:54] [INFO ] Implicit Places using invariants in 107 ms returned [35, 49, 61]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 108 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/124 places, 109/113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 115 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 115 transition count 107
Applied a total of 4 rules in 2 ms. Remains 115 /117 variables (removed 2) and now considering 107/109 (removed 2) transitions.
// Phase 1: matrix 107 rows 115 cols
[2024-05-25 16:40:54] [INFO ] Computed 22 invariants in 1 ms
[2024-05-25 16:40:54] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-25 16:40:54] [INFO ] Invariant cache hit.
[2024-05-25 16:40:54] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-25 16:40:54] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/124 places, 107/113 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 382 ms. Remains : 115/124 places, 107/113 transitions.
[2024-05-25 16:40:54] [INFO ] Flatten gal took : 5 ms
[2024-05-25 16:40:54] [INFO ] Flatten gal took : 5 ms
[2024-05-25 16:40:54] [INFO ] Input system was already deterministic with 107 transitions.
[2024-05-25 16:40:54] [INFO ] Flatten gal took : 5 ms
[2024-05-25 16:40:54] [INFO ] Flatten gal took : 5 ms
[2024-05-25 16:40:54] [INFO ] Time to serialize gal into /tmp/CTLFireability4579655400166719248.gal : 2 ms
[2024-05-25 16:40:54] [INFO ] Time to serialize properties into /tmp/CTLFireability17073421153074123732.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/CTLFireability4579655400166719248.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17073421153074123732.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.62144e+09,0.070608,5712,2,1003,5,8607,6,0,569,9967,0


Converting to forward existential form...Done !
original formula: E(AX(AX(!(AG(((p116==1)&&(p136==1)))))) U EF((p49==1)))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,!(EX(!(!(EX(!(!(!(E(TRUE U !(((p116==1)&&(p136==1))))))))))))),TRUE) * (p49==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t20, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tota...170
(forward)formula 0,1,0.88173,27040,1,0,201,141476,238,99,3548,87021,229
FORMULA Parking-PT-208-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 109
Applied a total of 8 rules in 2 ms. Remains 120 /124 variables (removed 4) and now considering 109/113 (removed 4) transitions.
// Phase 1: matrix 109 rows 120 cols
[2024-05-25 16:40:55] [INFO ] Computed 25 invariants in 3 ms
[2024-05-25 16:40:55] [INFO ] Implicit Places using invariants in 100 ms returned [35, 49, 61]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 105 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/124 places, 109/113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 115 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 115 transition count 107
Applied a total of 4 rules in 1 ms. Remains 115 /117 variables (removed 2) and now considering 107/109 (removed 2) transitions.
// Phase 1: matrix 107 rows 115 cols
[2024-05-25 16:40:55] [INFO ] Computed 22 invariants in 1 ms
[2024-05-25 16:40:55] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-25 16:40:55] [INFO ] Invariant cache hit.
[2024-05-25 16:40:55] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-25 16:40:55] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/124 places, 107/113 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 390 ms. Remains : 115/124 places, 107/113 transitions.
[2024-05-25 16:40:55] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:40:55] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:40:55] [INFO ] Input system was already deterministic with 107 transitions.
[2024-05-25 16:40:55] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:40:55] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:40:55] [INFO ] Time to serialize gal into /tmp/CTLFireability18406623207495423648.gal : 2 ms
[2024-05-25 16:40:55] [INFO ] Time to serialize properties into /tmp/CTLFireability12894174647697834315.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/CTLFireability18406623207495423648.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12894174647697834315.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.62144e+09,0.071247,5712,2,1003,5,8607,6,0,569,9967,0


Converting to forward existential form...Done !
original formula: AX(((EX(EF((p98==1))) * (((p81==0)||(p109==0)) + ((EF(((p11==0)||(p35==0))) * (p16==1)) * ((p57==1)&&(p107==1))))) * ((p40==0) + AX((p72=...162
=> equivalent forward existential formula: (([(EY(Init) * !(EX(E(TRUE U (p98==1)))))] = FALSE * (([((EY(Init) * !(((p81==0)||(p109==0)))) * !(E(TRUE U ((p1...389
Reverse transition relation is NOT exact ! Due to transitions t2, t20, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tota...170
(forward)formula 0,1,1.35786,39904,1,0,220,229741,246,114,3537,148993,248
FORMULA Parking-PT-208-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 109
Applied a total of 8 rules in 2 ms. Remains 120 /124 variables (removed 4) and now considering 109/113 (removed 4) transitions.
// Phase 1: matrix 109 rows 120 cols
[2024-05-25 16:40:57] [INFO ] Computed 25 invariants in 1 ms
[2024-05-25 16:40:57] [INFO ] Implicit Places using invariants in 146 ms returned [35, 49, 61]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 148 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/124 places, 109/113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 115 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 115 transition count 107
Applied a total of 4 rules in 2 ms. Remains 115 /117 variables (removed 2) and now considering 107/109 (removed 2) transitions.
// Phase 1: matrix 107 rows 115 cols
[2024-05-25 16:40:57] [INFO ] Computed 22 invariants in 0 ms
[2024-05-25 16:40:57] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-25 16:40:57] [INFO ] Invariant cache hit.
[2024-05-25 16:40:57] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-25 16:40:57] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/124 places, 107/113 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 525 ms. Remains : 115/124 places, 107/113 transitions.
[2024-05-25 16:40:57] [INFO ] Flatten gal took : 9 ms
[2024-05-25 16:40:57] [INFO ] Flatten gal took : 7 ms
[2024-05-25 16:40:57] [INFO ] Input system was already deterministic with 107 transitions.
[2024-05-25 16:40:57] [INFO ] Flatten gal took : 6 ms
[2024-05-25 16:40:57] [INFO ] Flatten gal took : 6 ms
[2024-05-25 16:40:57] [INFO ] Time to serialize gal into /tmp/CTLFireability6565358278147364587.gal : 2 ms
[2024-05-25 16:40:57] [INFO ] Time to serialize properties into /tmp/CTLFireability17884845943333258480.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/CTLFireability6565358278147364587.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17884845943333258480.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.62144e+09,0.079693,5712,2,1003,5,8607,6,0,569,9967,0


Converting to forward existential form...Done !
original formula: AX(((EG(((p32==0) * AF((p82==0)))) * EF((p41==0))) * !(A(EX((p32==1)) U (((p39==1)&&(p70==1)) + EG(((p1==1)&&(p125==1))))))))
=> equivalent forward existential formula: (([(EY(Init) * !(EG(((p32==0) * !(EG(!((p82==0))))))))] = FALSE * [(EY(Init) * !(E(TRUE U (p41==0))))] = FALSE) ...378
Reverse transition relation is NOT exact ! Due to transitions t2, t20, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tota...170
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-05-25 16:41:27] [INFO ] Flatten gal took : 5 ms
[2024-05-25 16:41:27] [INFO ] Applying decomposition
[2024-05-25 16:41:27] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8847097212146298923.txt' '-o' '/tmp/graph8847097212146298923.bin' '-w' '/tmp/graph8847097212146298923.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8847097212146298923.bin' '-l' '-1' '-v' '-w' '/tmp/graph8847097212146298923.weights' '-q' '0' '-e' '0.001'
[2024-05-25 16:41:28] [INFO ] Decomposing Gal with order
[2024-05-25 16:41:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 16:41:28] [INFO ] Removed a total of 13 redundant transitions.
[2024-05-25 16:41:28] [INFO ] Flatten gal took : 13 ms
[2024-05-25 16:41:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-25 16:41:28] [INFO ] Time to serialize gal into /tmp/CTLFireability10418968376733262010.gal : 3 ms
[2024-05-25 16:41:28] [INFO ] Time to serialize properties into /tmp/CTLFireability12924838814378292642.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/CTLFireability10418968376733262010.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12924838814378292642.ctl'

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 -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.62144e+09,0.04082,4636,105,39,1490,689,341,1684,74,1468,0


Converting to forward existential form...Done !
original formula: AX(((EG(((i1.u12.p32==0) * AF((i8.u25.p82==0)))) * EF((i3.u13.p41==0))) * !(A(EX((i1.u12.p32==1)) U (((i3.u13.p39==1)&&(i3.u19.p70==1)) +...198
=> equivalent forward existential formula: (([(EY(Init) * !(EG(((i1.u12.p32==0) * !(EG(!((i8.u25.p82==0))))))))] = FALSE * [(EY(Init) * !(E(TRUE U (i3.u13....487
Reverse transition relation is NOT exact ! Due to transitions i3.u19.t20, i11.u38.t2, Intersection with reachable at each step enabled. (destroyed/reverse...185
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,0,7.25504,182304,1,0,305526,4305,1994,778080,438,29288,231862
FORMULA Parking-PT-208-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2024-05-25 16:41:35] [INFO ] Flatten gal took : 5 ms
[2024-05-25 16:41:35] [INFO ] Flatten gal took : 5 ms
[2024-05-25 16:41:35] [INFO ] Applying decomposition
[2024-05-25 16:41:35] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7202572229922015037.txt' '-o' '/tmp/graph7202572229922015037.bin' '-w' '/tmp/graph7202572229922015037.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7202572229922015037.bin' '-l' '-1' '-v' '-w' '/tmp/graph7202572229922015037.weights' '-q' '0' '-e' '0.001'
[2024-05-25 16:41:35] [INFO ] Decomposing Gal with order
[2024-05-25 16:41:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 16:41:35] [INFO ] Removed a total of 10 redundant transitions.
[2024-05-25 16:41:35] [INFO ] Flatten gal took : 11 ms
[2024-05-25 16:41:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-25 16:41:35] [INFO ] Time to serialize gal into /tmp/CTLFireability17301032083256290104.gal : 4 ms
[2024-05-25 16:41:35] [INFO ] Time to serialize properties into /tmp/CTLFireability17324016373930124896.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/CTLFireability17301032083256290104.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17324016373930124896.ctl'

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 -...264
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.15236e+09,0.053836,4984,160,105,1948,1232,359,2618,86,2741,0


Converting to forward existential form...Done !
original formula: A((!(((E(E(((i5.u22.p26==1)&&(i5.u22.p69==1)) U (i5.u13.p40==1)) U E((i3.u11.p32==1) U (i2.i0.u6.p14==1))) * AX(((i7.u25.p76==1)||(i0.u0....738
=> equivalent forward existential formula: [((Init * !(EG(!(((((!(EX(!((i10.u33.p106!=1)))) * E(TRUE U (i2.i1.u8.p18==1))) * (E((EG(((i9.i1.u29.p84==1)&&(i...1775
Reverse transition relation is NOT exact ! Due to transitions t65, t68, t109, t110, i2.t111, i2.i1.t108, i5.u22.t21, i5.u22.t22, i9.t69, i9.i1.t62, i10.u40...272
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,0,29.3341,556524,1,0,817209,5706,2209,2.24896e+06,525,28365,721315
FORMULA Parking-PT-208-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 213292 ms.

BK_STOP 1716655324978

--------------------
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="Parking-PT-208"
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 Parking-PT-208, 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 r268-smll-171654406800066"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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