Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r210-tajo-159033475700402.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 ShieldPPPs-PT-001B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033475700402
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 2.9K May 14 01:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 14 01:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 18:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 18:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.4K May 13 13:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 13:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 08:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 08:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 18K May 12 20:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1590589127638

[2020-05-27 14:18:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-27 14:18:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 14:18:49] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2020-05-27 14:18:49] [INFO ] Transformed 71 places.
[2020-05-27 14:18:49] [INFO ] Transformed 66 transitions.
[2020-05-27 14:18:49] [INFO ] Found NUPN structural information;
[2020-05-27 14:18:49] [INFO ] Parsed PT model containing 71 places and 66 transitions in 72 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 948 steps, including 3 resets, run visited all 39 properties in 11 ms. (steps per millisecond=86 )
[2020-05-27 14:18:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-27 14:18:49] [INFO ] Flatten gal took : 27 ms
FORMULA ShieldPPPs-PT-001B-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 14:18:49] [INFO ] Flatten gal took : 8 ms
Using solver Z3 to compute partial order matrices.
[2020-05-27 14:18:49] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-27 14:18:49] [INFO ] Flatten gal took : 9 ms
[2020-05-27 14:18:49] [INFO ] Input system was already deterministic with 66 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph5395693367948879109.txt, -o, /tmp/graph5395693367948879109.bin, -w, /tmp/graph5395693367948879109.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph5395693367948879109.bin, -l, -1, -v, -w, /tmp/graph5395693367948879109.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 14:18:49] [INFO ] Decomposing Gal with order
[2020-05-27 14:18:49] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 66 rows 71 cols
[2020-05-27 14:18:49] [INFO ] Removed a total of 9 redundant transitions.
[2020-05-27 14:18:49] [INFO ] Computed 12 place invariants in 11 ms
inv : p0 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p15 + p16 + p17 + p18 + p19 = 1
inv : p0 + p4 + p5 + p6 + p7 + p8 + p9 + p29 + p30 + p31 + p32 + p33 = 1
inv : p0 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p22 + p23 + p24 + p25 + p26 = 1
inv : p0 + p1 + p2 + p3 = 1
inv : p0 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p15 + p16 + p17 + p20 + p21 = 1
inv : p0 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 = 1
inv : p0 + p4 + p5 + p6 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 = 1
inv : p0 + p4 + p5 + p6 + p7 + p46 + p47 + p48 + p49 = 1
inv : p0 + p4 + p5 + p6 + p7 + p8 + p9 + p29 + p30 + p31 + p34 + p35 = 1
inv : p0 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p22 + p23 + p24 + p27 + p28 = 1
inv : p0 + p4 + p5 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 = 1
inv : p0 + p4 + p5 + p6 + p7 + p8 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 = 1
Total of 12 invariants.
[2020-05-27 14:18:49] [INFO ] Computed 12 place invariants in 13 ms
[2020-05-27 14:18:50] [INFO ] Flatten gal took : 52 ms
[2020-05-27 14:18:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-27 14:18:50] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2020-05-27 14:18:50] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 15 LTL properties
Checking formula 0 : !(((F("(i5.u15.p45==1)"))U((!(F(X("(u22.p63==1)"))))&&(G("(i5.u16.p44==1)")))))
Formula 0 simplified : !(F"(i5.u15.p45==1)" U (!FX"(u22.p63==1)" & G"(i5.u16.p44==1)"))
[2020-05-27 14:18:50] [INFO ] Proved 71 variables to be positive in 138 ms
[2020-05-27 14:18:50] [INFO ] Computing symmetric may disable matrix : 66 transitions.
[2020-05-27 14:18:50] [INFO ] Computation of disable matrix completed :0/66 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 14:18:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 14:18:50] [INFO ] Computing symmetric may enable matrix : 66 transitions.
[2020-05-27 14:18:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
built 19 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t36, t39, t42, u19.t7, u19.t8, u19.t9, u19.t10, u22.t11, u22.t12, u22.t13, u22.t14, i0.u0.t46, i1.i1.u5.t45, i1.i1.u18.t29, i1.i1.u18.t30, i2.u6.t44, i3.u9.t41, i4.u12.t38, i5.t33, i5.u16.t35, i5.u17.t3, i5.u17.t4, i5.u17.t5, i5.u17.t6, i7.t25, i7.u20.t27, i9.t19, i9.u23.t22, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/38/28/66
Computing Next relation with stutter on 3 deadlock states
[2020-05-27 14:18:51] [INFO ] Computing symmetric co enabling matrix : 66 transitions.
84 unique states visited
82 strongly connected components in search stack
84 transitions explored
82 items max in DFS search stack
123 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.25451,71284,1,0,131869,668,1038,148418,242,2632,242736
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPs-PT-001B-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(("(u22.p66!=1)")U((F(G("(i1.i0.u2.p7==1)")))&&((F("((i4.u13.p32==1)&&(u22.p65==1))"))||("(i2.u6.p16!=1)"))))))
Formula 1 simplified : !F("(u22.p66!=1)" U (FG"(i1.i0.u2.p7==1)" & ("(i2.u6.p16!=1)" | F"((i4.u13.p32==1)&&(u22.p65==1))")))
Computing Next relation with stutter on 3 deadlock states
[2020-05-27 14:18:52] [INFO ] Computation of Finished co-enabling matrix. took 1470 ms. Total solver calls (SAT/UNSAT): 708(9/699)
[2020-05-27 14:18:52] [INFO ] Computing Do-Not-Accords matrix : 66 transitions.
[2020-05-27 14:18:52] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 14:18:52] [INFO ] Built C files in 2763ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 1127 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 61 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(((LTLAP3==true))U(( <>([]((LTLAP4==true))) ) && ( ( <>((LTLAP5==true))) || ( (LTLAP6==true)) ))), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(((LTLAP3==true))U(( <>([]((LTLAP4==true))) ) && ( ( <>((LTLAP5==true))) || ( (LTLAP6==true)) ))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(((LTLAP3==true))U(( <>([]((LTLAP4==true))) ) && ( ( <>((LTLAP5==true))) || ( (LTLAP6==true)) ))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
469 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.94043,212964,1,0,469380,678,1075,468932,244,2704,806062
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldPPPs-PT-001B-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((G((G(F("(i1.i0.u2.p6==1)")))U(("(i5.u17.p39==1)")U("(i1.i0.u4.p11==1)"))))U(G((G("(i4.u12.p30==1)"))||("((i1.i1.u5.p12==1)&&(u22.p62==1))")))))
Formula 2 simplified : !(G(GF"(i1.i0.u2.p6==1)" U ("(i5.u17.p39==1)" U "(i1.i0.u4.p11==1)")) U G("((i1.i1.u5.p12==1)&&(u22.p62==1))" | G"(i4.u12.p30==1)"))
Computing Next relation with stutter on 3 deadlock states
81 unique states visited
81 strongly connected components in search stack
81 transitions explored
81 items max in DFS search stack
168 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.63403,266756,1,0,570988,689,1199,653636,245,2841,1065160
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldPPPs-PT-001B-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G((G(F("(i1.i1.u18.p47==1)")))U("((i1.i1.u18.p47==1)||((i4.u13.p32==1)&&(i9.u23.p68==1)))"))))
Formula 3 simplified : !G(GF"(i1.i1.u18.p47==1)" U "((i1.i1.u18.p47==1)||((i4.u13.p32==1)&&(i9.u23.p68==1)))")
Computing Next relation with stutter on 3 deadlock states
86 unique states visited
86 strongly connected components in search stack
87 transitions explored
86 items max in DFS search stack
387 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.514,387700,1,0,876543,691,1227,924978,246,2899,1524844
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ShieldPPPs-PT-001B-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((X((!(F("(i5.u16.p44==1)")))||("(i0.u1.p0!=1)")))&&(F("(i5.u16.p44==1)"))))
Formula 4 simplified : !(F"(i5.u16.p44==1)" & X("(i0.u1.p0!=1)" | !F"(i5.u16.p44==1)"))
Computing Next relation with stutter on 3 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.5162,387964,1,0,876543,691,1241,924978,246,2899,1524867
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA ShieldPPPs-PT-001B-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((!(G("(i7.u20.p58==1)")))&&(!(X("(i9.u24.p70==1)")))))
Formula 5 simplified : !(!G"(i7.u20.p58==1)" & !X"(i9.u24.p70==1)")
Computing Next relation with stutter on 3 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.5168,387964,1,0,876543,691,1247,924978,246,2899,1524881
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA ShieldPPPs-PT-001B-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(X(F(((!(F("((i4.u13.p32==1)&&(i9.u23.p68==1))")))&&(!(G("((i4.u14.p34==1)&&(u19.p54==1))"))))&&("(u19.p53!=1)"))))))
Formula 6 simplified : !GXF("(u19.p53!=1)" & !F"((i4.u13.p32==1)&&(i9.u23.p68==1))" & !G"((i4.u14.p34==1)&&(u19.p54==1))")
Computing Next relation with stutter on 3 deadlock states
142 unique states visited
142 strongly connected components in search stack
143 transitions explored
142 items max in DFS search stack
72 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.2379,414100,1,0,939977,697,1284,992522,248,2952,1642569
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ShieldPPPs-PT-001B-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(((X(F(("(i1.i0.u4.p11==1)")U("(i5.u16.p44==1)"))))&&("(i1.i0.u4.p11==1)"))&&("(i5.u17.p40==1)"))))
Formula 7 simplified : !X("(i1.i0.u4.p11==1)" & "(i5.u17.p40==1)" & XF("(i1.i0.u4.p11==1)" U "(i5.u16.p44==1)"))
Computing Next relation with stutter on 3 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.2409,414364,1,0,939999,697,1296,992558,248,2952,1642674
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ShieldPPPs-PT-001B-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(!(((F("(u22.p64==1)"))U("(u22.p64==1)"))U(X(F("(u22.p67!=1)")))))))
Formula 8 simplified : !X!((F"(u22.p64==1)" U "(u22.p64==1)") U XF"(u22.p67!=1)")
Computing Next relation with stutter on 3 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.2441,414364,1,0,940023,697,1313,992594,250,2952,1642803
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ShieldPPPs-PT-001B-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(((!(X("(i9.u24.p70==1)")))||(!(G(X("(u19.p54==1)")))))||("((i3.u11.p25==1)&&(i5.u16.p43==1))"))))
Formula 9 simplified : !F("((i3.u11.p25==1)&&(i5.u16.p43==1))" | !X"(i9.u24.p70==1)" | !GX"(u19.p54==1)")
Computing Next relation with stutter on 3 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.2466,414364,1,0,940023,697,1351,992594,250,2952,1642825
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA ShieldPPPs-PT-001B-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((G(X("((i3.u10.p27!=1)||(i9.u23.p68!=1))")))&&(X(X(F("(u22.p67!=1)"))))))
Formula 10 simplified : !(GX"((i3.u10.p27!=1)||(i9.u23.p68!=1))" & XXF"(u22.p67!=1)")
Computing Next relation with stutter on 3 deadlock states
86 unique states visited
86 strongly connected components in search stack
87 transitions explored
86 items max in DFS search stack
149 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,13.7383,465580,1,0,1.0612e+06,699,1386,1.12885e+06,251,2969,1863485
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ShieldPPPs-PT-001B-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(X(F("((u19.p53==1)&&(u22.p65==1))")))))
Formula 11 simplified : !GXF"((u19.p53==1)&&(u22.p65==1))"
Computing Next relation with stutter on 3 deadlock states
86 unique states visited
86 strongly connected components in search stack
87 transitions explored
86 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,13.7511,466108,1,0,1.06209e+06,699,1406,1.13007e+06,251,2969,1865428
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ShieldPPPs-PT-001B-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G((F((F(("(i4.u12.p31!=1)")U("(i9.u24.p70==1)")))U(X(G("(i4.u12.p31==1)")))))||("(i3.u9.p23==1)"))))
Formula 12 simplified : !G("(i3.u9.p23==1)" | F(F("(i4.u12.p31!=1)" U "(i9.u24.p70==1)") U XG"(i4.u12.p31==1)"))
Computing Next relation with stutter on 3 deadlock states
86 unique states visited
86 strongly connected components in search stack
87 transitions explored
86 items max in DFS search stack
39 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,14.1368,485116,1,0,1.11209e+06,699,1428,1.16758e+06,251,2969,1951237
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA ShieldPPPs-PT-001B-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((((!((X("(i3.u10.p24==1)"))U("(i5.u17.p42==1)")))||(F(G("(i1.i1.u18.p47!=1)"))))U((X("(i3.u10.p24==1)"))||("(i5.u17.p42==1)"))))
Formula 13 simplified : !((!(X"(i3.u10.p24==1)" U "(i5.u17.p42==1)") | FG"(i1.i1.u18.p47!=1)") U ("(i5.u17.p42==1)" | X"(i3.u10.p24==1)"))
Computing Next relation with stutter on 3 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
16 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,14.3058,493828,1,0,1.13847e+06,701,1467,1.18389e+06,253,2975,1998347
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA ShieldPPPs-PT-001B-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((G("(u22.p65!=1)")))
Formula 14 simplified : !G"(u22.p65!=1)"
Computing Next relation with stutter on 3 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
37 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,14.671,509668,1,0,1.17692e+06,702,1478,1.22303e+06,254,2987,2070747
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA ShieldPPPs-PT-001B-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1590589149344

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="ShieldPPPs-PT-001B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 ShieldPPPs-PT-001B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r210-tajo-159033475700402"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-001B.tgz
mv ShieldPPPs-PT-001B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;