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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 4.1K May 14 00:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 00:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 17:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.2K May 14 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 15K May 14 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 13 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 07:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K 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 14K 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-R003C002-00
FORMULA_NAME ResAllocation-PT-R003C002-01
FORMULA_NAME ResAllocation-PT-R003C002-02
FORMULA_NAME ResAllocation-PT-R003C002-03
FORMULA_NAME ResAllocation-PT-R003C002-04
FORMULA_NAME ResAllocation-PT-R003C002-05
FORMULA_NAME ResAllocation-PT-R003C002-06
FORMULA_NAME ResAllocation-PT-R003C002-07
FORMULA_NAME ResAllocation-PT-R003C002-08
FORMULA_NAME ResAllocation-PT-R003C002-09
FORMULA_NAME ResAllocation-PT-R003C002-10
FORMULA_NAME ResAllocation-PT-R003C002-11
FORMULA_NAME ResAllocation-PT-R003C002-12
FORMULA_NAME ResAllocation-PT-R003C002-13
FORMULA_NAME ResAllocation-PT-R003C002-14
FORMULA_NAME ResAllocation-PT-R003C002-15

=== Now, execution of the tool begins

BK_START 1590538799479

[2020-05-27 00:20:01] [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:20:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 00:20:01] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2020-05-27 00:20:01] [INFO ] Transformed 12 places.
[2020-05-27 00:20:01] [INFO ] Transformed 8 transitions.
[2020-05-27 00:20:01] [INFO ] Found NUPN structural information;
[2020-05-27 00:20:01] [INFO ] Parsed PT model containing 12 places and 8 transitions in 80 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 15232 resets, run finished after 140 ms. (steps per millisecond=714 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 8 rows 12 cols
[2020-05-27 00:20:01] [INFO ] Computed 6 place invariants in 3 ms
[2020-05-27 00:20:01] [INFO ] [Real]Absence check using 6 positive place invariants in 17 ms returned unsat
[2020-05-27 00:20:01] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-27 00:20:02] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-27 00:20:02] [INFO ] Flatten gal took : 24 ms
FORMULA ResAllocation-PT-R003C002-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C002-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C002-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C002-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 00:20:02] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 00:20:02] [INFO ] Applying decomposition
[2020-05-27 00:20:02] [INFO ] Flatten gal took : 3 ms
[2020-05-27 00:20:02] [INFO ] Input system was already deterministic with 8 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/graph7496743721214884052.txt, -o, /tmp/graph7496743721214884052.bin, -w, /tmp/graph7496743721214884052.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/graph7496743721214884052.bin, -l, -1, -v, -w, /tmp/graph7496743721214884052.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 8 rows 12 cols
[2020-05-27 00:20:02] [INFO ] Computed 6 place invariants in 1 ms
inv : p_0_1 + r_0_1 + p_1_1 = 1
inv : p_0_0 + r_0_0 + p_1_0 = 1
inv : p_1_0 + r_1_0 = 1
inv : p_0_2 + r_0_2 + p_1_2 = 1
inv : p_1_1 + r_1_1 = 1
inv : p_1_2 + r_1_2 = 1
Total of 6 invariants.
[2020-05-27 00:20:02] [INFO ] Computed 6 place invariants in 5 ms
[2020-05-27 00:20:02] [INFO ] Decomposing Gal with order
[2020-05-27 00:20:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 00:20:02] [INFO ] Flatten gal took : 36 ms
[2020-05-27 00:20:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-27 00:20:02] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
[2020-05-27 00:20:02] [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]
[2020-05-27 00:20:02] [INFO ] Proved 12 variables to be positive in 132 ms
[2020-05-27 00:20:02] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2020-05-27 00:20:02] [INFO ] Computation of disable matrix completed :0/8 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 00:20:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 00:20:02] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2020-05-27 00:20:02] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)

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 : !(((G("((((i0.u3.p_1_0!=1)||(u1.r_0_1!=1))||(u4.r_1_1!=1))||(i3.u5.p_1_2!=1))"))U("(i0.u3.p_1_0==1)")))
Formula 0 simplified : !(G"((((i0.u3.p_1_0!=1)||(u1.r_0_1!=1))||(u4.r_1_1!=1))||(i3.u5.p_1_2!=1))" U "(i0.u3.p_1_0==1)")
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions i0.t_1_0, i3.u2.t_0_3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/6/2/8
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
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.042986,16760,1,0,264,25,163,304,50,21,724
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C002-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(!(X("(i0.u3.p_1_0!=1)")))))
Formula 1 simplified : !G!X"(i0.u3.p_1_0!=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.044722,17004,1,0,278,25,203,349,52,23,881
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C002-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((X("((i3.u2.r_0_2==1)&&(i3.u5.r_1_2==1))"))&&(F("(i3.u2.p_0_2!=1)"))))
Formula 2 simplified : !(X"((i3.u2.r_0_2==1)&&(i3.u5.r_1_2==1))" & F"(i3.u2.p_0_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.045944,17004,1,0,290,25,220,365,53,23,956
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C002-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((G((X("(i3.u2.p_0_2==1)"))||("(((i0.u0.r_0_0==1)&&(i0.u3.r_1_0==1))&&(u4.p_1_1==1))")))U("((u1.p_0_1==1)&&(i3.u2.r_0_2==1))")))
Formula 3 simplified : !(G("(((i0.u0.r_0_0==1)&&(i0.u3.r_1_0==1))&&(u4.p_1_1==1))" | X"(i3.u2.p_0_2==1)") U "((u1.p_0_1==1)&&(i3.u2.r_0_2==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.0484,17268,1,0,358,25,246,460,53,23,1221
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C002-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(X((X("(i0.u3.p_1_0==1)"))&&("(i3.u2.p_0_2!=1)")))))
Formula 4 simplified : !GX("(i3.u2.p_0_2!=1)" & X"(i0.u3.p_1_0==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.049776,17400,1,0,373,25,256,478,53,23,1311
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C002-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((G(F(X(X("(i3.u2.p_0_2==1)")))))||(!(G(F("((i0.u0.p_0_0==1)&&(u1.r_0_1==1))"))))))
Formula 5 simplified : !(GFXX"(i3.u2.p_0_2==1)" | !GF"((i0.u0.p_0_0==1)&&(u1.r_0_1==1))")
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
0 strongly connected components in search stack
3 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.052464,17532,1,0,426,25,282,550,53,23,1613
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R003C002-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(((G(X("((i0.u0.p_0_0==1)&&(u1.r_0_1==1))")))||("((i0.u0.p_0_0==1)&&(u1.r_0_1==1))"))U(X(X(X("(((u1.r_0_1==1)&&(u4.r_1_1==1))&&(i3.u5.p_1_2==1))")))))))
Formula 6 simplified : !X(("((i0.u0.p_0_0==1)&&(u1.r_0_1==1))" | GX"((i0.u0.p_0_0==1)&&(u1.r_0_1==1))") U XXX"(((u1.r_0_1==1)&&(u4.r_1_1==1))&&(i3.u5.p_1_2==1))")
Computing Next relation with stutter on 2 deadlock states
9 unique states visited
7 strongly connected components in search stack
9 transitions explored
7 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.060113,18780,1,0,446,25,301,575,53,23,1755
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C002-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(F(X("(((u1.r_0_1==1)&&(u4.r_1_1==1))&&(i3.u5.p_1_2==1))")))))
Formula 7 simplified : FX"(((u1.r_0_1==1)&&(u4.r_1_1==1))&&(i3.u5.p_1_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.061615,18780,1,0,491,25,313,650,53,23,1967
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C002-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!(G("(((i0.u0.r_0_0!=1)||(i0.u3.r_1_0!=1))||(u4.p_1_1!=1))"))))
Formula 8 simplified : G"(((i0.u0.r_0_0!=1)||(i0.u3.r_1_0!=1))||(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.062512,18780,1,0,513,25,335,708,53,23,2120
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C002-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((X(F("((u1.p_0_1==1)&&(i3.u2.r_0_2==1))")))||(G((F(G("((i0.u0.p_0_0==1)&&(u1.r_0_1==1))")))U("((i3.u2.r_0_2==1)&&(i3.u5.r_1_2==1))")))))
Formula 9 simplified : !(XF"((u1.p_0_1==1)&&(i3.u2.r_0_2==1))" | G(FG"((i0.u0.p_0_0==1)&&(u1.r_0_1==1))" U "((i3.u2.r_0_2==1)&&(i3.u5.r_1_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.065226,18780,1,0,548,25,356,761,53,23,2297
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C002-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(F(G(F((X("(i0.u3.p_1_0==1)"))U("(i3.u2.p_0_2==1)")))))))
Formula 10 simplified : !GFGF(X"(i0.u3.p_1_0==1)" U "(i3.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
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.066119,18780,1,0,555,25,371,775,53,23,2330
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C002-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(((F("((i3.u2.p_0_2==1)||(i0.u3.p_1_0==1))"))U(X("((i0.u0.p_0_0==1)&&(u1.r_0_1==1))")))U((G(F("((i0.u0.p_0_0==1)&&(u1.r_0_1==1))")))&&("(i0.u3.p_1_0!=1)")))))
Formula 11 simplified : !F((F"((i3.u2.p_0_2==1)||(i0.u3.p_1_0==1))" U X"((i0.u0.p_0_0==1)&&(u1.r_0_1==1))") U ("(i0.u3.p_1_0!=1)" & GF"((i0.u0.p_0_0==1)&&(u1.r_0_1==1))"))
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 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.068627,18780,1,0,594,25,391,834,53,23,2486
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C002-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-27 00:20:02] [WARNING] Script execution failed on command (assert (not (and (= (select s0 5) 1) (= (select s0 11) 1)))) with error
[2020-05-27 00:20:02] [WARNING] Script execution failed on command (assert (and (= (select s1 5) 1) (= (select s1 11) 1))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (and (= (select s1 5) 1) (= (select s1 11) 1))")
[2020-05-27 00:20:02] [WARNING] Script execution failed on command (assert (and (and (>= (select s0 2) 1) (>= (select s0 5) 1)) (= (store (store (store (store s0 5 (- (select s0 5) 1)) 2 (- (select s0 2) 1)) 4 (+ (select s0 4) 1)) 3 (+ (select s0 3) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (and (and (>= (select s0 2) 1) (>= (select s0 5) 1)) (= (store (store (store (store s0 5 (- (select s0 5) 1)) 2 (- (select s0 2) 1)) 4 (+ (select s0 4) 1)) 3 (+ (select s0 3) 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: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:20:02] [INFO ] Built C files in 355ms 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 1590538802903

--------------------
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-R003C002"
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-R003C002, 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-159033389100634"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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