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.r193-csrt-159033389100642.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 ResAllocation-PT-R003C003, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-csrt-159033389100642
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.4K May 14 00:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 14 00:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 17:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 17:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 12 20:53 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 12 20:53 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 14 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 13 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 13 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 07:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 07:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:53 equiv_col
-rw-r--r-- 1 mcc users 9 May 12 20:53 instance
-rw-r--r-- 1 mcc users 6 May 12 20:53 iscolored
-rw-r--r-- 1 mcc users 21K May 12 20:53 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 ResAllocation-PT-R003C003-00
FORMULA_NAME ResAllocation-PT-R003C003-01
FORMULA_NAME ResAllocation-PT-R003C003-02
FORMULA_NAME ResAllocation-PT-R003C003-03
FORMULA_NAME ResAllocation-PT-R003C003-04
FORMULA_NAME ResAllocation-PT-R003C003-05
FORMULA_NAME ResAllocation-PT-R003C003-06
FORMULA_NAME ResAllocation-PT-R003C003-07
FORMULA_NAME ResAllocation-PT-R003C003-08
FORMULA_NAME ResAllocation-PT-R003C003-09
FORMULA_NAME ResAllocation-PT-R003C003-10
FORMULA_NAME ResAllocation-PT-R003C003-11
FORMULA_NAME ResAllocation-PT-R003C003-12
FORMULA_NAME ResAllocation-PT-R003C003-13
FORMULA_NAME ResAllocation-PT-R003C003-14
FORMULA_NAME ResAllocation-PT-R003C003-15

=== Now, execution of the tool begins

BK_START 1590538862603

[2020-05-27 00:21:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-27 00:21:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 00:21:04] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2020-05-27 00:21:04] [INFO ] Transformed 18 places.
[2020-05-27 00:21:04] [INFO ] Transformed 12 transitions.
[2020-05-27 00:21:04] [INFO ] Found NUPN structural information;
[2020-05-27 00:21:04] [INFO ] Parsed PT model containing 18 places and 12 transitions in 91 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 168 steps, including 17 resets, run visited all 23 properties in 6 ms. (steps per millisecond=28 )
[2020-05-27 00:21:04] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-27 00:21:04] [INFO ] Flatten gal took : 30 ms
FORMULA ResAllocation-PT-R003C003-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C003-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C003-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C003-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C003-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C003-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 00:21:04] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 00:21:04] [INFO ] Applying decomposition
[2020-05-27 00:21:04] [INFO ] Flatten gal took : 3 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/graph13119144208631713079.txt, -o, /tmp/graph13119144208631713079.bin, -w, /tmp/graph13119144208631713079.weights], workingDir=null]
[2020-05-27 00:21:05] [INFO ] Input system was already deterministic with 12 transitions.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph13119144208631713079.bin, -l, -1, -v, -w, /tmp/graph13119144208631713079.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 00:21:05] [INFO ] Decomposing Gal with order
[2020-05-27 00:21:05] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 12 rows 18 cols
[2020-05-27 00:21:05] [INFO ] Computed 9 place invariants in 8 ms
inv : p_0_1 + r_0_1 + p_1_1 = 1
inv : p_1_0 + r_1_0 + p_2_0 = 1
inv : p_2_1 + r_2_1 = 1
inv : p_1_2 + r_1_2 + p_2_2 = 1
inv : p_2_2 + r_2_2 = 1
inv : p_1_1 + r_1_1 + p_2_1 = 1
inv : p_0_0 + r_0_0 + p_1_0 = 1
inv : p_0_2 + r_0_2 + p_1_2 = 1
inv : p_2_0 + r_2_0 = 1
Total of 9 invariants.
[2020-05-27 00:21:05] [INFO ] Computed 9 place invariants in 10 ms
[2020-05-27 00:21:05] [INFO ] Flatten gal took : 41 ms
[2020-05-27 00:21:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-27 00:21:05] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
[2020-05-27 00:21:05] [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 10 LTL properties
Checking formula 0 : !((!((G(("(((i0.u0.r_0_0==1)&&(i1.i0.u3.r_1_0==1))&&(i1.i1.u4.p_1_1==1))")U("((i1.i0.u3.r_1_0==1)&&(i1.i0.u6.r_2_0==1))")))U(F(X(X(X("(((i2.u5.r_1_2==1)&&(i1.i1.u7.p_2_1==1))&&(i2.u8.r_2_2==1))"))))))))
Formula 0 simplified : G("(((i0.u0.r_0_0==1)&&(i1.i0.u3.r_1_0==1))&&(i1.i1.u4.p_1_1==1))" U "((i1.i0.u3.r_1_0==1)&&(i1.i0.u6.r_2_0==1))") U FXXX"(((i2.u5.r_1_2==1)&&(i1.i1.u7.p_2_1==1))&&(i2.u8.r_2_2==1))"
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t_1_0, u2.t_0_3, i2.t_2_3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/9/3/12
Computing Next relation with stutter on 2 deadlock states
[2020-05-27 00:21:05] [INFO ] Proved 18 variables to be positive in 96 ms
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.034969,17000,1,0,668,30,297,851,52,46,1544
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C003-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((F(G((F("(i2.u8.p_2_2!=1)"))||("((i0.u1.p_0_1==1)&&(u2.r_0_2==1))"))))&&(("((i0.u1.p_0_1==1)&&(u2.r_0_2==1))")U(F("(i2.u8.p_2_2==1)")))))
Formula 1 simplified : !(FG("((i0.u1.p_0_1==1)&&(u2.r_0_2==1))" | F"(i2.u8.p_2_2!=1)") & ("((i0.u1.p_0_1==1)&&(u2.r_0_2==1))" U F"(i2.u8.p_2_2==1)"))
[2020-05-27 00:21:05] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2020-05-27 00:21:05] [INFO ] Computation of disable matrix completed :0/12 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 00:21:05] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 00:21:05] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2020-05-27 00:21:05] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Computing Next relation with stutter on 2 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.040553,18164,1,0,732,30,342,929,53,46,1793
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C003-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G((G(((G("(i2.u8.p_2_2==1)"))&&("(i1.i0.u3.r_1_0==1)"))&&("(i1.i0.u6.r_2_0==1)")))U(G(("((i1.i0.u3.r_1_0==1)&&(i1.i0.u6.r_2_0==1))")U(!(X("((i0.u1.p_0_1==1)&&(u2.r_0_2==1))"))))))))
Formula 2 simplified : !G(G("(i1.i0.u3.r_1_0==1)" & "(i1.i0.u6.r_2_0==1)" & G"(i2.u8.p_2_2==1)") U G("((i1.i0.u3.r_1_0==1)&&(i1.i0.u6.r_2_0==1))" U !X"((i0.u1.p_0_1==1)&&(u2.r_0_2==1))"))
Computing Next relation with stutter on 2 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.055318,19152,1,0,833,30,425,1037,54,46,2132
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C003-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(F((F("(i1.i0.u3.p_1_0==1)"))||((("(i0.u0.r_0_0==1)")U(G("(u2.p_0_2==1)")))&&("(i1.i0.u3.p_1_0==1)"))))))
Formula 3 simplified : !GF(F"(i1.i0.u3.p_1_0==1)" | ("(i1.i0.u3.p_1_0==1)" & ("(i0.u0.r_0_0==1)" U G"(u2.p_0_2==1)")))
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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.056476,19152,1,0,855,30,449,1075,54,46,2225
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C003-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((!(F("(((i0.u0.r_0_0==1)&&(i1.i0.u3.r_1_0==1))&&(i1.i1.u4.p_1_1==1))")))U(F("(((i0.u0.r_0_0==1)&&(i1.i0.u3.r_1_0==1))&&(i1.i1.u4.p_1_1==1))"))))
Formula 4 simplified : !(!F"(((i0.u0.r_0_0==1)&&(i1.i0.u3.r_1_0==1))&&(i1.i1.u4.p_1_1==1))" U F"(((i0.u0.r_0_0==1)&&(i1.i0.u3.r_1_0==1))&&(i1.i1.u4.p_1_1==1))")
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 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.058216,19152,1,0,1019,30,477,1250,54,46,2670
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C003-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X((F(G("(i1.i0.u3.p_1_0!=1)")))&&(G("(i2.u8.p_2_2==1)")))))
Formula 5 simplified : !X(FG"(i1.i0.u3.p_1_0!=1)" & G"(i2.u8.p_2_2==1)")
Computing Next relation with stutter on 2 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.059531,19152,1,0,1038,30,478,1274,54,46,2743
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C003-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((X(X("(((i0.u1.r_0_1==1)&&(i1.i1.u4.r_1_1==1))&&(i2.u5.p_1_2==1))")))U(X((X("(((i0.u1.r_0_1==1)&&(i1.i1.u4.r_1_1==1))&&(i2.u5.p_1_2==1))"))U("(((i0.u1.r_0_1==1)&&(i1.i1.u4.r_1_1==1))&&(i2.u5.p_1_2==1))")))))
Formula 6 simplified : !(XX"(((i0.u1.r_0_1==1)&&(i1.i1.u4.r_1_1==1))&&(i2.u5.p_1_2==1))" U X(X"(((i0.u1.r_0_1==1)&&(i1.i1.u4.r_1_1==1))&&(i2.u5.p_1_2==1))" U "(((i0.u1.r_0_1==1)&&(i1.i1.u4.r_1_1==1))&&(i2.u5.p_1_2==1))"))
Computing Next relation with stutter on 2 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,0.060684,19152,1,0,1076,30,487,1329,54,46,2921
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C003-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(F(G(((G(F(G((!(X("((u2.r_0_2==1)&&(i2.u5.r_1_2==1))")))||("((u2.r_0_2==1)&&(i2.u5.r_1_2==1))")))))U("(i0.u0.r_0_0==1)"))||("(((i1.i1.u4.r_1_1==1)&&(i1.i0.u6.p_2_0==1))&&(i1.i1.u7.r_2_1==1))"))))))
Formula 7 simplified : FG("(((i1.i1.u4.r_1_1==1)&&(i1.i0.u6.p_2_0==1))&&(i1.i1.u7.r_2_1==1))" | (GFG("((u2.r_0_2==1)&&(i2.u5.r_1_2==1))" | !X"((u2.r_0_2==1)&&(i2.u5.r_1_2==1))") U "(i0.u0.r_0_0==1)"))
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
2 strongly connected components in search stack
3 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,0.065698,19152,1,0,1252,30,529,1567,54,46,3322
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C003-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(G(!(("((i0.u1.p_0_1==1)&&(u2.r_0_2==1))")U((X("(i2.u8.p_2_2==1)"))||(F((X("((i0.u1.p_0_1==1)&&(u2.r_0_2==1))"))||("(i2.u8.p_2_2==1)")))))))))
Formula 8 simplified : !FG!("((i0.u1.p_0_1==1)&&(u2.r_0_2==1))" U (X"(i2.u8.p_2_2==1)" | F("(i2.u8.p_2_2==1)" | X"((i0.u1.p_0_1==1)&&(u2.r_0_2==1))")))
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
2 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.068098,19152,1,0,1317,30,540,1645,54,46,3551
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C003-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((!((((((G(X("((i0.u1.p_0_1==1)&&(u2.r_0_2==1))")))U("((i1.i0.u3.r_1_0==1)&&(i1.i0.u6.r_2_0==1))"))||(X("((u2.r_0_2==1)&&(i2.u5.r_1_2==1))")))&&("(u2.r_0_2==1)"))&&("(i2.u5.r_1_2==1)"))U("((i0.u1.p_0_1==1)&&(u2.r_0_2==1))"))))
Formula 9 simplified : ("(i2.u5.r_1_2==1)" & "(u2.r_0_2==1)" & ((GX"((i0.u1.p_0_1==1)&&(u2.r_0_2==1))" U "((i1.i0.u3.r_1_0==1)&&(i1.i0.u6.r_2_0==1))") | X"((u2.r_0_2==1)&&(i2.u5.r_1_2==1))")) U "((i0.u1.p_0_1==1)&&(u2.r_0_2==1))"
Computing Next relation with stutter on 2 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,0.072675,19380,1,0,1412,30,602,1693,54,46,3972
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C003-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
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:502)
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-27 00:21:05] [INFO ] Built C files in 260ms 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 1590538865556

--------------------
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="ResAllocation-PT-R003C003"
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 ResAllocation-PT-R003C003, 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 r193-csrt-159033389100642"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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