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-159033475500282.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 ShieldIIPt-PT-005A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033475500282
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 2.8K May 14 00:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 14 00:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 13 18:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 18:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 16K 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:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 13:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 08:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 13 08:01 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 27K 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 ShieldIIPt-PT-005A-00
FORMULA_NAME ShieldIIPt-PT-005A-01
FORMULA_NAME ShieldIIPt-PT-005A-02
FORMULA_NAME ShieldIIPt-PT-005A-03
FORMULA_NAME ShieldIIPt-PT-005A-04
FORMULA_NAME ShieldIIPt-PT-005A-05
FORMULA_NAME ShieldIIPt-PT-005A-06
FORMULA_NAME ShieldIIPt-PT-005A-07
FORMULA_NAME ShieldIIPt-PT-005A-08
FORMULA_NAME ShieldIIPt-PT-005A-09
FORMULA_NAME ShieldIIPt-PT-005A-10
FORMULA_NAME ShieldIIPt-PT-005A-11
FORMULA_NAME ShieldIIPt-PT-005A-12
FORMULA_NAME ShieldIIPt-PT-005A-13
FORMULA_NAME ShieldIIPt-PT-005A-14
FORMULA_NAME ShieldIIPt-PT-005A-15

=== Now, execution of the tool begins

BK_START 1590579667170

[2020-05-27 11:41:08] [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 11:41:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 11:41:08] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2020-05-27 11:41:08] [INFO ] Transformed 98 places.
[2020-05-27 11:41:08] [INFO ] Transformed 73 transitions.
[2020-05-27 11:41:08] [INFO ] Found NUPN structural information;
[2020-05-27 11:41:08] [INFO ] Parsed PT model containing 98 places and 73 transitions in 65 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 419 steps, including 0 resets, run visited all 34 properties in 10 ms. (steps per millisecond=41 )
[2020-05-27 11:41:08] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-27 11:41:08] [INFO ] Flatten gal took : 33 ms
FORMULA ShieldIIPt-PT-005A-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 11:41:08] [INFO ] Flatten gal took : 9 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 11:41:08] [INFO ] Applying decomposition
[2020-05-27 11:41:08] [INFO ] Flatten gal took : 8 ms
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/graph12472639003515172033.txt, -o, /tmp/graph12472639003515172033.bin, -w, /tmp/graph12472639003515172033.weights], workingDir=null]
[2020-05-27 11:41:08] [INFO ] Input system was already deterministic with 72 transitions.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph12472639003515172033.bin, -l, -1, -v, -w, /tmp/graph12472639003515172033.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 11:41:08] [INFO ] Decomposing Gal with order
[2020-05-27 11:41:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 11:41:08] [INFO ] Removed a total of 15 redundant transitions.
[2020-05-27 11:41:08] [INFO ] Flatten gal took : 28 ms
[2020-05-27 11:41:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2020-05-27 11:41:08] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 5 ms
[2020-05-27 11:41:08] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 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 : !((((X(("((i3.i0.u2.p8==1)&&(i0.i0.u7.p19==1))")U("(i11.i1.u40.p96==1)")))U(X("(i11.i0.u37.p90==1)")))&&(!(F("((i4.i1.u18.p44==1)&&(i7.u21.p53==1))")))))
Formula 0 simplified : !((X("((i3.i0.u2.p8==1)&&(i0.i0.u7.p19==1))" U "(i11.i1.u40.p96==1)") U X"(i11.i0.u37.p90==1)") & !F"((i4.i1.u18.p44==1)&&(i7.u21.p53==1))")
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 12 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 72 rows 98 cols
[2020-05-27 11:41:09] [INFO ] Computed 46 place invariants in 3 ms
inv : p0 + p35 + p36 = 1
inv : p0 + p62 + p65 + p66 = 1
inv : p0 + p20 + p21 = 1
inv : p0 + p43 + p44 + p45 = 1
inv : p0 + p60 + p61 = 1
inv : p0 + p69 + p70 = 1
inv : p0 + p79 + p80 = 1
inv : p0 + p50 + p51 = 1
inv : p0 + p39 + p40 = 1
inv : p0 + p31 + p32 = 1
inv : p0 + p10 + p11 = 1
inv : p0 + p5 + p8 + p9 = 1
inv : p0 + p90 + p91 = 1
inv : p0 + p14 + p15 = 1
inv : p0 + p71 + p72 = 1
inv : p0 + p24 + p27 + p28 = 1
inv : p0 + p56 + p57 = 1
inv : p0 + p88 + p89 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p33 + p34 = 1
inv : p0 + p81 + p82 + p83 = 1
inv : p0 + p75 + p76 = 1
inv : p0 + p94 + p95 = 1
inv : p0 + p43 + p46 + p47 = 1
inv : p0 + p67 + p68 = 1
inv : p0 + p81 + p84 + p85 = 1
inv : p0 + p62 + p63 + p64 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p77 + p78 = 1
inv : p0 + p92 + p93 = 1
inv : p0 + p52 + p53 = 1
inv : p0 + p96 + p97 = 1
inv : p0 + p12 + p13 = 1
inv : p0 + p37 + p38 = 1
inv : p0 + p18 + p19 = 1
inv : p0 + p58 + p59 = 1
inv : p0 + p5 + p6 + p7 = 1
inv : p0 + p41 + p42 = 1
inv : p0 + p73 + p74 = 1
inv : p0 + p29 + p30 = 1
inv : p0 + p16 + p17 = 1
inv : p0 + p48 + p49 = 1
inv : p0 + p22 + p23 = 1
inv : p0 + p24 + p25 + p26 = 1
inv : p0 + p54 + p55 = 1
inv : p0 + p86 + p87 = 1
Total of 46 invariants.
[2020-05-27 11:41:09] [INFO ] Computed 46 place invariants in 6 ms
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
13 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,0.157175,22836,1,0,11430,285,873,23133,118,1298,15482
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-005A-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G((X(F("(i10.u29.p71==1)")))U(G(!(X("((i6.u20.p50==1)&&(i6.u31.p75==1))")))))))
Formula 1 simplified : !G(XF"(i10.u29.p71==1)" U G!X"((i6.u20.p50==1)&&(i6.u31.p75==1))")
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
3 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,0.188294,24456,1,0,14072,285,927,28384,120,1298,19752
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-005A-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(!(G((!(X(!(G("((i3.i0.u2.p5==1)&&(i3.i0.u6.p16==1))")))))&&(X((F("((i3.i0.u2.p6==1)&&(i3.i1.u5.p15==1))"))U("((i3.i0.u2.p6==1)&&(i3.i1.u5.p15==1))"))))))))
Formula 2 simplified : !G!G(!X!G"((i3.i0.u2.p5==1)&&(i3.i0.u6.p16==1))" & X(F"((i3.i0.u2.p6==1)&&(i3.i1.u5.p15==1))" U "((i3.i0.u2.p6==1)&&(i3.i1.u5.p15==1))"))
3 unique states visited
0 strongly connected components in search stack
4 transitions explored
3 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,0.190907,24956,1,0,14253,285,1001,28648,122,1298,20058
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-005A-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X((G(X("(((i0.i0.u3.p11==1)&&(i3.i1.u5.p15==1))&&(i0.i1.u8.p21==1))")))||(G(F((("(i11.i0.u37.p90==1)")U("(i4.i2.u24.p58==1)"))||(F("(i11.i0.u37.p90==1)"))))))))
Formula 3 simplified : !X(GX"(((i0.i0.u3.p11==1)&&(i3.i1.u5.p15==1))&&(i0.i1.u8.p21==1))" | GF(("(i11.i0.u37.p90==1)" U "(i4.i2.u24.p58==1)") | F"(i11.i0.u37.p90==1)"))
5 unique states visited
5 strongly connected components in search stack
6 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,0.196739,25176,1,0,14895,285,1093,29669,122,1298,20822
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-005A-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X((F(G("((i3.i0.u2.p5==1)&&(i3.i0.u6.p16==1))")))&&("(i4.i2.u24.p58==1)"))))
Formula 4 simplified : !X("(i4.i2.u24.p58==1)" & FG"((i3.i0.u2.p5==1)&&(i3.i0.u6.p16==1))")
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,0.198076,25176,1,0,14924,285,1094,29676,122,1298,21032
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-005A-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((X(X(F("(i2.u14.p35==1)"))))||(("(((i3.i0.u2.p8==1)&&(i0.i0.u7.p19==1))||(i2.u14.p35==1))")U(G("((i3.i0.u2.p8==1)&&(i0.i0.u7.p19==1))")))))
Formula 5 simplified : !(XXF"(i2.u14.p35==1)" | ("(((i3.i0.u2.p8==1)&&(i0.i0.u7.p19==1))||(i2.u14.p35==1))" U G"((i3.i0.u2.p8==1)&&(i0.i0.u7.p19==1))"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
2 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,0.221628,26460,1,0,18990,285,1152,34055,123,1298,27174
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-005A-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(F((G("(((i1.u4.p13!=1)||(i0.i0.u7.p19!=1))||(i0.i1.u8.p21!=1))"))||(X(G("((i4.i2.u17.p42!=1)||(i4.i1.u22.p55!=1))")))))))
Formula 6 simplified : F(G"(((i1.u4.p13!=1)||(i0.i0.u7.p19!=1))||(i0.i1.u8.p21!=1))" | XG"((i4.i2.u17.p42!=1)||(i4.i1.u22.p55!=1))")
4 unique states visited
4 strongly connected components in search stack
5 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,0.229338,26716,1,0,19311,285,1205,34821,124,1298,27514
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-005A-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(((((G("((i4.i1.u18.p46==1)&&(i4.i0.u23.p57==1))"))&&(G(F("((i4.i1.u18.p46==1)&&(i4.i0.u23.p57==1))"))))&&("(i4.i1.u18.p46==1)"))&&("(i4.i0.u23.p57==1)"))&&("(i6.u31.p75==1)"))))
Formula 7 simplified : !X("(i4.i0.u23.p57==1)" & "(i4.i1.u18.p46==1)" & "(i6.u31.p75==1)" & G"((i4.i1.u18.p46==1)&&(i4.i0.u23.p57==1))" & GF"((i4.i1.u18.p46==1)&&(i4.i0.u23.p57==1))")
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,0.231169,26972,1,0,19311,285,1246,34821,125,1298,27574
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-005A-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!(F((!(X(!(X(G(F("((i4.i0.u23.p56==1)&&((i10.u26.p65!=1)||(i6.u31.p76!=1)))")))))))||(X("(i4.i0.u23.p56==1)"))))))
Formula 8 simplified : F(!X!XGF"((i4.i0.u23.p56==1)&&((i10.u26.p65!=1)||(i6.u31.p76!=1)))" | X"(i4.i0.u23.p56==1)")
5 unique states visited
5 strongly connected components in search stack
6 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,0.23544,26972,1,0,19707,285,1273,35624,125,1298,27899
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-005A-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F("((i4.i1.u18.p46==1)&&(i4.i0.u23.p57==1))")))
Formula 9 simplified : !F"((i4.i1.u18.p46==1)&&(i4.i0.u23.p57==1))"
[2020-05-27 11:41:09] [INFO ] Proved 98 variables to be positive in 196 ms
[2020-05-27 11:41:09] [INFO ] Computing symmetric may disable matrix : 72 transitions.
[2020-05-27 11:41:09] [INFO ] Computation of disable matrix completed :0/72 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 11:41:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 11:41:09] [INFO ] Computing symmetric may enable matrix : 72 transitions.
[2020-05-27 11:41:09] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
4 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,0.271786,29016,1,0,24454,285,1288,46196,125,1298,33391
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-005A-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((!(X((((G(X(G("((i4.i1.u18.p46==1)&&(i4.i0.u23.p57==1))"))))&&("(i4.i1.u22.p54!=1)"))||("(i3.i0.u2.p5!=1)"))||("(i3.i0.u6.p16!=1)")))))
Formula 10 simplified : X("(i3.i0.u2.p5!=1)" | "(i3.i0.u6.p16!=1)" | ("(i4.i1.u22.p54!=1)" & GXG"((i4.i1.u18.p46==1)&&(i4.i0.u23.p57==1))"))
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,0.273478,29544,1,0,24454,285,1316,46196,125,1298,33428
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-005A-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(X((!(("((i6.u20.p50==1)&&(i6.u31.p75==1))")U("(i4.i1.u22.p54==1)")))&&("(i4.i1.u22.p54!=1)")))))
Formula 11 simplified : !GX("(i4.i1.u22.p54!=1)" & !("((i6.u20.p50==1)&&(i6.u31.p75==1))" U "(i4.i1.u22.p54==1)"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
2 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,0.297127,29800,1,0,26623,285,1345,49535,130,1305,36653
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-005A-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(F((G(F(G("((i4.i1.u18.p45!=1)||(i4.i1.u18.p47!=1))"))))||("(i11.i1.u40.p96==1)")))))
Formula 12 simplified : !XF("(i11.i1.u40.p96==1)" | GFG"((i4.i1.u18.p45!=1)||(i4.i1.u18.p47!=1))")
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,0.298849,30064,1,0,26634,285,1391,49545,136,1305,36792
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-005A-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((!(G((X("(i0.i1.u8.p20!=1)"))U(!(("(i11.i1.u40.p96==1)")U("((i0.i0.u0.p1==1)&&(i0.i0.u7.p18==1))")))))))
Formula 13 simplified : G(X"(i0.i1.u8.p20!=1)" U !("(i11.i1.u40.p96==1)" U "((i0.i0.u0.p1==1)&&(i0.i0.u7.p18==1))"))
14 unique states visited
14 strongly connected components in search stack
14 transitions explored
14 items max in DFS search stack
5 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,0.350334,32160,1,0,31461,285,1464,60648,136,1364,43522
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-005A-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F("((i0.i1.u1.p3==1)&&(i0.i1.u8.p20==1))")))
Formula 14 simplified : !F"((i0.i1.u1.p3==1)&&(i0.i1.u8.p20==1))"
2 unique states visited
2 strongly connected components in search stack
2 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,0.353566,32424,1,0,31714,285,1487,60991,136,1366,44074
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-005A-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-27 11:41:09] [WARNING] Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
[2020-05-27 11:41:09] [WARNING] Script execution failed on command (declare-fun s1 () (Array Int Int)) with error (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
[2020-05-27 11:41:09] [WARNING] Script execution failed on command (assert (and (>= (select s0 0) 1) (= (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store s0 81 (+ (select s0 81) 1)) 34 (+ (select s0 34) 1)) 74 (+ (select s0 74) 1)) 0 (- (select s0 0) 1)) 93 (+ (select s0 93) 1)) 62 (+ (select s0 62) 1)) 78 (+ (select s0 78) 1)) 43 (+ (select s0 43) 1)) 36 (+ (select s0 36) 1)) 59 (+ (select s0 59) 1)) 79 (+ (select s0 79) 1)) 38 (+ (select s0 38) 1)) 53 (+ (select s0 53) 1)) 17 (+ (select s0 17) 1)) 40 (+ (select s0 40) 1)) 72 (+ (select s0 72) 1)) 22 (+ (select s0 22) 1)) 12 (+ (select s0 12) 1)) 41 (+ (select s0 41) 1)) 86 (+ (select s0 86) 1)) 95 (+ (select s0 95) 1)) 19 (+ (select s0 19) 1)) 50 (+ (select s0 50) 1)) 10 (+ (select s0 10) 1)) 76 (+ (select s0 76) 1)) 60 (+ (select s0 60) 1)) 21 (+ (select s0 21) 1)) 91 (+ (select s0 91) 1)) 55 (+ (select s0 55) 1)) 3 (+ (select s0 3) 1)) 88 (+ (select s0 88) 1)) 1 (+ (select s0 1) 1)) 69 (+ (select s0 69) 1)) 67 (+ (select s0 67) 1)) 97 (+ (select s0 97) 1)) 5 (+ (select s0 5) 1)) 29 (+ (select s0 29) 1)) 15 (+ (select s0 15) 1)) 31 (+ (select s0 31) 1)) 57 (+ (select s0 57) 1)) 24 (+ (select s0 24) 1)) 48 (+ (select s0 48) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (and (>= (select s0 0) 1) (= (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store s0 81 (+ (select s0 81) 1)) 34 (+ (select s0 34) 1)) 74 (+ (select s0 74) 1)) 0 (- (select s0 0) 1)) 93 (+ (select s0 93) 1)) 62 (+ (select s0 62) 1)) 78 (+ (select s0 78) 1)) 43 (+ (select s0 43) 1)) 36 (+ (select s0 36) 1)) 59 (+ (select s0 59) 1)) 79 (+ (select s0 79) 1)) 38 (+ (select s0 38) 1)) 53 (+ (select s0 53) 1)) 17 (+ (select s0 17) 1)) 40 (+ (select s0 40) 1)) 72 (+ (select s0 72) 1)) 22 (+ (select s0 22) 1)) 12 (+ (select s0 12) 1)) 41 (+ (select s0 41) 1)) 86 (+ (select s0 86) 1)) 95 (+ (select s0 95) 1)) 19 (+ (select s0 19) 1)) 50 (+ (select s0 50) 1)) 10 (+ (select s0 10) 1)) 76 (+ (select s0 76) 1)) 60 (+ (select s0 60) 1)) 21 (+ (select s0 21) 1)) 91 (+ (select s0 91) 1)) 55 (+ (select s0 55) 1)) 3 (+ (select s0 3) 1)) 88 (+ (select s0 88) 1)) 1 (+ (select s0 1) 1)) 69 (+ (select s0 69) 1)) 67 (+ (select s0 67) 1)) 97 (+ (select s0 97) 1)) 5 (+ (select s0 5) 1)) 29 (+ (select s0 29) 1)) 15 (+ (select s0 15) 1)) 31 (+ (select s0 31) 1)) 57 (+ (select s0 57) 1)) 24 (+ (select s0 24) 1)) 48 (+ (select s0 48) 1)) s1))")
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-27 11:41:09] [INFO ] Built C files in 535ms 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]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1590579669526

--------------------
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="ShieldIIPt-PT-005A"
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 ShieldIIPt-PT-005A, 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-159033475500282"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-005A.tgz
mv ShieldIIPt-PT-005A 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 ;