fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r210-tajo-159033475900577
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for ShieldPPPt-PT-001B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15740.610 26216.00 43363.00 277.30 FFFTTTFFFTTFTTFF 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/mcc2020-input.r210-tajo-159033475900577.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 ShieldPPPt-PT-001B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033475900577
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.3K May 14 01:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 14 01:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 19:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 19:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.7K May 13 14:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 13 14:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 08:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 08:48 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 19K 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 ShieldPPPt-PT-001B-00
FORMULA_NAME ShieldPPPt-PT-001B-01
FORMULA_NAME ShieldPPPt-PT-001B-02
FORMULA_NAME ShieldPPPt-PT-001B-03
FORMULA_NAME ShieldPPPt-PT-001B-04
FORMULA_NAME ShieldPPPt-PT-001B-05
FORMULA_NAME ShieldPPPt-PT-001B-06
FORMULA_NAME ShieldPPPt-PT-001B-07
FORMULA_NAME ShieldPPPt-PT-001B-08
FORMULA_NAME ShieldPPPt-PT-001B-09
FORMULA_NAME ShieldPPPt-PT-001B-10
FORMULA_NAME ShieldPPPt-PT-001B-11
FORMULA_NAME ShieldPPPt-PT-001B-12
FORMULA_NAME ShieldPPPt-PT-001B-13
FORMULA_NAME ShieldPPPt-PT-001B-14
FORMULA_NAME ShieldPPPt-PT-001B-15

=== Now, execution of the tool begins

BK_START 1590606194328

[2020-05-27 19:03:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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 19:03:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 19:03:17] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2020-05-27 19:03:17] [INFO ] Transformed 81 places.
[2020-05-27 19:03:17] [INFO ] Transformed 74 transitions.
[2020-05-27 19:03:17] [INFO ] Found NUPN structural information;
[2020-05-27 19:03:17] [INFO ] Parsed PT model containing 81 places and 74 transitions in 125 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 6 resets, run finished after 201 ms. (steps per millisecond=497 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 74 rows 81 cols
[2020-05-27 19:03:17] [INFO ] Computed 12 place invariants in 9 ms
[2020-05-27 19:03:18] [INFO ] [Real]Absence check using 12 positive place invariants in 111 ms returned sat
[2020-05-27 19:03:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 19:03:18] [INFO ] [Real]Absence check using state equation in 546 ms returned sat
[2020-05-27 19:03:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 19:03:18] [INFO ] [Nat]Absence check using 12 positive place invariants in 21 ms returned unsat
[2020-05-27 19:03:18] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2020-05-27 19:03:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 19:03:18] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2020-05-27 19:03:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 19:03:18] [INFO ] [Nat]Absence check using 12 positive place invariants in 16 ms returned unsat
[2020-05-27 19:03:19] [INFO ] [Real]Absence check using 12 positive place invariants in 31 ms returned sat
[2020-05-27 19:03:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 19:03:19] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2020-05-27 19:03:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 19:03:19] [INFO ] [Nat]Absence check using 12 positive place invariants in 43 ms returned unsat
[2020-05-27 19:03:19] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2020-05-27 19:03:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 19:03:19] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2020-05-27 19:03:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 19:03:19] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
[2020-05-27 19:03:19] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-27 19:03:19] [INFO ] Flatten gal took : 82 ms
FORMULA ShieldPPPt-PT-001B-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 19:03:19] [INFO ] Flatten gal took : 7 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 19:03:19] [INFO ] Applying decomposition
[2020-05-27 19:03:19] [INFO ] Flatten gal took : 29 ms
[2020-05-27 19:03:19] [INFO ] Input system was already deterministic with 74 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 74 rows 81 cols
[2020-05-27 19:03:19] [INFO ] Computed 12 place invariants in 2 ms
inv : p0 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p15 + p16 + p17 + p18 + p19 = 1
inv : p0 + p4 + p5 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 = 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 + p4 + p5 + p6 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 = 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 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 = 1
inv : p0 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 = 1
inv : p0 + p4 + p5 + p6 + p7 + p8 + p9 + p29 + p30 + p31 + p34 + p35 = 1
inv : p0 + p4 + p5 + p6 + p7 + p8 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 = 1
inv : p0 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p22 + p23 + p24 + p27 + p28 = 1
Total of 12 invariants.
[2020-05-27 19:03:19] [INFO ] Computed 12 place invariants in 3 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/graph15664509904477842556.txt, -o, /tmp/graph15664509904477842556.bin, -w, /tmp/graph15664509904477842556.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/graph15664509904477842556.bin, -l, -1, -v, -w, /tmp/graph15664509904477842556.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 19:03:20] [INFO ] Decomposing Gal with order
[2020-05-27 19:03:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 19:03:20] [INFO ] Removed a total of 6 redundant transitions.
[2020-05-27 19:03:20] [INFO ] Proved 81 variables to be positive in 176 ms
[2020-05-27 19:03:20] [INFO ] Computing symmetric may disable matrix : 74 transitions.
[2020-05-27 19:03:20] [INFO ] Computation of disable matrix completed :0/74 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 19:03:20] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 19:03:20] [INFO ] Computing symmetric may enable matrix : 74 transitions.
[2020-05-27 19:03:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 19:03:20] [INFO ] Flatten gal took : 100 ms
[2020-05-27 19:03:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-27 19:03:20] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 4 ms
[2020-05-27 19:03:20] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 10 LTL properties
Checking formula 0 : !((F(G("((i1.u6.p15==0)||(u10.p33==1))"))))
Formula 0 simplified : !FG"((i1.u6.p15==0)||(u10.p33==1))"
built 18 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 10 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t19, t50, t53, t56, u10.t52, i0.u5.t59, i1.u6.t58, i2.u8.t55, i3.t48, i3.t41, i3.u11.t42, i3.u11.t49, i3.u14.t46, i5.t31, i5.u17.t35, i5.u17.t37, i7.t26, i7.u22.t20, i7.u22.t27, i7.u23.t24, i8.u0.t60, i9.t14, i9.t7, i9.u25.t12, i9.u27.t8, i9.u27.t15, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/48/26/74
Computing Next relation with stutter on 3 deadlock states
[2020-05-27 19:03:21] [INFO ] Computing symmetric co enabling matrix : 74 transitions.
[2020-05-27 19:03:23] [INFO ] Computation of co-enabling matrix(38/74) took 1406 ms. Total solver calls (SAT/UNSAT): 593(3/590)
[2020-05-27 19:03:24] [INFO ] Computation of Finished co-enabling matrix. took 2494 ms. Total solver calls (SAT/UNSAT): 766(7/759)
[2020-05-27 19:03:24] [INFO ] Computing Do-Not-Accords matrix : 74 transitions.
[2020-05-27 19:03:24] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 19:03:24] [INFO ] Built C files in 4559ms 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 1743 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 189 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([]((LTLAP0==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, <>([]((LTLAP0==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, <>([]((LTLAP0==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)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
738 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.40325,226728,1,0,431808,528,1105,632875,273,1785,626383
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001B-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(!(X(X(F(G(F("((i3.u11.p37==0)||(u10.p32==1))")))))))))
Formula 1 simplified : !G!XXFGF"((i3.u11.p37==0)||(u10.p32==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
606 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.4767,422108,1,0,854497,559,1130,1.13792e+06,274,1989,1156982
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001B-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(F((!(G("((i6.u19.p58==0)||(i3.u14.p45==1))")))U(G("((i6.u19.p58==0)||(i3.u14.p45==1))"))))))
Formula 2 simplified : !XF(!G"((i6.u19.p58==0)||(i3.u14.p45==1))" U G"((i6.u19.p58==0)||(i3.u14.p45==1))")
Computing Next relation with stutter on 3 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
151 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.9846,485924,1,0,992379,560,1210,1.28946e+06,281,2001,1374705
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-001B-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X("((i8.u0.p2==0)||(i7.u20.p64==1))")))
Formula 3 simplified : !X"((i8.u0.p2==0)||(i7.u20.p64==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,14.9852,486188,1,0,992379,560,1218,1.28946e+06,282,2001,1374719
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-001B-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(G(X(X(F((F("((i2.u8.p28==0)||(i6.u19.p69==1))"))||(((G("((i3.u14.p39==0)||(i6.u2.p6==1))"))&&("((i9.u27.p78==0)||(i3.u12.p42==1))"))U(G("((i2.u8.p28==0)||(i6.u19.p69==1))"))))))))))
Formula 4 simplified : !XGXXF(F"((i2.u8.p28==0)||(i6.u19.p69==1))" | (("((i9.u27.p78==0)||(i3.u12.p42==1))" & G"((i3.u14.p39==0)||(i6.u2.p6==1))") U G"((i2.u8.p28==0)||(i6.u19.p69==1))"))
Computing Next relation with stutter on 3 deadlock states
48 unique states visited
48 strongly connected components in search stack
49 transitions explored
48 items max in DFS search stack
64 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,15.6322,503240,1,0,1.02995e+06,634,1274,1.33742e+06,283,2339,1447036
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001B-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((!(("((i3.u14.p39==0)||(i2.u8.p26==1))")U(X(F(X("((i3.u14.p39==0)||(i2.u8.p26==1))")))))))
Formula 5 simplified : "((i3.u14.p39==0)||(i2.u8.p26==1))" U XFX"((i3.u14.p39==0)||(i2.u8.p26==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,15.6352,503732,1,0,1.02997e+06,634,1297,1.33745e+06,284,2339,1447151
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001B-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X((F((!(X(X("((i8.u1.p5==0)||(i8.u1.p0==1))"))))&&("((i7.u20.p64==0)||(u10.p33==1))")))||((F("(i2.u8.p23==1)"))&&("((i9.u28.p70==0)||(i1.u6.p16==1))")))))
Formula 6 simplified : !X(F("((i7.u20.p64==0)||(u10.p33==1))" & !XX"((i8.u1.p5==0)||(i8.u1.p0==1))") | ("((i9.u28.p70==0)||(i1.u6.p16==1))" & F"(i2.u8.p23==1)"))
Computing Next relation with stutter on 3 deadlock states
125 unique states visited
76 strongly connected components in search stack
125 transitions explored
125 items max in DFS search stack
94 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,16.5718,534316,1,0,1.10343e+06,638,1396,1.42173e+06,291,2388,1574401
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001B-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(("((i9.u25.p73==0)||(i2.u9.p25==1))")U("((i6.u19.p58!=0)&&(i8.u1.p4!=1))"))))
Formula 7 simplified : !F("((i9.u25.p73==0)||(i2.u9.p25==1))" U "((i6.u19.p58!=0)&&(i8.u1.p4!=1))")
Computing Next relation with stutter on 3 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,16.5746,534580,1,0,1.10347e+06,638,1427,1.42177e+06,292,2388,1574699
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-001B-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(F("(i5.u17.p55!=1)"))))
Formula 8 simplified : !XF"(i5.u17.p55!=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,16.5756,534844,1,0,1.10347e+06,638,1449,1.42177e+06,293,2388,1574716
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-001B-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((F(X("((u10.p32==0)||(i7.u23.p61==1))")))&&(G(F(((F(G("((u10.p32==0)||(i7.u23.p61==1))")))||("(i7.u20.p60==0)"))||("(i2.u9.p27==1)"))))))
Formula 9 simplified : !(FX"((u10.p32==0)||(i7.u23.p61==1))" & GF("(i2.u9.p27==1)" | "(i7.u20.p60==0)" | FG"((u10.p32==0)||(i7.u23.p61==1))"))
Computing Next relation with stutter on 3 deadlock states
57 unique states visited
0 strongly connected components in search stack
90 transitions explored
46 items max in DFS search stack
27 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,16.831,544152,1,0,1.12814e+06,671,1511,1.44015e+06,294,2568,1617277
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-001B-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1590606220544

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="ShieldPPPt-PT-001B"
export BK_EXAMINATION="LTLCardinality"
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 ShieldPPPt-PT-001B, examination is LTLCardinality"
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-159033475900577"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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