Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r111-csrt-158961257200114.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 NQueens-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961257200114
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.3K Apr 8 13:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 8 13:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 7 16:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 7 16:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 6 19:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 6 19:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 6 02:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 6 02:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 27K 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 NQueens-PT-05-00
FORMULA_NAME NQueens-PT-05-01
FORMULA_NAME NQueens-PT-05-02
FORMULA_NAME NQueens-PT-05-03
FORMULA_NAME NQueens-PT-05-04
FORMULA_NAME NQueens-PT-05-05
FORMULA_NAME NQueens-PT-05-06
FORMULA_NAME NQueens-PT-05-07
FORMULA_NAME NQueens-PT-05-08
FORMULA_NAME NQueens-PT-05-09
FORMULA_NAME NQueens-PT-05-10
FORMULA_NAME NQueens-PT-05-11
FORMULA_NAME NQueens-PT-05-12
FORMULA_NAME NQueens-PT-05-13
FORMULA_NAME NQueens-PT-05-14
FORMULA_NAME NQueens-PT-05-15

=== Now, execution of the tool begins

BK_START 1589827762730

[2020-05-18 18:49:25] [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-18 18:49:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 18:49:25] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2020-05-18 18:49:25] [INFO ] Transformed 55 places.
[2020-05-18 18:49:25] [INFO ] Transformed 25 transitions.
[2020-05-18 18:49:25] [INFO ] Parsed PT model containing 55 places and 25 transitions in 85 ms.
Reduce places removed 2 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 6 steps, including 1 resets, run visited all 37 properties in 2 ms. (steps per millisecond=3 )
[2020-05-18 18:49:25] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-18 18:49:25] [INFO ] Flatten gal took : 60 ms
FORMULA NQueens-PT-05-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-05-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-05-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-05-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-05-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-05-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-18 18:49:25] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
[2020-05-18 18:49:26] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-18 18:49:26] [INFO ] Flatten gal took : 12 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/graph8069425187812623758.txt, -o, /tmp/graph8069425187812623758.bin, -w, /tmp/graph8069425187812623758.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/graph8069425187812623758.bin, -l, -1, -v, -w, /tmp/graph8069425187812623758.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-18 18:49:26] [INFO ] Input system was already deterministic with 25 transitions.
[2020-05-18 18:49:26] [INFO ] Decomposing Gal with order
[2020-05-18 18:49:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-18 18:49:26] [INFO ] Removed a total of 48 redundant transitions.
[2020-05-18 18:49:26] [INFO ] Flatten gal took : 73 ms
[2020-05-18 18:49:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 25 rows 53 cols
[2020-05-18 18:49:26] [INFO ] Computed 28 place invariants in 4 ms
inv : P_0_0 + P_1_1 + P_2_2 + P_3_3 + P_4_4 + L_4 = 1
inv : P_0_3 + P_1_2 + P_2_1 + P_3_0 + R_4 = 1
inv : P_0_0 + P_0_1 + P_0_2 + P_0_3 + P_0_4 + cX_0 = 1
inv : P_0_3 + P_1_3 + P_2_3 + P_3_3 + P_4_3 + cY_3 = 1
inv : P_4_0 + L_8 = 1
inv : P_0_4 + P_1_3 + P_2_2 + P_3_1 + P_4_0 + R_5 = 1
inv : P_0_0 + P_1_0 + P_2_0 + P_3_0 + P_4_0 + cY_0 = 1
inv : P_0_1 + P_1_2 + P_2_3 + P_3_4 + L_3 = 1
inv : P_4_4 + R_9 = 1
inv : P_1_0 + P_2_1 + P_3_2 + P_4_3 + L_5 = 1
inv : P_0_4 + L_0 = 1
inv : P_0_1 + P_1_0 + R_2 = 1
inv : P_0_0 + R_1 = 1
inv : P_0_1 + P_1_1 + P_2_1 + P_3_1 + P_4_1 + cY_1 = 1
inv : P_0_2 + P_1_3 + P_2_4 + L_2 = 1
inv : P_2_4 + P_3_3 + P_4_2 + R_7 = 1
inv : P_0_2 + P_1_2 + P_2_2 + P_3_2 + P_4_2 + cY_2 = 1
inv : P_2_0 + P_3_1 + P_4_2 + L_6 = 1
inv : P_0_4 + P_1_4 + P_2_4 + P_3_4 + P_4_4 + cY_4 = 1
inv : P_1_4 + P_2_3 + P_3_2 + P_4_1 + R_6 = 1
inv : P_3_4 + P_4_3 + R_8 = 1
inv : P_3_0 + P_4_1 + L_7 = 1
inv : P_1_0 + P_1_1 + P_1_2 + P_1_3 + P_1_4 + cX_1 = 1
inv : P_0_3 + P_1_4 + L_1 = 1
inv : P_4_0 + P_4_1 + P_4_2 + P_4_3 + P_4_4 + cX_4 = 1
inv : P_2_0 + P_2_1 + P_2_2 + P_2_3 + P_2_4 + cX_2 = 1
inv : P_0_2 + P_1_1 + P_2_0 + R_3 = 1
inv : P_3_0 + P_3_1 + P_3_2 + P_3_3 + P_3_4 + cX_3 = 1
Total of 28 invariants.
[2020-05-18 18:49:26] [INFO ] Computed 28 place invariants in 6 ms
[2020-05-18 18:49:26] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 16 ms
[2020-05-18 18:49:26] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 10 LTL properties
Checking formula 0 : !((!(X((G(F("((((i5.u12.cX_4>=1)&&(i0.u13.cY_3>=1))&&(i1.u3.L_5>=1))&&(i0.u10.R_8>=1))")))&&("((((i5.u12.cX_4<1)||(i0.u13.cY_3<1))||(i1.u3.L_5<1))||(i0.u10.R_8<1))")))))
Formula 0 simplified : X("((((i5.u12.cX_4<1)||(i0.u13.cY_3<1))||(i1.u3.L_5<1))||(i0.u10.R_8<1))" & GF"((((i5.u12.cX_4>=1)&&(i0.u13.cY_3>=1))&&(i1.u3.L_5>=1))&&(i0.u10.R_8>=1))")
built 17 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 58 deadlock states
[2020-05-18 18:49:26] [INFO ] Proved 53 variables to be positive in 204 ms
[2020-05-18 18:49:26] [INFO ] Computing symmetric may disable matrix : 25 transitions.
[2020-05-18 18:49:26] [INFO ] Computation of disable matrix completed :0/25 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 18:49:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 18:49:26] [INFO ] Computing symmetric may enable matrix : 25 transitions.
[2020-05-18 18:49:26] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
12 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.148015,20928,1,0,9517,70,528,12815,70,286,32894
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA NQueens-PT-05-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(X(X(!(G(("((((i5.u17.cX_3<1)||(i0.u13.cY_3<1))||(i4.u9.L_4<1))||(i5.u21.R_7<1))")U(F(G("((((i5.u17.cX_3>=1)&&(i0.u13.cY_3>=1))&&(i4.u9.L_4>=1))&&(i5.u21.R_7>=1))"))))))))))
Formula 1 simplified : !GXX!G("((((i5.u17.cX_3<1)||(i0.u13.cY_3<1))||(i4.u9.L_4<1))||(i5.u21.R_7<1))" U FG"((((i5.u17.cX_3>=1)&&(i0.u13.cY_3>=1))&&(i4.u9.L_4>=1))&&(i5.u21.R_7>=1))")
Computing Next relation with stutter on 58 deadlock states
11 unique states visited
0 strongly connected components in search stack
11 transitions explored
6 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.192646,22244,1,0,10921,70,578,13754,70,286,38211
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA NQueens-PT-05-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(X(G("((((i1.u4.cX_1>=1)&&(i0.u13.cY_3>=1))&&(i2.u16.L_2>=1))&&(i2.u15.R_5>=1))")))))
Formula 2 simplified : !FXG"((((i1.u4.cX_1>=1)&&(i0.u13.cY_3>=1))&&(i2.u16.L_2>=1))&&(i2.u15.R_5>=1))"
Computing Next relation with stutter on 58 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.226661,23276,1,0,12446,70,625,15011,70,289,45298
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA NQueens-PT-05-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((G(F("((((i1.u4.cX_1>=1)&&(i1.u8.cY_1>=1))&&(i4.u9.L_4>=1))&&(i4.u1.R_3>=1))")))U(X(G("((((i1.u4.cX_1>=1)&&(i4.u1.cY_2>=1))&&(i0.u5.L_3>=1))&&(i0.u2.R_4>=1))")))))
Formula 3 simplified : !(GF"((((i1.u4.cX_1>=1)&&(i1.u8.cY_1>=1))&&(i4.u9.L_4>=1))&&(i4.u1.R_3>=1))" U XG"((((i1.u4.cX_1>=1)&&(i4.u1.cY_2>=1))&&(i0.u5.L_3>=1))&&(i0.u2.R_4>=1))")
Computing Next relation with stutter on 58 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.274413,24980,1,0,14218,70,696,16530,70,289,53070
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA NQueens-PT-05-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((("((((i4.u19.cX_0>=1)&&(i4.u1.cY_2>=1))&&(i2.u16.L_2>=1))&&(i4.u1.R_3>=1))")U(F(((((F(!(F("((((i5.u17.cX_3>=1)&&(i1.u8.cY_1>=1))&&(i5.u17.L_6>=1))&&(i2.u15.R_5>=1))"))))||("(i5.u17.cX_3<1)"))||("(i4.u1.cY_2<1)"))||("(i1.u3.L_5<1)"))||("(i3.u20.R_6<1)")))))
Formula 4 simplified : !("((((i4.u19.cX_0>=1)&&(i4.u1.cY_2>=1))&&(i2.u16.L_2>=1))&&(i4.u1.R_3>=1))" U F("(i1.u3.L_5<1)" | "(i3.u20.R_6<1)" | "(i4.u1.cY_2<1)" | "(i5.u17.cX_3<1)" | F!F"((((i5.u17.cX_3>=1)&&(i1.u8.cY_1>=1))&&(i5.u17.L_6>=1))&&(i2.u15.R_5>=1))"))
Computing Next relation with stutter on 58 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.286189,25276,1,0,14952,70,765,17012,75,289,55551
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA NQueens-PT-05-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(G(X(X(G("((((i1.u4.cX_1>=1)&&(i1.u8.cY_1>=1))&&(i4.u9.L_4>=1))&&(i4.u1.R_3>=1))")))))))
Formula 5 simplified : !XGXXG"((((i1.u4.cX_1>=1)&&(i1.u8.cY_1>=1))&&(i4.u9.L_4>=1))&&(i4.u1.R_3>=1))"
Computing Next relation with stutter on 58 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.295482,25804,1,0,15270,70,778,17265,75,289,56980
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA NQueens-PT-05-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((!(F(X("((((i4.u7.cX_2>=1)&&(i4.u1.cY_2>=1))&&(i4.u9.L_4>=1))&&(i2.u15.R_5>=1))"))))||(!(G("((((i4.u7.cX_2>=1)&&(i4.u1.cY_2>=1))&&(i4.u9.L_4>=1))&&(i2.u15.R_5>=1))")))))
Formula 6 simplified : !(!FX"((((i4.u7.cX_2>=1)&&(i4.u1.cY_2>=1))&&(i4.u9.L_4>=1))&&(i2.u15.R_5>=1))" | !G"((((i4.u7.cX_2>=1)&&(i4.u1.cY_2>=1))&&(i4.u9.L_4>=1))&&(i2.u15.R_5>=1))")
Computing Next relation with stutter on 58 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.31867,25804,1,0,15764,70,811,17594,75,289,58651
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA NQueens-PT-05-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(!(F(X(!(G("(((((i4.u19.cX_0>=1)&&(i4.u1.cY_2>=1))&&(i2.u16.L_2>=1))&&(i4.u1.R_3>=1))||((((i4.u7.cX_2>=1)&&(i0.u13.cY_3>=1))&&(i0.u5.L_3>=1))&&(i3.u20.R_6>=1)))"))))))))
Formula 7 simplified : !G!FX!G"(((((i4.u19.cX_0>=1)&&(i4.u1.cY_2>=1))&&(i2.u16.L_2>=1))&&(i4.u1.R_3>=1))||((((i4.u7.cX_2>=1)&&(i0.u13.cY_3>=1))&&(i0.u5.L_3>=1))&&(i3.u20.R_6>=1)))"
Computing Next relation with stutter on 58 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.346418,26588,1,0,17178,70,850,18836,75,289,63566
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA NQueens-PT-05-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(G(((F("((((i1.u4.cX_1>=1)&&(i5.u11.cY_0>=1))&&(i1.u3.L_5>=1))&&(i1.u0.R_2>=1))"))U("((((i4.u7.cX_2>=1)&&(i0.u13.cY_3>=1))&&(i0.u5.L_3>=1))&&(i3.u20.R_6>=1))"))||(G((F("((((i1.u4.cX_1>=1)&&(i5.u11.cY_0>=1))&&(i1.u3.L_5>=1))&&(i1.u0.R_2>=1))"))U(X(G("((((i5.u12.cX_4>=1)&&(i0.u13.cY_3>=1))&&(i1.u3.L_5>=1))&&(i0.u10.R_8>=1))")))))))))
Formula 8 simplified : !FG((F"((((i1.u4.cX_1>=1)&&(i5.u11.cY_0>=1))&&(i1.u3.L_5>=1))&&(i1.u0.R_2>=1))" U "((((i4.u7.cX_2>=1)&&(i0.u13.cY_3>=1))&&(i0.u5.L_3>=1))&&(i3.u20.R_6>=1))") | G(F"((((i1.u4.cX_1>=1)&&(i5.u11.cY_0>=1))&&(i1.u3.L_5>=1))&&(i1.u0.R_2>=1))" U XG"((((i5.u12.cX_4>=1)&&(i0.u13.cY_3>=1))&&(i1.u3.L_5>=1))&&(i0.u10.R_8>=1))"))
Computing Next relation with stutter on 58 deadlock states
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 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.365892,27684,1,0,17638,70,928,19202,76,289,65752
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA NQueens-PT-05-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((G(X(!(X(G(X("((((i4.u7.cX_2>=1)&&(i2.u14.cY_4>=1))&&(i2.u16.L_2>=1))&&(i5.u21.R_7>=1))")))))))&&(X(X(!(F(X(F("((((i5.u17.cX_3>=1)&&(i4.u1.cY_2>=1))&&(i1.u3.L_5>=1))&&(i3.u20.R_6>=1))")))))))))
Formula 9 simplified : !(GX!XGX"((((i4.u7.cX_2>=1)&&(i2.u14.cY_4>=1))&&(i2.u16.L_2>=1))&&(i5.u21.R_7>=1))" & XX!FXF"((((i5.u17.cX_3>=1)&&(i4.u1.cY_2>=1))&&(i1.u3.L_5>=1))&&(i3.u20.R_6>=1))")
Computing Next relation with stutter on 58 deadlock states
20 unique states visited
6 strongly connected components in search stack
24 transitions explored
8 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.379676,27904,1,0,18008,70,971,19535,76,289,67535
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA NQueens-PT-05-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:768)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java: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-18 18:49:26] [INFO ] Built C files in 715ms 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 1589827767266

--------------------
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="NQueens-PT-05"
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 NQueens-PT-05, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r111-csrt-158961257200114"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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