About the Execution of ITS-Tools for ShieldRVt-PT-002B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1160.787 | 99226.00 | 111886.00 | 730.10 | FFFTTFFTFTTTFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r222-tall-165286026000906.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVt-PT-002B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286026000906
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 7.4K Apr 30 00:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 30 00:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 00:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 30 00:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 09:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 09:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 09:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 09:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 09:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 24K May 10 09:34 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 ShieldRVt-PT-002B-CTLFireability-00
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-01
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-02
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-03
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-04
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-05
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-06
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-07
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-08
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-09
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-10
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-11
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-12
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-13
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-14
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1653071355515
Running Version 202205111006
[2022-05-20 18:29:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 18:29:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 18:29:16] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2022-05-20 18:29:16] [INFO ] Transformed 103 places.
[2022-05-20 18:29:16] [INFO ] Transformed 103 transitions.
[2022-05-20 18:29:16] [INFO ] Found NUPN structural information;
[2022-05-20 18:29:16] [INFO ] Parsed PT model containing 103 places and 103 transitions in 162 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 70 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 101 transition count 101
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 101
Applied a total of 4 rules in 15 ms. Remains 101 /103 variables (removed 2) and now considering 101/103 (removed 2) transitions.
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 18:29:16] [INFO ] Computed 9 place invariants in 12 ms
[2022-05-20 18:29:17] [INFO ] Implicit Places using invariants in 146 ms returned []
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 18:29:17] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-20 18:29:17] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 18:29:17] [INFO ] Computed 9 place invariants in 6 ms
[2022-05-20 18:29:17] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101/103 places, 101/103 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/103 places, 101/103 transitions.
Support contains 70 out of 101 places after structural reductions.
[2022-05-20 18:29:17] [INFO ] Flatten gal took : 28 ms
[2022-05-20 18:29:17] [INFO ] Flatten gal took : 11 ms
[2022-05-20 18:29:17] [INFO ] Input system was already deterministic with 101 transitions.
Support contains 69 out of 101 places (down from 70) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 547 ms. (steps per millisecond=18 ) properties (out of 67) seen :61
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 101 rows 101 cols
[2022-05-20 18:29:18] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-20 18:29:18] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-20 18:29:18] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2022-05-20 18:29:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-20 18:29:18] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :1
[2022-05-20 18:29:18] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 3 ms to minimize.
[2022-05-20 18:29:18] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2022-05-20 18:29:18] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 2 ms to minimize.
[2022-05-20 18:29:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 120 ms
[2022-05-20 18:29:18] [INFO ] After 158ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-20 18:29:18] [INFO ] After 222ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :1
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 101/101 places, 101/101 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 101 transition count 73
Reduce places removed 28 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 30 rules applied. Total rules applied 58 place count 73 transition count 71
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 61 place count 71 transition count 70
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 61 place count 71 transition count 61
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 79 place count 62 transition count 61
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 90 place count 51 transition count 50
Iterating global reduction 3 with 11 rules applied. Total rules applied 101 place count 51 transition count 50
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 101 place count 51 transition count 43
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 115 place count 44 transition count 43
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 147 place count 28 transition count 27
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -4
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 157 place count 23 transition count 31
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 158 place count 23 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 159 place count 22 transition count 29
Applied a total of 159 rules in 24 ms. Remains 22 /101 variables (removed 79) and now considering 29/101 (removed 72) transitions.
Finished structural reductions, in 1 iterations. Remains : 22/101 places, 29/101 transitions.
Incomplete random walk after 10000 steps, including 78 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Probably explored full state space saw : 1154 states, properties seen :0
Probabilistic random walk after 6340 steps, saw 1154 distinct states, run finished after 29 ms. (steps per millisecond=218 ) properties seen :0
Explored full state space saw : 1154 states, properties seen :0
Exhaustive walk after 6340 steps, saw 1154 distinct states, run finished after 9 ms. (steps per millisecond=704 ) properties seen :0
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
FORMULA ShieldRVt-PT-002B-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 18:29:18] [INFO ] Flatten gal took : 6 ms
[2022-05-20 18:29:18] [INFO ] Flatten gal took : 6 ms
[2022-05-20 18:29:18] [INFO ] Input system was already deterministic with 101 transitions.
Computed a total of 32 stabilizing places and 32 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 84 transition count 84
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 84 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 83 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 83 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 82 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 82 transition count 82
Applied a total of 38 rules in 12 ms. Remains 82 /101 variables (removed 19) and now considering 82/101 (removed 19) transitions.
// Phase 1: matrix 82 rows 82 cols
[2022-05-20 18:29:18] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-20 18:29:18] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 82 rows 82 cols
[2022-05-20 18:29:19] [INFO ] Computed 9 place invariants in 3 ms
[2022-05-20 18:29:19] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
// Phase 1: matrix 82 rows 82 cols
[2022-05-20 18:29:19] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-20 18:29:19] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 82/101 places, 82/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 82/101 places, 82/101 transitions.
[2022-05-20 18:29:19] [INFO ] Flatten gal took : 4 ms
[2022-05-20 18:29:19] [INFO ] Flatten gal took : 5 ms
[2022-05-20 18:29:19] [INFO ] Input system was already deterministic with 82 transitions.
[2022-05-20 18:29:19] [INFO ] Flatten gal took : 4 ms
[2022-05-20 18:29:19] [INFO ] Flatten gal took : 4 ms
[2022-05-20 18:29:19] [INFO ] Time to serialize gal into /tmp/CTLFireability10582152885231300448.gal : 1 ms
[2022-05-20 18:29:19] [INFO ] Time to serialize properties into /tmp/CTLFireability14825512046495490739.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10582152885231300448.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14825512046495490739.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.70327e+07,0.083172,8288,2,786,5,12334,6,0,412,23103,0
Converting to forward existential form...Done !
original formula: EG(((p0==1) + (EX((p39==0)) * AG((((p72==0)||(p100==0)) * EX((p74==0)))))))
=> equivalent forward existential formula: [FwdG(Init,((p0==1) + (EX((p39==0)) * !(E(TRUE U !((((p72==0)||(p100==0)) * EX((p74==0)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t10, t13, t17, t20, t22, t26, t27, t28, t31, t32, t38, t42, t47, t48, t52, t54, t57, ...273
(forward)formula 0,0,1.66559,68776,1,0,248,338311,194,111,2339,416221,265
FORMULA ShieldRVt-PT-002B-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 81 transition count 81
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 80 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 79 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 79 transition count 79
Applied a total of 44 rules in 17 ms. Remains 79 /101 variables (removed 22) and now considering 79/101 (removed 22) transitions.
// Phase 1: matrix 79 rows 79 cols
[2022-05-20 18:29:20] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 18:29:20] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 79 rows 79 cols
[2022-05-20 18:29:20] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 18:29:21] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
// Phase 1: matrix 79 rows 79 cols
[2022-05-20 18:29:21] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-20 18:29:21] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 79/101 places, 79/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 79/101 places, 79/101 transitions.
[2022-05-20 18:29:21] [INFO ] Flatten gal took : 5 ms
[2022-05-20 18:29:21] [INFO ] Flatten gal took : 4 ms
[2022-05-20 18:29:21] [INFO ] Input system was already deterministic with 79 transitions.
[2022-05-20 18:29:21] [INFO ] Flatten gal took : 4 ms
[2022-05-20 18:29:21] [INFO ] Flatten gal took : 6 ms
[2022-05-20 18:29:21] [INFO ] Time to serialize gal into /tmp/CTLFireability1679256258007877923.gal : 1 ms
[2022-05-20 18:29:21] [INFO ] Time to serialize properties into /tmp/CTLFireability5122680681478175725.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1679256258007877923.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5122680681478175725.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.75398e+07,0.057877,7396,2,544,5,9344,6,0,397,16022,0
Converting to forward existential form...Done !
original formula: (EX(EX((p14==1))) + AF(EG((p87==1))))
=> equivalent forward existential formula: [FwdG((Init * !(EX(EX((p14==1))))),!(EG((p87==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t45, t49, t58, t61, t65, t68, t73, Intersect...243
(forward)formula 0,0,3.32539,123656,1,0,799,507699,185,454,2162,1.02749e+06,758
FORMULA ShieldRVt-PT-002B-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 82 transition count 82
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 82 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 81 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 80 transition count 80
Applied a total of 42 rules in 7 ms. Remains 80 /101 variables (removed 21) and now considering 80/101 (removed 21) transitions.
// Phase 1: matrix 80 rows 80 cols
[2022-05-20 18:29:24] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 18:29:24] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 80 rows 80 cols
[2022-05-20 18:29:24] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 18:29:24] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 80 cols
[2022-05-20 18:29:24] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 18:29:24] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 80/101 places, 80/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/101 places, 80/101 transitions.
[2022-05-20 18:29:24] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:29:24] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:29:24] [INFO ] Input system was already deterministic with 80 transitions.
[2022-05-20 18:29:24] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:29:24] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:29:24] [INFO ] Time to serialize gal into /tmp/CTLFireability14670406773720090622.gal : 1 ms
[2022-05-20 18:29:24] [INFO ] Time to serialize properties into /tmp/CTLFireability8143196396557994293.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14670406773720090622.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8143196396557994293.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.0423e+07,0.062078,7716,2,602,5,10128,6,0,402,17881,0
Converting to forward existential form...Done !
original formula: EF(AX(EG((A((p46==1) U (((p67==1)&&(p73==1))&&(p89==1))) * AG((p5==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EG((!((E(!((((p67==1)&&(p73==1))&&(p89==1))) U (!((p46==1)) * !((((p67==1)&&(p73==1))...255
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t41, t46, t50, t55, t59, t62, t66, t69, t74, ...253
(forward)formula 0,1,0.219865,14052,1,0,196,44573,195,86,2298,49361,205
FORMULA ShieldRVt-PT-002B-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 100 transition count 68
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 66 place count 68 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 67 transition count 66
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 67 place count 67 transition count 58
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 83 place count 59 transition count 58
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 96 place count 46 transition count 45
Iterating global reduction 3 with 13 rules applied. Total rules applied 109 place count 46 transition count 45
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 109 place count 46 transition count 37
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 125 place count 38 transition count 37
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 147 place count 27 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 149 place count 25 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 150 place count 24 transition count 24
Applied a total of 150 rules in 17 ms. Remains 24 /101 variables (removed 77) and now considering 24/101 (removed 77) transitions.
// Phase 1: matrix 24 rows 24 cols
[2022-05-20 18:29:24] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-20 18:29:25] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 24 rows 24 cols
[2022-05-20 18:29:25] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-20 18:29:25] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2022-05-20 18:29:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 24 rows 24 cols
[2022-05-20 18:29:25] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-20 18:29:25] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 24/101 places, 24/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/101 places, 24/101 transitions.
[2022-05-20 18:29:25] [INFO ] Flatten gal took : 2 ms
[2022-05-20 18:29:25] [INFO ] Flatten gal took : 6 ms
[2022-05-20 18:29:25] [INFO ] Input system was already deterministic with 24 transitions.
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
FORMULA ShieldRVt-PT-002B-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 83 transition count 83
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 83 transition count 83
Applied a total of 36 rules in 3 ms. Remains 83 /101 variables (removed 18) and now considering 83/101 (removed 18) transitions.
// Phase 1: matrix 83 rows 83 cols
[2022-05-20 18:29:25] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 18:29:25] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 83 rows 83 cols
[2022-05-20 18:29:25] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 18:29:25] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
// Phase 1: matrix 83 rows 83 cols
[2022-05-20 18:29:25] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 18:29:25] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 83/101 places, 83/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/101 places, 83/101 transitions.
[2022-05-20 18:29:25] [INFO ] Flatten gal took : 4 ms
[2022-05-20 18:29:25] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:29:25] [INFO ] Input system was already deterministic with 83 transitions.
[2022-05-20 18:29:25] [INFO ] Flatten gal took : 4 ms
[2022-05-20 18:29:25] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:29:25] [INFO ] Time to serialize gal into /tmp/CTLFireability491052463446238416.gal : 1 ms
[2022-05-20 18:29:25] [INFO ] Time to serialize properties into /tmp/CTLFireability5258987791805245592.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability491052463446238416.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5258987791805245592.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...273
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.28994e+07,0.062085,7664,2,582,5,10107,6,0,417,17872,0
Converting to forward existential form...Done !
original formula: E((!(AX((A((p61==1) U (p26==1)) * AG((p37==1))))) * (p16==1)) U (E(((AX(AG((p23==1))) + EX((p5==1))) + ((AF((p30==1)) * (p27==1)) * (p75=...195
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,(!(!(EX(!((!((E(!((p26==1)) U (!((p61==1)) * !((p26==1)))) + EG(!((p26==1))))) * !(E(TRUE U !(...484
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t32, t33, t39, t43, t48, t52, t61, t62, t65, t69, t72, t77, Inte...248
(forward)formula 0,0,11.7446,395340,1,0,931,2.09619e+06,217,443,2379,3.62298e+06,1026
FORMULA ShieldRVt-PT-002B-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 81 transition count 81
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 80 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 79 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 79 transition count 79
Applied a total of 44 rules in 4 ms. Remains 79 /101 variables (removed 22) and now considering 79/101 (removed 22) transitions.
// Phase 1: matrix 79 rows 79 cols
[2022-05-20 18:29:37] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 18:29:37] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 79 rows 79 cols
[2022-05-20 18:29:37] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-20 18:29:37] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
// Phase 1: matrix 79 rows 79 cols
[2022-05-20 18:29:37] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-20 18:29:37] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 79/101 places, 79/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 79/101 places, 79/101 transitions.
[2022-05-20 18:29:37] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:29:37] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:29:37] [INFO ] Input system was already deterministic with 79 transitions.
[2022-05-20 18:29:37] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:29:37] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:29:37] [INFO ] Time to serialize gal into /tmp/CTLFireability4289542121619711731.gal : 2 ms
[2022-05-20 18:29:37] [INFO ] Time to serialize properties into /tmp/CTLFireability6580180514933599626.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4289542121619711731.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6580180514933599626.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.75398e+07,0.058253,7404,2,544,5,9344,6,0,397,16022,0
Converting to forward existential form...Done !
original formula: AG(AX(EF((p9==1))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(TRUE U (p9==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t45, t49, t58, t61, t65, t68, t73, Intersect...243
(forward)formula 0,0,0.165123,10956,1,0,158,29366,179,83,2211,27979,169
FORMULA ShieldRVt-PT-002B-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 81 transition count 81
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 80 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 79 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 79 transition count 79
Applied a total of 44 rules in 3 ms. Remains 79 /101 variables (removed 22) and now considering 79/101 (removed 22) transitions.
// Phase 1: matrix 79 rows 79 cols
[2022-05-20 18:29:37] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 18:29:37] [INFO ] Implicit Places using invariants in 120 ms returned []
// Phase 1: matrix 79 rows 79 cols
[2022-05-20 18:29:37] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-20 18:29:37] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
// Phase 1: matrix 79 rows 79 cols
[2022-05-20 18:29:37] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 18:29:37] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 79/101 places, 79/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 79/101 places, 79/101 transitions.
[2022-05-20 18:29:37] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:29:37] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:29:37] [INFO ] Input system was already deterministic with 79 transitions.
[2022-05-20 18:29:37] [INFO ] Flatten gal took : 4 ms
[2022-05-20 18:29:37] [INFO ] Flatten gal took : 4 ms
[2022-05-20 18:29:37] [INFO ] Time to serialize gal into /tmp/CTLFireability8440516145483706895.gal : 6 ms
[2022-05-20 18:29:37] [INFO ] Time to serialize properties into /tmp/CTLFireability6261848082060024242.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8440516145483706895.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6261848082060024242.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.75398e+07,0.057862,7344,2,544,5,9344,6,0,397,16022,0
Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.059147,7344,1,0,6,9344,7,1,471,16022,1
FORMULA ShieldRVt-PT-002B-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 86 transition count 86
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 86 transition count 86
Applied a total of 30 rules in 2 ms. Remains 86 /101 variables (removed 15) and now considering 86/101 (removed 15) transitions.
// Phase 1: matrix 86 rows 86 cols
[2022-05-20 18:29:37] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 18:29:37] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 86 rows 86 cols
[2022-05-20 18:29:37] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-20 18:29:37] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
// Phase 1: matrix 86 rows 86 cols
[2022-05-20 18:29:37] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-20 18:29:37] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 86/101 places, 86/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 86/101 places, 86/101 transitions.
[2022-05-20 18:29:37] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:29:37] [INFO ] Flatten gal took : 4 ms
[2022-05-20 18:29:37] [INFO ] Input system was already deterministic with 86 transitions.
[2022-05-20 18:29:37] [INFO ] Flatten gal took : 8 ms
[2022-05-20 18:29:38] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:29:38] [INFO ] Time to serialize gal into /tmp/CTLFireability2128493685912028756.gal : 3 ms
[2022-05-20 18:29:38] [INFO ] Time to serialize properties into /tmp/CTLFireability12945032008855878905.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2128493685912028756.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12945032008855878905.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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.52441e+07,0.077975,8152,2,722,5,11942,6,0,432,21581,0
Converting to forward existential form...Done !
original formula: A(A(A(!(AX((p79==1))) U EF((((p27==1)&&(p4==1))&&((p18==1)&&(p52==1))))) U A((p92==1) U AG((p75==1)))) U ((A((EG(EF((p43==1))) * (p1!=1))...293
=> equivalent forward existential formula: [((Init * !(EG(!(((!((E(!(((!(E(TRUE U !((p64==1)))) + (p53==1)) * ((!(EX(!((p83==1)))) + !(EX(!((p21==1))))) + ...2046
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t9, t13, t17, t18, t23, t27, t36, t42, t47, t51, t55, t66, t68, t72, t75, t80, Inter...247
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,22.6026,731980,1,0,2345,4.03982e+06,233,1661,2570,5.88786e+06,2708
FORMULA ShieldRVt-PT-002B-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 86 transition count 86
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 86 transition count 86
Applied a total of 30 rules in 10 ms. Remains 86 /101 variables (removed 15) and now considering 86/101 (removed 15) transitions.
// Phase 1: matrix 86 rows 86 cols
[2022-05-20 18:30:00] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 18:30:00] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 86 rows 86 cols
[2022-05-20 18:30:00] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 18:30:00] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
// Phase 1: matrix 86 rows 86 cols
[2022-05-20 18:30:00] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 18:30:00] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 86/101 places, 86/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 86/101 places, 86/101 transitions.
[2022-05-20 18:30:00] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:30:00] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:30:00] [INFO ] Input system was already deterministic with 86 transitions.
[2022-05-20 18:30:00] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:30:00] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:30:00] [INFO ] Time to serialize gal into /tmp/CTLFireability14055328269894839509.gal : 4 ms
[2022-05-20 18:30:00] [INFO ] Time to serialize properties into /tmp/CTLFireability7133928125970590002.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14055328269894839509.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7133928125970590002.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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.12867e+07,0.083497,8564,2,739,5,12277,6,0,432,25196,0
Converting to forward existential form...Done !
original formula: !(A(A((((p7==1) * EF((p69==1))) * EF((p19==1))) U EF(((((p32==1)||(p44==1))&&(p13==1))&&((p67==1)&&(p101==1))))) U AG(((AX((p86!=1)) * ((...237
=> equivalent forward existential formula: ((([(EY(FwdU((FwdU(Init,!(!(E(TRUE U !(((!(EX(!((p86!=1)))) * ((p54==1)||(p68!=1))) * (((p59==1)||(((p18==1)&&(p...1674
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t30, t35, t36, t40, t41, t45, t47, t50, t51, t55, t57, t60, t64, ...268
Using saturation style SCC detection
(forward)formula 0,1,2.77253,108688,1,0,708,553133,209,413,2690,782826,727
FORMULA ShieldRVt-PT-002B-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 81 transition count 81
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 80 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 79 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 79 transition count 79
Applied a total of 44 rules in 5 ms. Remains 79 /101 variables (removed 22) and now considering 79/101 (removed 22) transitions.
// Phase 1: matrix 79 rows 79 cols
[2022-05-20 18:30:03] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 18:30:03] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 79 rows 79 cols
[2022-05-20 18:30:03] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-20 18:30:03] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
// Phase 1: matrix 79 rows 79 cols
[2022-05-20 18:30:03] [INFO ] Computed 9 place invariants in 11 ms
[2022-05-20 18:30:03] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 79/101 places, 79/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 79/101 places, 79/101 transitions.
[2022-05-20 18:30:03] [INFO ] Flatten gal took : 4 ms
[2022-05-20 18:30:03] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:30:03] [INFO ] Input system was already deterministic with 79 transitions.
[2022-05-20 18:30:03] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:30:03] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:30:03] [INFO ] Time to serialize gal into /tmp/CTLFireability16622729079730879009.gal : 1 ms
[2022-05-20 18:30:03] [INFO ] Time to serialize properties into /tmp/CTLFireability5447145372776896472.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16622729079730879009.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5447145372776896472.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.75398e+07,0.059784,7316,2,544,5,9344,6,0,397,16022,0
Converting to forward existential form...Done !
original formula: EF(EX((p75==1)))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * (p75==1))] != FALSE
(forward)formula 0,1,0.065541,7700,1,0,8,9344,8,1,645,16022,2
FORMULA ShieldRVt-PT-002B-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 100 transition count 71
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 71 transition count 69
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 64 place count 70 transition count 66
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 67 place count 67 transition count 66
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 67 place count 67 transition count 59
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 81 place count 60 transition count 59
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 95 place count 46 transition count 45
Iterating global reduction 4 with 14 rules applied. Total rules applied 109 place count 46 transition count 45
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 109 place count 46 transition count 38
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 123 place count 39 transition count 38
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 4 with 22 rules applied. Total rules applied 145 place count 28 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 147 place count 26 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 148 place count 25 transition count 25
Applied a total of 148 rules in 12 ms. Remains 25 /101 variables (removed 76) and now considering 25/101 (removed 76) transitions.
// Phase 1: matrix 25 rows 25 cols
[2022-05-20 18:30:04] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-20 18:30:04] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-20 18:30:04] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-20 18:30:04] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2022-05-20 18:30:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-20 18:30:04] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-20 18:30:04] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 25/101 places, 25/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/101 places, 25/101 transitions.
[2022-05-20 18:30:04] [INFO ] Flatten gal took : 1 ms
[2022-05-20 18:30:04] [INFO ] Flatten gal took : 1 ms
[2022-05-20 18:30:04] [INFO ] Input system was already deterministic with 25 transitions.
[2022-05-20 18:30:04] [INFO ] Flatten gal took : 4 ms
[2022-05-20 18:30:04] [INFO ] Flatten gal took : 1 ms
[2022-05-20 18:30:04] [INFO ] Time to serialize gal into /tmp/CTLFireability9707892000644006802.gal : 0 ms
[2022-05-20 18:30:04] [INFO ] Time to serialize properties into /tmp/CTLFireability2126541407134704512.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9707892000644006802.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2126541407134704512.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
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,7776,0.008309,4520,2,43,5,1000,6,0,128,1272,0
Converting to forward existential form...Done !
original formula: A((p15==1) U EF((p26==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (p26==1)))))) * !(E(!(E(TRUE U (p26==1))) U (!((p15==1)) * !(E(TRUE U (p26==1)))))))] ...163
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,1,0.0314,5748,1,0,36,6661,23,26,649,7988,29
FORMULA ShieldRVt-PT-002B-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 81 transition count 81
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 80 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 79 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 79 transition count 79
Applied a total of 44 rules in 2 ms. Remains 79 /101 variables (removed 22) and now considering 79/101 (removed 22) transitions.
// Phase 1: matrix 79 rows 79 cols
[2022-05-20 18:30:04] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 18:30:04] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 79 rows 79 cols
[2022-05-20 18:30:04] [INFO ] Computed 9 place invariants in 4 ms
[2022-05-20 18:30:04] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
// Phase 1: matrix 79 rows 79 cols
[2022-05-20 18:30:04] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-20 18:30:04] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 79/101 places, 79/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 79/101 places, 79/101 transitions.
[2022-05-20 18:30:04] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:30:04] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:30:04] [INFO ] Input system was already deterministic with 79 transitions.
[2022-05-20 18:30:04] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:30:04] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:30:04] [INFO ] Time to serialize gal into /tmp/CTLFireability11986053598141757470.gal : 1 ms
[2022-05-20 18:30:04] [INFO ] Time to serialize properties into /tmp/CTLFireability6411999929170181840.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11986053598141757470.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6411999929170181840.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.75398e+07,0.058652,7356,2,544,5,9344,6,0,397,16022,0
Converting to forward existential form...Done !
original formula: AG(((p49==0) + (EX(EX((p5==0))) * (EF((p30==1)) + (EX((p6==0)) * (((p13==0)||(p67==0))||(p101==0)))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !((p49==0))) * !(EX(EX((p5==0)))))] = FALSE * [(((FwdU(Init,TRUE) * !((p49==0))) * !((EX((...236
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t45, t49, t58, t61, t65, t68, t73, Intersect...243
(forward)formula 0,0,0.188579,12488,1,0,168,39467,183,90,2215,40181,175
FORMULA ShieldRVt-PT-002B-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 82 transition count 82
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 82 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 81 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 80 transition count 80
Applied a total of 42 rules in 2 ms. Remains 80 /101 variables (removed 21) and now considering 80/101 (removed 21) transitions.
// Phase 1: matrix 80 rows 80 cols
[2022-05-20 18:30:04] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 18:30:04] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 80 rows 80 cols
[2022-05-20 18:30:04] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-20 18:30:04] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 80 cols
[2022-05-20 18:30:04] [INFO ] Computed 9 place invariants in 3 ms
[2022-05-20 18:30:04] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 80/101 places, 80/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/101 places, 80/101 transitions.
[2022-05-20 18:30:04] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:30:04] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:30:04] [INFO ] Input system was already deterministic with 80 transitions.
[2022-05-20 18:30:04] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:30:04] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:30:04] [INFO ] Time to serialize gal into /tmp/CTLFireability13834360086806565886.gal : 1 ms
[2022-05-20 18:30:04] [INFO ] Time to serialize properties into /tmp/CTLFireability765664560182824121.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13834360086806565886.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability765664560182824121.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.14191e+07,0.076931,8292,2,766,5,13193,6,0,402,19640,0
Converting to forward existential form...Done !
original formula: AG((A((AX(AX((p50==1))) * AF(AX((p83==1)))) U AF((p7==1))) + EX((p27==1))))
=> equivalent forward existential formula: ([FwdG((FwdU((FwdU(Init,TRUE) * !(EX((p27==1)))),!(!(EG(!((p7==1)))))) * !((!(EX(!(!(EX(!((p50==1))))))) * !(EG(...278
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t17, t22, t26, t30, t31, t37, t41, t46, t50, t59, t62, t66, t69, t74, Inte...248
(forward)formula 0,0,13.2139,433368,1,0,897,2.34959e+06,188,456,2198,3.82259e+06,988
FORMULA ShieldRVt-PT-002B-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 83 transition count 83
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 83 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 82 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 82 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 81 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 81 transition count 81
Applied a total of 40 rules in 36 ms. Remains 81 /101 variables (removed 20) and now considering 81/101 (removed 20) transitions.
// Phase 1: matrix 81 rows 81 cols
[2022-05-20 18:30:18] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-20 18:30:18] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 81 rows 81 cols
[2022-05-20 18:30:18] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 18:30:18] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 81 cols
[2022-05-20 18:30:18] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 18:30:18] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 81/101 places, 81/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/101 places, 81/101 transitions.
[2022-05-20 18:30:18] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:30:18] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:30:18] [INFO ] Input system was already deterministic with 81 transitions.
[2022-05-20 18:30:18] [INFO ] Flatten gal took : 2 ms
[2022-05-20 18:30:18] [INFO ] Flatten gal took : 2 ms
[2022-05-20 18:30:18] [INFO ] Time to serialize gal into /tmp/CTLFireability4780251763184767195.gal : 1 ms
[2022-05-20 18:30:18] [INFO ] Time to serialize properties into /tmp/CTLFireability12082991997831322479.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4780251763184767195.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12082991997831322479.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.22505e+07,0.064478,7660,2,617,5,10507,6,0,407,18974,0
Converting to forward existential form...Done !
original formula: EF(!(E(!(AX((p75==1))) U (((p79==1)||(p66==1))&&(p39!=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(!(EX(!((p75==1))))) U (((p79==1)||(p66==1))&&(p39!=1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t28, t30, t31, t33, t37, t41, t46, t51, t53, t56, t60, t63, t67, ...258
(forward)formula 0,1,1.88505,86172,1,0,459,393844,183,283,2163,745679,421
FORMULA ShieldRVt-PT-002B-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 82 transition count 82
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 82 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 81 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 81 transition count 81
Applied a total of 40 rules in 2 ms. Remains 81 /101 variables (removed 20) and now considering 81/101 (removed 20) transitions.
// Phase 1: matrix 81 rows 81 cols
[2022-05-20 18:30:20] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 18:30:20] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 81 rows 81 cols
[2022-05-20 18:30:20] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-20 18:30:20] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 81 cols
[2022-05-20 18:30:20] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-20 18:30:20] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 81/101 places, 81/101 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/101 places, 81/101 transitions.
[2022-05-20 18:30:20] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:30:20] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:30:20] [INFO ] Input system was already deterministic with 81 transitions.
[2022-05-20 18:30:20] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:30:20] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:30:20] [INFO ] Time to serialize gal into /tmp/CTLFireability6378192188741551386.gal : 2 ms
[2022-05-20 18:30:20] [INFO ] Time to serialize properties into /tmp/CTLFireability9050914385482211870.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6378192188741551386.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9050914385482211870.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.13932e+07,0.058391,7428,2,561,5,9673,6,0,407,16576,0
Converting to forward existential form...Done !
original formula: E(((A(EG(A((p63==1) U (p15==1))) U E((p41==1) U (((p77==1)&&(p96==1))&&(p21==1)))) + !(EG((p76==1)))) + ((p54==1) * !((!(AG((p31==1))) * ...258
=> equivalent forward existential formula: [FwdG((FwdU(Init,((!((E(!(E((p41==1) U (((p77==1)&&(p96==1))&&(p21==1)))) U (!(EG(!((E(!((p15==1)) U (!((p63==1)...531
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t30, t31, t37, t41, t47, t52, t60, t63, t67, t70, t75, Intersect...243
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2022-05-20 18:30:50] [INFO ] Flatten gal took : 3 ms
[2022-05-20 18:30:50] [INFO ] Applying decomposition
[2022-05-20 18:30:50] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10510309359452866926.txt' '-o' '/tmp/graph10510309359452866926.bin' '-w' '/tmp/graph10510309359452866926.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10510309359452866926.bin' '-l' '-1' '-v' '-w' '/tmp/graph10510309359452866926.weights' '-q' '0' '-e' '0.001'
[2022-05-20 18:30:50] [INFO ] Decomposing Gal with order
[2022-05-20 18:30:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 18:30:50] [INFO ] Removed a total of 22 redundant transitions.
[2022-05-20 18:30:50] [INFO ] Flatten gal took : 31 ms
[2022-05-20 18:30:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-20 18:30:50] [INFO ] Time to serialize gal into /tmp/CTLFireability11195355145886547357.gal : 2 ms
[2022-05-20 18:30:50] [INFO ] Time to serialize properties into /tmp/CTLFireability6923604106716782906.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11195355145886547357.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6923604106716782906.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.13932e+07,0.028548,5824,174,21,2232,244,245,3005,43,512,0
Converting to forward existential form...Done !
original formula: E(((A(EG(A((i5.u20.p63==1) U (i1.u5.p15==1))) U E((i3.i1.u13.p41==1) U (((i7.u24.p77==1)&&(i9.u32.p96==1))&&(i2.u10.p21==1)))) + !(EG((i7...375
=> equivalent forward existential formula: [FwdG((FwdU(Init,((!((E(!(E((i3.i1.u13.p41==1) U (((i7.u24.p77==1)&&(i9.u32.p96==1))&&(i2.u10.p21==1)))) U (!(EG...736
Reverse transition relation is NOT exact ! Due to transitions t75, i0.i0.u1.t70, i1.t63, i1.u5.t67, i2.t60, i3.t52, i3.i1.u13.t47, i4.t41, i4.u15.t37, i5.t...323
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,4.17559,151144,1,0,289030,422,1657,443683,229,1227,279319
FORMULA ShieldRVt-PT-002B-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
[2022-05-20 18:30:54] [INFO ] Flatten gal took : 9 ms
[2022-05-20 18:30:54] [INFO ] Flatten gal took : 4 ms
Total runtime 98080 ms.
BK_STOP 1653071454741
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="ShieldRVt-PT-002B"
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-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVt-PT-002B, 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 r222-tall-165286026000906"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-002B.tgz
mv ShieldRVt-PT-002B 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 ;