About the Execution of ITS-Tools for AutoFlight-PT-05a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1050.668 | 155935.00 | 176113.00 | 638.00 | FTFFTTTFTTFTFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r026-smll-171620167000122.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 AutoFlight-PT-05a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167000122
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 22:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Apr 12 22:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 22:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 12 22:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 36K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME AutoFlight-PT-05a-CTLFireability-2024-00
FORMULA_NAME AutoFlight-PT-05a-CTLFireability-2024-01
FORMULA_NAME AutoFlight-PT-05a-CTLFireability-2024-02
FORMULA_NAME AutoFlight-PT-05a-CTLFireability-2024-03
FORMULA_NAME AutoFlight-PT-05a-CTLFireability-2024-04
FORMULA_NAME AutoFlight-PT-05a-CTLFireability-2024-05
FORMULA_NAME AutoFlight-PT-05a-CTLFireability-2024-06
FORMULA_NAME AutoFlight-PT-05a-CTLFireability-2024-07
FORMULA_NAME AutoFlight-PT-05a-CTLFireability-2024-08
FORMULA_NAME AutoFlight-PT-05a-CTLFireability-2024-09
FORMULA_NAME AutoFlight-PT-05a-CTLFireability-2024-10
FORMULA_NAME AutoFlight-PT-05a-CTLFireability-2024-11
FORMULA_NAME AutoFlight-PT-05a-CTLFireability-2023-12
FORMULA_NAME AutoFlight-PT-05a-CTLFireability-2023-13
FORMULA_NAME AutoFlight-PT-05a-CTLFireability-2023-14
FORMULA_NAME AutoFlight-PT-05a-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716258028276
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-05a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 02:20:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 02:20:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 02:20:30] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-05-21 02:20:30] [INFO ] Transformed 132 places.
[2024-05-21 02:20:30] [INFO ] Transformed 130 transitions.
[2024-05-21 02:20:30] [INFO ] Found NUPN structural information;
[2024-05-21 02:20:30] [INFO ] Parsed PT model containing 132 places and 130 transitions and 420 arcs in 283 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
Support contains 91 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 105/105 transitions.
Applied a total of 0 rules in 34 ms. Remains 132 /132 variables (removed 0) and now considering 105/105 (removed 0) transitions.
// Phase 1: matrix 105 rows 132 cols
[2024-05-21 02:20:30] [INFO ] Computed 34 invariants in 22 ms
[2024-05-21 02:20:31] [INFO ] Implicit Places using invariants in 521 ms returned [38, 44, 77, 111, 129]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 574 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 127/132 places, 105/105 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 126 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 126 transition count 104
Applied a total of 2 rules in 15 ms. Remains 126 /127 variables (removed 1) and now considering 104/105 (removed 1) transitions.
// Phase 1: matrix 104 rows 126 cols
[2024-05-21 02:20:31] [INFO ] Computed 29 invariants in 20 ms
[2024-05-21 02:20:31] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-21 02:20:31] [INFO ] Invariant cache hit.
[2024-05-21 02:20:31] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 02:20:31] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 126/132 places, 104/105 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1027 ms. Remains : 126/132 places, 104/105 transitions.
Support contains 91 out of 126 places after structural reductions.
[2024-05-21 02:20:31] [INFO ] Flatten gal took : 49 ms
[2024-05-21 02:20:31] [INFO ] Flatten gal took : 21 ms
[2024-05-21 02:20:31] [INFO ] Input system was already deterministic with 104 transitions.
Reduction of identical properties reduced properties to check from 81 to 80
RANDOM walk for 40000 steps (1231 resets) in 2314 ms. (17 steps per ms) remains 7/80 properties
BEST_FIRST walk for 40004 steps (175 resets) in 184 ms. (216 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (191 resets) in 99 ms. (400 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (187 resets) in 86 ms. (459 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (139 resets) in 254 ms. (156 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (138 resets) in 119 ms. (333 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (189 resets) in 88 ms. (449 steps per ms) remains 5/7 properties
[2024-05-21 02:20:32] [INFO ] Invariant cache hit.
[2024-05-21 02:20:33] [INFO ] State equation strengthened by 23 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp71 is UNSAT
At refinement iteration 1 (OVERLAPS) 74/96 variables, 15/15 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/15 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/126 variables, 14/29 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/29 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 104/230 variables, 126/155 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 23/178 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/178 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/230 variables, 0/178 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 178 constraints, problems are : Problem set: 4 solved, 1 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, State Equation: 126/126 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/78 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/126 variables, 25/29 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/29 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 104/230 variables, 126/155 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 23/178 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 1/179 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/179 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/230 variables, 0/179 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 179 constraints, problems are : Problem set: 4 solved, 1 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, State Equation: 126/126 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 1/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 513ms problems are : Problem set: 4 solved, 1 unsolved
Finished Parikh walk after 23 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 10 ms.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2024-05-21 02:20:33] [INFO ] Flatten gal took : 12 ms
[2024-05-21 02:20:33] [INFO ] Flatten gal took : 12 ms
[2024-05-21 02:20:33] [INFO ] Input system was already deterministic with 104 transitions.
Computed a total of 9 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 104/104 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 103
Applied a total of 2 rules in 17 ms. Remains 125 /126 variables (removed 1) and now considering 103/104 (removed 1) transitions.
// Phase 1: matrix 103 rows 125 cols
[2024-05-21 02:20:33] [INFO ] Computed 29 invariants in 8 ms
[2024-05-21 02:20:33] [INFO ] Implicit Places using invariants in 143 ms returned [14, 21, 40, 45, 48, 96, 102, 112, 118, 124]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 147 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/126 places, 103/104 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 111 transition count 99
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 111 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 110 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 110 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 109 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 109 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 108 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 108 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 107 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 107 transition count 95
Applied a total of 16 rules in 33 ms. Remains 107 /115 variables (removed 8) and now considering 95/103 (removed 8) transitions.
// Phase 1: matrix 95 rows 107 cols
[2024-05-21 02:20:33] [INFO ] Computed 19 invariants in 2 ms
[2024-05-21 02:20:33] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-21 02:20:33] [INFO ] Invariant cache hit.
[2024-05-21 02:20:34] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 02:20:34] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 107/126 places, 95/104 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 497 ms. Remains : 107/126 places, 95/104 transitions.
[2024-05-21 02:20:34] [INFO ] Flatten gal took : 8 ms
[2024-05-21 02:20:34] [INFO ] Flatten gal took : 7 ms
[2024-05-21 02:20:34] [INFO ] Input system was already deterministic with 95 transitions.
[2024-05-21 02:20:34] [INFO ] Flatten gal took : 8 ms
[2024-05-21 02:20:34] [INFO ] Flatten gal took : 8 ms
[2024-05-21 02:20:34] [INFO ] Time to serialize gal into /tmp/CTLFireability2737894497306532475.gal : 4 ms
[2024-05-21 02:20:34] [INFO ] Time to serialize properties into /tmp/CTLFireability3134045660301796287.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/CTLFireability2737894497306532475.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3134045660301796287.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.9993e+07,0.245051,10504,2,1319,5,25020,6,0,519,41406,0
Converting to forward existential form...Done !
original formula: AG(((AX((p61==1)) + A(((p45==1)&&(p121==1)) U ((p7==1)&&(p89==1)))) + (EX(((p28==1)&&(p70==1))) + AX(((p35==0)||(p56==0))))))
=> equivalent forward existential formula: [(EY(((FwdU(Init,TRUE) * !((!(EX(!((p61==1)))) + !((E(!(((p7==1)&&(p89==1))) U (!(((p45==1)&&(p121==1))) * !(((p...276
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t10, t12, t14, t16, t18, t20, t22, t24, t44, t55, t59, Intersection with reachable a...223
(forward)formula 0,0,4.10939,118924,1,0,725,748165,222,367,3007,668392,822
FORMULA AutoFlight-PT-05a-CTLFireability-2024-00 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 : 126/126 places, 104/104 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 126 transition count 91
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 113 transition count 91
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 26 place count 113 transition count 83
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 42 place count 105 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 104 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 104 transition count 82
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 60 place count 96 transition count 74
Applied a total of 60 rules in 38 ms. Remains 96 /126 variables (removed 30) and now considering 74/104 (removed 30) transitions.
// Phase 1: matrix 74 rows 96 cols
[2024-05-21 02:20:38] [INFO ] Computed 29 invariants in 3 ms
[2024-05-21 02:20:38] [INFO ] Implicit Places using invariants in 145 ms returned [11, 16, 22, 27, 28, 29, 30, 33, 34, 35, 36, 69, 74, 83, 89, 95]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 146 ms to find 16 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 80/126 places, 74/104 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 80 transition count 57
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 63 transition count 57
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 34 place count 63 transition count 53
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 42 place count 59 transition count 53
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 46 place count 55 transition count 49
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 55 transition count 49
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 2 with 2 rules applied. Total rules applied 52 place count 54 transition count 48
Applied a total of 52 rules in 12 ms. Remains 54 /80 variables (removed 26) and now considering 48/74 (removed 26) transitions.
// Phase 1: matrix 48 rows 54 cols
[2024-05-21 02:20:38] [INFO ] Computed 13 invariants in 1 ms
[2024-05-21 02:20:38] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 02:20:38] [INFO ] Invariant cache hit.
[2024-05-21 02:20:38] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-21 02:20:38] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 54/126 places, 48/104 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 350 ms. Remains : 54/126 places, 48/104 transitions.
[2024-05-21 02:20:38] [INFO ] Flatten gal took : 4 ms
[2024-05-21 02:20:38] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:20:38] [INFO ] Input system was already deterministic with 48 transitions.
[2024-05-21 02:20:38] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:20:38] [INFO ] Flatten gal took : 4 ms
[2024-05-21 02:20:38] [INFO ] Time to serialize gal into /tmp/CTLFireability16549002172936542359.gal : 2 ms
[2024-05-21 02:20:38] [INFO ] Time to serialize properties into /tmp/CTLFireability18270877355291525535.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/CTLFireability16549002172936542359.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18270877355291525535.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,118273,0.028111,4248,2,739,5,3787,6,0,264,3926,0
Converting to forward existential form...Done !
original formula: E(!(AG(E(EF(((p7==1)&&(p52==1))) U (p12==1)))) U A(EG(((p27==1)&&(p120==1))) U (p43==1)))
=> equivalent forward existential formula: [((FwdU(Init,!(!(E(TRUE U !(E(E(TRUE U ((p7==1)&&(p52==1))) U (p12==1))))))) * !(EG(!((p43==1))))) * !(E(!((p43=...219
Reverse transition relation is NOT exact ! Due to transitions t4, t9, t47, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/...172
(forward)formula 0,1,1.75851,59296,1,0,595,314123,135,333,1687,379309,653
FORMULA AutoFlight-PT-05a-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 104/104 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 103
Applied a total of 2 rules in 5 ms. Remains 125 /126 variables (removed 1) and now considering 103/104 (removed 1) transitions.
// Phase 1: matrix 103 rows 125 cols
[2024-05-21 02:20:40] [INFO ] Computed 29 invariants in 1 ms
[2024-05-21 02:20:40] [INFO ] Implicit Places using invariants in 128 ms returned [14, 28, 40, 45, 96, 102, 112, 118]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 129 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/126 places, 103/104 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 114 transition count 100
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 114 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 113 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 113 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 112 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 112 transition count 98
Applied a total of 10 rules in 10 ms. Remains 112 /117 variables (removed 5) and now considering 98/103 (removed 5) transitions.
// Phase 1: matrix 98 rows 112 cols
[2024-05-21 02:20:40] [INFO ] Computed 21 invariants in 1 ms
[2024-05-21 02:20:40] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 02:20:40] [INFO ] Invariant cache hit.
[2024-05-21 02:20:40] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-21 02:20:40] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 112/126 places, 98/104 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 366 ms. Remains : 112/126 places, 98/104 transitions.
[2024-05-21 02:20:40] [INFO ] Flatten gal took : 8 ms
[2024-05-21 02:20:40] [INFO ] Flatten gal took : 8 ms
[2024-05-21 02:20:40] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-21 02:20:40] [INFO ] Flatten gal took : 7 ms
[2024-05-21 02:20:40] [INFO ] Flatten gal took : 7 ms
[2024-05-21 02:20:40] [INFO ] Time to serialize gal into /tmp/CTLFireability14519564448110895176.gal : 3 ms
[2024-05-21 02:20:40] [INFO ] Time to serialize properties into /tmp/CTLFireability11253808038858035149.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/CTLFireability14519564448110895176.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11253808038858035149.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,6.19481e+07,0.344172,13248,2,1964,5,35250,6,0,540,58796,0
Converting to forward existential form...Done !
original formula: E(AX(((AX((((p33==1)&&(p100==1))&&(p131==1))) + AF(EX((p57==1)))) + (((AF(((p35==1)&&(p93==1))) * EX((p40==1))) * EG((p3==1))) + (E((p9==...439
=> equivalent forward existential formula: [FwdG(((FwdU(Init,!(EX(!(((!(EX(!((((p33==1)&&(p100==1))&&(p131==1))))) + !(EG(!(EX((p57==1)))))) + (((!(EG(!(((...611
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t10, t12, t14, t16, t18, t20, t22, t24, t46, t59, t61, Intersection with reachable a...223
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-21 02:21:11] [INFO ] Flatten gal took : 8 ms
[2024-05-21 02:21:11] [INFO ] Applying decomposition
[2024-05-21 02:21:11] [INFO ] Flatten gal took : 7 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/graph13275762419744345042.txt' '-o' '/tmp/graph13275762419744345042.bin' '-w' '/tmp/graph13275762419744345042.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13275762419744345042.bin' '-l' '-1' '-v' '-w' '/tmp/graph13275762419744345042.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:21:11] [INFO ] Decomposing Gal with order
[2024-05-21 02:21:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:21:11] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-21 02:21:11] [INFO ] Flatten gal took : 96 ms
[2024-05-21 02:21:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 9 ms.
[2024-05-21 02:21:11] [INFO ] Time to serialize gal into /tmp/CTLFireability8123775732847497200.gal : 11 ms
[2024-05-21 02:21:11] [INFO ] Time to serialize properties into /tmp/CTLFireability17129316104332386424.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/CTLFireability8123775732847497200.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17129316104332386424.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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.19481e+07,0.108533,6844,215,25,6199,282,311,11928,40,562,0
Converting to forward existential form...Done !
original formula: E(AX(((AX((((i9.u9.p33==1)&&(i10.u43.p100==1))&&(i10.u43.p131==1))) + AF(EX((i2.i0.u17.p57==1)))) + (((AF(((i3.i0.u16.p35==1)&&(i5.i1.u30...666
=> equivalent forward existential formula: [FwdG(((FwdU(Init,!(EX(!(((!(EX(!((((i9.u9.p33==1)&&(i10.u43.p100==1))&&(i10.u43.p131==1))))) + !(EG(!(EX((i2.i0...864
Reverse transition relation is NOT exact ! Due to transitions i0.u0.t24, i0.u1.t22, i1.u5.t14, i3.t59, i3.i1.t61, i4.u2.t20, i4.u4.t16, i4.u8.t8, i6.u7.t10...290
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
(forward)formula 0,0,2.20981,72316,1,0,148756,414,2016,198962,210,914,179968
FORMULA AutoFlight-PT-05a-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 104/104 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 126 transition count 94
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 116 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 115 transition count 93
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 22 place count 115 transition count 84
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 40 place count 106 transition count 84
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 105 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 105 transition count 83
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 58 place count 97 transition count 75
Applied a total of 58 rules in 18 ms. Remains 97 /126 variables (removed 29) and now considering 75/104 (removed 29) transitions.
// Phase 1: matrix 75 rows 97 cols
[2024-05-21 02:21:13] [INFO ] Computed 29 invariants in 1 ms
[2024-05-21 02:21:13] [INFO ] Implicit Places using invariants in 168 ms returned [5, 10, 16, 21, 27, 28, 29, 30, 31, 32, 34, 35, 70, 75, 84, 90, 96]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 173 ms to find 17 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 80/126 places, 75/104 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 80 transition count 51
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 56 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 55 transition count 50
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 50 place count 55 transition count 48
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 54 place count 53 transition count 48
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 58 place count 49 transition count 44
Iterating global reduction 3 with 4 rules applied. Total rules applied 62 place count 49 transition count 44
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 3 with 2 rules applied. Total rules applied 64 place count 48 transition count 43
Applied a total of 64 rules in 9 ms. Remains 48 /80 variables (removed 32) and now considering 43/75 (removed 32) transitions.
// Phase 1: matrix 43 rows 48 cols
[2024-05-21 02:21:13] [INFO ] Computed 12 invariants in 0 ms
[2024-05-21 02:21:13] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-21 02:21:13] [INFO ] Invariant cache hit.
[2024-05-21 02:21:13] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-21 02:21:13] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 48/126 places, 43/104 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 374 ms. Remains : 48/126 places, 43/104 transitions.
[2024-05-21 02:21:13] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:21:13] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:21:13] [INFO ] Input system was already deterministic with 43 transitions.
[2024-05-21 02:21:13] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:21:13] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:21:13] [INFO ] Time to serialize gal into /tmp/CTLFireability8058579982198304058.gal : 2 ms
[2024-05-21 02:21:13] [INFO ] Time to serialize properties into /tmp/CTLFireability17284510076484030748.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/CTLFireability8058579982198304058.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17284510076484030748.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,48641,0.018288,3964,2,362,5,2267,6,0,235,2433,0
Converting to forward existential form...Done !
original formula: AG(((!(A(((p47==1)&&(p122==1)) U (p30==1))) * (p59==0)) * ((p17==0)||(p113==0))))
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * !(EG(!((p30==1))))) * !(E(!((p30==1)) U (!(((p47==1)&&(p122==1))) * !((p30==1))))))] = FA...261
(forward)formula 0,0,0.019803,4228,1,0,8,2267,9,2,246,2433,1
FORMULA AutoFlight-PT-05a-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 104/104 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 103
Applied a total of 2 rules in 4 ms. Remains 125 /126 variables (removed 1) and now considering 103/104 (removed 1) transitions.
// Phase 1: matrix 103 rows 125 cols
[2024-05-21 02:21:14] [INFO ] Computed 29 invariants in 2 ms
[2024-05-21 02:21:14] [INFO ] Implicit Places using invariants in 125 ms returned [14, 21, 28, 35, 40, 45, 48, 96, 102, 112, 118, 124]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 126 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/126 places, 103/104 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 109 transition count 99
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 109 transition count 99
Applied a total of 8 rules in 2 ms. Remains 109 /113 variables (removed 4) and now considering 99/103 (removed 4) transitions.
// Phase 1: matrix 99 rows 109 cols
[2024-05-21 02:21:14] [INFO ] Computed 17 invariants in 1 ms
[2024-05-21 02:21:14] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 02:21:14] [INFO ] Invariant cache hit.
[2024-05-21 02:21:14] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 02:21:14] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 109/126 places, 99/104 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 321 ms. Remains : 109/126 places, 99/104 transitions.
[2024-05-21 02:21:14] [INFO ] Flatten gal took : 5 ms
[2024-05-21 02:21:14] [INFO ] Flatten gal took : 6 ms
[2024-05-21 02:21:14] [INFO ] Input system was already deterministic with 99 transitions.
[2024-05-21 02:21:14] [INFO ] Flatten gal took : 6 ms
[2024-05-21 02:21:14] [INFO ] Flatten gal took : 5 ms
[2024-05-21 02:21:14] [INFO ] Time to serialize gal into /tmp/CTLFireability17026351020282356692.gal : 1 ms
[2024-05-21 02:21:14] [INFO ] Time to serialize properties into /tmp/CTLFireability9741875478822234141.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/CTLFireability17026351020282356692.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9741875478822234141.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.0124e+07,0.196788,9812,2,1125,5,22707,6,0,535,37144,0
Converting to forward existential form...Done !
original formula: EG((EF(((p45==0)||(p121==0))) * (AX(((AF((p84==0)) * ((p7==0)||(p79==0))) * ((p15==0)||(p74==0)))) + ((p25==1)&&(p97==1)))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U ((p45==0)||(p121==0))) * (!(EX(!(((!(EG(!((p84==0)))) * ((p7==0)||(p79==0))) * ((p15==0)||(...203
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t10, t12, t14, t16, t18, t20, t22, t24, t48, t63, Intersection with reachable at eac...218
(forward)formula 0,1,3.03855,82776,1,0,490,416644,234,299,3187,532508,498
FORMULA AutoFlight-PT-05a-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 104/104 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 103
Applied a total of 2 rules in 3 ms. Remains 125 /126 variables (removed 1) and now considering 103/104 (removed 1) transitions.
// Phase 1: matrix 103 rows 125 cols
[2024-05-21 02:21:17] [INFO ] Computed 29 invariants in 1 ms
[2024-05-21 02:21:17] [INFO ] Implicit Places using invariants in 149 ms returned [7, 14, 21, 28, 40, 45, 48, 96, 102, 112, 118, 124]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 150 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/126 places, 103/104 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 109 transition count 99
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 109 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 108 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 108 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 107 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 107 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 106 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 106 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 105 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 105 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 104 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 104 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 103 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 103 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 102 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 102 transition count 92
Applied a total of 22 rules in 17 ms. Remains 102 /113 variables (removed 11) and now considering 92/103 (removed 11) transitions.
// Phase 1: matrix 92 rows 102 cols
[2024-05-21 02:21:17] [INFO ] Computed 17 invariants in 1 ms
[2024-05-21 02:21:17] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 02:21:17] [INFO ] Invariant cache hit.
[2024-05-21 02:21:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 02:21:17] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 102/126 places, 92/104 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 355 ms. Remains : 102/126 places, 92/104 transitions.
[2024-05-21 02:21:17] [INFO ] Flatten gal took : 5 ms
[2024-05-21 02:21:17] [INFO ] Flatten gal took : 5 ms
[2024-05-21 02:21:17] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-21 02:21:17] [INFO ] Flatten gal took : 5 ms
[2024-05-21 02:21:17] [INFO ] Flatten gal took : 5 ms
[2024-05-21 02:21:17] [INFO ] Time to serialize gal into /tmp/CTLFireability6489627728315506797.gal : 2 ms
[2024-05-21 02:21:17] [INFO ] Time to serialize properties into /tmp/CTLFireability17294804486726782058.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/CTLFireability6489627728315506797.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17294804486726782058.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.98947e+07,0.314477,11636,2,1489,5,28645,6,0,500,46770,0
Converting to forward existential form...Done !
original formula: !(E((((!(EG((p30==1))) * !(AF(((p36==1)&&(p103==1))))) + AF(((p35==1)&&(p93==1)))) + ((p19==1) + A(!(EF(((p36==1)&&(p103==1)))) U !(EX((p...183
=> equivalent forward existential formula: [FwdG(FwdU(Init,(((!(EG((p30==1))) * !(!(EG(!(((p36==1)&&(p103==1))))))) + !(EG(!(((p35==1)&&(p93==1)))))) + ((p...300
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t10, t12, t14, t16, t18, t20, t22, t24, t58, t73, t81, Intersection with reachable a...223
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 90/0/2
(forward)formula 0,1,23.1421,553280,1,0,1712,3.47169e+06,243,904,3269,3.03281e+06,1926
FORMULA AutoFlight-PT-05a-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 104/104 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 103
Applied a total of 2 rules in 3 ms. Remains 125 /126 variables (removed 1) and now considering 103/104 (removed 1) transitions.
// Phase 1: matrix 103 rows 125 cols
[2024-05-21 02:21:41] [INFO ] Computed 29 invariants in 2 ms
[2024-05-21 02:21:41] [INFO ] Implicit Places using invariants in 165 ms returned [7, 21, 28, 40, 45, 48, 102, 112, 118, 124]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 167 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/126 places, 103/104 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 112 transition count 100
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 112 transition count 100
Applied a total of 6 rules in 2 ms. Remains 112 /115 variables (removed 3) and now considering 100/103 (removed 3) transitions.
// Phase 1: matrix 100 rows 112 cols
[2024-05-21 02:21:41] [INFO ] Computed 19 invariants in 1 ms
[2024-05-21 02:21:41] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 02:21:41] [INFO ] Invariant cache hit.
[2024-05-21 02:21:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 02:21:41] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 112/126 places, 100/104 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 403 ms. Remains : 112/126 places, 100/104 transitions.
[2024-05-21 02:21:41] [INFO ] Flatten gal took : 6 ms
[2024-05-21 02:21:41] [INFO ] Flatten gal took : 5 ms
[2024-05-21 02:21:41] [INFO ] Input system was already deterministic with 100 transitions.
[2024-05-21 02:21:41] [INFO ] Flatten gal took : 9 ms
[2024-05-21 02:21:41] [INFO ] Flatten gal took : 6 ms
[2024-05-21 02:21:41] [INFO ] Time to serialize gal into /tmp/CTLFireability13187217191170282539.gal : 2 ms
[2024-05-21 02:21:41] [INFO ] Time to serialize properties into /tmp/CTLFireability4463946319014545596.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/CTLFireability13187217191170282539.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4463946319014545596.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.03729e+07,0.158432,7992,2,1064,5,18357,6,0,546,25223,0
Converting to forward existential form...Done !
original formula: EF((EF((EX(((p14==1)&&(p80==1))) + AF(((p23==1)||((p14==1)&&(p80==1)))))) * A((p20==1) U (AX(E((p27==1) U ((p35==1)&&(p83==1)))) + !(((p9...177
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * E(TRUE U (EX(((p14==1)&&(p80==1))) + !(EG(!(((p23==1)||((p14==1)&&(p80==1))))))))) * !(EG(...425
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t10, t12, t14, t16, t18, t20, t22, t24, t63, t92, Intersection with reachable at eac...219
Using saturation style SCC detection
(forward)formula 0,1,4.29408,125400,1,0,1038,826540,244,539,3435,705162,1158
FORMULA AutoFlight-PT-05a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 104/104 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 103
Applied a total of 2 rules in 2 ms. Remains 125 /126 variables (removed 1) and now considering 103/104 (removed 1) transitions.
// Phase 1: matrix 103 rows 125 cols
[2024-05-21 02:21:45] [INFO ] Computed 29 invariants in 1 ms
[2024-05-21 02:21:46] [INFO ] Implicit Places using invariants in 154 ms returned [7, 14, 21, 35, 40, 45, 48, 96, 102, 112, 118, 124]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 155 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/126 places, 103/104 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 109 transition count 99
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 109 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 108 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 108 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 107 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 107 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 106 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 106 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 105 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 105 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 104 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 104 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 103 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 103 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 102 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 102 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 101 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 101 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 100 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 100 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 99 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 99 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 98 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 98 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 97 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 97 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 96 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 96 transition count 86
Applied a total of 34 rules in 18 ms. Remains 96 /113 variables (removed 17) and now considering 86/103 (removed 17) transitions.
// Phase 1: matrix 86 rows 96 cols
[2024-05-21 02:21:46] [INFO ] Computed 17 invariants in 0 ms
[2024-05-21 02:21:46] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 02:21:46] [INFO ] Invariant cache hit.
[2024-05-21 02:21:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 02:21:46] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 96/126 places, 86/104 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 398 ms. Remains : 96/126 places, 86/104 transitions.
[2024-05-21 02:21:46] [INFO ] Flatten gal took : 7 ms
[2024-05-21 02:21:46] [INFO ] Flatten gal took : 4 ms
[2024-05-21 02:21:46] [INFO ] Input system was already deterministic with 86 transitions.
[2024-05-21 02:21:46] [INFO ] Flatten gal took : 5 ms
[2024-05-21 02:21:46] [INFO ] Flatten gal took : 5 ms
[2024-05-21 02:21:46] [INFO ] Time to serialize gal into /tmp/CTLFireability16433533863776402333.gal : 1 ms
[2024-05-21 02:21:46] [INFO ] Time to serialize properties into /tmp/CTLFireability4177422077085748325.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/CTLFireability16433533863776402333.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4177422077085748325.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.9698e+07,0.192535,9744,2,1246,5,23159,6,0,470,38436,0
Converting to forward existential form...Done !
original formula: AG(EX(AF(!(A(((p28==1)&&(p92==1)) U (p34==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EG(!(!(!((E(!((p34==1)) U (!(((p28==1)&&(p92==1))) * !((p34==1)))) + EG(!((p34==1))))...172
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t10, t12, t14, t16, t18, t20, t22, t24, t40, t55, t69, Intersection with reachable a...223
Using saturation style SCC detection
(forward)formula 0,0,8.44226,229236,1,0,789,1.52446e+06,205,408,2826,1.09225e+06,855
FORMULA AutoFlight-PT-05a-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 104/104 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 103
Applied a total of 2 rules in 13 ms. Remains 125 /126 variables (removed 1) and now considering 103/104 (removed 1) transitions.
// Phase 1: matrix 103 rows 125 cols
[2024-05-21 02:21:54] [INFO ] Computed 29 invariants in 1 ms
[2024-05-21 02:21:54] [INFO ] Implicit Places using invariants in 100 ms returned [14, 21, 28, 40, 45, 48, 96, 102, 112, 118, 124]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 102 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/126 places, 103/104 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 110 transition count 99
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 110 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 109 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 109 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 108 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 108 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 107 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 107 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 106 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 106 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 105 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 105 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 104 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 104 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 103 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 103 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 102 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 102 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 101 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 101 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 100 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 100 transition count 89
Applied a total of 28 rules in 9 ms. Remains 100 /114 variables (removed 14) and now considering 89/103 (removed 14) transitions.
// Phase 1: matrix 89 rows 100 cols
[2024-05-21 02:21:54] [INFO ] Computed 18 invariants in 0 ms
[2024-05-21 02:21:55] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 02:21:55] [INFO ] Invariant cache hit.
[2024-05-21 02:21:55] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 02:21:55] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 100/126 places, 89/104 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 330 ms. Remains : 100/126 places, 89/104 transitions.
[2024-05-21 02:21:55] [INFO ] Flatten gal took : 5 ms
[2024-05-21 02:21:55] [INFO ] Flatten gal took : 5 ms
[2024-05-21 02:21:55] [INFO ] Input system was already deterministic with 89 transitions.
[2024-05-21 02:21:55] [INFO ] Flatten gal took : 5 ms
[2024-05-21 02:21:55] [INFO ] Flatten gal took : 5 ms
[2024-05-21 02:21:55] [INFO ] Time to serialize gal into /tmp/CTLFireability8649607753814520078.gal : 1 ms
[2024-05-21 02:21:55] [INFO ] Time to serialize properties into /tmp/CTLFireability10140961792668498433.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/CTLFireability8649607753814520078.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10140961792668498433.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.97964e+07,0.215565,10300,2,1359,5,24601,6,0,487,40778,0
Converting to forward existential form...Done !
original formula: (A((!(EF((!(((p7==1)&&(p67==1))) * E((p66==1) U ((p35==1)&&(p71==1)))))) + (((EG(E(((p18==1)&&(p96==1)) U (p2==1))) + !(AF((p37==1)))) * ...310
=> equivalent forward existential formula: ([((Init * !(EG(!(((!(EG(!((p6==1)))) * (p27==1)) * (p120==1)))))) * !(E(!(((!(EG(!((p6==1)))) * (p27==1)) * (p1...573
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t10, t12, t14, t16, t18, t20, t22, t24, t43, t58, t75, Intersection with reachable a...223
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-21 02:22:25] [INFO ] Flatten gal took : 5 ms
[2024-05-21 02:22:25] [INFO ] Applying decomposition
[2024-05-21 02:22:25] [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/graph11145486242071467224.txt' '-o' '/tmp/graph11145486242071467224.bin' '-w' '/tmp/graph11145486242071467224.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11145486242071467224.bin' '-l' '-1' '-v' '-w' '/tmp/graph11145486242071467224.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:22:25] [INFO ] Decomposing Gal with order
[2024-05-21 02:22:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:22:25] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-21 02:22:25] [INFO ] Flatten gal took : 12 ms
[2024-05-21 02:22:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 02:22:25] [INFO ] Time to serialize gal into /tmp/CTLFireability13554793277806531249.gal : 3 ms
[2024-05-21 02:22:25] [INFO ] Time to serialize properties into /tmp/CTLFireability7970367207749646961.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/CTLFireability13554793277806531249.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7970367207749646961.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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.97964e+07,0.03518,4592,191,22,1746,160,255,1939,35,315,0
Converting to forward existential form...Done !
original formula: (A((!(EF((!(((i5.u21.p7==1)&&(i7.i0.u22.p67==1))) * E((i5.u21.p66==1) U ((i7.i0.u23.p35==1)&&(i7.i0.u23.p71==1)))))) + (((EG(E(((i1.u5.p1...444
=> equivalent forward existential formula: ([((Init * !(EG(!(((!(EG(!((i9.u1.p6==1)))) * (i8.u7.p27==1)) * (i8.u35.p120==1)))))) * !(E(!(((!(EG(!((i9.u1.p6...759
Reverse transition relation is NOT exact ! Due to transitions t43, t58, u4.t16, u0.t24, i0.u2.t20, i1.u5.t14, i2.u6.t12, i5.u19.t75, i8.u7.t10, i9.u1.t22, ...288
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
Fast SCC detection found an SCC at level 12
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,5.16791,153488,1,0,280320,236,1745,331936,179,540,335717
FORMULA AutoFlight-PT-05a-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 104/104 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 103
Applied a total of 2 rules in 3 ms. Remains 125 /126 variables (removed 1) and now considering 103/104 (removed 1) transitions.
// Phase 1: matrix 103 rows 125 cols
[2024-05-21 02:22:30] [INFO ] Computed 29 invariants in 1 ms
[2024-05-21 02:22:30] [INFO ] Implicit Places using invariants in 165 ms returned [7, 14, 21, 28, 35, 40, 45, 48, 96, 102, 112, 118, 124]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 167 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/126 places, 103/104 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 108 transition count 99
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 108 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 107 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 107 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 106 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 106 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 105 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 105 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 104 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 104 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 103 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 103 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 102 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 102 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 101 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 101 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 100 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 100 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 99 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 99 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 98 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 98 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 97 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 97 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 96 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 96 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 95 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 95 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 94 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 94 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 93 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 93 transition count 84
Applied a total of 38 rules in 13 ms. Remains 93 /112 variables (removed 19) and now considering 84/103 (removed 19) transitions.
// Phase 1: matrix 84 rows 93 cols
[2024-05-21 02:22:30] [INFO ] Computed 16 invariants in 1 ms
[2024-05-21 02:22:30] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 02:22:30] [INFO ] Invariant cache hit.
[2024-05-21 02:22:30] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 93/126 places, 84/104 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 371 ms. Remains : 93/126 places, 84/104 transitions.
[2024-05-21 02:22:30] [INFO ] Flatten gal took : 5 ms
[2024-05-21 02:22:30] [INFO ] Flatten gal took : 4 ms
[2024-05-21 02:22:30] [INFO ] Input system was already deterministic with 84 transitions.
[2024-05-21 02:22:30] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:22:30] [INFO ] Flatten gal took : 4 ms
[2024-05-21 02:22:30] [INFO ] Time to serialize gal into /tmp/CTLFireability11656893189753077029.gal : 5 ms
[2024-05-21 02:22:30] [INFO ] Time to serialize properties into /tmp/CTLFireability17233785955167625136.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/CTLFireability11656893189753077029.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17233785955167625136.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,5.96325e+07,0.308371,12892,2,1122,5,31746,6,0,458,58770,0
Converting to forward existential form...Done !
original formula: EG(AX(AF(((p12==0)&&(p23==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!(EG(!(((p12==0)&&(p23==0)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t10, t12, t14, t16, t18, t20, t22, t24, t38, t48, t53, Intersection with reachable a...223
(forward)formula 0,1,3.78162,111924,1,0,502,638301,195,277,2630,703448,492
FORMULA AutoFlight-PT-05a-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 104/104 transitions.
Applied a total of 0 rules in 1 ms. Remains 126 /126 variables (removed 0) and now considering 104/104 (removed 0) transitions.
// Phase 1: matrix 104 rows 126 cols
[2024-05-21 02:22:34] [INFO ] Computed 29 invariants in 1 ms
[2024-05-21 02:22:34] [INFO ] Implicit Places using invariants in 103 ms returned [7, 14, 21, 28, 35, 40, 45, 48, 96, 102, 112, 118]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 104 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/126 places, 104/104 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 110 transition count 100
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 110 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 109 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 109 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 108 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 108 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 107 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 107 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 106 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 106 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 105 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 105 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 104 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 104 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 103 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 103 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 102 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 102 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 101 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 101 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 100 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 100 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 99 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 99 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 98 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 98 transition count 88
Applied a total of 32 rules in 21 ms. Remains 98 /114 variables (removed 16) and now considering 88/104 (removed 16) transitions.
// Phase 1: matrix 88 rows 98 cols
[2024-05-21 02:22:34] [INFO ] Computed 17 invariants in 1 ms
[2024-05-21 02:22:34] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 02:22:34] [INFO ] Invariant cache hit.
[2024-05-21 02:22:35] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 98/126 places, 88/104 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 300 ms. Remains : 98/126 places, 88/104 transitions.
[2024-05-21 02:22:35] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:22:35] [INFO ] Flatten gal took : 4 ms
[2024-05-21 02:22:35] [INFO ] Input system was already deterministic with 88 transitions.
[2024-05-21 02:22:35] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:22:35] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:22:35] [INFO ] Time to serialize gal into /tmp/CTLFireability14269279294143435759.gal : 1 ms
[2024-05-21 02:22:35] [INFO ] Time to serialize properties into /tmp/CTLFireability16715455329761814846.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/CTLFireability14269279294143435759.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16715455329761814846.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,6.16204e+07,0.320551,13452,2,1584,5,34694,6,0,482,60040,0
Converting to forward existential form...Done !
original formula: AG((AX(EX(EG(((p24==0)||(p119==0))))) * (EX((p43==0)) + (!(A(((p20==1)||(p64==1)) U ((p2==1)||((p29==1)&&(p76==1))))) * (A(((p124==1)&&(p...221
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * !(EX(EG(((p24==0)||(p119==0))))))] = FALSE * [((FwdU(Init,TRUE) * !((!(!((E(!(((p2==1)|...473
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t10, t12, t14, t16, t18, t20, t22, t24, t41, t56, t71, Intersection with reachable a...223
(forward)formula 0,0,12.3525,317892,1,0,1641,2.07814e+06,219,806,2824,1.80424e+06,1815
FORMULA AutoFlight-PT-05a-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 104/104 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 103
Applied a total of 2 rules in 2 ms. Remains 125 /126 variables (removed 1) and now considering 103/104 (removed 1) transitions.
// Phase 1: matrix 103 rows 125 cols
[2024-05-21 02:22:47] [INFO ] Computed 29 invariants in 1 ms
[2024-05-21 02:22:47] [INFO ] Implicit Places using invariants in 141 ms returned [7, 14, 21, 28, 35, 40, 48, 96, 102, 112, 118, 124]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 142 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/126 places, 103/104 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 109 transition count 99
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 109 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 108 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 108 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 107 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 107 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 106 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 106 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 105 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 105 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 104 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 104 transition count 94
Applied a total of 18 rules in 5 ms. Remains 104 /113 variables (removed 9) and now considering 94/103 (removed 9) transitions.
// Phase 1: matrix 94 rows 104 cols
[2024-05-21 02:22:47] [INFO ] Computed 17 invariants in 0 ms
[2024-05-21 02:22:47] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 02:22:47] [INFO ] Invariant cache hit.
[2024-05-21 02:22:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 02:22:47] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 104/126 places, 94/104 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 384 ms. Remains : 104/126 places, 94/104 transitions.
[2024-05-21 02:22:47] [INFO ] Flatten gal took : 5 ms
[2024-05-21 02:22:47] [INFO ] Flatten gal took : 5 ms
[2024-05-21 02:22:47] [INFO ] Input system was already deterministic with 94 transitions.
[2024-05-21 02:22:47] [INFO ] Flatten gal took : 5 ms
[2024-05-21 02:22:47] [INFO ] Flatten gal took : 5 ms
[2024-05-21 02:22:47] [INFO ] Time to serialize gal into /tmp/CTLFireability591351155314825242.gal : 2 ms
[2024-05-21 02:22:47] [INFO ] Time to serialize properties into /tmp/CTLFireability16788748412184442289.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/CTLFireability591351155314825242.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16788748412184442289.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.99602e+07,0.382531,11628,2,1354,5,28168,6,0,510,48234,0
Converting to forward existential form...Done !
original formula: AX((EF((p2==1)) * ((A(!(AX((p57==1))) U ((!((p47==1)&&(p122==1)))&&(p43==1))) + EF(((p47==1)&&(p122==1)))) + ((p47==1)&&(p122==1)))))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U (p2==1))))] = FALSE * ([((FwdU(((EY(Init) * !(((p47==1)&&(p122==1)))) * !(E(TRUE U ((p4...427
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t10, t12, t14, t16, t18, t20, t22, t24, t58, t75, t85, Intersection with reachable a...223
(forward)formula 0,1,5.96707,155472,1,0,271,949717,228,144,3038,655691,318
FORMULA AutoFlight-PT-05a-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 104/104 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 103
Applied a total of 2 rules in 2 ms. Remains 125 /126 variables (removed 1) and now considering 103/104 (removed 1) transitions.
// Phase 1: matrix 103 rows 125 cols
[2024-05-21 02:22:53] [INFO ] Computed 29 invariants in 1 ms
[2024-05-21 02:22:54] [INFO ] Implicit Places using invariants in 116 ms returned [14, 21, 35, 40, 45, 48, 96, 102, 112]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 116 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/126 places, 103/104 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 114 transition count 101
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 114 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 113 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 113 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 112 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 112 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 111 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 111 transition count 98
Applied a total of 10 rules in 4 ms. Remains 111 /116 variables (removed 5) and now considering 98/103 (removed 5) transitions.
// Phase 1: matrix 98 rows 111 cols
[2024-05-21 02:22:54] [INFO ] Computed 20 invariants in 0 ms
[2024-05-21 02:22:54] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 02:22:54] [INFO ] Invariant cache hit.
[2024-05-21 02:22:54] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 02:22:54] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 111/126 places, 98/104 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 309 ms. Remains : 111/126 places, 98/104 transitions.
[2024-05-21 02:22:54] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:22:54] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:22:54] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-21 02:22:54] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:22:54] [INFO ] Flatten gal took : 4 ms
[2024-05-21 02:22:54] [INFO ] Time to serialize gal into /tmp/CTLFireability2869415029546840319.gal : 1 ms
[2024-05-21 02:22:54] [INFO ] Time to serialize properties into /tmp/CTLFireability15431266003441065600.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/CTLFireability2869415029546840319.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15431266003441065600.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.38049e+07,0.349225,11160,2,2202,5,27290,6,0,540,41893,0
Converting to forward existential form...Done !
original formula: E((A(((EF(((p28==1)&&(p82==1))) * EF((p30==1))) * !(E(((p123==1)&&(p130==1)) U (p33==1)))) U ((EF(((p7==1)&&(p89==1))) + (p43==1)) + (((p...278
=> equivalent forward existential formula: ([(FwdU(Init,(!((E(!(((E(TRUE U ((p7==1)&&(p89==1))) + (p43==1)) + (((p18==1)&&(p96==1))||(p10==1)))) U (!(((E(T...964
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t10, t12, t14, t16, t18, t20, t22, t24, t45, t57, t60, Intersection with reachable a...223
(forward)formula 0,0,1.12867,28224,1,0,274,135783,229,144,3153,105631,343
FORMULA AutoFlight-PT-05a-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 104/104 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 103
Applied a total of 2 rules in 2 ms. Remains 125 /126 variables (removed 1) and now considering 103/104 (removed 1) transitions.
// Phase 1: matrix 103 rows 125 cols
[2024-05-21 02:22:55] [INFO ] Computed 29 invariants in 1 ms
[2024-05-21 02:22:55] [INFO ] Implicit Places using invariants in 149 ms returned [7, 14, 21, 28, 35, 40, 45, 48, 96, 102, 118, 124]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 151 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/126 places, 103/104 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 110 transition count 100
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 110 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 109 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 109 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 108 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 108 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 107 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 107 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 106 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 106 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 105 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 105 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 104 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 104 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 103 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 103 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 102 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 102 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 101 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 101 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 100 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 100 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 99 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 99 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 98 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 98 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 97 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 97 transition count 87
Applied a total of 32 rules in 9 ms. Remains 97 /113 variables (removed 16) and now considering 87/103 (removed 16) transitions.
// Phase 1: matrix 87 rows 97 cols
[2024-05-21 02:22:55] [INFO ] Computed 17 invariants in 1 ms
[2024-05-21 02:22:55] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 02:22:55] [INFO ] Invariant cache hit.
[2024-05-21 02:22:55] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 97/126 places, 87/104 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 329 ms. Remains : 97/126 places, 87/104 transitions.
[2024-05-21 02:22:55] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:22:55] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:22:55] [INFO ] Input system was already deterministic with 87 transitions.
[2024-05-21 02:22:55] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:22:55] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:22:55] [INFO ] Time to serialize gal into /tmp/CTLFireability15009595592241631685.gal : 1 ms
[2024-05-21 02:22:55] [INFO ] Time to serialize properties into /tmp/CTLFireability4656880190942710573.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/CTLFireability15009595592241631685.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4656880190942710573.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.15876e+07,0.318507,13440,2,1629,5,35460,6,0,477,57396,0
Converting to forward existential form...Done !
original formula: (EF((AG(((EF((p20==1)) + EX((p3==1))) + ((p10==1)||(p65==1)))) * ((EG((p23==0)) + ((p117==1)&&(p130==1))) + (p20==1)))) + (AG(A(!(((p23==...302
=> equivalent forward existential formula: (([(FwdU(FwdU((Init * !(E(TRUE U (!(E(TRUE U !(((E(TRUE U (p20==1)) + EX((p3==1))) + ((p10==1)||(p65==1)))))) * ...927
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t10, t12, t14, t16, t18, t20, t22, t24, t40, t55, t69, Intersection with reachable a...223
(forward)formula 0,0,7.5685,211852,1,0,739,1.35423e+06,206,370,2866,1.1586e+06,830
FORMULA AutoFlight-PT-05a-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 104/104 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 8 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 117 transition count 73
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 69 place count 87 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 86 transition count 72
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 70 place count 86 transition count 61
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 97 place count 70 transition count 61
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 97 place count 70 transition count 56
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 107 place count 65 transition count 56
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 108 place count 64 transition count 55
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 64 transition count 55
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 131 place count 53 transition count 44
Applied a total of 131 rules in 13 ms. Remains 53 /126 variables (removed 73) and now considering 44/104 (removed 60) transitions.
// Phase 1: matrix 44 rows 53 cols
[2024-05-21 02:23:03] [INFO ] Computed 16 invariants in 0 ms
[2024-05-21 02:23:03] [INFO ] Implicit Places using invariants in 64 ms returned [34, 38, 44, 48]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 66 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 49/126 places, 44/104 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 46 transition count 41
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 46 transition count 41
Applied a total of 6 rules in 4 ms. Remains 46 /49 variables (removed 3) and now considering 41/44 (removed 3) transitions.
// Phase 1: matrix 41 rows 46 cols
[2024-05-21 02:23:03] [INFO ] Computed 12 invariants in 1 ms
[2024-05-21 02:23:03] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 02:23:03] [INFO ] Invariant cache hit.
[2024-05-21 02:23:03] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 46/126 places, 41/104 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 201 ms. Remains : 46/126 places, 41/104 transitions.
[2024-05-21 02:23:03] [INFO ] Flatten gal took : 1 ms
[2024-05-21 02:23:03] [INFO ] Flatten gal took : 1 ms
[2024-05-21 02:23:03] [INFO ] Input system was already deterministic with 41 transitions.
[2024-05-21 02:23:03] [INFO ] Flatten gal took : 1 ms
[2024-05-21 02:23:03] [INFO ] Flatten gal took : 1 ms
[2024-05-21 02:23:03] [INFO ] Time to serialize gal into /tmp/CTLFireability765065817466551024.gal : 1 ms
[2024-05-21 02:23:03] [INFO ] Time to serialize properties into /tmp/CTLFireability4379887809209404497.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/CTLFireability765065817466551024.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4379887809209404497.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,25600,0.013276,3628,2,154,5,1184,6,0,228,1232,0
Converting to forward existential form...Done !
original formula: (EF(((p118==1)&&(p131==1))) * EF((p84==0)))
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U ((p118==1)&&(p131==1)))),TRUE) * (p84==0))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.03888,4476,1,0,10,6092,16,3,1122,3042,8
FORMULA AutoFlight-PT-05a-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 104/104 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 126 transition count 91
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 113 transition count 91
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 26 place count 113 transition count 82
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 44 place count 104 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 103 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 103 transition count 81
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 66 place count 93 transition count 71
Applied a total of 66 rules in 10 ms. Remains 93 /126 variables (removed 33) and now considering 71/104 (removed 33) transitions.
// Phase 1: matrix 71 rows 93 cols
[2024-05-21 02:23:03] [INFO ] Computed 29 invariants in 0 ms
[2024-05-21 02:23:03] [INFO ] Implicit Places using invariants in 125 ms returned [5, 10, 15, 20, 25, 26, 27, 28, 29, 30, 31, 32, 33, 66, 71, 86, 92]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 127 ms to find 17 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 76/126 places, 71/104 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 76 transition count 50
Reduce places removed 21 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 26 rules applied. Total rules applied 47 place count 55 transition count 45
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 52 place count 50 transition count 45
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 52 place count 50 transition count 44
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 49 transition count 44
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 57 place count 46 transition count 41
Iterating global reduction 3 with 3 rules applied. Total rules applied 60 place count 46 transition count 41
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 3 with 2 rules applied. Total rules applied 62 place count 45 transition count 40
Applied a total of 62 rules in 5 ms. Remains 45 /76 variables (removed 31) and now considering 40/71 (removed 31) transitions.
// Phase 1: matrix 40 rows 45 cols
[2024-05-21 02:23:03] [INFO ] Computed 12 invariants in 0 ms
[2024-05-21 02:23:03] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 02:23:03] [INFO ] Invariant cache hit.
[2024-05-21 02:23:03] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 02:23:03] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 45/126 places, 40/104 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 327 ms. Remains : 45/126 places, 40/104 transitions.
[2024-05-21 02:23:04] [INFO ] Flatten gal took : 2 ms
[2024-05-21 02:23:04] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:23:04] [INFO ] Input system was already deterministic with 40 transitions.
[2024-05-21 02:23:04] [INFO ] Flatten gal took : 2 ms
[2024-05-21 02:23:04] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:23:04] [INFO ] Time to serialize gal into /tmp/CTLFireability12875772166154516715.gal : 1 ms
[2024-05-21 02:23:04] [INFO ] Time to serialize properties into /tmp/CTLFireability5404642184176962080.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/CTLFireability12875772166154516715.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5404642184176962080.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,23553,0.027407,3948,2,338,5,1873,6,0,222,1992,0
Converting to forward existential form...Done !
original formula: EF(EG(AF(((p117==0)||(p130==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!(((p117==0)||(p130==0))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.091152,5268,1,0,9,9520,21,5,1098,3852,9
FORMULA AutoFlight-PT-05a-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2024-05-21 02:23:04] [INFO ] Flatten gal took : 5 ms
[2024-05-21 02:23:04] [INFO ] Flatten gal took : 5 ms
Total runtime 154163 ms.
BK_STOP 1716258184211
--------------------
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="AutoFlight-PT-05a"
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 AutoFlight-PT-05a, 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 r026-smll-171620167000122"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-05a.tgz
mv AutoFlight-PT-05a 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 '
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 ;