Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r111-csrt-158961257800522.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Parking-PT-208, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961257800522
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 228K
-rw-r--r-- 1 mcc users 3.9K Apr 11 23:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 11 23:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 10 22:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 10 22:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 10 07:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 10 07:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 9 12:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 9 12:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 10 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 10 22:21 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 49K 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 Parking-PT-208-00
FORMULA_NAME Parking-PT-208-01
FORMULA_NAME Parking-PT-208-02
FORMULA_NAME Parking-PT-208-03
FORMULA_NAME Parking-PT-208-04
FORMULA_NAME Parking-PT-208-05
FORMULA_NAME Parking-PT-208-06
FORMULA_NAME Parking-PT-208-07
FORMULA_NAME Parking-PT-208-08
FORMULA_NAME Parking-PT-208-09
FORMULA_NAME Parking-PT-208-10
FORMULA_NAME Parking-PT-208-11
FORMULA_NAME Parking-PT-208-12
FORMULA_NAME Parking-PT-208-13
FORMULA_NAME Parking-PT-208-14
FORMULA_NAME Parking-PT-208-15

=== Now, execution of the tool begins

BK_START 1590000673615

[2020-05-20 18:51:15] [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-20 18:51:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-20 18:51:15] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2020-05-20 18:51:15] [INFO ] Transformed 137 places.
[2020-05-20 18:51:15] [INFO ] Transformed 201 transitions.
[2020-05-20 18:51:15] [INFO ] Found NUPN structural information;
[2020-05-20 18:51:15] [INFO ] Parsed PT model containing 137 places and 201 transitions in 123 ms.
Ensure Unique test removed 84 transitions
Reduce redundant transitions removed 84 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 2897 resets, run finished after 230 ms. (steps per millisecond=434 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 117 rows 137 cols
[2020-05-20 18:51:16] [INFO ] Computed 34 place invariants in 13 ms
[2020-05-20 18:51:16] [INFO ] [Real]Absence check using 32 positive place invariants in 28 ms returned unsat
[2020-05-20 18:51:16] [INFO ] [Real]Absence check using 32 positive place invariants in 28 ms returned sat
[2020-05-20 18:51:16] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-20 18:51:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:16] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2020-05-20 18:51:16] [INFO ] State equation strengthened by 26 read => feed constraints.
[2020-05-20 18:51:16] [INFO ] [Real]Added 26 Read/Feed constraints in 18 ms returned sat
[2020-05-20 18:51:16] [INFO ] Computed and/alt/rep : 116/396/116 causal constraints in 12 ms.
[2020-05-20 18:51:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:51:16] [INFO ] [Nat]Absence check using 32 positive place invariants in 24 ms returned sat
[2020-05-20 18:51:16] [INFO ] [Nat]Absence check using 32 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-20 18:51:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:16] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2020-05-20 18:51:16] [INFO ] [Nat]Added 26 Read/Feed constraints in 7 ms returned sat
[2020-05-20 18:51:16] [INFO ] Computed and/alt/rep : 116/396/116 causal constraints in 46 ms.
[2020-05-20 18:51:17] [INFO ] Added : 103 causal constraints over 21 iterations in 477 ms. Result :sat
[2020-05-20 18:51:17] [INFO ] [Real]Absence check using 32 positive place invariants in 13 ms returned sat
[2020-05-20 18:51:17] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-20 18:51:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:17] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2020-05-20 18:51:17] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-05-20 18:51:17] [INFO ] Computed and/alt/rep : 116/396/116 causal constraints in 11 ms.
[2020-05-20 18:51:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:51:17] [INFO ] [Nat]Absence check using 32 positive place invariants in 16 ms returned sat
[2020-05-20 18:51:17] [INFO ] [Nat]Absence check using 32 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-20 18:51:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:17] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2020-05-20 18:51:17] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-05-20 18:51:17] [INFO ] Deduced a trap composed of 28 places in 85 ms
[2020-05-20 18:51:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2020-05-20 18:51:17] [INFO ] Computed and/alt/rep : 116/396/116 causal constraints in 14 ms.
[2020-05-20 18:51:18] [INFO ] Added : 112 causal constraints over 23 iterations in 285 ms. Result :sat
[2020-05-20 18:51:18] [INFO ] Deduced a trap composed of 28 places in 60 ms
[2020-05-20 18:51:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2020-05-20 18:51:18] [INFO ] [Real]Absence check using 32 positive place invariants in 51 ms returned sat
[2020-05-20 18:51:18] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 3 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-20 18:51:18] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-20 18:51:18] [INFO ] Flatten gal took : 62 ms
FORMULA Parking-PT-208-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-20 18:51:18] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-20 18:51:18] [INFO ] Applying decomposition
[2020-05-20 18:51:18] [INFO ] Flatten gal took : 10 ms
[2020-05-20 18:51:18] [INFO ] Input system was already deterministic with 117 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 117 rows 137 cols
[2020-05-20 18:51:18] [INFO ] Computed 34 place invariants in 20 ms
inv : p0 + p5 + p6 = 1
inv : p0 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 = 1
inv : p0 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 = 1
inv : -4*p0 + p87 + p88 + p89 + p90 + p91 + p92 + p93 - p102 - p110 - p118 - p130 - p132 = -4
inv : p0 + p85 + p86 = 1
inv : p0 + p15 + p16 = 1
inv : p0 + p133 + p134 + p135 + p136 = 1
inv : p0 + p17 + p18 = 1
inv : p0 + p65 + p66 = 1
inv : p0 + p75 + p76 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p131 + p132 = 1
inv : p0 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 = 1
inv : p0 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 = 1
inv : p0 + p9 + p10 = 1
inv : p0 + p73 + p74 = 1
inv : -4*p0 + p21 + p22 + p23 + p24 + p25 + p26 + p27 - p36 - p44 - p52 - p64 - p66 = -4
inv : p0 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 = 1
inv : p0 + p79 + p80 = 1
inv : p0 + p67 + p68 + p69 + p70 = 1
inv : p0 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 = 1
inv : p0 + p71 + p72 = 1
inv : p0 + p11 + p12 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p81 + p82 = 1
inv : p0 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 = 1
inv : 5*p0 + p94 + p102 + p110 + p118 + p130 + p132 = 5
inv : p0 + p77 + p78 = 1
inv : p0 + p13 + p14 = 1
inv : p0 + p7 + p8 = 1
inv : p0 + p19 + p20 = 1
inv : p0 + p83 + p84 = 1
inv : 5*p0 + p28 + p36 + p44 + p52 + p64 + p66 = 5
inv : p0 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 = 1
Total of 34 invariants.
[2020-05-20 18:51:18] [INFO ] Computed 34 place invariants in 21 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph6073625786121324865.txt, -o, /tmp/graph6073625786121324865.bin, -w, /tmp/graph6073625786121324865.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/graph6073625786121324865.bin, -l, -1, -v, -w, /tmp/graph6073625786121324865.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-20 18:51:19] [INFO ] Decomposing Gal with order
[2020-05-20 18:51:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-20 18:51:19] [INFO ] Removed a total of 4 redundant transitions.
[2020-05-20 18:51:19] [INFO ] Flatten gal took : 71 ms
[2020-05-20 18:51:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2020-05-20 18:51:19] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 31 ms
[2020-05-20 18:51:19] [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 10 LTL properties
Checking formula 0 : !((X(G(("((i8.u41.p133==1)||((i8.u41.p91==1)&&(i8.u41.p136==1)))")||((G(X("((i8.u41.p91==1)&&(i8.u41.p136==1))")))&&(F("((i9.u25.p77==1)&&(i6.u40.p101==1))")))))))
Formula 0 simplified : !XG("((i8.u41.p133==1)||((i8.u41.p91==1)&&(i8.u41.p136==1)))" | (GX"((i8.u41.p91==1)&&(i8.u41.p136==1))" & F"((i9.u25.p77==1)&&(i6.u40.p101==1))"))
built 22 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 12 ordering constraints for composite.
built 15 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 12 ordering constraints for composite.
built 15 ordering constraints for composite.
built 14 ordering constraints for composite.
[2020-05-20 18:51:19] [INFO ] Proved 137 variables to be positive in 424 ms
[2020-05-20 18:51:19] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2020-05-20 18:51:19] [INFO ] Computation of disable matrix completed :0/117 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-20 18:51:19] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-20 18:51:19] [INFO ] Computing symmetric may enable matrix : 117 transitions.
Reverse transition relation is NOT exact ! Due to transitions t169, t170, t171, t197, t198, t199, i0.t196, i4.u21.t62, i4.u21.t64, i6.t168, i8.u41.t4, i8.u41.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/105/12/117
[2020-05-20 18:51:19] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Computing Next relation with stutter on 289 deadlock states
6 unique states visited
6 strongly connected components in search stack
8 transitions explored
6 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.168841,21808,1,0,8000,4725,1789,11364,667,9205,14956
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-208-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((!(G(!(G((F("(i8.u35.p115==1)"))&&(F(G("((i1.u2.p21==1)&&(i0.u20.p66==1))"))))))))&&(!(G("(i8.u35.p115==1)")))))
Formula 1 simplified : !(!G!G(F"(i8.u35.p115==1)" & FG"((i1.u2.p21==1)&&(i0.u20.p66==1))") & !G"(i8.u35.p115==1)")
Computing Next relation with stutter on 289 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.178225,22580,1,0,8726,4748,1851,12432,670,9310,16176
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Parking-PT-208-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(!(F("(i4.u15.p49==1)")))))
Formula 2 simplified : !F!F"(i4.u15.p49==1)"
Computing Next relation with stutter on 289 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
29 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.459194,33932,1,0,36447,4775,1890,48457,670,9707,53597
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Parking-PT-208-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(G(((!(("(i2.i0.u4.p10!=1)")U("(i2.i0.u4.p10==1)")))||(X("((i8.u33.p105==1)&&(i8.u41.p136==1))")))||(X("(i10.i1.u29.p86==1)"))))))
Formula 3 simplified : !FG(!("(i2.i0.u4.p10!=1)" U "(i2.i0.u4.p10==1)") | X"((i8.u33.p105==1)&&(i8.u41.p136==1))" | X"(i10.i1.u29.p86==1)")
Computing Next relation with stutter on 289 deadlock states
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.492396,35776,1,0,39521,4783,1975,52212,672,9754,59645
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Parking-PT-208-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((!(X(X(F(("((i8.u41.p99!=1)||(i8.u41.p136!=1))")U("(((i9.u27.p82==1)&&(i10.i0.u16.p53==1))&&(i0.u20.p66==1))"))))))||(!(X("(i9.u27.p82==1)")))))
Formula 4 simplified : !(!XXF("((i8.u41.p99!=1)||(i8.u41.p136!=1))" U "(((i9.u27.p82==1)&&(i10.i0.u16.p53==1))&&(i0.u20.p66==1))") | !X"(i9.u27.p82==1)")
Computing Next relation with stutter on 289 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
13 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.622469,41316,1,0,51723,4803,2016,77203,672,9823,75782
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Parking-PT-208-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(("(i4.u13.p41==1)")U(X(X(((X("((i7.i0.u24.p76==1)&&(i7.i0.u31.p97==1))"))||("(i4.u13.p41==1)"))||("((((i7.i0.u24.p76==1)&&(i7.i0.u31.p97==1))&&(i2.i0.u4.p10==1))&&(i2.i0.u11.p31==1))")))))))
Formula 5 simplified : !F("(i4.u13.p41==1)" U XX("((((i7.i0.u24.p76==1)&&(i7.i0.u31.p97==1))&&(i2.i0.u4.p10==1))&&(i2.i0.u11.p31==1))" | "(i4.u13.p41==1)" | X"((i7.i0.u24.p76==1)&&(i7.i0.u31.p97==1))"))
Computing Next relation with stutter on 289 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
10 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.724923,44744,1,0,58933,4809,2090,84846,672,9935,89474
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Parking-PT-208-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F((F((X("((i5.u22.p87==1)&&(i6.u40.p132==1))"))||(G("(i5.u22.p72==1)"))))&&((F("(i8.u33.p106==1)"))||(G(X("(i5.u22.p72!=1)")))))))
Formula 6 simplified : !F(F(X"((i5.u22.p87==1)&&(i6.u40.p132==1))" | G"(i5.u22.p72==1)") & (F"(i8.u33.p106==1)" | GX"(i5.u22.p72!=1)"))
Computing Next relation with stutter on 289 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 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.793323,47328,1,0,64574,4813,2137,93387,673,10076,97786
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Parking-PT-208-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(F((G(X("(i8.u41.p133==1)")))U((F(X(G("((i8.u35.p116==1)&&(i8.u41.p136==1))"))))U(G("(i5.u30.p90==1)")))))))
Formula 7 simplified : F(GX"(i8.u41.p133==1)" U (FXG"((i8.u35.p116==1)&&(i8.u41.p136==1))" U G"(i5.u30.p90==1)"))
Computing Next relation with stutter on 289 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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,0.796935,47556,1,0,64628,4813,2157,93468,673,10076,98096
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Parking-PT-208-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((G("(i8.u35.p115==1)"))||((F("((i0.u20.p52==1)&&(i0.u20.p65==1))"))&&(!(G(X("((i0.u20.p52==1)&&(i0.u20.p65==1))")))))))
Formula 8 simplified : !(G"(i8.u35.p115==1)" | (F"((i0.u20.p52==1)&&(i0.u20.p65==1))" & !GX"((i0.u20.p52==1)&&(i0.u20.p65==1))"))
Computing Next relation with stutter on 289 deadlock states
4 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.803553,47792,1,0,65138,4813,2214,93847,678,10076,99233
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Parking-PT-208-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F("((i3.u5.p11==1)&&(i0.u20.p35==1))")))
Formula 9 simplified : !F"((i3.u5.p11==1)&&(i0.u20.p35==1))"
Computing Next relation with stutter on 289 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,0.867395,50168,1,0,71600,4861,2247,99842,678,10310,108362
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Parking-PT-208-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:768)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:512)
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-20 18:51:20] [INFO ] Built C files in 1534ms 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 1590000680545

--------------------
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="Parking-PT-208"
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 Parking-PT-208, 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 r111-csrt-158961257800522"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-208.tgz
mv Parking-PT-208 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;