fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r178-tajo-162089416000594
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for RefineWMG-PT-005005

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
874.319 67600.00 74821.00 45.20 TFFFFFTTFTFTTFTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089416000594.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is RefineWMG-PT-005005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089416000594
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 10:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 10:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 14:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 25 14:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 14K 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 RefineWMG-PT-005005-CTLFireability-00
FORMULA_NAME RefineWMG-PT-005005-CTLFireability-01
FORMULA_NAME RefineWMG-PT-005005-CTLFireability-02
FORMULA_NAME RefineWMG-PT-005005-CTLFireability-03
FORMULA_NAME RefineWMG-PT-005005-CTLFireability-04
FORMULA_NAME RefineWMG-PT-005005-CTLFireability-05
FORMULA_NAME RefineWMG-PT-005005-CTLFireability-06
FORMULA_NAME RefineWMG-PT-005005-CTLFireability-07
FORMULA_NAME RefineWMG-PT-005005-CTLFireability-08
FORMULA_NAME RefineWMG-PT-005005-CTLFireability-09
FORMULA_NAME RefineWMG-PT-005005-CTLFireability-10
FORMULA_NAME RefineWMG-PT-005005-CTLFireability-11
FORMULA_NAME RefineWMG-PT-005005-CTLFireability-12
FORMULA_NAME RefineWMG-PT-005005-CTLFireability-13
FORMULA_NAME RefineWMG-PT-005005-CTLFireability-14
FORMULA_NAME RefineWMG-PT-005005-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1621261484374

Running Version 0
[2021-05-17 14:24:46] [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-17 14:24:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 14:24:46] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2021-05-17 14:24:46] [INFO ] Transformed 29 places.
[2021-05-17 14:24:46] [INFO ] Transformed 23 transitions.
[2021-05-17 14:24:46] [INFO ] Parsed PT model containing 29 places and 23 transitions in 60 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 29 out of 29 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 8 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:24:46] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-17 14:24:46] [INFO ] Dead Transitions using invariants and state equation in 126 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:24:46] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 14:24:46] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:24:46] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-17 14:24:46] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:24:46] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-17 14:24:46] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 23/23 transitions.
[2021-05-17 14:24:46] [INFO ] Flatten gal took : 25 ms
[2021-05-17 14:24:46] [INFO ] Flatten gal took : 9 ms
[2021-05-17 14:24:46] [INFO ] Input system was already deterministic with 23 transitions.
Incomplete random walk after 100002 steps, including 2 resets, run finished after 245 ms. (steps per millisecond=408 ) properties (out of 88) seen :65
Running SMT prover for 23 properties.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:24:46] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-17 14:24:47] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2021-05-17 14:24:47] [INFO ] SMT Verify possible in real domain returnedunsat :4 sat :0 real:19
[2021-05-17 14:24:47] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2021-05-17 14:24:47] [INFO ] SMT Verify possible in nat domain returned unsat :19 sat :4
Successfully simplified 23 atomic propositions for a total of 16 simplifications.
[2021-05-17 14:24:47] [INFO ] Initial state test concluded for 1 properties.
FORMULA RefineWMG-PT-005005-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Graph (trivial) has 15 edges and 29 vertex of which 10 / 29 are part of one of the 5 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 19 transition count 14
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 15 rules applied. Total rules applied 20 place count 9 transition count 9
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 24 place count 9 transition count 5
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 28 place count 5 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 4 transition count 4
Applied a total of 30 rules in 15 ms. Remains 4 /29 variables (removed 25) and now considering 4/23 (removed 19) transitions.
[2021-05-17 14:24:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-17 14:24:47] [INFO ] Flatten gal took : 1 ms
FORMULA RefineWMG-PT-005005-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 14:24:47] [INFO ] Flatten gal took : 0 ms
[2021-05-17 14:24:47] [INFO ] Input system was already deterministic with 4 transitions.
Graph (trivial) has 9 edges and 29 vertex of which 6 / 29 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 23 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 9 rules applied. Total rules applied 12 place count 17 transition count 15
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 1 rules applied. Total rules applied 13 place count 17 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 16 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 14 place count 16 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 15 transition count 13
Applied a total of 16 rules in 10 ms. Remains 15 /29 variables (removed 14) and now considering 13/23 (removed 10) transitions.
[2021-05-17 14:24:47] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:24:47] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:24:47] [INFO ] Input system was already deterministic with 13 transitions.
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
FORMULA RefineWMG-PT-005005-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2021-05-17 14:24:47] [INFO ] Flatten gal took : 4 ms
[2021-05-17 14:24:47] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA RefineWMG-PT-005005-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-005005-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 14:24:47] [INFO ] Flatten gal took : 3 ms
[2021-05-17 14:24:47] [INFO ] Applying decomposition
[2021-05-17 14:24:47] [INFO ] Flatten gal took : 3 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/graph13811081937536221087.txt, -o, /tmp/graph13811081937536221087.bin, -w, /tmp/graph13811081937536221087.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/graph13811081937536221087.bin, -l, -1, -v, -w, /tmp/graph13811081937536221087.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 14:24:47] [INFO ] Decomposing Gal with order
[2021-05-17 14:24:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 14:24:47] [INFO ] Flatten gal took : 23 ms
[2021-05-17 14:24:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 14:24:47] [INFO ] Time to serialize gal into /tmp/CTLFireability185899141625643219.gal : 2 ms
[2021-05-17 14:24:47] [INFO ] Time to serialize properties into /tmp/CTLFireability9285242546092675501.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/CTLFireability185899141625643219.gal, -t, CGAL, -ctl, /tmp/CTLFireability9285242546092675501.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/CTLFireability185899141625643219.gal -t CGAL -ctl /tmp/CTLFireability9285242546092675501.ctl
No direction supplied, using forward translation only.
Parsed 11 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.2256e+11,0.592143,24512,92,25,25653,3175,78,94215,39,28795,0


Converting to forward existential form...Done !
original formula: (EX((((((i3.u5.p8>=1)&&(i3.u6.p9>=1))&&(i3.u4.p11>=1)) + EF(AG(((((i0.u0.p1>=5)||(((i3.u5.p8>=1)&&(i3.u6.p9>=1))&&(i3.u4.p11>=1)))||(((u2.p3>=1)&&(u3.p4>=1))&&(i3.u4.p6>=1)))||(u13.p24>=1))))) + (EX((((((((i3.u6.p10>=1)||(i0.u0.p1>=5))||(u8.p14>=1))||(u2.p2>=1))||(u3.p4>=1))||(u12.p22>=1))||(i3.u6.p10>=1))) * (((i0.u0.p1>=5)||(((u7.p13>=1)&&(u8.p14>=1))&&(i7.u9.p16>=1)))||(u7.p12>=1))))) + !(EF(EX(AX((((((((i0.u0.pprime<2)||(i0.u1.psecond<2))&&(u2.p2<1))&&(((u2.p3<1)||(u3.p4<1))||(i3.u4.p6<1)))&&(u13.p24<1))&&(((u7.p13<1)||(u8.p14<1))||(i7.u9.p16<1)))&&(u7.p12<1)))))))
=> equivalent forward existential formula: [(EY(FwdU((Init * !(EX((((((i3.u5.p8>=1)&&(i3.u6.p9>=1))&&(i3.u4.p11>=1)) + E(TRUE U !(E(TRUE U !(((((i0.u0.p1>=5)||(((i3.u5.p8>=1)&&(i3.u6.p9>=1))&&(i3.u4.p11>=1)))||(((u2.p3>=1)&&(u3.p4>=1))&&(i3.u4.p6>=1)))||(u13.p24>=1))))))) + (EX((((((((i3.u6.p10>=1)||(i0.u0.p1>=5))||(u8.p14>=1))||(u2.p2>=1))||(u3.p4>=1))||(u12.p22>=1))||(i3.u6.p10>=1))) * (((i0.u0.p1>=5)||(((u7.p13>=1)&&(u8.p14>=1))&&(i7.u9.p16>=1)))||(u7.p12>=1))))))),TRUE)) * !(EX(!((((((((i0.u0.pprime<2)||(i0.u1.psecond<2))&&(u2.p2<1))&&(((u2.p3<1)||(u3.p4<1))||(i3.u4.p6<1)))&&(u13.p24<1))&&(((u7.p13<1)||(u8.p14<1))||(i7.u9.p16<1)))&&(u7.p12<1))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.602804,24952,1,0,25653,3175,215,94215,160,28795,1725
FORMULA RefineWMG-PT-005005-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A((AX((AG((((i7.u11.p20>=1)||(u3.p5>=1))||(((i7.u10.p18>=1)&&(i7.u11.p19>=1))&&(i7.u9.p21>=1)))) + !(EG(((u3.p4>=1)||(i3.u6.p10>=1)))))) * AX(EG(AG(((((((((((i0.u0.p1>=5)||(((i0.u0.p>=1)&&(u12.p23>=1))&&(u13.p24>=1)))||(i0.u1.pterce>=3))||(u2.p2>=1))||(u12.p22>=1))||(i3.u5.p7>=1))||(((i7.u10.p18>=1)&&(i7.u11.p19>=1))&&(i7.u9.p21>=1)))||(u13.p25>=1))||(i3.u6.p9>=1))||(u7.p12>=1)))))) U AF(AG((((((i0.u0.p1>=5)||(u8.p14>=1))||(i7.u10.p17>=1))||(i7.u11.p20>=1))||(u13.p24>=1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(!(E(TRUE U !((((((i0.u0.p1>=5)||(u8.p14>=1))||(i7.u10.p17>=1))||(i7.u11.p20>=1))||(u13.p24>=1)))))))))))) * !(E(!(!(EG(!(!(E(TRUE U !((((((i0.u0.p1>=5)||(u8.p14>=1))||(i7.u10.p17>=1))||(i7.u11.p20>=1))||(u13.p24>=1))))))))) U (!((!(EX(!((!(E(TRUE U !((((i7.u11.p20>=1)||(u3.p5>=1))||(((i7.u10.p18>=1)&&(i7.u11.p19>=1))&&(i7.u9.p21>=1)))))) + !(EG(((u3.p4>=1)||(i3.u6.p10>=1)))))))) * !(EX(!(EG(!(E(TRUE U !(((((((((((i0.u0.p1>=5)||(((i0.u0.p>=1)&&(u12.p23>=1))&&(u13.p24>=1)))||(i0.u1.pterce>=3))||(u2.p2>=1))||(u12.p22>=1))||(i3.u5.p7>=1))||(((i7.u10.p18>=1)&&(i7.u11.p19>=1))&&(i7.u9.p21>=1)))||(u13.p25>=1))||(i3.u6.p9>=1))||(u7.p12>=1))))))))))) * !(!(EG(!(!(E(TRUE U !((((((i0.u0.p1>=5)||(u8.p14>=1))||(i7.u10.p17>=1))||(i7.u11.p20>=1))||(u13.p24>=1)))))))))))))] != FALSE
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 an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 1,0,0.615077,24952,1,0,25653,3175,420,94215,171,28795,4037
FORMULA RefineWMG-PT-005005-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(AG((!(AG(EX(TRUE))) * AG(((((((((((i0.u0.p1>=5)||(((i3.u5.p8>=1)&&(i3.u6.p9>=1))&&(i3.u4.p11>=1)))||(u8.p15>=1))||(i7.u10.p17>=1))||(u2.p2>=1))||(((u2.p3>=1)&&(u3.p4>=1))&&(i3.u4.p6>=1)))||(u12.p22>=1))||(i3.u5.p7>=1))||(u13.p24>=1))||(i3.u6.p9>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((!(!(E(TRUE U !(EX(TRUE))))) * !(E(TRUE U !(((((((((((i0.u0.p1>=5)||(((i3.u5.p8>=1)&&(i3.u6.p9>=1))&&(i3.u4.p11>=1)))||(u8.p15>=1))||(i7.u10.p17>=1))||(u2.p2>=1))||(((u2.p3>=1)&&(u3.p4>=1))&&(i3.u4.p6>=1)))||(u12.p22>=1))||(i3.u5.p7>=1))||(u13.p24>=1))||(i3.u6.p9>=1))))))))))] != FALSE
(forward)formula 2,0,0.617288,24952,1,0,25653,3175,458,94215,171,28795,4276
FORMULA RefineWMG-PT-005005-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(AX(A((!(E((((((((((i0.u1.pterce>=3)||(u8.p15>=1))||(i7.u10.p17>=1))||(u2.p2>=1))||(((u2.p3>=1)&&(u3.p4>=1))&&(i3.u4.p6>=1)))||(u3.p5>=1))||(u12.p22>=1))||(i3.u5.p7>=1))||(i3.u6.p10>=1)) U ((u8.p15>=1)||(((u2.p3>=1)&&(u3.p4>=1))&&(i3.u4.p6>=1))))) * EG((((i0.u0.p1>=5)||(u8.p15>=1))||(u3.p5>=1)))) U AX((((i0.u1.pterce<3)&&(i3.u6.p9<1))&&(((i0.u0.p<1)||(u12.p23<1))||(u13.p24<1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!((E(!(!(EX(!((((i0.u1.pterce<3)&&(i3.u6.p9<1))&&(((i0.u0.p<1)||(u12.p23<1))||(u13.p24<1))))))) U (!((!(E((((((((((i0.u1.pterce>=3)||(u8.p15>=1))||(i7.u10.p17>=1))||(u2.p2>=1))||(((u2.p3>=1)&&(u3.p4>=1))&&(i3.u4.p6>=1)))||(u3.p5>=1))||(u12.p22>=1))||(i3.u5.p7>=1))||(i3.u6.p10>=1)) U ((u8.p15>=1)||(((u2.p3>=1)&&(u3.p4>=1))&&(i3.u4.p6>=1))))) * EG((((i0.u0.p1>=5)||(u8.p15>=1))||(u3.p5>=1))))) * !(!(EX(!((((i0.u1.pterce<3)&&(i3.u6.p9<1))&&(((i0.u0.p<1)||(u12.p23<1))||(u13.p24<1))))))))) + EG(!(!(EX(!((((i0.u1.pterce<3)&&(i3.u6.p9<1))&&(((i0.u0.p<1)||(u12.p23<1))||(u13.p24<1))))))))))))))] != FALSE
(forward)formula 3,0,0.63222,24952,1,0,25653,3175,521,94215,173,28795,6899
FORMULA RefineWMG-PT-005005-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AG(((((((u7.p13>=1)&&(u8.p14>=1))&&(i7.u9.p16>=1))||((i0.u0.pprime>=2)&&(i0.u1.psecond>=2)))||(u3.p4>=1))||(u7.p12>=1))) * AF(((AF((u13.p24>=1)) + A(EX(TRUE) U ((((((i0.u0.pprime<2)||(i0.u1.psecond<2))&&(i7.u10.p17<1))&&(u3.p4<1))&&(u13.p25<1))&&(i3.u6.p10<1)))) * EX(AG((((((((((i0.u0.p>=1)&&(u12.p23>=1))&&(u13.p24>=1))||((i0.u0.pprime>=2)&&(i0.u1.psecond>=2)))||(i7.u11.p20>=1))||(u12.p22>=1))||(i3.u5.p7>=1))||(u13.p25>=1))||(i3.u6.p10>=1)))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(((((((u7.p13>=1)&&(u8.p14>=1))&&(i7.u9.p16>=1))||((i0.u0.pprime>=2)&&(i0.u1.psecond>=2)))||(u3.p4>=1))||(u7.p12>=1))))] = FALSE * [FwdG(Init,!(((!(EG(!((u13.p24>=1)))) + !((E(!(((((((i0.u0.pprime<2)||(i0.u1.psecond<2))&&(i7.u10.p17<1))&&(u3.p4<1))&&(u13.p25<1))&&(i3.u6.p10<1))) U (!(EX(TRUE)) * !(((((((i0.u0.pprime<2)||(i0.u1.psecond<2))&&(i7.u10.p17<1))&&(u3.p4<1))&&(u13.p25<1))&&(i3.u6.p10<1))))) + EG(!(((((((i0.u0.pprime<2)||(i0.u1.psecond<2))&&(i7.u10.p17<1))&&(u3.p4<1))&&(u13.p25<1))&&(i3.u6.p10<1))))))) * EX(!(E(TRUE U !((((((((((i0.u0.p>=1)&&(u12.p23>=1))&&(u13.p24>=1))||((i0.u0.pprime>=2)&&(i0.u1.psecond>=2)))||(i7.u11.p20>=1))||(u12.p22>=1))||(i3.u5.p7>=1))||(u13.p25>=1))||(i3.u6.p10>=1)))))))))] = FALSE)
(forward)formula 4,0,1.18565,28648,1,0,32049,4176,609,117028,178,35868,45181
FORMULA RefineWMG-PT-005005-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(A(EX((AX((((u13.p24>=1)||(((i7.u10.p18>=1)&&(i7.u11.p19>=1))&&(i7.u9.p21>=1)))||(i3.u6.p10>=1))) * EX(TRUE))) U EG(EF(((u3.p4<1)&&(u13.p24<1))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(EG(E(TRUE U ((u3.p4<1)&&(u13.p24<1))))) U (!(EX((!(EX(!((((u13.p24>=1)||(((i7.u10.p18>=1)&&(i7.u11.p19>=1))&&(i7.u9.p21>=1)))||(i3.u6.p10>=1))))) * EX(TRUE)))) * !(EG(E(TRUE U ((u3.p4<1)&&(u13.p24<1))))))) + EG(!(EG(E(TRUE U ((u3.p4<1)&&(u13.p24<1)))))))))] != FALSE
(forward)formula 5,1,1.18736,28912,1,0,32084,4176,614,117028,178,35868,45289
FORMULA RefineWMG-PT-005005-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX((AG(((((((((((i0.u0.p1>=5)||(i0.u1.pterce>=3))||(u8.p15>=1))||(i7.u11.p20>=1))||(u3.p5>=1))||(u12.p22>=1))||(u13.p24>=1))||(i3.u6.p9>=1))||(((i7.u10.p18>=1)&&(i7.u11.p19>=1))&&(i7.u9.p21>=1)))||(u7.p12>=1))) * AF((((((((((i0.u0.p1>=5)||(((i0.u0.p>=1)&&(u12.p23>=1))&&(u13.p24>=1)))||(u8.p14>=1))||(((i3.u5.p8>=1)&&(i3.u6.p9>=1))&&(i3.u4.p11>=1)))||(i0.u1.pterce>=3))||((i0.u0.pprime>=2)&&(i0.u1.psecond>=2)))||(u3.p4>=1))||(u12.p22>=1))||(u13.p24>=1)))))
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * !(((((((((((i0.u0.p1>=5)||(i0.u1.pterce>=3))||(u8.p15>=1))||(i7.u11.p20>=1))||(u3.p5>=1))||(u12.p22>=1))||(u13.p24>=1))||(i3.u6.p9>=1))||(((i7.u10.p18>=1)&&(i7.u11.p19>=1))&&(i7.u9.p21>=1)))||(u7.p12>=1))))] = FALSE * [FwdG(EY(Init),!((((((((((i0.u0.p1>=5)||(((i0.u0.p>=1)&&(u12.p23>=1))&&(u13.p24>=1)))||(u8.p14>=1))||(((i3.u5.p8>=1)&&(i3.u6.p9>=1))&&(i3.u4.p11>=1)))||(i0.u1.pterce>=3))||((i0.u0.pprime>=2)&&(i0.u1.psecond>=2)))||(u3.p4>=1))||(u12.p22>=1))||(u13.p24>=1))))] = FALSE)
(forward)formula 6,0,1.19235,29440,1,0,32383,4189,656,117645,178,35900,45563
FORMULA RefineWMG-PT-005005-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E((((((((i0.u0.p1>=5)||(u8.p15>=1))||(i7.u11.p20>=1))||(u3.p4>=1))||(u13.p24>=1))||(i3.u6.p10>=1))||(((u7.p13>=1)&&(u8.p14>=1))&&(i7.u9.p16>=1))) U AG((((((((((EX((EF(((((((((i0.u0.p1>=5)||(((i0.u0.p>=1)&&(u12.p23>=1))&&(u13.p24>=1)))||(((i3.u5.p8>=1)&&(i3.u6.p9>=1))&&(i3.u4.p11>=1)))||(i0.u1.pterce>=3))||(i7.u10.p17>=1))||(u3.p5>=1))||(u12.p22>=1))||(((u7.p13>=1)&&(u8.p14>=1))&&(i7.u9.p16>=1)))) * EG((((u8.p14>=1)||(i3.u5.p7>=1))||(i3.u6.p9>=1))))) + (i0.u0.p1>=5)) + (u8.p15>=1)) + (i7.u10.p17>=1)) + (i7.u11.p20>=1)) + (u12.p22>=1)) + (i3.u5.p7>=1)) + (i3.u6.p10>=1)) + ((i0.u0.pprime>=2)&&(i0.u1.psecond>=2))) + (((u2.p3>=1)&&(u3.p4>=1))&&(i3.u4.p6>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,(((((((i0.u0.p1>=5)||(u8.p15>=1))||(i7.u11.p20>=1))||(u3.p4>=1))||(u13.p24>=1))||(i3.u6.p10>=1))||(((u7.p13>=1)&&(u8.p14>=1))&&(i7.u9.p16>=1)))) * !(E(TRUE U !((((((((((EX((E(TRUE U ((((((((i0.u0.p1>=5)||(((i0.u0.p>=1)&&(u12.p23>=1))&&(u13.p24>=1)))||(((i3.u5.p8>=1)&&(i3.u6.p9>=1))&&(i3.u4.p11>=1)))||(i0.u1.pterce>=3))||(i7.u10.p17>=1))||(u3.p5>=1))||(u12.p22>=1))||(((u7.p13>=1)&&(u8.p14>=1))&&(i7.u9.p16>=1)))) * EG((((u8.p14>=1)||(i3.u5.p7>=1))||(i3.u6.p9>=1))))) + (i0.u0.p1>=5)) + (u8.p15>=1)) + (i7.u10.p17>=1)) + (i7.u11.p20>=1)) + (u12.p22>=1)) + (i3.u5.p7>=1)) + (i3.u6.p10>=1)) + ((i0.u0.pprime>=2)&&(i0.u1.psecond>=2))) + (((u2.p3>=1)&&(u3.p4>=1))&&(i3.u4.p6>=1)))))))] != FALSE
(forward)formula 7,1,63.9324,659856,1,0,849054,5886,713,3.20874e+06,178,91190,508086
FORMULA RefineWMG-PT-005005-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EF((EF(((((u8.p14<1)&&(i0.u1.pterce<3))&&(u2.p2<1))&&(i3.u6.p9<1))) * AF(((((u2.p2>=1)||(i7.u11.p19>=1))||(u12.p22>=1))||(u13.p25>=1))))) * AF(E(E((((((((((((i0.u0.p1<5)&&(((i0.u0.p<1)||(u12.p23<1))||(u13.p24<1)))&&(i0.u1.pterce<3))&&(u8.p15<1))&&((i0.u0.pprime<2)||(i0.u1.psecond<2)))&&(i7.u10.p17<1))&&(i7.u11.p19<1))&&(u13.p25<1))&&(((i7.u10.p18<1)||(i7.u11.p19<1))||(i7.u9.p21<1)))&&(i3.u6.p9<1))||(((((((i0.u0.pprime>=2)&&(i0.u1.psecond>=2))||(u2.p2>=1))||(i7.u11.p19>=1))||(i3.u6.p10>=1))||(u7.p12>=1))&&(((((((i0.u0.p1>=5)||(((i0.u0.p>=1)&&(u12.p23>=1))&&(u13.p24>=1)))||(i0.u1.pterce>=3))||(u2.p2>=1))||(i7.u11.p19>=1))||(((i7.u10.p18>=1)&&(i7.u11.p19>=1))&&(i7.u9.p21>=1)))||(i3.u6.p10>=1)))) U ((((((((((i0.u0.p1>=5)||(((i3.u5.p8>=1)&&(i3.u6.p9>=1))&&(i3.u4.p11>=1)))||(i0.u1.pterce>=3))||((i0.u0.pprime>=2)&&(i0.u1.psecond>=2)))||(u2.p2>=1))||(u3.p4>=1))||(((u2.p3>=1)&&(u3.p4>=1))&&(i3.u4.p6>=1)))||(u12.p22>=1))||(i3.u5.p7>=1))||(u13.p24>=1))) U ((((((EX(((((((((i0.u0.p1>=5)||(((i3.u5.p8>=1)&&(i3.u6.p9>=1))&&(i3.u4.p11>=1)))||(u8.p15>=1))||((i0.u0.pprime>=2)&&(i0.u1.psecond>=2)))||(u2.p2>=1))||(i7.u11.p20>=1))||(u3.p5>=1))||(u13.p25>=1))) * (i0.u0.p1<5)) * (((i3.u5.p8<1)||(i3.u6.p9<1))||(i3.u4.p11<1))) * (u3.p5<1)) * (u13.p25<1)) * (i3.u6.p10<1)) + AF(AX((((((u8.p15>=1)||((i0.u0.pprime>=2)&&(i0.u1.psecond>=2)))||(u3.p5>=1))||(((i7.u10.p18>=1)&&(i7.u11.p19>=1))&&(i7.u9.p21>=1)))||(u7.p12>=1))))))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (E(TRUE U ((((u8.p14<1)&&(i0.u1.pterce<3))&&(u2.p2<1))&&(i3.u6.p9<1))) * !(EG(!(((((u2.p2>=1)||(i7.u11.p19>=1))||(u12.p22>=1))||(u13.p25>=1)))))))))] = FALSE * [FwdG(Init,!(E(E((((((((((((i0.u0.p1<5)&&(((i0.u0.p<1)||(u12.p23<1))||(u13.p24<1)))&&(i0.u1.pterce<3))&&(u8.p15<1))&&((i0.u0.pprime<2)||(i0.u1.psecond<2)))&&(i7.u10.p17<1))&&(i7.u11.p19<1))&&(u13.p25<1))&&(((i7.u10.p18<1)||(i7.u11.p19<1))||(i7.u9.p21<1)))&&(i3.u6.p9<1))||(((((((i0.u0.pprime>=2)&&(i0.u1.psecond>=2))||(u2.p2>=1))||(i7.u11.p19>=1))||(i3.u6.p10>=1))||(u7.p12>=1))&&(((((((i0.u0.p1>=5)||(((i0.u0.p>=1)&&(u12.p23>=1))&&(u13.p24>=1)))||(i0.u1.pterce>=3))||(u2.p2>=1))||(i7.u11.p19>=1))||(((i7.u10.p18>=1)&&(i7.u11.p19>=1))&&(i7.u9.p21>=1)))||(i3.u6.p10>=1)))) U ((((((((((i0.u0.p1>=5)||(((i3.u5.p8>=1)&&(i3.u6.p9>=1))&&(i3.u4.p11>=1)))||(i0.u1.pterce>=3))||((i0.u0.pprime>=2)&&(i0.u1.psecond>=2)))||(u2.p2>=1))||(u3.p4>=1))||(((u2.p3>=1)&&(u3.p4>=1))&&(i3.u4.p6>=1)))||(u12.p22>=1))||(i3.u5.p7>=1))||(u13.p24>=1))) U ((((((EX(((((((((i0.u0.p1>=5)||(((i3.u5.p8>=1)&&(i3.u6.p9>=1))&&(i3.u4.p11>=1)))||(u8.p15>=1))||((i0.u0.pprime>=2)&&(i0.u1.psecond>=2)))||(u2.p2>=1))||(i7.u11.p20>=1))||(u3.p5>=1))||(u13.p25>=1))) * (i0.u0.p1<5)) * (((i3.u5.p8<1)||(i3.u6.p9<1))||(i3.u4.p11<1))) * (u3.p5<1)) * (u13.p25<1)) * (i3.u6.p10<1)) + !(EG(!(!(EX(!((((((u8.p15>=1)||((i0.u0.pprime>=2)&&(i0.u1.psecond>=2)))||(u3.p5>=1))||(((i7.u10.p18>=1)&&(i7.u11.p19>=1))&&(i7.u9.p21>=1)))||(u7.p12>=1))))))))))))] = FALSE)
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local 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 8
(forward)formula 8,1,64.1414,663552,1,0,854618,6102,886,3.23082e+06,182,94085,513741
FORMULA RefineWMG-PT-005005-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF((!(EF(!(EX((((((u8.p15>=1)||((i0.u0.pprime>=2)&&(i0.u1.psecond>=2)))||(i7.u11.p19>=1))||(u13.p25>=1))||(i3.u6.p10>=1)))))) + (!(EX(TRUE)) * !((((((((u8.p15>=1)||(u3.p5>=1))||(u12.p22>=1))||(i3.u5.p7>=1))||(u7.p12>=1))||(u2.p2>=1)) * E(((((((((((i3.u5.p8>=1)&&(i3.u6.p9>=1))&&(i3.u4.p11>=1))||((i0.u0.pprime>=2)&&(i0.u1.psecond>=2)))||(i7.u10.p17>=1))||(i7.u11.p19>=1))||(u3.p5>=1))||(u13.p24>=1))||(i3.u6.p9>=1))||(((u7.p13>=1)&&(u8.p14>=1))&&(i7.u9.p16>=1))) U (((((((((((i0.u0.p>=1)&&(u12.p23>=1))&&(u13.p24>=1))||(i0.u0.p1>=5))||(((i3.u5.p8>=1)&&(i3.u6.p9>=1))&&(i3.u4.p11>=1)))||((i0.u0.pprime>=2)&&(i0.u1.psecond>=2)))||(u8.p15>=1))||(u2.p2>=1))||(((u2.p3>=1)&&(u3.p4>=1))&&(i3.u4.p6>=1)))||(u12.p22>=1))||(((u7.p13>=1)&&(u8.p14>=1))&&(i7.u9.p16>=1)))))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(EX((((((u8.p15>=1)||((i0.u0.pprime>=2)&&(i0.u1.psecond>=2)))||(i7.u11.p19>=1))||(u13.p25>=1))||(i3.u6.p10>=1)))))) + (!(EX(TRUE)) * !((((((((u8.p15>=1)||(u3.p5>=1))||(u12.p22>=1))||(i3.u5.p7>=1))||(u7.p12>=1))||(u2.p2>=1)) * E(((((((((((i3.u5.p8>=1)&&(i3.u6.p9>=1))&&(i3.u4.p11>=1))||((i0.u0.pprime>=2)&&(i0.u1.psecond>=2)))||(i7.u10.p17>=1))||(i7.u11.p19>=1))||(u3.p5>=1))||(u13.p24>=1))||(i3.u6.p9>=1))||(((u7.p13>=1)&&(u8.p14>=1))&&(i7.u9.p16>=1))) U (((((((((((i0.u0.p>=1)&&(u12.p23>=1))&&(u13.p24>=1))||(i0.u0.p1>=5))||(((i3.u5.p8>=1)&&(i3.u6.p9>=1))&&(i3.u4.p11>=1)))||((i0.u0.pprime>=2)&&(i0.u1.psecond>=2)))||(u8.p15>=1))||(u2.p2>=1))||(((u2.p3>=1)&&(u3.p4>=1))&&(i3.u4.p6>=1)))||(u12.p22>=1))||(((u7.p13>=1)&&(u8.p14>=1))&&(i7.u9.p16>=1))))))))))] = FALSE
(forward)formula 9,1,64.1893,664344,1,0,856404,6132,939,3.23681e+06,182,94484,516234
FORMULA RefineWMG-PT-005005-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(((((!(EF(((((((((((u8.p14>=1)||(i7.u10.p17>=1))||(u2.p2>=1))||(i7.u11.p20>=1))||(i3.u5.p7>=1))||(u13.p25>=1))||(((i7.u10.p18>=1)&&(i7.u11.p19>=1))&&(i7.u9.p21>=1)))||(i3.u6.p10>=1))||(((u7.p13>=1)&&(u8.p14>=1))&&(i7.u9.p16>=1)))||(u7.p12>=1)))) + !(AX((((((i0.u0.p>=1)&&(u12.p23>=1))&&(u13.p24>=1))||(u3.p5>=1))||(i3.u6.p10>=1))))) + AF(((((i0.u0.p1>=5)||(u2.p2>=1))||(u3.p5>=1))||(u13.p25>=1)))) + (((i3.u5.p8>=1)&&(i3.u6.p9>=1))&&(i3.u4.p11>=1))) + (((i7.u10.p18>=1)&&(i7.u11.p19>=1))&&(i7.u9.p21>=1))))
=> equivalent forward existential formula: [FwdG((((FwdU(Init,TRUE) * !((((i7.u10.p18>=1)&&(i7.u11.p19>=1))&&(i7.u9.p21>=1)))) * !((((i3.u5.p8>=1)&&(i3.u6.p9>=1))&&(i3.u4.p11>=1)))) * !((!(E(TRUE U ((((((((((u8.p14>=1)||(i7.u10.p17>=1))||(u2.p2>=1))||(i7.u11.p20>=1))||(i3.u5.p7>=1))||(u13.p25>=1))||(((i7.u10.p18>=1)&&(i7.u11.p19>=1))&&(i7.u9.p21>=1)))||(i3.u6.p10>=1))||(((u7.p13>=1)&&(u8.p14>=1))&&(i7.u9.p16>=1)))||(u7.p12>=1)))) + !(!(EX(!((((((i0.u0.p>=1)&&(u12.p23>=1))&&(u13.p24>=1))||(u3.p5>=1))||(i3.u6.p10>=1))))))))),!(((((i0.u0.p1>=5)||(u2.p2>=1))||(u3.p5>=1))||(u13.p25>=1))))] = FALSE
(forward)formula 10,0,64.2232,665136,1,0,858102,6244,985,3.24167e+06,182,95634,517833
FORMULA RefineWMG-PT-005005-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1621261551974

--------------------
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="RefineWMG-PT-005005"
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 RefineWMG-PT-005005, 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 r178-tajo-162089416000594"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-005005.tgz
mv RefineWMG-PT-005005 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;