About the Execution of ITS-Tools for FlexibleBarrier-PT-04b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16247.323 | 3192893.00 | 3168992.00 | 29728.20 | FF????T?TTF???FT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r102-smll-162075331000010.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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 FlexibleBarrier-PT-04b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331000010
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 7.3K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 11:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 11:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 19:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 19:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 69K May 5 16:51 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 FlexibleBarrier-PT-04b-CTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1621112953898
Running Version 0
[2021-05-15 21:09:17] [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]
[2021-05-15 21:09:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 21:09:17] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2021-05-15 21:09:17] [INFO ] Transformed 268 places.
[2021-05-15 21:09:17] [INFO ] Transformed 305 transitions.
[2021-05-15 21:09:17] [INFO ] Found NUPN structural information;
[2021-05-15 21:09:17] [INFO ] Parsed PT model containing 268 places and 305 transitions in 226 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 29 ms.
[2021-05-15 21:09:17] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-15 21:09:17] [INFO ] Reduced 1 identical enabling conditions.
Support contains 232 out of 268 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 268/268 places, 305/305 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 265 transition count 302
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 265 transition count 302
Applied a total of 6 rules in 48 ms. Remains 265 /268 variables (removed 3) and now considering 302/305 (removed 3) transitions.
// Phase 1: matrix 302 rows 265 cols
[2021-05-15 21:09:18] [INFO ] Computed 6 place invariants in 29 ms
[2021-05-15 21:09:18] [INFO ] Implicit Places using invariants in 404 ms returned []
// Phase 1: matrix 302 rows 265 cols
[2021-05-15 21:09:18] [INFO ] Computed 6 place invariants in 9 ms
[2021-05-15 21:09:18] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 881 ms to find 0 implicit places.
// Phase 1: matrix 302 rows 265 cols
[2021-05-15 21:09:18] [INFO ] Computed 6 place invariants in 5 ms
[2021-05-15 21:09:19] [INFO ] Dead Transitions using invariants and state equation in 397 ms returned []
Finished structural reductions, in 1 iterations. Remains : 265/268 places, 302/305 transitions.
[2021-05-15 21:09:19] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-15 21:09:19] [INFO ] Flatten gal took : 119 ms
FORMULA FlexibleBarrier-PT-04b-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 21:09:19] [INFO ] Flatten gal took : 55 ms
[2021-05-15 21:09:20] [INFO ] Input system was already deterministic with 302 transitions.
Incomplete random walk after 100000 steps, including 2377 resets, run finished after 401 ms. (steps per millisecond=249 ) properties (out of 68) seen :66
Running SMT prover for 2 properties.
// Phase 1: matrix 302 rows 265 cols
[2021-05-15 21:09:20] [INFO ] Computed 6 place invariants in 5 ms
[2021-05-15 21:09:20] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2021-05-15 21:09:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 21:09:20] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2021-05-15 21:09:21] [INFO ] Deduced a trap composed of 78 places in 151 ms of which 8 ms to minimize.
[2021-05-15 21:09:21] [INFO ] Deduced a trap composed of 77 places in 162 ms of which 2 ms to minimize.
[2021-05-15 21:09:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 464 ms
[2021-05-15 21:09:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 21:09:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2021-05-15 21:09:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 21:09:21] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2021-05-15 21:09:21] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 2 ms to minimize.
[2021-05-15 21:09:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2021-05-15 21:09:21] [INFO ] Computed and/alt/rep : 284/557/284 causal constraints (skipped 17 transitions) in 45 ms.
[2021-05-15 21:09:24] [INFO ] Deduced a trap composed of 77 places in 138 ms of which 3 ms to minimize.
[2021-05-15 21:09:24] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 1 ms to minimize.
[2021-05-15 21:09:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 398 ms
[2021-05-15 21:09:24] [INFO ] Added : 279 causal constraints over 56 iterations in 2451 ms. Result :sat
[2021-05-15 21:09:24] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2021-05-15 21:09:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 21:09:24] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2021-05-15 21:09:24] [INFO ] Deduced a trap composed of 80 places in 82 ms of which 1 ms to minimize.
[2021-05-15 21:09:24] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 1 ms to minimize.
[2021-05-15 21:09:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 243 ms
[2021-05-15 21:09:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 21:09:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2021-05-15 21:09:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 21:09:25] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2021-05-15 21:09:25] [INFO ] Deduced a trap composed of 123 places in 134 ms of which 1 ms to minimize.
[2021-05-15 21:09:25] [INFO ] Deduced a trap composed of 77 places in 127 ms of which 1 ms to minimize.
[2021-05-15 21:09:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 332 ms
[2021-05-15 21:09:25] [INFO ] Computed and/alt/rep : 284/557/284 causal constraints (skipped 17 transitions) in 39 ms.
[2021-05-15 21:09:27] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2021-05-15 21:09:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2021-05-15 21:09:27] [INFO ] Added : 251 causal constraints over 51 iterations in 2139 ms. Result :sat
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 264 transition count 251
Reduce places removed 50 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 54 rules applied. Total rules applied 104 place count 214 transition count 247
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 108 place count 210 transition count 247
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 108 place count 210 transition count 228
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 146 place count 191 transition count 228
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 202 place count 135 transition count 172
Iterating global reduction 3 with 56 rules applied. Total rules applied 258 place count 135 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 259 place count 135 transition count 171
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 259 place count 135 transition count 168
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 265 place count 132 transition count 168
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 270 place count 127 transition count 163
Iterating global reduction 4 with 5 rules applied. Total rules applied 275 place count 127 transition count 163
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 279 place count 127 transition count 159
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 325 place count 104 transition count 136
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 329 place count 102 transition count 136
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 331 place count 102 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 332 place count 101 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 333 place count 100 transition count 134
Applied a total of 333 rules in 136 ms. Remains 100 /265 variables (removed 165) and now considering 134/302 (removed 168) transitions.
[2021-05-15 21:09:27] [INFO ] Flatten gal took : 16 ms
[2021-05-15 21:09:27] [INFO ] Flatten gal took : 19 ms
[2021-05-15 21:09:27] [INFO ] Input system was already deterministic with 134 transitions.
[2021-05-15 21:09:27] [INFO ] Flatten gal took : 17 ms
[2021-05-15 21:09:27] [INFO ] Flatten gal took : 17 ms
[2021-05-15 21:09:27] [INFO ] Time to serialize gal into /tmp/CTLFireability2158174352680446792.gal : 9 ms
[2021-05-15 21:09:27] [INFO ] Time to serialize properties into /tmp/CTLFireability1814153952040774091.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability2158174352680446792.gal, -t, CGAL, -ctl, /tmp/CTLFireability1814153952040774091.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability2158174352680446792.gal -t CGAL -ctl /tmp/CTLFireability1814153952040774091.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.45266e+06,0.531711,14820,2,3364,5,49932,6,0,537,49477,0
Converting to forward existential form...Done !
original formula: !(A((p205==1) U (!(EG(((((((((((((((((((((p130==1)||(((p52==1)&&(p71==1))&&(p219==1)))||((p132==1)&&(p265==1)))||(p147==1))||((p28==1)&&(p265==1)))||(p72==1))||(p217==1))||((p184==1)&&(p265==1)))||(p74==1))||(p33==1))||(p85==1))||(p181==1))||(p253==1))||(p207==1))||(p45==1))||(p174==1))||(((p52==1)&&(p69==1))&&(p219==1)))||(p47==1))||(p205==1)) + EF((((((((p100==1)||(p6==1))||(p197==1))||(p170==1))||(p253==1))||(p42==1))||(((p52==1)&&(p69==1))&&(p219==1))))))) + (EG(!(AF(((p265==1)||(p174==1))))) * EF((E(((((((((((p104==1)&&(p167==1))&&(p244==1))||(((p73==1)&&(p156==1))&&(p224==1)))||((p34==1)&&(p265==1)))||(p240==1))||(p231==1))||(p100==1))||(p88==1))||(p105==1)) U ((p197==1)||(p148==1))) * (p175==0)))))))
=> equivalent forward existential formula: ([FwdG(((FwdU(Init,!((!(EG(((((((((((((((((((((p130==1)||(((p52==1)&&(p71==1))&&(p219==1)))||((p132==1)&&(p265==1)))||(p147==1))||((p28==1)&&(p265==1)))||(p72==1))||(p217==1))||((p184==1)&&(p265==1)))||(p74==1))||(p33==1))||(p85==1))||(p181==1))||(p253==1))||(p207==1))||(p45==1))||(p174==1))||(((p52==1)&&(p69==1))&&(p219==1)))||(p47==1))||(p205==1)) + E(TRUE U (((((((p100==1)||(p6==1))||(p197==1))||(p170==1))||(p253==1))||(p42==1))||(((p52==1)&&(p69==1))&&(p219==1))))))) + (EG(!(!(EG(!(((p265==1)||(p174==1))))))) * E(TRUE U (E(((((((((((p104==1)&&(p167==1))&&(p244==1))||(((p73==1)&&(p156==1))&&(p224==1)))||((p34==1)&&(p265==1)))||(p240==1))||(p231==1))||(p100==1))||(p88==1))||(p105==1)) U ((p197==1)||(p148==1))) * (p175==0))))))) * !((p205==1))) * !((EG(!(!(EG(!(((p265==1)||(p174==1))))))) * E(TRUE U (E(((((((((((p104==1)&&(p167==1))&&(p244==1))||(((p73==1)&&(p156==1))&&(p224==1)))||((p34==1)&&(p265==1)))||(p240==1))||(p231==1))||(p100==1))||(p88==1))||(p105==1)) U ((p197==1)||(p148==1))) * (p175==0)))))),((((((((((((((((((((p130==1)||(((p52==1)&&(p71==1))&&(p219==1)))||((p132==1)&&(p265==1)))||(p147==1))||((p28==1)&&(p265==1)))||(p72==1))||(p217==1))||((p184==1)&&(p265==1)))||(p74==1))||(p33==1))||(p85==1))||(p181==1))||(p253==1))||(p207==1))||(p45==1))||(p174==1))||(((p52==1)&&(p69==1))&&(p219==1)))||(p47==1))||(p205==1)) + E(TRUE U (((((((p100==1)||(p6==1))||(p197==1))||(p170==1))||(p253==1))||(p42==1))||(((p52==1)&&(p69==1))&&(p219==1))))))] != FALSE + [FwdG(Init,!((!(EG(((((((((((((((((((((p130==1)||(((p52==1)&&(p71==1))&&(p219==1)))||((p132==1)&&(p265==1)))||(p147==1))||((p28==1)&&(p265==1)))||(p72==1))||(p217==1))||((p184==1)&&(p265==1)))||(p74==1))||(p33==1))||(p85==1))||(p181==1))||(p253==1))||(p207==1))||(p45==1))||(p174==1))||(((p52==1)&&(p69==1))&&(p219==1)))||(p47==1))||(p205==1)) + E(TRUE U (((((((p100==1)||(p6==1))||(p197==1))||(p170==1))||(p253==1))||(p42==1))||(((p52==1)&&(p69==1))&&(p219==1))))))) + (EG(!(!(EG(!(((p265==1)||(p174==1))))))) * E(TRUE U (E(((((((((((p104==1)&&(p167==1))&&(p244==1))||(((p73==1)&&(p156==1))&&(p224==1)))||((p34==1)&&(p265==1)))||(p240==1))||(p231==1))||(p100==1))||(p88==1))||(p105==1)) U ((p197==1)||(p148==1))) * (p175==0)))))))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t10, t15, t23, t35, t38, t40, t51, t73, t77, t86, t95, t104, t114, t124, t125, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/117/17/134
Detected timeout of ITS tools.
[2021-05-15 21:09:58] [INFO ] Flatten gal took : 16 ms
[2021-05-15 21:09:58] [INFO ] Applying decomposition
[2021-05-15 21:09:58] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12320484874334902737.txt, -o, /tmp/graph12320484874334902737.bin, -w, /tmp/graph12320484874334902737.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12320484874334902737.bin, -l, -1, -v, -w, /tmp/graph12320484874334902737.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 21:09:58] [INFO ] Decomposing Gal with order
[2021-05-15 21:09:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 21:09:58] [INFO ] Removed a total of 61 redundant transitions.
[2021-05-15 21:09:58] [INFO ] Flatten gal took : 102 ms
[2021-05-15 21:09:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 9 ms.
[2021-05-15 21:09:58] [INFO ] Time to serialize gal into /tmp/CTLFireability8491362818414534381.gal : 9 ms
[2021-05-15 21:09:58] [INFO ] Time to serialize properties into /tmp/CTLFireability16804290043568397246.ctl : 6 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability8491362818414534381.gal, -t, CGAL, -ctl, /tmp/CTLFireability16804290043568397246.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability8491362818414534381.gal -t CGAL -ctl /tmp/CTLFireability16804290043568397246.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.45266e+06,0.268424,10768,324,221,10642,4460,370,15211,129,18622,0
Converting to forward existential form...Done !
original formula: !(A((i7.u20.p205==1) U (!(EG(((((((((((((((((((((i4.u12.p130==1)||(((i1.u1.p52==1)&&(i3.u7.p71==1))&&(i7.u23.p219==1)))||((i0.u11.p132==1)&&(i0.u24.p265==1)))||(i4.u14.p147==1))||((i0.u2.p28==1)&&(i0.u24.p265==1)))||(i3.u9.p72==1))||(i7.u21.p217==1))||((i0.u24.p184==1)&&(i0.u24.p265==1)))||(i3.u9.p74==1))||(i1.u1.p33==1))||(i3.u7.p85==1))||(i6.u16.p181==1))||(i7.u23.p253==1))||(i7.u20.p207==1))||(i1.u5.p45==1))||(i6.u19.p174==1))||(((i1.u1.p52==1)&&(i3.u7.p69==1))&&(i7.u23.p219==1)))||(i1.u1.p47==1))||(i7.u20.p205==1)) + EF((((((((i3.u8.p100==1)||(i1.u0.p6==1))||(i6.u18.p197==1))||(i6.u19.p170==1))||(i7.u23.p253==1))||(i1.u4.p42==1))||(((i1.u1.p52==1)&&(i3.u7.p69==1))&&(i7.u23.p219==1))))))) + (EG(!(AF(((i0.u24.p265==1)||(i6.u19.p174==1))))) * EF((E(((((((((((i3.u9.p104==1)&&(i6.u18.p167==1))&&(i7.u23.p244==1))||(((i3.u7.p73==1)&&(i4.u10.p156==1))&&(i7.u23.p224==1)))||((i0.u24.p34==1)&&(i0.u24.p265==1)))||(i7.u23.p240==1))||(i7.u22.p231==1))||(i3.u8.p100==1))||(u6.p88==1))||(i3.u9.p105==1)) U ((i6.u18.p197==1)||(i4.u10.p148==1))) * (u15.p175==0)))))))
=> equivalent forward existential formula: ([FwdG(((FwdU(Init,!((!(EG(((((((((((((((((((((i4.u12.p130==1)||(((i1.u1.p52==1)&&(i3.u7.p71==1))&&(i7.u23.p219==1)))||((i0.u11.p132==1)&&(i0.u24.p265==1)))||(i4.u14.p147==1))||((i0.u2.p28==1)&&(i0.u24.p265==1)))||(i3.u9.p72==1))||(i7.u21.p217==1))||((i0.u24.p184==1)&&(i0.u24.p265==1)))||(i3.u9.p74==1))||(i1.u1.p33==1))||(i3.u7.p85==1))||(i6.u16.p181==1))||(i7.u23.p253==1))||(i7.u20.p207==1))||(i1.u5.p45==1))||(i6.u19.p174==1))||(((i1.u1.p52==1)&&(i3.u7.p69==1))&&(i7.u23.p219==1)))||(i1.u1.p47==1))||(i7.u20.p205==1)) + E(TRUE U (((((((i3.u8.p100==1)||(i1.u0.p6==1))||(i6.u18.p197==1))||(i6.u19.p170==1))||(i7.u23.p253==1))||(i1.u4.p42==1))||(((i1.u1.p52==1)&&(i3.u7.p69==1))&&(i7.u23.p219==1))))))) + (EG(!(!(EG(!(((i0.u24.p265==1)||(i6.u19.p174==1))))))) * E(TRUE U (E(((((((((((i3.u9.p104==1)&&(i6.u18.p167==1))&&(i7.u23.p244==1))||(((i3.u7.p73==1)&&(i4.u10.p156==1))&&(i7.u23.p224==1)))||((i0.u24.p34==1)&&(i0.u24.p265==1)))||(i7.u23.p240==1))||(i7.u22.p231==1))||(i3.u8.p100==1))||(u6.p88==1))||(i3.u9.p105==1)) U ((i6.u18.p197==1)||(i4.u10.p148==1))) * (u15.p175==0))))))) * !((i7.u20.p205==1))) * !((EG(!(!(EG(!(((i0.u24.p265==1)||(i6.u19.p174==1))))))) * E(TRUE U (E(((((((((((i3.u9.p104==1)&&(i6.u18.p167==1))&&(i7.u23.p244==1))||(((i3.u7.p73==1)&&(i4.u10.p156==1))&&(i7.u23.p224==1)))||((i0.u24.p34==1)&&(i0.u24.p265==1)))||(i7.u23.p240==1))||(i7.u22.p231==1))||(i3.u8.p100==1))||(u6.p88==1))||(i3.u9.p105==1)) U ((i6.u18.p197==1)||(i4.u10.p148==1))) * (u15.p175==0)))))),((((((((((((((((((((i4.u12.p130==1)||(((i1.u1.p52==1)&&(i3.u7.p71==1))&&(i7.u23.p219==1)))||((i0.u11.p132==1)&&(i0.u24.p265==1)))||(i4.u14.p147==1))||((i0.u2.p28==1)&&(i0.u24.p265==1)))||(i3.u9.p72==1))||(i7.u21.p217==1))||((i0.u24.p184==1)&&(i0.u24.p265==1)))||(i3.u9.p74==1))||(i1.u1.p33==1))||(i3.u7.p85==1))||(i6.u16.p181==1))||(i7.u23.p253==1))||(i7.u20.p207==1))||(i1.u5.p45==1))||(i6.u19.p174==1))||(((i1.u1.p52==1)&&(i3.u7.p69==1))&&(i7.u23.p219==1)))||(i1.u1.p47==1))||(i7.u20.p205==1)) + E(TRUE U (((((((i3.u8.p100==1)||(i1.u0.p6==1))||(i6.u18.p197==1))||(i6.u19.p170==1))||(i7.u23.p253==1))||(i1.u4.p42==1))||(((i1.u1.p52==1)&&(i3.u7.p69==1))&&(i7.u23.p219==1))))))] != FALSE + [FwdG(Init,!((!(EG(((((((((((((((((((((i4.u12.p130==1)||(((i1.u1.p52==1)&&(i3.u7.p71==1))&&(i7.u23.p219==1)))||((i0.u11.p132==1)&&(i0.u24.p265==1)))||(i4.u14.p147==1))||((i0.u2.p28==1)&&(i0.u24.p265==1)))||(i3.u9.p72==1))||(i7.u21.p217==1))||((i0.u24.p184==1)&&(i0.u24.p265==1)))||(i3.u9.p74==1))||(i1.u1.p33==1))||(i3.u7.p85==1))||(i6.u16.p181==1))||(i7.u23.p253==1))||(i7.u20.p207==1))||(i1.u5.p45==1))||(i6.u19.p174==1))||(((i1.u1.p52==1)&&(i3.u7.p69==1))&&(i7.u23.p219==1)))||(i1.u1.p47==1))||(i7.u20.p205==1)) + E(TRUE U (((((((i3.u8.p100==1)||(i1.u0.p6==1))||(i6.u18.p197==1))||(i6.u19.p170==1))||(i7.u23.p253==1))||(i1.u4.p42==1))||(((i1.u1.p52==1)&&(i3.u7.p69==1))&&(i7.u23.p219==1))))))) + (EG(!(!(EG(!(((i0.u24.p265==1)||(i6.u19.p174==1))))))) * E(TRUE U (E(((((((((((i3.u9.p104==1)&&(i6.u18.p167==1))&&(i7.u23.p244==1))||(((i3.u7.p73==1)&&(i4.u10.p156==1))&&(i7.u23.p224==1)))||((i0.u24.p34==1)&&(i0.u24.p265==1)))||(i7.u23.p240==1))||(i7.u22.p231==1))||(i3.u8.p100==1))||(u6.p88==1))||(i3.u9.p105==1)) U ((i6.u18.p197==1)||(i4.u10.p148==1))) * (u15.p175==0)))))))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t104, t114, u6.t73, i1.t125, i1.t124, i1.t51, i1.u1.t86, i3.t35, i3.u7.t95, i3.u9.t38, i3.u9.t40, i4.u10.t77, i6.u19.t23, i7.t15, i7.t10, i7.t6, i7.u23.t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/112/17/129
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,5.15511,164736,1,0,306201,24703,2313,514609,733,116655,534355
FORMULA FlexibleBarrier-PT-04b-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Graph (trivial) has 186 edges and 265 vertex of which 14 / 265 are part of one of the 2 SCC in 11 ms
Free SCC test removed 12 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 252 transition count 239
Reduce places removed 49 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 52 rules applied. Total rules applied 102 place count 203 transition count 236
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 105 place count 200 transition count 236
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 105 place count 200 transition count 212
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 153 place count 176 transition count 212
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 212 place count 117 transition count 153
Iterating global reduction 3 with 59 rules applied. Total rules applied 271 place count 117 transition count 153
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 271 place count 117 transition count 151
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 275 place count 115 transition count 151
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 280 place count 110 transition count 146
Iterating global reduction 3 with 5 rules applied. Total rules applied 285 place count 110 transition count 146
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 290 place count 110 transition count 141
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 336 place count 87 transition count 118
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 340 place count 85 transition count 124
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 341 place count 85 transition count 124
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 342 place count 84 transition count 123
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 343 place count 83 transition count 122
Applied a total of 343 rules in 77 ms. Remains 83 /265 variables (removed 182) and now considering 122/302 (removed 180) transitions.
[2021-05-15 21:10:03] [INFO ] Flatten gal took : 9 ms
[2021-05-15 21:10:03] [INFO ] Flatten gal took : 9 ms
[2021-05-15 21:10:03] [INFO ] Input system was already deterministic with 122 transitions.
[2021-05-15 21:10:03] [INFO ] Flatten gal took : 10 ms
[2021-05-15 21:10:03] [INFO ] Flatten gal took : 9 ms
[2021-05-15 21:10:03] [INFO ] Time to serialize gal into /tmp/CTLFireability14227224457626339037.gal : 3 ms
[2021-05-15 21:10:03] [INFO ] Time to serialize properties into /tmp/CTLFireability7080781278830602265.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability14227224457626339037.gal, -t, CGAL, -ctl, /tmp/CTLFireability7080781278830602265.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability14227224457626339037.gal -t CGAL -ctl /tmp/CTLFireability7080781278830602265.ctl --gen-order FOLLOW
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.22053e+06,0.339487,14656,2,3483,5,48189,6,0,454,51068,0
Converting to forward existential form...Done !
original formula: EG(!(E(EF((((p151==1)&&(p253==1))||(p251==1))) U AG(((((((((p166==0)&&(p181==0))&&(p253==0))&&(p207==0))&&(p76==0))&&((p142==0)||(p265==0)))&&(p108==0))||((((((((((p49==0)&&(p48==0))&&(p193==0))&&(p144==0))&&(p258==0))&&(((p17==0)||(p104==0))||(p209==0)))&&(p223==0))&&(p13==0))&&(p222==0))&&(p29==0)))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(E(TRUE U (((p151==1)&&(p253==1))||(p251==1))) U !(E(TRUE U !(((((((((p166==0)&&(p181==0))&&(p253==0))&&(p207==0))&&(p76==0))&&((p142==0)||(p265==0)))&&(p108==0))||((((((((((p49==0)&&(p48==0))&&(p193==0))&&(p144==0))&&(p258==0))&&(((p17==0)||(p104==0))||(p209==0)))&&(p223==0))&&(p13==0))&&(p222==0))&&(p29==0)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t10, t15, t18, t22, t40, t43, t47, t62, t66, t72, t75, t81, t96, t107, t108, t113, t114, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/103/19/122
Detected timeout of ITS tools.
[2021-05-15 21:10:33] [INFO ] Flatten gal took : 26 ms
[2021-05-15 21:10:33] [INFO ] Applying decomposition
[2021-05-15 21:10:33] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16499167341918487172.txt, -o, /tmp/graph16499167341918487172.bin, -w, /tmp/graph16499167341918487172.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16499167341918487172.bin, -l, -1, -v, -w, /tmp/graph16499167341918487172.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 21:10:33] [INFO ] Decomposing Gal with order
[2021-05-15 21:10:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 21:10:33] [INFO ] Removed a total of 61 redundant transitions.
[2021-05-15 21:10:33] [INFO ] Flatten gal took : 17 ms
[2021-05-15 21:10:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 3 ms.
[2021-05-15 21:10:33] [INFO ] Time to serialize gal into /tmp/CTLFireability18341622559479661419.gal : 3 ms
[2021-05-15 21:10:33] [INFO ] Time to serialize properties into /tmp/CTLFireability17873999858115907282.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability18341622559479661419.gal, -t, CGAL, -ctl, /tmp/CTLFireability17873999858115907282.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability18341622559479661419.gal -t CGAL -ctl /tmp/CTLFireability17873999858115907282.ctl
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.22053e+06,0.349513,13016,350,400,9574,9677,320,25332,153,60953,0
Converting to forward existential form...Done !
original formula: EG(!(E(EF((((i4.u7.p151==1)&&(i6.u14.p253==1))||(i6.u14.p251==1))) U AG(((((((((i5.u10.p166==0)&&(i5.u11.p181==0))&&(i6.u14.p253==0))&&(i6.u15.p207==0))&&(u6.p76==0))&&((i4.u9.p142==0)||(i0.u17.p265==0)))&&(i4.u7.p108==0))||((((((((((i2.u4.p49==0)&&(i2.u4.p48==0))&&(i5.u13.p193==0))&&(i4.u8.p144==0))&&(i0.u17.p258==0))&&(((i2.u1.p17==0)||(u6.p104==0))||(i6.u14.p209==0)))&&(u16.p223==0))&&(i2.u0.p13==0))&&(u16.p222==0))&&(u3.p29==0)))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(E(TRUE U (((i4.u7.p151==1)&&(i6.u14.p253==1))||(i6.u14.p251==1))) U !(E(TRUE U !(((((((((i5.u10.p166==0)&&(i5.u11.p181==0))&&(i6.u14.p253==0))&&(i6.u15.p207==0))&&(u6.p76==0))&&((i4.u9.p142==0)||(i0.u17.p265==0)))&&(i4.u7.p108==0))||((((((((((i2.u4.p49==0)&&(i2.u4.p48==0))&&(i5.u13.p193==0))&&(i4.u8.p144==0))&&(i0.u17.p258==0))&&(((i2.u1.p17==0)||(u6.p104==0))||(i6.u14.p209==0)))&&(u16.p223==0))&&(i2.u0.p13==0))&&(u16.p222==0))&&(u3.p29==0)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t72, t75, t80, t96, t114, u3.t43, i0.u17.t1, i0.u17.t66, i2.t40, i2.u0.t47, i4.u7.t107, i4.u7.t108, i4.u8.t62, i5.t18, i5.u10.t22, i6.t15, i6.u14.t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/91/18/109
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,7.08628,192996,1,0,250335,109744,1751,658987,827,733841,428613
FORMULA FlexibleBarrier-PT-04b-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 264 transition count 250
Reduce places removed 51 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 65 rules applied. Total rules applied 116 place count 213 transition count 236
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 130 place count 199 transition count 236
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 130 place count 199 transition count 212
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 178 place count 175 transition count 212
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 236 place count 117 transition count 154
Iterating global reduction 3 with 58 rules applied. Total rules applied 294 place count 117 transition count 154
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 294 place count 117 transition count 151
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 300 place count 114 transition count 151
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 306 place count 108 transition count 145
Iterating global reduction 3 with 6 rules applied. Total rules applied 312 place count 108 transition count 145
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 318 place count 108 transition count 139
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 362 place count 86 transition count 117
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 370 place count 82 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 371 place count 81 transition count 127
Applied a total of 371 rules in 40 ms. Remains 81 /265 variables (removed 184) and now considering 127/302 (removed 175) transitions.
[2021-05-15 21:10:41] [INFO ] Flatten gal took : 9 ms
[2021-05-15 21:10:41] [INFO ] Flatten gal took : 9 ms
[2021-05-15 21:10:41] [INFO ] Input system was already deterministic with 127 transitions.
[2021-05-15 21:10:41] [INFO ] Flatten gal took : 8 ms
[2021-05-15 21:10:41] [INFO ] Flatten gal took : 8 ms
[2021-05-15 21:10:41] [INFO ] Time to serialize gal into /tmp/CTLFireability5830834432164243963.gal : 12 ms
[2021-05-15 21:10:41] [INFO ] Time to serialize properties into /tmp/CTLFireability3717854237711716857.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability5830834432164243963.gal, -t, CGAL, -ctl, /tmp/CTLFireability3717854237711716857.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability5830834432164243963.gal -t CGAL -ctl /tmp/CTLFireability3717854237711716857.ctl --gen-order FOLLOW
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.19018e+06,0.13069,7716,2,1416,5,18682,6,0,453,12969,0
Converting to forward existential form...Done !
original formula: E((((((p115==1)||(p177==1))||(p183==1))||(p88==1))||((p141==1)&&(p253==1))) U EG(AF(((((((((((p115==1)||(p144==1))||(p177==1))||(p231==1))||(p199==1))||(p151==1))||(p13==1))||(p95==1)) + EG((((((((p194==1)||(p53==1))||(p150==1))||(p56==1))||((p99==1)&&(p253==1)))||(p111==1))||(p174==1)))) + ((p184==1)&&(p265==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,(((((p115==1)||(p177==1))||(p183==1))||(p88==1))||((p141==1)&&(p253==1)))),!(EG(!(((((((((((p115==1)||(p144==1))||(p177==1))||(p231==1))||(p199==1))||(p151==1))||(p13==1))||(p95==1)) + EG((((((((p194==1)||(p53==1))||(p150==1))||(p56==1))||((p99==1)&&(p253==1)))||(p111==1))||(p174==1)))) + ((p184==1)&&(p265==1)))))))] != FALSE
Hit Full ! (commute/partial/dont) 93/0/34
Reverse transition relation is NOT exact ! Due to transitions t5, t51, t53, t54, t66, t74, t99, t100, t105, t106, t117, t118, t124, t125, t126, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/112/15/127
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,16.1923,423424,1,0,621,2.27178e+06,295,342,3268,2.89131e+06,641
FORMULA FlexibleBarrier-PT-04b-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Graph (trivial) has 186 edges and 265 vertex of which 12 / 265 are part of one of the 2 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 254 transition count 236
Reduce places removed 55 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 61 rules applied. Total rules applied 117 place count 199 transition count 230
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 123 place count 193 transition count 230
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 123 place count 193 transition count 207
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 169 place count 170 transition count 207
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 229 place count 110 transition count 147
Iterating global reduction 3 with 60 rules applied. Total rules applied 289 place count 110 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 290 place count 110 transition count 146
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 290 place count 110 transition count 145
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 292 place count 109 transition count 145
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 296 place count 105 transition count 141
Iterating global reduction 4 with 4 rules applied. Total rules applied 300 place count 105 transition count 141
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 303 place count 105 transition count 138
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 349 place count 82 transition count 115
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 355 place count 79 transition count 122
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 356 place count 78 transition count 121
Applied a total of 356 rules in 42 ms. Remains 78 /265 variables (removed 187) and now considering 121/302 (removed 181) transitions.
[2021-05-15 21:10:57] [INFO ] Flatten gal took : 7 ms
[2021-05-15 21:10:57] [INFO ] Flatten gal took : 8 ms
[2021-05-15 21:10:57] [INFO ] Input system was already deterministic with 121 transitions.
[2021-05-15 21:10:57] [INFO ] Flatten gal took : 7 ms
[2021-05-15 21:10:57] [INFO ] Flatten gal took : 7 ms
[2021-05-15 21:10:57] [INFO ] Time to serialize gal into /tmp/CTLFireability16166963145290145366.gal : 1 ms
[2021-05-15 21:10:57] [INFO ] Time to serialize properties into /tmp/CTLFireability16192634430760428554.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability16166963145290145366.gal, -t, CGAL, -ctl, /tmp/CTLFireability16192634430760428554.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability16166963145290145366.gal -t CGAL -ctl /tmp/CTLFireability16192634430760428554.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.34819e+06,0.203612,9068,2,1505,5,21460,6,0,433,18719,0
Converting to forward existential form...Done !
original formula: !(AG(((AG((((((((p141==1)&&(p253==1))||(p241==1))||(p197==1))||(p154==1))||(p40==1))||(p186==1))) + EG(EF(((((((((p225==1)||(p99==1))||(p101==1))||(p70==1))||(p74==1))||(p200==1))||(p190==1))||(p124==1))))) + EF(((p22==1)||(p40==1))))))
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !(E(TRUE U ((p22==1)||(p40==1))))) * !(EG(E(TRUE U ((((((((p225==1)||(p99==1))||(p101==1))||(p70==1))||(p74==1))||(p200==1))||(p190==1))||(p124==1)))))),TRUE) * !((((((((p141==1)&&(p253==1))||(p241==1))||(p197==1))||(p154==1))||(p40==1))||(p186==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t6, t23, t36, t49, t70, t78, t85, t95, t99, t100, t101, t102, t107, t108, t111, t112, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/104/17/121
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,14.9301,353940,1,0,279,2.06966e+06,269,127,3139,1.41325e+06,353
FORMULA FlexibleBarrier-PT-04b-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Graph (trivial) has 249 edges and 265 vertex of which 26 / 265 are part of one of the 4 SCC in 1 ms
Free SCC test removed 22 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 242 transition count 205
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 147 place count 169 transition count 205
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 147 place count 169 transition count 193
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 171 place count 157 transition count 193
Discarding 67 places :
Symmetric choice reduction at 2 with 67 rule applications. Total rules 238 place count 90 transition count 126
Iterating global reduction 2 with 67 rules applied. Total rules applied 305 place count 90 transition count 126
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 305 place count 90 transition count 124
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 309 place count 88 transition count 124
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 317 place count 80 transition count 116
Iterating global reduction 2 with 8 rules applied. Total rules applied 325 place count 80 transition count 116
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 332 place count 80 transition count 109
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 376 place count 58 transition count 87
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 377 place count 57 transition count 86
Iterating global reduction 3 with 1 rules applied. Total rules applied 378 place count 57 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 379 place count 57 transition count 85
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 383 place count 57 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 384 place count 56 transition count 80
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 385 place count 55 transition count 79
Applied a total of 385 rules in 38 ms. Remains 55 /265 variables (removed 210) and now considering 79/302 (removed 223) transitions.
[2021-05-15 21:11:12] [INFO ] Flatten gal took : 5 ms
[2021-05-15 21:11:12] [INFO ] Flatten gal took : 5 ms
[2021-05-15 21:11:12] [INFO ] Input system was already deterministic with 79 transitions.
Finished random walk after 552 steps, including 51 resets, run visited all 1 properties in 7 ms. (steps per millisecond=78 )
FORMULA FlexibleBarrier-PT-04b-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Graph (trivial) has 207 edges and 265 vertex of which 12 / 265 are part of one of the 2 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 254 transition count 225
Reduce places removed 66 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 68 rules applied. Total rules applied 135 place count 188 transition count 223
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 137 place count 186 transition count 223
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 137 place count 186 transition count 207
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 169 place count 170 transition count 207
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 231 place count 108 transition count 145
Iterating global reduction 3 with 62 rules applied. Total rules applied 293 place count 108 transition count 145
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 3 with 2 rules applied. Total rules applied 295 place count 108 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 296 place count 107 transition count 143
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 296 place count 107 transition count 141
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 300 place count 105 transition count 141
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 307 place count 98 transition count 134
Iterating global reduction 5 with 7 rules applied. Total rules applied 314 place count 98 transition count 134
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 320 place count 98 transition count 128
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 360 place count 78 transition count 108
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 364 place count 76 transition count 108
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 367 place count 76 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 368 place count 75 transition count 107
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 369 place count 74 transition count 106
Applied a total of 369 rules in 48 ms. Remains 74 /265 variables (removed 191) and now considering 106/302 (removed 196) transitions.
[2021-05-15 21:11:12] [INFO ] Flatten gal took : 6 ms
[2021-05-15 21:11:12] [INFO ] Flatten gal took : 6 ms
[2021-05-15 21:11:12] [INFO ] Input system was already deterministic with 106 transitions.
[2021-05-15 21:11:12] [INFO ] Flatten gal took : 6 ms
[2021-05-15 21:11:12] [INFO ] Flatten gal took : 6 ms
[2021-05-15 21:11:12] [INFO ] Time to serialize gal into /tmp/CTLFireability6889449433950777451.gal : 1 ms
[2021-05-15 21:11:12] [INFO ] Time to serialize properties into /tmp/CTLFireability13104017478718127933.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability6889449433950777451.gal, -t, CGAL, -ctl, /tmp/CTLFireability13104017478718127933.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability6889449433950777451.gal -t CGAL -ctl /tmp/CTLFireability13104017478718127933.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.5939e+06,0.095936,6796,2,693,5,13534,6,0,402,9909,0
Converting to forward existential form...Done !
original formula: AG(AF((!(EF((((p99==0)&&(p154==0))&&(p105==0)))) + (((EG((((((((((p104==1)&&(p167==1))&&(p244==1))||(p195==1))||(p150==1))||(p197==1))||((p139==1)&&(p265==1)))||(p111==1))||(p29==1))) * (p55==0)) * (p45==0)) * ((p87==0)||(p265==0))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((!(E(TRUE U (((p99==0)&&(p154==0))&&(p105==0)))) + (((EG((((((((((p104==1)&&(p167==1))&&(p244==1))||(p195==1))||(p150==1))||(p197==1))||((p139==1)&&(p265==1)))||(p111==1))||(p29==1))) * (p55==0)) * (p45==0)) * ((p87==0)||(p265==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t22, t78, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/104/2/106
(forward)formula 0,0,3.3729,72988,1,0,199,418424,245,90,2722,334869,291
FORMULA FlexibleBarrier-PT-04b-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Graph (trivial) has 180 edges and 265 vertex of which 6 / 265 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 259 transition count 245
Reduce places removed 51 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 54 rules applied. Total rules applied 106 place count 208 transition count 242
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 109 place count 205 transition count 242
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 109 place count 205 transition count 219
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 155 place count 182 transition count 219
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 213 place count 124 transition count 161
Iterating global reduction 3 with 58 rules applied. Total rules applied 271 place count 124 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 272 place count 124 transition count 160
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 272 place count 124 transition count 157
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 278 place count 121 transition count 157
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 284 place count 115 transition count 151
Iterating global reduction 4 with 6 rules applied. Total rules applied 290 place count 115 transition count 151
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 295 place count 115 transition count 146
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 347 place count 89 transition count 120
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 355 place count 85 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 356 place count 84 transition count 130
Applied a total of 356 rules in 28 ms. Remains 84 /265 variables (removed 181) and now considering 130/302 (removed 172) transitions.
[2021-05-15 21:11:16] [INFO ] Flatten gal took : 8 ms
[2021-05-15 21:11:16] [INFO ] Flatten gal took : 8 ms
[2021-05-15 21:11:16] [INFO ] Input system was already deterministic with 130 transitions.
[2021-05-15 21:11:16] [INFO ] Flatten gal took : 8 ms
[2021-05-15 21:11:16] [INFO ] Flatten gal took : 8 ms
[2021-05-15 21:11:16] [INFO ] Time to serialize gal into /tmp/CTLFireability11915593732311412063.gal : 1 ms
[2021-05-15 21:11:16] [INFO ] Time to serialize properties into /tmp/CTLFireability12715277885097004131.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability11915593732311412063.gal, -t, CGAL, -ctl, /tmp/CTLFireability12715277885097004131.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability11915593732311412063.gal -t CGAL -ctl /tmp/CTLFireability12715277885097004131.ctl --gen-order FOLLOW
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.25996e+06,0.637428,17888,2,4080,5,64694,6,0,465,55222,0
Converting to forward existential form...Done !
original formula: (AG(((((((EF(((((p245==1)||(p240==1))||(p186==1))||((p86==1)&&(p265==1)))) + (p247==1)) + (p101==1)) + (p254==1)) + (p128==1)) + (p164==1)) + ((p89==1)&&(p253==1)))) * (!(EF(((p9==1)||(p94==1)))) + !(AF(!(EG((((((((((p101==1)||(p6==1))||(p197==1))||(p164==1))||(p77==1))||((p99==1)&&(p253==1)))||(p207==1))||(p266==1))||(p79==1))))))))
=> equivalent forward existential formula: ([(((((((FwdU(Init,TRUE) * !(((p89==1)&&(p253==1)))) * !((p164==1))) * !((p128==1))) * !((p254==1))) * !((p101==1))) * !((p247==1))) * !(E(TRUE U ((((p245==1)||(p240==1))||(p186==1))||((p86==1)&&(p265==1))))))] = FALSE * [(FwdU((Init * !(!(!(EG(!(!(EG((((((((((p101==1)||(p6==1))||(p197==1))||(p164==1))||(p77==1))||((p99==1)&&(p253==1)))||(p207==1))||(p266==1))||(p79==1)))))))))),TRUE) * ((p9==1)||(p94==1)))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t6, t9, t17, t18, t26, t33, t58, t63, t66, t67, t92, t100, t101, t102, t103, t120, t121, t122, t123, t124, t125, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/106/24/130
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,6.72943,161296,1,0,291,918944,289,110,3428,759150,360
FORMULA FlexibleBarrier-PT-04b-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2021-05-15 21:11:23] [INFO ] Flatten gal took : 21 ms
[2021-05-15 21:11:23] [INFO ] Flatten gal took : 12 ms
[2021-05-15 21:11:23] [INFO ] Applying decomposition
[2021-05-15 21:11:23] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16950359334964822511.txt, -o, /tmp/graph16950359334964822511.bin, -w, /tmp/graph16950359334964822511.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16950359334964822511.bin, -l, -1, -v, -w, /tmp/graph16950359334964822511.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 21:11:23] [INFO ] Decomposing Gal with order
[2021-05-15 21:11:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 21:11:23] [INFO ] Removed a total of 84 redundant transitions.
[2021-05-15 21:11:23] [INFO ] Flatten gal took : 62 ms
[2021-05-15 21:11:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-15 21:11:23] [INFO ] Time to serialize gal into /tmp/CTLFireability292999122926263968.gal : 6 ms
[2021-05-15 21:11:23] [INFO ] Time to serialize properties into /tmp/CTLFireability15791053128528929427.ctl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability292999122926263968.gal, -t, CGAL, -ctl, /tmp/CTLFireability15791053128528929427.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability292999122926263968.gal -t CGAL -ctl /tmp/CTLFireability15791053128528929427.ctl
No direction supplied, using forward translation only.
Parsed 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.60613e+08,20.8812,396668,13129,405,623360,2956,707,1.46344e+06,114,34082,0
Converting to forward existential form...Done !
original formula: EX(!(EG(((EX((((((i14.u83.p259==1)||(i11.i1.u63.p186==1))||(((i4.i2.u27.p104==1)&&(i10.i2.u68.p169==1))&&(i12.u81.p244==1)))||((i10.i1.u65.p191==1)&&(i14.u84.p264==1)))||(i12.u75.p220==1))) * (((((i10.i1.u66.p194==1)||(i4.i2.u36.p99==1))||(i1.u3.p7==1))||((i5.i0.u30.p89==1)&&(i12.u81.p253==1)))||(i2.i0.u9.p27==1))) + (((((i11.i0.u59.p177==0)&&(i10.i0.u62.p183==0))&&(i10.i2.u68.p197==0))&&(((i4.i2.u27.p104==0)||(i10.i2.u68.p169==0))||(i12.u81.p244==0)))&&(i3.i1.u8.p47==0))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(((EX((((((i14.u83.p259==1)||(i11.i1.u63.p186==1))||(((i4.i2.u27.p104==1)&&(i10.i2.u68.p169==1))&&(i12.u81.p244==1)))||((i10.i1.u65.p191==1)&&(i14.u84.p264==1)))||(i12.u75.p220==1))) * (((((i10.i1.u66.p194==1)||(i4.i2.u36.p99==1))||(i1.u3.p7==1))||((i5.i0.u30.p89==1)&&(i12.u81.p253==1)))||(i2.i0.u9.p27==1))) + (((((i11.i0.u59.p177==0)&&(i10.i0.u62.p183==0))&&(i10.i2.u68.p197==0))&&(((i4.i2.u27.p104==0)||(i10.i2.u68.p169==0))||(i12.u81.p244==0)))&&(i3.i1.u8.p47==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t15, t60, t111, t159, t207, u71.t58, u71.t61, i1.t245, i1.t243, i1.t239, i1.t237, i1.t205, i1.u5.t241, i2.i0.t220, i2.i0.u9.t224, i2.i1.u11.t213, i2.i1.u11.t218, i3.i0.t209, i3.i1.u18.t228, i3.i1.u18.t230, i3.i1.u18.t232, i3.i1.u18.t234, i3.i2.t201, i3.i2.u12.t215, i3.i2.u12.t222, i3.i2.u19.t216, i4.i0.t154, i4.i0.u26.t168, i4.i0.u29.t167, i4.i0.u29.t174, i4.i1.t161, i4.i2.u27.t180, i4.i2.u27.t182, i4.i2.u27.t184, i5.i0.u31.t165, i5.i0.u31.t170, i5.i1.t172, i5.i1.u28.t176, i6.t197, i6.t195, i6.t193, i6.t191, i6.t189, i6.t157, i7.i0.t124, i7.i0.u45.t128, i7.i1.u50.t117, i7.i1.u50.t122, i8.i0.t105, i8.i0.u47.t120, i8.i0.u48.t119, i8.i0.u48.t126, i8.i1.t113, i8.i2.u57.t132, i8.i2.u57.t134, i8.i2.u57.t136, i8.i2.u57.t138, i9.t149, i9.t147, i9.t145, i9.t143, i9.t141, i9.t109, i10.i0.t64, i10.i0.u61.t77, i10.i0.u62.t76, i10.i0.u62.t83, i10.i1.t70, i10.i2.u70.t89, i10.i2.u70.t91, i10.i2.u70.t93, i10.i2.u70.t95, i10.i2.u70.t97, i10.i2.u70.t99, i11.i0.t81, i11.i0.u59.t85, i11.i1.u64.t74, i11.i1.u64.t79, i12.t55, i12.t54, i12.t50, i12.t46, i12.t41, i12.t36, i12.t31, i12.t26, i12.t21, i12.u72.t17, i12.u73.t53, i12.u73.t56, i12.u74.t49, i12.u74.t51, i12.u75.t44, i12.u75.t47, i12.u76.t39, i12.u76.t42, i12.u77.t34, i12.u77.t37, i12.u78.t29, i12.u78.t32, i12.u79.t24, i12.u79.t27, i12.u80.t19, i12.u80.t22, i12.u81.t16, i14.t10, i14.t7, i14.t4, i14.u85.t8, i14.u85.t11, i14.u85.t12, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/191/111/302
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2021-05-15 21:20:58] [INFO ] Applying decomposition
[2021-05-15 21:20:59] [INFO ] Flatten gal took : 13 ms
[2021-05-15 21:20:59] [INFO ] Decomposing Gal with order
[2021-05-15 21:20:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 21:20:59] [INFO ] Removed a total of 21 redundant transitions.
[2021-05-15 21:20:59] [INFO ] Flatten gal took : 20 ms
[2021-05-15 21:20:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 63 labels/synchronizations in 6 ms.
[2021-05-15 21:20:59] [INFO ] Time to serialize gal into /tmp/CTLFireability16531152950007495252.gal : 4 ms
[2021-05-15 21:20:59] [INFO ] Time to serialize properties into /tmp/CTLFireability14365551388280766597.ctl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability16531152950007495252.gal, -t, CGAL, -ctl, /tmp/CTLFireability14365551388280766597.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability16531152950007495252.gal -t CGAL -ctl /tmp/CTLFireability14365551388280766597.ctl
No direction supplied, using forward translation only.
Parsed 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.60613e+08,195.617,3397356,12370,35408,2.46742e+06,2.96319e+06,411,9.96351e+06,450,3.51835e+07,0
Converting to forward existential form...Done !
original formula: EX(!(EG(((EX((((((i1.u10.p259==1)||(i0.u7.p186==1))||(((i0.i0.i0.u5.p104==1)&&(i0.u7.p169==1))&&(i1.u9.p244==1)))||((i0.u7.p191==1)&&(i1.u10.p264==1)))||(i1.u9.p220==1))) * (((((i0.u7.p194==1)||(i0.i0.i0.u5.p99==1))||(i0.i0.i0.u4.p7==1))||((i0.i0.i0.u5.p89==1)&&(i1.u9.p253==1)))||(i0.i0.i0.u4.p27==1))) + (((((i0.u7.p177==0)&&(i0.u7.p183==0))&&(i0.u7.p197==0))&&(((i0.i0.i0.u5.p104==0)||(i0.u7.p169==0))||(i1.u9.p244==0)))&&(i0.i0.i0.u4.p47==0))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(((EX((((((i1.u10.p259==1)||(i0.u7.p186==1))||(((i0.i0.i0.u5.p104==1)&&(i0.u7.p169==1))&&(i1.u9.p244==1)))||((i0.u7.p191==1)&&(i1.u10.p264==1)))||(i1.u9.p220==1))) * (((((i0.u7.p194==1)||(i0.i0.i0.u5.p99==1))||(i0.i0.i0.u4.p7==1))||((i0.i0.i0.u5.p89==1)&&(i1.u9.p253==1)))||(i0.i0.i0.u4.p27==1))) + (((((i0.u7.p177==0)&&(i0.u7.p183==0))&&(i0.u7.p197==0))&&(((i0.i0.i0.u5.p104==0)||(i0.u7.p169==0))||(i1.u9.p244==0)))&&(i0.i0.i0.u4.p47==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.u7.t64, i0.u7.t70, i0.u7.t74, i0.u7.t76, i0.u7.t77, i0.u7.t79, i0.u7.t81, i0.u7.t83, i0.u7.t85, i0.u7.t89, i0.u7.t91, i0.u7.t93, i0.u7.t95, i0.u7.t97, i0.u7.t99, i0.i0.u6.t105, i0.i0.u6.t109, i0.i0.u6.t111, i0.i0.u6.t113, i0.i0.u6.t117, i0.i0.u6.t119, i0.i0.u6.t120, i0.i0.u6.t122, i0.i0.u6.t124, i0.i0.u6.t126, i0.i0.u6.t128, i0.i0.u6.t132, i0.i0.u6.t134, i0.i0.u6.t136, i0.i0.u6.t138, i0.i0.u6.t141, i0.i0.u6.t143, i0.i0.u6.t145, i0.i0.u6.t147, i0.i0.u6.t149, i0.i0.i0.u4.t201, i0.i0.i0.u4.t205, i0.i0.i0.u4.t207, i0.i0.i0.u4.t209, i0.i0.i0.u4.t213, i0.i0.i0.u4.t215, i0.i0.i0.u4.t216, i0.i0.i0.u4.t218, i0.i0.i0.u4.t220, i0.i0.i0.u4.t222, i0.i0.i0.u4.t224, i0.i0.i0.u4.t228, i0.i0.i0.u4.t230, i0.i0.i0.u4.t232, i0.i0.i0.u4.t234, i0.i0.i0.u4.t237, i0.i0.i0.u4.t239, i0.i0.i0.u4.t241, i0.i0.i0.u4.t243, i0.i0.i0.u4.t245, i0.i0.i0.u5.t154, i0.i0.i0.u5.t157, i0.i0.i0.u5.t159, i0.i0.i0.u5.t161, i0.i0.i0.u5.t165, i0.i0.i0.u5.t167, i0.i0.i0.u5.t168, i0.i0.i0.u5.t170, i0.i0.i0.u5.t172, i0.i0.i0.u5.t174, i0.i0.i0.u5.t176, i0.i0.i0.u5.t180, i0.i0.i0.u5.t182, i0.i0.i0.u5.t184, i0.i0.i0.u5.t189, i0.i0.i0.u5.t191, i0.i0.i0.u5.t193, i0.i0.i0.u5.t195, i0.i0.i0.u5.t197, i1.u9.t15, i1.u9.t16, i1.u9.t17, i1.u9.t19, i1.u9.t21, i1.u9.t22, i1.u9.t24, i1.u9.t26, i1.u9.t27, i1.u9.t29, i1.u9.t31, i1.u9.t32, i1.u9.t34, i1.u9.t36, i1.u9.t37, i1.u9.t39, i1.u9.t41, i1.u9.t42, i1.u9.t44, i1.u9.t46, i1.u9.t47, i1.u9.t49, i1.u9.t50, i1.u9.t51, i1.u9.t53, i1.u9.t54, i1.u9.t55, i1.u9.t56, i1.u9.t58, i1.u9.t60, i1.u9.t61, i1.u10.t4, i1.u10.t7, i1.u10.t8, i1.u10.t10, i1.u10.t11, i1.u10.t12, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/170/111/281
Detected timeout of ITS tools.
[2021-05-15 21:41:41] [INFO ] Flatten gal took : 228 ms
[2021-05-15 21:41:43] [INFO ] Input system was already deterministic with 302 transitions.
[2021-05-15 21:41:43] [INFO ] Transformed 265 places.
[2021-05-15 21:41:43] [INFO ] Transformed 302 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-15 21:41:43] [INFO ] Time to serialize gal into /tmp/CTLFireability7566383949256382841.gal : 9 ms
[2021-05-15 21:41:43] [INFO ] Time to serialize properties into /tmp/CTLFireability6232412704500915984.ctl : 13 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability7566383949256382841.gal, -t, CGAL, -ctl, /tmp/CTLFireability6232412704500915984.ctl, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability7566383949256382841.gal -t CGAL -ctl /tmp/CTLFireability6232412704500915984.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.60613e+08,692.3,9350788,2,689369,5,2.58017e+07,6,0,1364,5.90528e+07,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
BK_STOP 1621116146791
--------------------
content from stderr:
+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="FlexibleBarrier-PT-04b"
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 FlexibleBarrier-PT-04b, 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 r102-smll-162075331000010"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-04b.tgz
mv FlexibleBarrier-PT-04b 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 ;