About the Execution of ITS-Tools for ShieldPPPt-PT-005A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15743.070 | 192801.00 | 205594.00 | 1111.10 | FFFFFFTTTTFFFFFF | 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-159033476000634.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-005A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033476000634
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.7K May 14 01:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 01:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 19:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 19:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 15K 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.3K May 13 14:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 14:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 08:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 08:50 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 33K 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-005A-00
FORMULA_NAME ShieldPPPt-PT-005A-01
FORMULA_NAME ShieldPPPt-PT-005A-02
FORMULA_NAME ShieldPPPt-PT-005A-03
FORMULA_NAME ShieldPPPt-PT-005A-04
FORMULA_NAME ShieldPPPt-PT-005A-05
FORMULA_NAME ShieldPPPt-PT-005A-06
FORMULA_NAME ShieldPPPt-PT-005A-07
FORMULA_NAME ShieldPPPt-PT-005A-08
FORMULA_NAME ShieldPPPt-PT-005A-09
FORMULA_NAME ShieldPPPt-PT-005A-10
FORMULA_NAME ShieldPPPt-PT-005A-11
FORMULA_NAME ShieldPPPt-PT-005A-12
FORMULA_NAME ShieldPPPt-PT-005A-13
FORMULA_NAME ShieldPPPt-PT-005A-14
FORMULA_NAME ShieldPPPt-PT-005A-15
=== Now, execution of the tool begins
BK_START 1590608445678
[2020-05-27 19:40:47] [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 19:40:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 19:40:47] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2020-05-27 19:40:47] [INFO ] Transformed 128 places.
[2020-05-27 19:40:47] [INFO ] Transformed 93 transitions.
[2020-05-27 19:40:47] [INFO ] Found NUPN structural information;
[2020-05-27 19:40:47] [INFO ] Parsed PT model containing 128 places and 93 transitions in 78 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 1349 steps, including 0 resets, run visited all 43 properties in 19 ms. (steps per millisecond=71 )
[2020-05-27 19:40:47] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-27 19:40:47] [INFO ] Flatten gal took : 35 ms
FORMULA ShieldPPPt-PT-005A-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-005A-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-005A-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 19:40:47] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 19:40:47] [INFO ] Applying decomposition
[2020-05-27 19:40:47] [INFO ] Flatten gal took : 18 ms
[2020-05-27 19:40:47] [INFO ] Input system was already deterministic with 92 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/graph7686792152646768581.txt, -o, /tmp/graph7686792152646768581.bin, -w, /tmp/graph7686792152646768581.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/graph7686792152646768581.bin, -l, -1, -v, -w, /tmp/graph7686792152646768581.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 19:40:47] [INFO ] Decomposing Gal with order
[2020-05-27 19:40:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 19:40:47] [INFO ] Removed a total of 15 redundant transitions.
[2020-05-27 19:40:47] [INFO ] Flatten gal took : 35 ms
[2020-05-27 19:40:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2020-05-27 19:40:47] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 7 ms
[2020-05-27 19:40:47] [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 13 LTL properties
Checking formula 0 : !(((!(X((!(F("((i6.u19.p63==1)&&(i8.u24.p77==1))")))||("(i0.u0.p0==1)"))))U((((G("(i11.u21.p70==1)"))&&("(i2.i1.u6.p22==1)"))&&("(i6.u19.p63==1)"))&&("(i8.u24.p77==1)"))))
Formula 0 simplified : !(!X("(i0.u0.p0==1)" | !F"((i6.u19.p63==1)&&(i8.u24.p77==1))") U ("(i2.i1.u6.p22==1)" & "(i6.u19.p63==1)" & "(i8.u24.p77==1)" & G"(i11.u21.p70==1)"))
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 92 rows 128 cols
[2020-05-27 19:40:47] [INFO ] Computed 56 place invariants in 11 ms
inv : p0 + p55 + p58 + p59 = 1
inv : p0 + p45 + p46 = 1
inv : p0 + p99 + p100 = 1
inv : p0 + p115 + p116 + p117 = 1
inv : p0 + p10 + p13 + p14 = 1
inv : p0 + p124 + p125 = 1
inv : p0 + p20 + p21 = 1
inv : p0 + p35 + p38 + p39 = 1
inv : p0 + p90 + p91 + p92 = 1
inv : p0 + p95 + p96 = 1
inv : p0 + p26 + p27 = 1
inv : p0 + p80 + p83 + p84 = 1
inv : p0 + p5 + p8 + p9 = 1
inv : p0 + p74 + p75 = 1
inv : p0 + p40 + p41 + p42 = 1
inv : p0 + p120 + p121 = 1
inv : p0 + p103 + p104 = 1
inv : p0 + p15 + p18 + p19 = 1
inv : p0 + p60 + p63 + p64 = 1
inv : p0 + p24 + p25 = 1
inv : p0 + p105 + p108 + p109 = 1
inv : p0 + p55 + p56 + p57 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p49 + p50 = 1
inv : p0 + p85 + p86 + p87 = 1
inv : p0 + p30 + p33 + p34 = 1
inv : p0 + p97 + p98 = 1
inv : p0 + p10 + p11 + p12 = 1
inv : p0 + p126 + p127 = 1
inv : p0 + p78 + p79 = 1
inv : p0 + p90 + p93 + p94 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p115 + p118 + p119 = 1
inv : p0 + p28 + p29 = 1
inv : p0 + p35 + p36 + p37 = 1
inv : p0 + p80 + p81 + p82 = 1
inv : p0 + p72 + p73 = 1
inv : p0 + p60 + p61 + p62 = 1
inv : p0 + p53 + p54 = 1
inv : p0 + p101 + p102 = 1
inv : p0 + p30 + p31 + p32 = 1
inv : p0 + p15 + p16 + p17 = 1
inv : p0 + p47 + p48 = 1
inv : p0 + p110 + p113 + p114 = 1
inv : p0 + p122 + p123 = 1
inv : p0 + p105 + p106 + p107 = 1
inv : p0 + p65 + p68 + p69 = 1
inv : p0 + p5 + p6 + p7 = 1
inv : p0 + p51 + p52 = 1
inv : p0 + p110 + p111 + p112 = 1
inv : p0 + p85 + p88 + p89 = 1
inv : p0 + p65 + p66 + p67 = 1
inv : p0 + p76 + p77 = 1
inv : p0 + p22 + p23 = 1
inv : p0 + p40 + p43 + p44 = 1
inv : p0 + p70 + p71 = 1
Total of 56 invariants.
[2020-05-27 19:40:47] [INFO ] Computed 56 place invariants in 18 ms
built 31 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
[2020-05-27 19:40:48] [INFO ] Proved 128 variables to be positive in 245 ms
[2020-05-27 19:40:48] [INFO ] Computing symmetric may disable matrix : 92 transitions.
[2020-05-27 19:40:48] [INFO ] Computation of disable matrix completed :0/92 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 19:40:48] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 19:40:48] [INFO ] Computing symmetric may enable matrix : 92 transitions.
[2020-05-27 19:40:48] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 19:40:49] [INFO ] Computing symmetric co enabling matrix : 92 transitions.
[2020-05-27 19:40:51] [INFO ] Computation of co-enabling matrix(91/92) took 1730 ms. Total solver calls (SAT/UNSAT): 274(34/240)
[2020-05-27 19:40:51] [INFO ] Computation of Finished co-enabling matrix. took 1731 ms. Total solver calls (SAT/UNSAT): 274(34/240)
[2020-05-27 19:40:51] [INFO ] Computing Do-Not-Accords matrix : 92 transitions.
[2020-05-27 19:40:51] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 19:40:51] [INFO ] Built C files in 3530ms 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 1551 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 54 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, (!( X(( !( <>((LTLAP0==true))) ) || ( (LTLAP1==true)) )) )U(( ( ( []((LTLAP2==true)) ) && ( (LTLAP3==true) ) ) && ( (LTLAP4==true) ) ) && ( (LTLAP5==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, --when, --ltl, (!( X(( !( <>((LTLAP0==true))) ) || ( (LTLAP1==true)) )) )U(( ( ( []((LTLAP2==true)) ) && ( (LTLAP3==true) ) ) && ( (LTLAP4==true) ) ) && ( (LTLAP5==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, --when, --ltl, (!( X(( !( <>((LTLAP0==true))) ) || ( (LTLAP1==true)) )) )U(( ( ( []((LTLAP2==true)) ) && ( (LTLAP3==true) ) ) && ( (LTLAP4==true) ) ) && ( (LTLAP5==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
8774 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,87.7734,1672172,1,0,2.45192e+06,244,914,4.50592e+06,128,1172,2002297
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-005A-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(G(("((i3.u12.p41==1)&&(i3.u16.p52==1))")U(!(G("((i3.u12.p41==1)&&(i3.u16.p52==1))")))))))
Formula 1 simplified : !XG("((i3.u12.p41==1)&&(i3.u16.p52==1))" U !G"((i3.u12.p41==1)&&(i3.u16.p52==1))")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
7 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,87.8496,1675192,1,0,2.4583e+06,244,1058,4.516e+06,129,1493,2012240
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-005A-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F((G("((i0.u7.p24==1)||((i12.u26.p82==1)&&(i12.u26.p84==1)))"))||(((X(X(F(X(G("((i1.u4.p17==1)&&(i1.u4.p19==1))"))))))&&("(i12.u26.p81==1)"))&&("(i12.u29.p96==1)")))))
Formula 2 simplified : !F(G"((i0.u7.p24==1)||((i12.u26.p82==1)&&(i12.u26.p84==1)))" | ("(i12.u26.p81==1)" & "(i12.u29.p96==1)" & XXFXG"((i1.u4.p17==1)&&(i1.u4.p19==1))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,87.8684,1675976,1,0,2.46023e+06,244,1187,4.51818e+06,136,1493,2015207
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-005A-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(((G("((i1.u4.p17==1)&&(i1.u4.p19==1))"))||(F("(i2.i0.u8.p26==1)")))U(G((X(X("((i0.u3.p12==1)&&(i0.u3.p14==1))")))U("((i2.i1.u2.p5==1)&&(i2.i1.u6.p22==1))"))))))
Formula 3 simplified : !G((G"((i1.u4.p17==1)&&(i1.u4.p19==1))" | F"(i2.i0.u8.p26==1)") U G(XX"((i0.u3.p12==1)&&(i0.u3.p14==1))" U "((i2.i1.u2.p5==1)&&(i2.i1.u6.p22==1))"))
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 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,87.8824,1676236,1,0,2.46128e+06,244,1259,4.51944e+06,136,1498,2016604
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-005A-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(G("((i5.u10.p33!=1)||(i1.u15.p50!=1))"))))
Formula 4 simplified : !FG"((i5.u10.p33!=1)||(i1.u15.p50!=1))"
2 unique states visited
2 strongly connected components in search stack
2 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,88.034,1683100,1,0,2.4794e+06,244,1321,4.54238e+06,136,1500,2039583
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-005A-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((!(("(i8.u24.p76!=1)")U(X(F("(i8.u22.p72!=1)"))))))
Formula 5 simplified : "(i8.u24.p76!=1)" U XF"(i8.u22.p72!=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,88.0361,1683364,1,0,2.47944e+06,245,1339,4.54244e+06,136,1539,2039828
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-005A-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((F(X((!((X(X("((i11.u21.p70==1)&&(i11.u27.p85==1))")))U("((i11.u21.p70==1)&&(i11.u27.p85==1))")))||("(i11.u21.p70!=1)"))))||(G("((i3.u12.p40==1)&&(i9.u23.p74==1))"))))
Formula 6 simplified : !(FX("(i11.u21.p70!=1)" | !(XX"((i11.u21.p70==1)&&(i11.u27.p85==1))" U "((i11.u21.p70==1)&&(i11.u27.p85==1))")) | G"((i3.u12.p40==1)&&(i9.u23.p74==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,88.038,1683364,1,0,2.47944e+06,245,1360,4.54244e+06,136,1539,2039870
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-005A-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((("((i12.u26.p80==1)&&(i10.u30.p97==1))")U((!(X("((i1.u4.p16==1)&&(i2.i0.u8.p27==1))")))&&("((i12.u26.p80!=1)||(i10.u30.p97!=1))"))))
Formula 7 simplified : !("((i12.u26.p80==1)&&(i10.u30.p97==1))" U ("((i12.u26.p80!=1)||(i10.u30.p97!=1))" & !X"((i1.u4.p16==1)&&(i2.i0.u8.p27==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,88.0391,1683364,1,0,2.47944e+06,245,1399,4.54244e+06,136,1539,2039934
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-005A-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(((X(G((G("(((i9.u18.p58==1)&&(i9.u23.p75==1))&&((i12.u29.p95!=1)||(i13.u35.p110!=1)))"))||("((i4.u11.p36==1)&&(i6.u13.p46==1))"))))||("(i4.u11.p36!=1)"))||("(i6.u13.p46!=1)"))))
Formula 8 simplified : !X("(i4.u11.p36!=1)" | "(i6.u13.p46!=1)" | XG("((i4.u11.p36==1)&&(i6.u13.p46==1))" | G"(((i9.u18.p58==1)&&(i9.u23.p75==1))&&((i12.u29.p95!=1)||(i13.u35.p110!=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,88.0397,1683364,1,0,2.47944e+06,245,1407,4.54244e+06,136,1539,2039954
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-005A-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X((G("((i12.u26.p81==1)&&(i12.u29.p96==1))"))U("((i10.u25.p79==1)&&(i10.u30.p98==1))"))))
Formula 9 simplified : !X(G"((i12.u26.p81==1)&&(i12.u29.p96==1))" U "((i10.u25.p79==1)&&(i10.u30.p98==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,88.0404,1683364,1,0,2.47944e+06,245,1422,4.54244e+06,136,1539,2039978
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-005A-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(X(G(F((X(X("((i11.u27.p86==1)&&(i12.u29.p96==1))")))||(G("((i11.u27.p87==1)&&(i11.u27.p89==1))"))))))))
Formula 10 simplified : !XXGF(XX"((i11.u27.p86==1)&&(i12.u29.p96==1))" | G"((i11.u27.p87==1)&&(i11.u27.p89==1))")
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 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,88.0442,1683628,1,0,2.47974e+06,245,1471,4.54279e+06,136,1543,2040452
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-005A-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(("((i5.u9.p28!=1)||(i3.u16.p51!=1))")U(((G("((i14.u34.p106!=1)||(i13.u37.p121!=1))"))||("((i12.u26.p80==1)&&(i10.u30.p97==1))"))U("((i14.u34.p106==1)&&(i13.u37.p121==1))")))))
Formula 11 simplified : !G("((i5.u9.p28!=1)||(i3.u16.p51!=1))" U (("((i12.u26.p80==1)&&(i10.u30.p97==1))" | G"((i14.u34.p106!=1)||(i13.u37.p121!=1))") U "((i14.u34.p106==1)&&(i13.u37.p121==1))"))
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
10181 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,189.862,3059452,1,0,4.62166e+06,245,804,9.31296e+06,92,1562,948
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-005A-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G((X("((i7.u20.p65==1)&&(i7.u31.p99==1))"))||("((i3.u12.p42==1)&&(i3.u12.p44==1))"))))
Formula 12 simplified : !G("((i3.u12.p42==1)&&(i3.u12.p44==1))" | X"((i7.u20.p65==1)&&(i7.u31.p99==1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,189.914,3059452,1,0,4.62166e+06,245,955,9.31296e+06,105,1562,14692
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-005A-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
BK_STOP 1590608638479
--------------------
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="ShieldPPPt-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 ShieldPPPt-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-159033476000634"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-005A.tgz
mv ShieldPPPt-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 '
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 ;