About the Execution of ITS-Tools for AutoFlight-PT-05a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15743.430 | 10762.00 | 25121.00 | 224.50 | FTFFFFFFFTFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2020-input.r006-smll-158897516000438.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 AutoFlight-PT-05a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-smll-158897516000438
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.4K Mar 25 23:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 25 23:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 18:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 18:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 15:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 25 15:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 10:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 10:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 25 17:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 36K Mar 24 05:37 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 AutoFlight-PT-05a-00
FORMULA_NAME AutoFlight-PT-05a-01
FORMULA_NAME AutoFlight-PT-05a-02
FORMULA_NAME AutoFlight-PT-05a-03
FORMULA_NAME AutoFlight-PT-05a-04
FORMULA_NAME AutoFlight-PT-05a-05
FORMULA_NAME AutoFlight-PT-05a-06
FORMULA_NAME AutoFlight-PT-05a-07
FORMULA_NAME AutoFlight-PT-05a-08
FORMULA_NAME AutoFlight-PT-05a-09
FORMULA_NAME AutoFlight-PT-05a-10
FORMULA_NAME AutoFlight-PT-05a-11
FORMULA_NAME AutoFlight-PT-05a-12
FORMULA_NAME AutoFlight-PT-05a-13
FORMULA_NAME AutoFlight-PT-05a-14
FORMULA_NAME AutoFlight-PT-05a-15
=== Now, execution of the tool begins
BK_START 1589545236424
[2020-05-15 12:20:39] [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-15 12:20:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 12:20:39] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2020-05-15 12:20:39] [INFO ] Transformed 132 places.
[2020-05-15 12:20:39] [INFO ] Transformed 130 transitions.
[2020-05-15 12:20:39] [INFO ] Found NUPN structural information;
[2020-05-15 12:20:39] [INFO ] Parsed PT model containing 132 places and 130 transitions in 137 ms.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 3091 resets, run finished after 416 ms. (steps per millisecond=240 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1]
// Phase 1: matrix 105 rows 132 cols
[2020-05-15 12:20:40] [INFO ] Computed 34 place invariants in 12 ms
[2020-05-15 12:20:40] [INFO ] [Real]Absence check using 33 positive place invariants in 42 ms returned sat
[2020-05-15 12:20:40] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-15 12:20:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 12:20:40] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2020-05-15 12:20:40] [INFO ] State equation strengthened by 25 read => feed constraints.
[2020-05-15 12:20:40] [INFO ] [Real]Added 25 Read/Feed constraints in 6 ms returned sat
[2020-05-15 12:20:40] [INFO ] Computed and/alt/rep : 104/311/104 causal constraints in 37 ms.
[2020-05-15 12:20:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 12:20:40] [INFO ] [Nat]Absence check using 33 positive place invariants in 39 ms returned sat
[2020-05-15 12:20:40] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-15 12:20:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 12:20:40] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2020-05-15 12:20:40] [INFO ] [Nat]Added 25 Read/Feed constraints in 11 ms returned sat
[2020-05-15 12:20:41] [INFO ] Computed and/alt/rep : 104/311/104 causal constraints in 20 ms.
[2020-05-15 12:20:41] [INFO ] Added : 103 causal constraints over 21 iterations in 498 ms. Result :sat
[2020-05-15 12:20:41] [INFO ] [Real]Absence check using 33 positive place invariants in 27 ms returned sat
[2020-05-15 12:20:41] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 4 ms returned sat
[2020-05-15 12:20:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 12:20:41] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2020-05-15 12:20:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 12:20:41] [INFO ] [Nat]Absence check using 33 positive place invariants in 27 ms returned sat
[2020-05-15 12:20:41] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-15 12:20:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 12:20:42] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2020-05-15 12:20:42] [INFO ] [Nat]Added 25 Read/Feed constraints in 9 ms returned sat
[2020-05-15 12:20:42] [INFO ] Computed and/alt/rep : 104/311/104 causal constraints in 14 ms.
[2020-05-15 12:20:42] [INFO ] Added : 104 causal constraints over 21 iterations in 374 ms. Result :sat
[2020-05-15 12:20:42] [INFO ] Deduced a trap composed of 51 places in 83 ms
[2020-05-15 12:20:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2020-05-15 12:20:42] [INFO ] [Real]Absence check using 33 positive place invariants in 17 ms returned sat
[2020-05-15 12:20:42] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-15 12:20:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-15 12:20:42] [INFO ] Flatten gal took : 72 ms
FORMULA AutoFlight-PT-05a-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-15 12:20:43] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 12:20:43] [INFO ] Applying decomposition
[2020-05-15 12:20:43] [INFO ] Flatten gal took : 19 ms
[2020-05-15 12:20:43] [INFO ] Input system was already deterministic with 105 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/graph15608115272963780697.txt, -o, /tmp/graph15608115272963780697.bin, -w, /tmp/graph15608115272963780697.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/graph15608115272963780697.bin, -l, -1, -v, -w, /tmp/graph15608115272963780697.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 105 rows 132 cols
[2020-05-15 12:20:43] [INFO ] Computed 34 place invariants in 14 ms
inv : p0 + p21 = 1
inv : p0 + p18 + p19 + p20 = 1
inv : p0 + p45 + p46 = 1
inv : p0 + p38 = 1
inv : p0 + p32 + p33 + p34 = 1
inv : p0 + p112 + p113 + p114 + p115 + p116 + p117 = 1
inv : p0 + p28 = 1
inv : p0 + p4 + p5 + p6 = 1
inv : p0 + p8 + p9 + p10 = 1
inv : p0 + p100 + p101 + p102 + p103 + p104 + p105 = 1
inv : p0 + p1 + p2 + p3 = 1
inv : p0 + p7 = 1
inv : p0 + p106 + p107 + p108 + p109 + p110 + p111 = 1
inv : p0 + p14 = 1
inv : p0 + p47 = 1
inv : p0 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 = 1
inv : p0 + p118 + p119 + p120 + p121 + p122 + p123 = 1
inv : 7*p0 + p77 + p99 + p105 + p111 + p117 + p123 + p129 + p131 = 7
inv : p0 + p29 + p30 + p31 = 1
inv : p0 + p50 = 1
inv : p0 + p39 + p40 = 1
inv : p0 + p36 + p37 = 1
inv : p0 + p25 + p26 + p27 = 1
inv : p0 + p41 = 1
inv : p0 + p15 + p16 + p17 = 1
inv : p0 + p42 + p43 = 1
inv : p0 + p44 = 1
inv : -6*p0 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 - p99 - p105 - p111 - p117 - p123 - p129 - p131 = -6
inv : p0 + p130 + p131 = 1
inv : p0 + p22 + p23 + p24 = 1
inv : p0 + p48 + p49 = 1
inv : p0 + p124 + p125 + p126 + p127 + p128 + p129 = 1
inv : p0 + p11 + p12 + p13 = 1
inv : p0 + p35 = 1
Total of 34 invariants.
[2020-05-15 12:20:43] [INFO ] Computed 34 place invariants in 20 ms
[2020-05-15 12:20:43] [INFO ] Decomposing Gal with order
[2020-05-15 12:20:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 12:20:43] [INFO ] Removed a total of 10 redundant transitions.
[2020-05-15 12:20:43] [INFO ] Flatten gal took : 74 ms
[2020-05-15 12:20:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2020-05-15 12:20:43] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 12 ms
[2020-05-15 12:20:43] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 15 LTL properties
Checking formula 0 : !((("(i5.u34.p88==1)")U(((G("((i8.u1.p6!=1)||(i8.u38.p102!=1))"))||(X("((i8.u1.p6==1)&&(i8.u38.p102==1))")))||((F("((u47.p106==1)&&(u47.p131==1))"))&&(X("(i5.u34.p88==1)"))))))
Formula 0 simplified : !("(i5.u34.p88==1)" U (G"((i8.u1.p6!=1)||(i8.u38.p102!=1))" | X"((i8.u1.p6==1)&&(i8.u38.p102==1))" | (F"((u47.p106==1)&&(u47.p131==1))" & X"(i5.u34.p88==1)")))
built 20 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 32 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
[2020-05-15 12:20:43] [INFO ] Proved 132 variables to be positive in 394 ms
[2020-05-15 12:20:43] [INFO ] Computing symmetric may disable matrix : 105 transitions.
[2020-05-15 12:20:43] [INFO ] Computation of disable matrix completed :0/105 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 12:20:43] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 12:20:43] [INFO ] Computing symmetric may enable matrix : 105 transitions.
[2020-05-15 12:20:43] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions t119, t120, i0.u2.t42, i0.u4.t36, i1.i0.u5.t33, i3.u6.t30, i3.u9.t24, i7.i0.u7.t27, i8.u0.t48, i8.u1.t45, i9.i0.u3.t39, i10.u10.t21, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/93/12/105
Computing Next relation with stutter on 10 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
31 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.358668,24100,1,0,11922,3311,1687,13955,538,8309,29994
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-05a-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((X(!((((X("((i10.u46.p50==1)&&(i10.u46.p128==1))"))&&("(i6.u19.p35==1)"))&&("(i5.u32.p83==1)"))U("(i7.i1.u15.p46==1)"))))||((X("((i9.i1.u13.p39==1)&&(i9.i1.u40.p109==1))"))U(X("((i10.u46.p50!=1)||(i10.u46.p128!=1))")))))
Formula 1 simplified : !(X!(("(i5.u32.p83==1)" & "(i6.u19.p35==1)" & X"((i10.u46.p50==1)&&(i10.u46.p128==1))") U "(i7.i1.u15.p46==1)") | (X"((i9.i1.u13.p39==1)&&(i9.i1.u40.p109==1))" U X"((i10.u46.p50!=1)||(i10.u46.p128!=1))"))
Computing Next relation with stutter on 10 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,0.36575,24724,1,0,11922,3311,1769,13955,544,8309,30011
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA AutoFlight-PT-05a-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(X(X(X(G((G(X(G("((u47.p99==1)&&(u47.p130==1))"))))||(X(("((i8.u12.p38==1)&&(i8.u12.p104==1))")U("((u47.p99==1)&&(u47.p130==1))"))))))))))
Formula 2 simplified : !FXXXG(GXG"((u47.p99==1)&&(u47.p130==1))" | X("((i8.u12.p38==1)&&(i8.u12.p104==1))" U "((u47.p99==1)&&(u47.p130==1))"))
Computing Next relation with stutter on 10 deadlock states
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
6 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.432351,26304,1,0,14372,4554,1876,17284,560,13089,36059
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA AutoFlight-PT-05a-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(X(("(i5.u32.p84==1)")U((!(X("((i6.u30.p21==1)&&(i6.u25.p69==1))")))&&("((i6.u30.p21!=1)||(i6.u25.p69!=1))"))))))
Formula 3 simplified : !GX("(i5.u32.p84==1)" U ("((i6.u30.p21!=1)||(i6.u25.p69!=1))" & !X"((i6.u30.p21==1)&&(i6.u25.p69==1))"))
Computing Next relation with stutter on 10 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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.458777,27096,1,0,16468,4618,1897,19307,560,13717,41573
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA AutoFlight-PT-05a-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(G(X(!(X(!(F((G("((i7.i0.u7.p27==1)&&(i7.i1.u43.p120==1))"))||("(i7.i1.u15.p46==1)"))))))))))
Formula 4 simplified : !FGX!X!F("(i7.i1.u15.p46==1)" | G"((i7.i0.u7.p27==1)&&(i7.i1.u43.p120==1))")
Computing Next relation with stutter on 10 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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.497099,28416,1,0,19577,4637,1940,22118,560,13862,48087
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA AutoFlight-PT-05a-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F((G("((((i9.i0.u3.p12==1)&&(i1.i0.u5.p20==1))&&(i1.i0.u41.p114==1))&&(i1.i0.u5.p19!=1))"))&&("((i3.u9.p31==1)||((i1.i0.u5.p20==1)&&(i1.i0.u41.p114==1)))"))))
Formula 5 simplified : !F("((i3.u9.p31==1)||((i1.i0.u5.p20==1)&&(i1.i0.u41.p114==1)))" & G"((((i9.i0.u3.p12==1)&&(i1.i0.u5.p20==1))&&(i1.i0.u41.p114==1))&&(i1.i0.u5.p19!=1))")
Computing Next relation with stutter on 10 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
12 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.616508,33168,1,0,29364,4731,2025,33621,562,14751,68074
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA AutoFlight-PT-05a-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((X(F("((i6.u19.p35!=1)||(i6.u26.p71!=1))")))&&(F(G("((i7.i0.u7.p26==1)||(i5.u34.p88==1))")))))
Formula 6 simplified : !(XF"((i6.u19.p35!=1)||(i6.u26.p71!=1))" & FG"((i7.i0.u7.p26==1)||(i5.u34.p88==1))")
Computing Next relation with stutter on 10 deadlock states
4 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
82 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.43793,61416,1,0,103800,4778,2072,99450,562,15821,159428
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA AutoFlight-PT-05a-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((((("(i2.i1.u22.p62==1)")U(G("(i2.i1.u23.p66==1)")))||(X(X("(i2.i1.u23.p66==1)"))))||(G("(i2.i1.u22.p62==1)"))))
Formula 7 simplified : !(("(i2.i1.u22.p62==1)" U G"(i2.i1.u23.p66==1)") | XX"(i2.i1.u23.p66==1)" | G"(i2.i1.u22.p62==1)")
Computing Next relation with stutter on 10 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
6 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.49958,62208,1,0,105249,4837,2080,100727,562,16418,162439
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA AutoFlight-PT-05a-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((X("(i1.i1.u14.p43!=1)"))U(X((F("(i1.i1.u14.p43==1)"))&&("(i8.u0.p3==1)")))))
Formula 8 simplified : !(X"(i1.i1.u14.p43!=1)" U X("(i8.u0.p3==1)" & F"(i1.i1.u14.p43==1)"))
Computing Next relation with stutter on 10 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,1.50136,62472,1,0,105249,4837,2095,100727,562,16418,162473
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA AutoFlight-PT-05a-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F("((i6.u17.p7==1)&&(i6.u35.p89==1))")))
Formula 9 simplified : !F"((i6.u17.p7==1)&&(i6.u35.p89==1))"
Computing Next relation with stutter on 10 deadlock states
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,1.52022,62472,1,0,106140,4838,2133,101734,562,16533,165855
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA AutoFlight-PT-05a-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X((G("(i7.i1.u15.p46==1)"))||(G("(((i7.i1.u15.p46==1)&&(i2.i1.u22.p62==1))&&(i8.u11.p37!=1))")))))
Formula 10 simplified : !X(G"(i7.i1.u15.p46==1)" | G"(((i7.i1.u15.p46==1)&&(i2.i1.u22.p62==1))&&(i8.u11.p37!=1))")
Computing Next relation with stutter on 10 deadlock states
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,1.54573,63792,1,0,108300,4896,2195,103484,564,16973,169350
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA AutoFlight-PT-05a-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((G("(i10.u16.p49==1)"))||(!((F((X("(i1.i0.u5.p20==1)"))||("(i3.u9.p31==1)")))U(G(F("(i10.u16.p49==1)")))))))
Formula 11 simplified : !(G"(i10.u16.p49==1)" | !(F("(i3.u9.p31==1)" | X"(i1.i0.u5.p20==1)") U GF"(i10.u16.p49==1)"))
Computing Next relation with stutter on 10 deadlock states
[2020-05-15 12:20:45] [INFO ] Computing symmetric co enabling matrix : 105 transitions.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
35 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.90372,74616,1,0,136917,4896,2221,124166,564,16973,201934
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA AutoFlight-PT-05a-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(G(!(F((G("(i1.i1.u14.p43!=1)"))||(X("((i9.i1.u13.p39==1)&&(i9.i1.u40.p109==1))"))))))))
Formula 12 simplified : !XG!F(G"(i1.i1.u14.p43!=1)" | X"((i9.i1.u13.p39==1)&&(i9.i1.u40.p109==1))")
Computing Next relation with stutter on 10 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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,1.94205,75936,1,0,139749,4907,2244,126461,564,17056,207057
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA AutoFlight-PT-05a-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G(X(X("((i6.u17.p7==1)&&(i6.u18.p52==1))")))))
Formula 13 simplified : !GXX"((i6.u17.p7==1)&&(i6.u18.p52==1))"
Computing Next relation with stutter on 10 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,1.94406,76200,1,0,139749,4907,2261,126461,564,17056,207148
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA AutoFlight-PT-05a-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F(((F("((i6.u24.p14==1)&&(i6.u18.p53==1))"))&&("(i6.u24.p14==1)"))&&("(i6.u18.p53==1)"))))
Formula 14 simplified : !F("(i6.u18.p53==1)" & "(i6.u24.p14==1)" & F"((i6.u24.p14==1)&&(i6.u18.p53==1))")
Computing Next relation with stutter on 10 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.95141,76200,1,0,140092,4907,2298,126940,564,17056,208385
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA AutoFlight-PT-05a-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
[2020-05-15 12:20:45] [WARNING] Script execution failed on command (assert (>= (select s0 108) 0)) with error
[2020-05-15 12:20:45] [WARNING] Script execution failed on command (assert (>= (select s0 109) 0)) with error (error "Failed to assert expression: java.io.IOException: Stream closed (>= (select s0 109) 0)")
[(declare-fun s0 () (Array Int Int)), (assert (= 1 (+ (select s0 0) (select s0 106) (select s0 107) (select s0 108) (select s0 109) (select s0 110) (select s0 111)))), (assert (= 1 (+ (select s0 0) (select s0 11) (select s0 12) (select s0 13)))), (assert (and (>= (select s0 13) 1) (>= (select s0 108) 1))), (assert (>= (select s0 0) 0)), (assert (>= (select s0 11) 0)), (assert (>= (select s0 12) 0)), (assert (>= (select s0 13) 0)), (assert (>= (select s0 106) 0)), (assert (>= (select s0 107) 0)), (assert (>= (select s0 108) 0)), (assert (>= (select s0 109) 0)), (assert (>= (select s0 110) 0)), (assert (>= (select s0 111) 0))]
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@7a62b8c5
java.lang.RuntimeException: SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@7a62b8c5
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:450)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
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-15 12:20:45] [INFO ] Built C files in 2863ms 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 1589545247186
--------------------
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="AutoFlight-PT-05a"
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 AutoFlight-PT-05a, 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 r006-smll-158897516000438"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-05a.tgz
mv AutoFlight-PT-05a 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 ;