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

About the Execution of ITS-Tools for DiscoveryGPU-PT-06b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.570 11437.00 26993.00 64.10 TTFTFFFFFTTFTFFT 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.r066-tajo-158922814500594.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 DiscoveryGPU-PT-06b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814500594
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.5K Mar 31 06:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 31 06:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 29 23:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 29 23:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 28 14:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 27 07:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 27 07:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 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 46K 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 DiscoveryGPU-PT-06b-00
FORMULA_NAME DiscoveryGPU-PT-06b-01
FORMULA_NAME DiscoveryGPU-PT-06b-02
FORMULA_NAME DiscoveryGPU-PT-06b-03
FORMULA_NAME DiscoveryGPU-PT-06b-04
FORMULA_NAME DiscoveryGPU-PT-06b-05
FORMULA_NAME DiscoveryGPU-PT-06b-06
FORMULA_NAME DiscoveryGPU-PT-06b-07
FORMULA_NAME DiscoveryGPU-PT-06b-08
FORMULA_NAME DiscoveryGPU-PT-06b-09
FORMULA_NAME DiscoveryGPU-PT-06b-10
FORMULA_NAME DiscoveryGPU-PT-06b-11
FORMULA_NAME DiscoveryGPU-PT-06b-12
FORMULA_NAME DiscoveryGPU-PT-06b-13
FORMULA_NAME DiscoveryGPU-PT-06b-14
FORMULA_NAME DiscoveryGPU-PT-06b-15

=== Now, execution of the tool begins

BK_START 1590129154781

[2020-05-22 06:32:37] [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-22 06:32:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 06:32:37] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2020-05-22 06:32:37] [INFO ] Transformed 184 places.
[2020-05-22 06:32:37] [INFO ] Transformed 194 transitions.
[2020-05-22 06:32:37] [INFO ] Found NUPN structural information;
[2020-05-22 06:32:37] [INFO ] Parsed PT model containing 184 places and 194 transitions in 121 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 502 resets, run finished after 198 ms. (steps per millisecond=505 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 194 rows 184 cols
[2020-05-22 06:32:37] [INFO ] Computed 8 place invariants in 8 ms
[2020-05-22 06:32:37] [INFO ] [Real]Absence check using 8 positive place invariants in 18 ms returned sat
[2020-05-22 06:32:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 06:32:37] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2020-05-22 06:32:38] [INFO ] Deduced a trap composed of 50 places in 206 ms
[2020-05-22 06:32:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2020-05-22 06:32:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 06:32:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 282 ms returned sat
[2020-05-22 06:32:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 06:32:38] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2020-05-22 06:32:38] [INFO ] Deduced a trap composed of 50 places in 83 ms
[2020-05-22 06:32:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2020-05-22 06:32:38] [INFO ] Computed and/alt/rep : 193/458/193 causal constraints in 13 ms.
[2020-05-22 06:32:38] [INFO ] Added : 120 causal constraints over 24 iterations in 288 ms. Result :sat
[2020-05-22 06:32:39] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned unsat
[2020-05-22 06:32:39] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-22 06:32:39] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-05-22 06:32:39] [INFO ] Flatten gal took : 42 ms
FORMULA DiscoveryGPU-PT-06b-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 06:32:39] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 06:32:39] [INFO ] Applying decomposition
[2020-05-22 06:32:39] [INFO ] Flatten gal took : 18 ms
[2020-05-22 06:32:39] [INFO ] Input system was already deterministic with 194 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/graph8507062525452202376.txt, -o, /tmp/graph8507062525452202376.bin, -w, /tmp/graph8507062525452202376.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/graph8507062525452202376.bin, -l, -1, -v, -w, /tmp/graph8507062525452202376.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 194 rows 184 cols
[2020-05-22 06:32:39] [INFO ] Computed 8 place invariants in 4 ms
inv : p0 + p168 + p178 + p179 + p180 + p181 + p182 + p183 = 1
inv : p0 + p1 + p2 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 = 1
inv : p0 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 = 1
inv : p0 + p1 + p2 + p3 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 = 1
inv : p0 + p1 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 = 1
inv : p0 + p1 + p2 + p3 + p4 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 = 1
Total of 8 invariants.
[2020-05-22 06:32:39] [INFO ] Computed 8 place invariants in 5 ms
[2020-05-22 06:32:39] [INFO ] Decomposing Gal with order
[2020-05-22 06:32:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 06:32:39] [INFO ] Removed a total of 49 redundant transitions.
[2020-05-22 06:32:39] [INFO ] Flatten gal took : 49 ms
[2020-05-22 06:32:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2020-05-22 06:32:39] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 5 ms
[2020-05-22 06:32:39] [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 8 LTL properties
Checking formula 0 : !((!(((G(X("(i13.u36.p90==1)")))||(X("(i25.u0.p168==1)")))U(G(X("(i27.u65.p180==1)"))))))
Formula 0 simplified : (GX"(i13.u36.p90==1)" | X"(i25.u0.p168==1)") U GX"(i27.u65.p180==1)"
built 57 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
[2020-05-22 06:32:39] [INFO ] Proved 184 variables to be positive in 288 ms
[2020-05-22 06:32:39] [INFO ] Computing symmetric may disable matrix : 194 transitions.
[2020-05-22 06:32:39] [INFO ] Computation of disable matrix completed :0/194 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:32:39] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:32:39] [INFO ] Computing symmetric may enable matrix : 194 transitions.
[2020-05-22 06:32:39] [INFO ] Computation of Complete enable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:32:40] [INFO ] Computing symmetric co enabling matrix : 194 transitions.
Reverse transition relation is NOT exact ! Due to transitions t9, u62.t11, u62.t12, u62.t14, i1.u3.t111, i1.u3.t127, i2.u5.t121, i2.u5.t123, i3.u8.t117, i3.u8.t125, i5.u13.t99, i5.u13.t107, i6.u15.t103, i6.u15.t105, i8.u12.t93, i8.u12.t109, i9.u24.t84, i9.u24.t86, i10.u27.t80, i10.u27.t88, i12.u31.t74, i12.u31.t90, i13.u36.t65, i13.u36.t67, i14.u34.t61, i14.u34.t69, i16.u33.t55, i16.u33.t71, i17.u44.t46, i17.u44.t48, i18.u47.t42, i18.u47.t50, i20.u51.t36, i20.u51.t52, i21.u53.t27, i21.u53.t29, i22.u56.t23, i22.u56.t31, i24.u60.t17, i24.u60.t33, i27.t3, i27.u65.t4, i27.u65.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/151/43/194
Computing Next relation with stutter on 64 deadlock states
40 unique states visited
0 strongly connected components in search stack
39 transitions explored
14 items max in DFS search stack
105 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.08481,48180,1,0,69428,363,1978,91739,241,1275,234219
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-06b-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(!(X(X((X(F(G("(i24.u60.p164==1)"))))||(G(F("(i23.u58.p159==1)")))))))))
Formula 1 simplified : !G!XX(XFG"(i24.u60.p164==1)" | GF"(i23.u58.p159==1)")
Computing Next relation with stutter on 64 deadlock states
42 unique states visited
42 strongly connected components in search stack
43 transitions explored
42 items max in DFS search stack
65 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.7445,74520,1,0,124266,402,2098,176017,244,1694,349623
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-06b-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(G(((((F("(i8.u12.p34==1)"))||("(i8.u20.p55==1)"))||("((i8.u12.p57==1)&&(u62.p175==1))"))&&("(i8.u20.p55!=1)"))U("(i8.u12.p34==1)")))))
Formula 2 simplified : G(("(i8.u20.p55!=1)" & ("((i8.u12.p57==1)&&(u62.p175==1))" | "(i8.u20.p55==1)" | F"(i8.u12.p34==1)")) U "(i8.u12.p34==1)")
Computing Next relation with stutter on 64 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
105 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,2.798,115896,1,0,211684,407,2201,315157,244,2005,522596
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-06b-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(X(!(X(G("(i5.u13.p47==1)")))))))
Formula 3 simplified : X!XG"(i5.u13.p47==1)"
Computing Next relation with stutter on 64 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,2.8082,116156,1,0,211783,407,2223,315250,246,2005,523123
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-06b-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((!(G((G("(u62.p170!=1)"))&&("(u62.p170==1)"))))U(X("(i4.u10.p25!=1)"))))
Formula 4 simplified : !(!G("(u62.p170==1)" & G"(u62.p170!=1)") U X"(i4.u10.p25!=1)")
Computing Next relation with stutter on 64 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 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,2.81329,116156,1,0,211783,407,2250,315250,248,2005,523190
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-06b-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((!(G(X("(i23.u58.p160==1)")))))
Formula 5 simplified : GX"(i23.u58.p160==1)"
Computing Next relation with stutter on 64 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,2.81588,116156,1,0,211783,407,2264,315250,248,2005,523197
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-06b-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X((G((F("(i27.u64.p178==1)"))||("(i20.u51.p115==1)")))&&((!(G("(i20.u51.p115!=1)")))||(G("(i24.u60.p164==1)"))))))
Formula 6 simplified : !X(G("(i20.u51.p115==1)" | F"(i27.u64.p178==1)") & (!G"(i20.u51.p115!=1)" | G"(i24.u60.p164==1)"))
Computing Next relation with stutter on 64 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
24 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,3.05928,123992,1,0,229806,409,2300,334471,248,2033,559373
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-06b-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((!(F(X(F("((i19.u49.p133==1)&&(i11.u29.p79==1))")))))&&(!(G("(i19.u49.p133==1)")))))
Formula 7 simplified : !(!FXF"((i19.u49.p133==1)&&(i11.u29.p79==1))" & !G"(i19.u49.p133==1)")
Computing Next relation with stutter on 64 deadlock states
[2020-05-22 06:32:42] [INFO ] Computation of co-enabling matrix(43/194) took 2455 ms. Total solver calls (SAT/UNSAT): 1569(7/1562)
40 unique states visited
40 strongly connected components in search stack
41 transitions explored
40 items max in DFS search stack
196 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,5.01729,177564,1,0,343582,428,2364,495491,248,2166,826711
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-06b-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-22 06:32:45] [INFO ] Computation of co-enabling matrix(131/194) took 5473 ms. Total solver calls (SAT/UNSAT): 3466(80/3386)
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:482)
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-22 06:32:45] [INFO ] Built C files in 6614ms 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 1590129166218

--------------------
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="DiscoveryGPU-PT-06b"
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 DiscoveryGPU-PT-06b, 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 r066-tajo-158922814500594"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-06b.tgz
mv DiscoveryGPU-PT-06b 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 ;