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.r141-smll-158961510700234.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 Raft-PT-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r141-smll-158961510700234
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.3K Apr 12 07:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 07:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 11 08:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 11 08:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 10 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 10 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 9 21:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 9 21:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 41K Mar 24 05:38 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 Raft-PT-04-00
FORMULA_NAME Raft-PT-04-01
FORMULA_NAME Raft-PT-04-02
FORMULA_NAME Raft-PT-04-03
FORMULA_NAME Raft-PT-04-04
FORMULA_NAME Raft-PT-04-05
FORMULA_NAME Raft-PT-04-06
FORMULA_NAME Raft-PT-04-07
FORMULA_NAME Raft-PT-04-08
FORMULA_NAME Raft-PT-04-09
FORMULA_NAME Raft-PT-04-10
FORMULA_NAME Raft-PT-04-11
FORMULA_NAME Raft-PT-04-12
FORMULA_NAME Raft-PT-04-13
FORMULA_NAME Raft-PT-04-14
FORMULA_NAME Raft-PT-04-15

=== Now, execution of the tool begins

BK_START 1590053687044

[2020-05-21 09:34:49] [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-21 09:34:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 09:34:49] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2020-05-21 09:34:49] [INFO ] Transformed 88 places.
[2020-05-21 09:34:49] [INFO ] Transformed 160 transitions.
[2020-05-21 09:34:49] [INFO ] Found NUPN structural information;
[2020-05-21 09:34:49] [INFO ] Parsed PT model containing 88 places and 160 transitions in 196 ms.
Ensure Unique test removed 18 transitions
Reduce redundant transitions removed 18 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 583 ms. (steps per millisecond=171 ) properties seen :[1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-05-21 09:34:50] [INFO ] Flow matrix only has 126 transitions (discarded 16 similar events)
// Phase 1: matrix 126 rows 88 cols
[2020-05-21 09:34:50] [INFO ] Computed 16 place invariants in 8 ms
[2020-05-21 09:34:50] [INFO ] [Real]Absence check using 16 positive place invariants in 15 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-21 09:34:51] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-21 09:34:51] [INFO ] Flatten gal took : 68 ms
FORMULA Raft-PT-04-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-04-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-04-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-04-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-21 09:34:51] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 09:34:51] [INFO ] Applying decomposition
[2020-05-21 09:34:51] [INFO ] Flatten gal took : 27 ms
[2020-05-21 09:34:51] [INFO ] Input system was already deterministic with 142 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/graph3155041539021898612.txt, -o, /tmp/graph3155041539021898612.bin, -w, /tmp/graph3155041539021898612.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/graph3155041539021898612.bin, -l, -1, -v, -w, /tmp/graph3155041539021898612.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-21 09:34:51] [INFO ] Decomposing Gal with order
[2020-05-21 09:34:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-21 09:34:51] [INFO ] Removed a total of 102 redundant transitions.
[2020-05-21 09:34:51] [INFO ] Flatten gal took : 99 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 126 out of 142 initially.
// Phase 1: matrix 126 rows 88 cols
[2020-05-21 09:34:51] [INFO ] Computed 16 place invariants in 3 ms
inv : p0 + p76 + p77 + p78 + p79 + p80 = 1
inv : p0 + p11 + p12 + p13 + p14 + p15 = 1
inv : p0 + p56 + p57 + p58 + p59 + p60 = 1
inv : p0 + p51 + p52 + p53 + p54 + p55 = 1
inv : p0 + p26 + p27 + p28 + p29 + p30 = 1
inv : p0 + p36 + p37 + p38 + p39 + p40 = 1
inv : p0 + p31 + p32 + p33 + p34 + p35 = 1
inv : p0 + p21 + p22 + p23 + p24 + p25 = 1
inv : p0 + p41 + p42 + p43 + p44 + p45 = 1
inv : p0 + p46 + p47 + p48 + p49 + p50 = 1
inv : p0 + p16 + p17 + p18 + p19 + p20 = 1
inv : p0 + p6 + p7 + p8 + p9 + p10 = 1
inv : p0 + p71 + p72 + p73 + p74 + p75 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 = 1
inv : p0 + p61 + p62 + p63 + p64 + p65 = 1
inv : p0 + p66 + p67 + p68 + p69 + p70 = 1
Total of 16 invariants.
[2020-05-21 09:34:51] [INFO ] Computed 16 place invariants in 4 ms
[2020-05-21 09:34:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 104 labels/synchronizations in 24 ms.
[2020-05-21 09:34:51] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 7 ms
[2020-05-21 09:34:51] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 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 12 LTL properties
Checking formula 0 : !((X((((((!(X(G(X("(i4.u14.p73==1)")))))||("(i3.u7.p37!=1)"))||("(i3.u13.p70!=1)"))||("(i4.u6.p32!=1)"))||("(i2.u12.p65!=1)"))||(!(F(X("((i3.u7.p37==1)&&(i3.u13.p70==1))")))))))
Formula 0 simplified : !X("(i2.u12.p65!=1)" | "(i3.u7.p37!=1)" | "(i3.u13.p70!=1)" | "(i4.u6.p32!=1)" | !XGX"(i4.u14.p73==1)" | !FX"((i3.u7.p37==1)&&(i3.u13.p70==1))")
built 13 ordering constraints for composite.
built 12 ordering constraints for composite.
built 18 ordering constraints for composite.
built 12 ordering constraints for composite.
built 18 ordering constraints for composite.
built 7 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions i1.u15.t6, i1.u15.t7, i1.u15.t8, i1.u15.t10, i2.u12.t24, i2.u12.t25, i2.u12.t26, i2.u12.t28, i3.u13.t18, i3.u13.t19, i3.u13.t20, i3.u13.t22, i4.u14.t12, i4.u14.t13, i4.u14.t14, i4.u14.t16, i5.t159, i5.u18.t157, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/78/18/96
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.079896,18784,1,0,1626,169,978,2745,177,564,3120
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Raft-PT-04-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(((F(G(("((i2.u9.p47==1)&&(i2.u12.p65==1))")U(X("((i2.u2.p15==1)&&(i2.u12.p65==1))")))))&&("((i2.u3.p20!=1)||(i3.u13.p70!=1))"))&&((F("(i3.u13.p66==1)"))||("((i2.u2.p15==1)&&(i2.u12.p65==1))")))))
Formula 1 simplified : !F("((i2.u3.p20!=1)||(i3.u13.p70!=1))" & FG("((i2.u9.p47==1)&&(i2.u12.p65==1))" U X"((i2.u2.p15==1)&&(i2.u12.p65==1))") & ("((i2.u2.p15==1)&&(i2.u12.p65==1))" | F"(i3.u13.p66==1)"))
[2020-05-21 09:34:51] [INFO ] Proved 88 variables to be positive in 247 ms
[2020-05-21 09:34:51] [INFO ] Computing symmetric may disable matrix : 142 transitions.
[2020-05-21 09:34:51] [INFO ] Computation of disable matrix completed :0/142 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 09:34:51] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 09:34:51] [INFO ] Computing symmetric may enable matrix : 142 transitions.
[2020-05-21 09:34:51] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
4 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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.377373,28312,1,0,16838,180,1230,47813,189,859,20393
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Raft-PT-04-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(G((G(F("(i1.u15.p77!=1)")))||(((X("((i4.u6.p33==1)&&(i2.u12.p65==1))"))U("((i4.u6.p33==1)&&(i2.u12.p65==1))"))&&(F("(i2.u12.p65==1)")))))))
Formula 2 simplified : !FG(GF"(i1.u15.p77!=1)" | ((X"((i4.u6.p33==1)&&(i2.u12.p65==1))" U "((i4.u6.p33==1)&&(i2.u12.p65==1))") & F"(i2.u12.p65==1)"))
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 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.397453,28532,1,0,17814,182,1288,50489,190,906,22287
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Raft-PT-04-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(("(i3.u13.p70==1)")U(G(!(F("(i3.u13.p70==1)")))))))
Formula 3 simplified : !F("(i3.u13.p70==1)" U G!F"(i3.u13.p70==1)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
28 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.676251,35924,1,0,33180,182,1318,81805,190,988,32332
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Raft-PT-04-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(F(G((X("(i1.u15.p80==1)"))U(G((G("((i4.u6.p35==1)&&(i4.u14.p75==1))"))U(G("(i1.u15.p80==1)")))))))))
Formula 4 simplified : !XFG(X"(i1.u15.p80==1)" U G(G"((i4.u6.p35==1)&&(i4.u14.p75==1))" U G"(i1.u15.p80==1)"))
4 unique states visited
3 strongly connected components in search stack
5 transitions explored
4 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.789582,38816,1,0,39683,182,1374,94242,190,994,39034
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Raft-PT-04-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((!(X(("((i4.u14.p75!=1)||(i1.u15.p77!=1))")U("((i2.u3.p16==1)&&(i2.u12.p65==1))")))))
Formula 5 simplified : X("((i4.u14.p75!=1)||(i1.u15.p77!=1))" U "((i2.u3.p16==1)&&(i2.u12.p65==1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
46 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.24978,50960,1,0,61904,182,1401,151344,190,1060,55919
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Raft-PT-04-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((!(G(X(G("((u4.p25==1)&&(i3.u13.p70==1))")))))&&(!(X("((i4.u11.p56==1)&&(i4.u14.p75==1))")))))
Formula 6 simplified : !(!GXG"((u4.p25==1)&&(i3.u13.p70==1))" & !X"((i4.u11.p56==1)&&(i4.u14.p75==1))")
4 unique states visited
4 strongly connected components in search stack
4 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,1.2678,51488,1,0,63155,182,1442,153587,190,1060,58058
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Raft-PT-04-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F((X("(((i2.u12.p65==1)&&(i5.u17.p81==1))||((i3.u0.p5==1)&&(i2.u12.p65==1)))"))||("((i4.u11.p60==1)&&(i1.u15.p80==1))"))))
Formula 7 simplified : !F("((i4.u11.p60==1)&&(i1.u15.p80==1))" | X"(((i2.u12.p65==1)&&(i5.u17.p81==1))||((i3.u0.p5==1)&&(i2.u12.p65==1)))")
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.2693,52016,1,0,63155,182,1467,153587,190,1060,58087
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA Raft-PT-04-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((X(X(X("((((i2.u2.p14!=1)||(i1.u15.p80!=1))&&(i4.u11.p56==1))&&(i4.u14.p75==1))"))))||(!(F(G(F("(i1.u15.p80==1)")))))))
Formula 8 simplified : !(XXX"((((i2.u2.p14!=1)||(i1.u15.p80!=1))&&(i4.u11.p56==1))&&(i4.u14.p75==1))" | !FGF"(i1.u15.p80==1)")
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
14 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.41099,55976,1,0,72055,182,1516,177795,191,1073,70126
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Raft-PT-04-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(((G("((i4.u11.p58==1)&&(i4.u14.p75==1))"))||(G(("((i1.u5.p30==1)&&(i3.u13.p70==1))")U(X(F("((i1.u8.p45==1)&&(i4.u14.p75==1))"))))))||("((i4.u11.p58==1)&&(i4.u14.p75==1))"))))
Formula 9 simplified : !F("((i4.u11.p58==1)&&(i4.u14.p75==1))" | G"((i4.u11.p58==1)&&(i4.u14.p75==1))" | G("((i1.u5.p30==1)&&(i3.u13.p70==1))" U XF"((i1.u8.p45==1)&&(i4.u14.p75==1))"))
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.44827,57296,1,0,74746,182,1574,184109,191,1082,72968
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Raft-PT-04-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((!(X(X((F((!(X("(i1.u15.p76==1)")))&&("((i1.u8.p42!=1)||(i1.u15.p80!=1))")))&&(G("((i4.u1.p10==1)&&(i2.u12.p65==1))")))))))
Formula 10 simplified : XX(F("((i1.u8.p42!=1)||(i1.u15.p80!=1))" & !X"(i1.u15.p76==1)") & G"((i4.u1.p10==1)&&(i2.u12.p65==1))")
8 unique states visited
8 strongly connected components in search stack
10 transitions explored
8 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.51249,59144,1,0,79367,182,1679,192977,191,1085,78930
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Raft-PT-04-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F((((("((i1.u5.p28==1)&&(i1.u15.p80==1))")U(G("((u4.p22==1)&&(i4.u14.p75==1))")))||("((u4.p22==1)&&(i4.u14.p75==1))"))U("((u4.p22==1)&&(i4.u14.p75==1))"))||("((i2.u3.p20==1)&&(i3.u13.p70==1))"))))
Formula 11 simplified : !F("((i2.u3.p20==1)&&(i3.u13.p70==1))" | (("((u4.p22==1)&&(i4.u14.p75==1))" | ("((i1.u5.p28==1)&&(i1.u15.p80==1))" U G"((u4.p22==1)&&(i4.u14.p75==1))")) U "((u4.p22==1)&&(i4.u14.p75==1))"))
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.51402,59408,1,0,79367,182,1714,192977,191,1085,78978
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA Raft-PT-04-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
[2020-05-21 09:34:53] [WARNING] Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
[2020-05-21 09:34:53] [WARNING] Script execution failed on command (declare-fun s1 () (Array Int Int)) with error (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
[2020-05-21 09:34:53] [WARNING] Script execution failed on command (assert (and (>= (select s0 67) 1) (= (store (store s0 67 (- (select s0 67) 1)) 66 (+ (select s0 66) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (>= (select s0 67) 1) (= (store (store s0 67 (- (select s0 67) 1)) 66 (+ (select s0 66) 1)) s1))")
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.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
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-21 09:34:53] [INFO ] Built C files in 2344ms 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 1590053694606

--------------------
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="Raft-PT-04"
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 Raft-PT-04, 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 r141-smll-158961510700234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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