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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.5K Apr 8 13:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 8 13:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 7 16:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.3K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 6 19:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 6 19:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 6 02:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 6 02:50 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 60K 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-08-00
FORMULA_NAME NQueens-PT-08-01
FORMULA_NAME NQueens-PT-08-02
FORMULA_NAME NQueens-PT-08-03
FORMULA_NAME NQueens-PT-08-04
FORMULA_NAME NQueens-PT-08-05
FORMULA_NAME NQueens-PT-08-06
FORMULA_NAME NQueens-PT-08-07
FORMULA_NAME NQueens-PT-08-08
FORMULA_NAME NQueens-PT-08-09
FORMULA_NAME NQueens-PT-08-10
FORMULA_NAME NQueens-PT-08-11
FORMULA_NAME NQueens-PT-08-12
FORMULA_NAME NQueens-PT-08-13
FORMULA_NAME NQueens-PT-08-14
FORMULA_NAME NQueens-PT-08-15

=== Now, execution of the tool begins

BK_START 1589827890821

[2020-05-18 18:51:32] [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:51:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 18:51:32] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2020-05-18 18:51:32] [INFO ] Transformed 112 places.
[2020-05-18 18:51:32] [INFO ] Transformed 64 transitions.
[2020-05-18 18:51:32] [INFO ] Parsed PT model containing 112 places and 64 transitions in 102 ms.
Reduce places removed 2 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 41 steps, including 5 resets, run visited all 55 properties in 7 ms. (steps per millisecond=5 )
[2020-05-18 18:51:33] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-18 18:51:33] [INFO ] Flatten gal took : 53 ms
FORMULA NQueens-PT-08-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-08-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-08-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-08-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-08-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-08-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-18 18:51:33] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
[2020-05-18 18:51:33] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-18 18:51:33] [INFO ] Flatten gal took : 17 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/graph3191384782564426536.txt, -o, /tmp/graph3191384782564426536.bin, -w, /tmp/graph3191384782564426536.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/graph3191384782564426536.bin, -l, -1, -v, -w, /tmp/graph3191384782564426536.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-18 18:51:33] [INFO ] Input system was already deterministic with 64 transitions.
[2020-05-18 18:51:33] [INFO ] Decomposing Gal with order
[2020-05-18 18:51:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-18 18:51:33] [INFO ] Removed a total of 153 redundant transitions.
[2020-05-18 18:51:33] [INFO ] Flatten gal took : 110 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 64 rows 110 cols
[2020-05-18 18:51:33] [INFO ] Computed 46 place invariants in 9 ms
inv : P_0_7 + P_1_6 + P_2_5 + P_3_4 + P_4_3 + P_5_2 + P_6_1 + P_7_0 + R_8 = 1
inv : P_0_4 + P_1_3 + P_2_2 + P_3_1 + P_4_0 + R_5 = 1
inv : P_0_4 + P_1_5 + P_2_6 + P_3_7 + L_3 = 1
inv : P_6_7 + P_7_6 + R_14 = 1
inv : P_6_0 + P_7_1 + L_13 = 1
inv : P_3_7 + P_4_6 + P_5_5 + P_6_4 + P_7_3 + R_11 = 1
inv : P_0_6 + P_1_5 + P_2_4 + P_3_3 + P_4_2 + P_5_1 + P_6_0 + R_7 = 1
inv : P_1_0 + P_2_1 + P_3_2 + P_4_3 + P_5_4 + P_6_5 + P_7_6 + L_8 = 1
inv : P_0_6 + P_1_7 + L_1 = 1
inv : P_7_0 + L_14 = 1
inv : P_0_2 + P_1_1 + P_2_0 + R_3 = 1
inv : P_0_5 + P_1_5 + P_2_5 + P_3_5 + P_4_5 + P_5_5 + P_6_5 + P_7_5 + cY_5 = 1
inv : P_0_0 + P_0_1 + P_0_2 + P_0_3 + P_0_4 + P_0_5 + P_0_6 + P_0_7 + cX_0 = 1
inv : P_2_0 + P_2_1 + P_2_2 + P_2_3 + P_2_4 + P_2_5 + P_2_6 + P_2_7 + cX_2 = 1
inv : P_0_3 + P_1_2 + P_2_1 + P_3_0 + R_4 = 1
inv : P_0_2 + P_1_2 + P_2_2 + P_3_2 + P_4_2 + P_5_2 + P_6_2 + P_7_2 + cY_2 = 1
inv : P_0_5 + P_1_4 + P_2_3 + P_3_2 + P_4_1 + P_5_0 + R_6 = 1
inv : P_0_7 + P_1_7 + P_2_7 + P_3_7 + P_4_7 + P_5_7 + P_6_7 + P_7_7 + cY_7 = 1
inv : P_0_0 + P_1_0 + P_2_0 + P_3_0 + P_4_0 + P_5_0 + P_6_0 + P_7_0 + cY_0 = 1
inv : P_5_7 + P_6_6 + P_7_5 + R_13 = 1
inv : P_0_3 + P_1_4 + P_2_5 + P_3_6 + P_4_7 + L_4 = 1
inv : P_0_0 + P_1_1 + P_2_2 + P_3_3 + P_4_4 + P_5_5 + P_6_6 + P_7_7 + L_7 = 1
inv : P_4_0 + P_4_1 + P_4_2 + P_4_3 + P_4_4 + P_4_5 + P_4_6 + P_4_7 + cX_4 = 1
inv : P_6_0 + P_6_1 + P_6_2 + P_6_3 + P_6_4 + P_6_5 + P_6_6 + P_6_7 + cX_6 = 1
inv : P_1_7 + P_2_6 + P_3_5 + P_4_4 + P_5_3 + P_6_2 + P_7_1 + R_9 = 1
inv : P_0_1 + P_1_0 + R_2 = 1
inv : P_3_0 + P_4_1 + P_5_2 + P_6_3 + P_7_4 + L_10 = 1
inv : P_0_1 + P_1_2 + P_2_3 + P_3_4 + P_4_5 + P_5_6 + P_6_7 + L_6 = 1
inv : P_0_7 + L_0 = 1
inv : P_2_7 + P_3_6 + P_4_5 + P_5_4 + P_6_3 + P_7_2 + R_10 = 1
inv : P_0_3 + P_1_3 + P_2_3 + P_3_3 + P_4_3 + P_5_3 + P_6_3 + P_7_3 + cY_3 = 1
inv : P_0_4 + P_1_4 + P_2_4 + P_3_4 + P_4_4 + P_5_4 + P_6_4 + P_7_4 + cY_4 = 1
inv : P_2_0 + P_3_1 + P_4_2 + P_5_3 + P_6_4 + P_7_5 + L_9 = 1
inv : P_4_0 + P_5_1 + P_6_2 + P_7_3 + L_11 = 1
inv : P_0_0 + R_1 = 1
inv : P_3_0 + P_3_1 + P_3_2 + P_3_3 + P_3_4 + P_3_5 + P_3_6 + P_3_7 + cX_3 = 1
inv : P_1_0 + P_1_1 + P_1_2 + P_1_3 + P_1_4 + P_1_5 + P_1_6 + P_1_7 + cX_1 = 1
inv : P_0_5 + P_1_6 + P_2_7 + L_2 = 1
inv : P_0_2 + P_1_3 + P_2_4 + P_3_5 + P_4_6 + P_5_7 + L_5 = 1
inv : P_5_0 + P_6_1 + P_7_2 + L_12 = 1
inv : P_4_7 + P_5_6 + P_6_5 + P_7_4 + R_12 = 1
inv : P_7_7 + R_15 = 1
inv : P_0_1 + P_1_1 + P_2_1 + P_3_1 + P_4_1 + P_5_1 + P_6_1 + P_7_1 + cY_1 = 1
[2020-05-18 18:51:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
inv : P_0_6 + P_1_6 + P_2_6 + P_3_6 + P_4_6 + P_5_6 + P_6_6 + P_7_6 + cY_6 = 1
inv : P_5_0 + P_5_1 + P_5_2 + P_5_3 + P_5_4 + P_5_5 + P_5_6 + P_5_7 + cX_5 = 1
inv : P_7_0 + P_7_1 + P_7_2 + P_7_3 + P_7_4 + P_7_5 + P_7_6 + P_7_7 + cX_7 = 1
Total of 46 invariants.
[2020-05-18 18:51:33] [INFO ] Computed 46 place invariants in 15 ms
[2020-05-18 18:51:33] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 10 ms
[2020-05-18 18:51:33] [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 : !((F(X((("(((((i4.i1.u20.cX_5>=1)&&(i7.u22.cY_2>=1))&&(i0.i0.u10.L_10>=1))&&(i2.i1.u5.R_8>=1))||((((i0.i0.u21.cX_6>=1)&&(i4.i0.u25.cY_7>=1))&&(i1.u31.L_6>=1))&&(i1.u16.R_14>=1)))")U(G(((((F("((((i6.u11.cX_3>=1)&&(i7.u22.cY_2>=1))&&(i5.i0.u8.L_8>=1))&&(i5.i0.u39.R_6>=1))"))||("(i0.i0.u21.cX_6<1)"))||("(i4.i0.u25.cY_7<1)"))||("(i1.u31.L_6<1)"))||("(i1.u16.R_14<1)"))))||("((((i4.i1.u20.cX_5>=1)&&(i7.u22.cY_2>=1))&&(i0.i0.u10.L_10>=1))&&(i2.i1.u5.R_8>=1))")))))
Formula 0 simplified : !FX("((((i4.i1.u20.cX_5>=1)&&(i7.u22.cY_2>=1))&&(i0.i0.u10.L_10>=1))&&(i2.i1.u5.R_8>=1))" | ("(((((i4.i1.u20.cX_5>=1)&&(i7.u22.cY_2>=1))&&(i0.i0.u10.L_10>=1))&&(i2.i1.u5.R_8>=1))||((((i0.i0.u21.cX_6>=1)&&(i4.i0.u25.cY_7>=1))&&(i1.u31.L_6>=1))&&(i1.u16.R_14>=1)))" U G("(i0.i0.u21.cX_6<1)" | "(i1.u16.R_14<1)" | "(i1.u31.L_6<1)" | "(i4.i0.u25.cY_7<1)" | F"((((i6.u11.cX_3>=1)&&(i7.u22.cY_2>=1))&&(i5.i0.u8.L_8>=1))&&(i5.i0.u39.R_6>=1))")))
built 48 ordering constraints for composite.
built 4 ordering constraints for composite.
built 14 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 10 ordering constraints for composite.
built 17 ordering constraints for composite.
built 3 ordering constraints for composite.
built 14 ordering constraints for composite.
built 18 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 17 ordering constraints for composite.
[2020-05-18 18:51:33] [INFO ] Proved 110 variables to be positive in 253 ms
[2020-05-18 18:51:33] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2020-05-18 18:51:33] [INFO ] Computation of disable matrix completed :0/64 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 18:51:33] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 18:51:33] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2020-05-18 18:51:33] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 18:51:38] [INFO ] Computing symmetric co enabling matrix : 64 transitions.
[2020-05-18 18:51:38] [INFO ] Computation of co-enabling matrix(0/64) took 46 ms. Total solver calls (SAT/UNSAT): 21(21/0)
[2020-05-18 18:51:41] [INFO ] Computation of co-enabling matrix(32/64) took 3059 ms. Total solver calls (SAT/UNSAT): 511(511/0)
[2020-05-18 18:51:43] [INFO ] Computation of Finished co-enabling matrix. took 4753 ms. Total solver calls (SAT/UNSAT): 728(728/0)
[2020-05-18 18:51:43] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2020-05-18 18:51:43] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 18:51:43] [INFO ] Built C files in 9733ms 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]
Compilation finished in 1678 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 97 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>(X(( ((LTLAP0==true))U([](( ( ( ( <>((LTLAP1==true))) || ( (LTLAP2==true)) ) || ( (LTLAP3==true)) ) || ( (LTLAP4==true)) ) || ( (LTLAP5==true)) ))) || ( (LTLAP6==true)) )), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>(X(( ((LTLAP0==true))U([](( ( ( ( <>((LTLAP1==true))) || ( (LTLAP2==true)) ) || ( (LTLAP3==true)) ) || ( (LTLAP4==true)) ) || ( (LTLAP5==true)) ))) || ( (LTLAP6==true)) )), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>(X(( ((LTLAP0==true))U([](( ( ( ( <>((LTLAP1==true))) || ( (LTLAP2==true)) ) || ( (LTLAP3==true)) ) || ( (LTLAP4==true)) ) || ( (LTLAP5==true)) ))) || ( (LTLAP6==true)) )), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 10188 deadlock states
16 unique states visited
0 strongly connected components in search stack
16 transitions explored
9 items max in DFS search stack
8458 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,84.6274,1476392,1,0,2.905e+06,93,1332,2.2473e+06,80,367,10727471
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA NQueens-PT-08-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F((!(X("((((i5.i0.u12.cX_4>=1)&&(i3.u23.cY_3>=1))&&(i5.i0.u8.L_8>=1))&&(i2.i1.u5.R_8>=1))")))U(G((F("((((i5.i0.u12.cX_4>=1)&&(i3.u23.cY_3>=1))&&(i5.i0.u8.L_8>=1))&&(i2.i1.u5.R_8>=1))"))U(X(X("((((i0.i1.u18.cX_7>=1)&&(i7.u22.cY_2>=1))&&(i0.i1.u13.L_12>=1))&&(i5.i1.u9.R_10>=1))"))))))))
Formula 1 simplified : !F(!X"((((i5.i0.u12.cX_4>=1)&&(i3.u23.cY_3>=1))&&(i5.i0.u8.L_8>=1))&&(i2.i1.u5.R_8>=1))" U G(F"((((i5.i0.u12.cX_4>=1)&&(i3.u23.cY_3>=1))&&(i5.i0.u8.L_8>=1))&&(i2.i1.u5.R_8>=1))" U XX"((((i0.i1.u18.cX_7>=1)&&(i7.u22.cY_2>=1))&&(i0.i1.u13.L_12>=1))&&(i5.i1.u9.R_10>=1))"))
Computing Next relation with stutter on 10188 deadlock states
11 unique states visited
11 strongly connected components in search stack
12 transitions explored
11 items max in DFS search stack
1248 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,97.1117,1598512,1,0,3.0818e+06,93,1397,2.40271e+06,80,367,11459613
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA NQueens-PT-08-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G((((((F("((((i0.i1.u18.cX_7>=1)&&(i3.u23.cY_3>=1))&&(i7.u33.L_11>=1))&&(i6.u42.R_11>=1))"))&&("(i6.u11.cX_3>=1)"))&&("(i6.u2.cY_4>=1)"))&&("(i1.u31.L_6>=1)"))&&("(i2.i1.u5.R_8>=1)"))U((X("((((i0.i0.u21.cX_6>=1)&&(i7.u22.cY_2>=1))&&(i7.u33.L_11>=1))&&(i4.i1.u41.R_9>=1))"))U(G(X("((((i6.u11.cX_3>=1)&&(i6.u2.cY_4>=1))&&(i1.u31.L_6>=1))&&(i2.i1.u5.R_8>=1))")))))))
Formula 2 simplified : !G(("(i1.u31.L_6>=1)" & "(i2.i1.u5.R_8>=1)" & "(i6.u2.cY_4>=1)" & "(i6.u11.cX_3>=1)" & F"((((i0.i1.u18.cX_7>=1)&&(i3.u23.cY_3>=1))&&(i7.u33.L_11>=1))&&(i6.u42.R_11>=1))") U (X"((((i0.i0.u21.cX_6>=1)&&(i7.u22.cY_2>=1))&&(i7.u33.L_11>=1))&&(i4.i1.u41.R_9>=1))" U GX"((((i6.u11.cX_3>=1)&&(i6.u2.cY_4>=1))&&(i1.u31.L_6>=1))&&(i2.i1.u5.R_8>=1))"))
Computing Next relation with stutter on 10188 deadlock states
12 unique states visited
12 strongly connected components in search stack
12 transitions explored
12 items max in DFS search stack
296 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,100.116,1642328,1,0,3.16336e+06,93,1518,2.46384e+06,80,367,11757425
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA NQueens-PT-08-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X((F(G(F(!(F((F("((((i0.i0.u21.cX_6>=1)&&(i7.u36.cY_1>=1))&&(i0.i1.u13.L_12>=1))&&(i2.i1.u5.R_8>=1))"))U(X("((((i0.i0.u21.cX_6>=1)&&(i4.i0.u25.cY_7>=1))&&(i1.u31.L_6>=1))&&(i1.u16.R_14>=1))"))))))))||(G("((((i4.i1.u20.cX_5>=1)&&(i7.u22.cY_2>=1))&&(i0.i0.u10.L_10>=1))&&(i2.i1.u5.R_8>=1))")))))
Formula 3 simplified : !X(FGF!F(F"((((i0.i0.u21.cX_6>=1)&&(i7.u36.cY_1>=1))&&(i0.i1.u13.L_12>=1))&&(i2.i1.u5.R_8>=1))" U X"((((i0.i0.u21.cX_6>=1)&&(i4.i0.u25.cY_7>=1))&&(i1.u31.L_6>=1))&&(i1.u16.R_14>=1))") | G"((((i4.i1.u20.cX_5>=1)&&(i7.u22.cY_2>=1))&&(i0.i0.u10.L_10>=1))&&(i2.i1.u5.R_8>=1))")
Computing Next relation with stutter on 10188 deadlock states
151 unique states visited
0 strongly connected components in search stack
202 transitions explored
11 items max in DFS search stack
7709 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,177.199,2313988,1,0,4.10104e+06,93,1599,3.30757e+06,80,367,16096623
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA NQueens-PT-08-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(X(!(X(F("((((i6.u11.cX_3>=1)&&(i7.u22.cY_2>=1))&&(i5.i0.u8.L_8>=1))&&(i5.i0.u39.R_6>=1))")))))))
Formula 4 simplified : !GX!XF"((((i6.u11.cX_3>=1)&&(i7.u22.cY_2>=1))&&(i5.i0.u8.L_8>=1))&&(i5.i0.u39.R_6>=1))"
Computing Next relation with stutter on 10188 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
3694 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,214.139,2455952,1,0,4.30796e+06,93,827,3.47437e+06,54,367,3445970
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA NQueens-PT-08-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((G("((((((((i6.u11.cX_3>=1)&&(i4.i0.u25.cY_7>=1))&&(i6.u28.L_3>=1))&&(i6.u42.R_11>=1))&&(i3.u6.cX_1>=1))&&(i4.i1.u24.cY_6>=1))&&(i5.i1.u27.L_2>=1))&&(i2.i1.u5.R_8>=1))"))&&(X((X(G(X("((((i5.i0.u12.cX_4<1)||(i4.i1.u24.cY_6<1))||(i6.u30.L_5<1))||(i6.u42.R_11<1))"))))&&(X("((((i6.u11.cX_3>=1)&&(i4.i0.u25.cY_7>=1))&&(i6.u28.L_3>=1))&&(i6.u42.R_11>=1))"))))))
Formula 5 simplified : !(G"((((((((i6.u11.cX_3>=1)&&(i4.i0.u25.cY_7>=1))&&(i6.u28.L_3>=1))&&(i6.u42.R_11>=1))&&(i3.u6.cX_1>=1))&&(i4.i1.u24.cY_6>=1))&&(i5.i1.u27.L_2>=1))&&(i2.i1.u5.R_8>=1))" & X(XGX"((((i5.i0.u12.cX_4<1)||(i4.i1.u24.cY_6<1))||(i6.u30.L_5<1))||(i6.u42.R_11<1))" & X"((((i6.u11.cX_3>=1)&&(i4.i0.u25.cY_7>=1))&&(i6.u28.L_3>=1))&&(i6.u42.R_11>=1))"))
Computing Next relation with stutter on 10188 deadlock states
10 unique states visited
10 strongly connected components in search stack
10 transitions explored
10 items max in DFS search stack
745 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,221.586,2455952,1,0,4.30796e+06,93,1129,3.47437e+06,65,367,5989883
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA NQueens-PT-08-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(!(X(("((((i0.i0.u21.cX_6>=1)&&(i4.i1.u24.cY_6>=1))&&(i4.i1.u0.L_7>=1))&&(i4.i1.u14.R_13>=1))")U(("((((i4.i1.u20.cX_5<1)||(i5.i1.u3.cY_5<1))||(i4.i1.u0.L_7<1))||(i6.u42.R_11<1))")U("((((i2.i0.u35.cX_0<1)||(i4.i0.u25.cY_7<1))||(i2.i1.u26.L_0<1))||(i2.i1.u5.R_8<1))")))))))
Formula 6 simplified : !X!X("((((i0.i0.u21.cX_6>=1)&&(i4.i1.u24.cY_6>=1))&&(i4.i1.u0.L_7>=1))&&(i4.i1.u14.R_13>=1))" U ("((((i4.i1.u20.cX_5<1)||(i5.i1.u3.cY_5<1))||(i4.i1.u0.L_7<1))||(i6.u42.R_11<1))" U "((((i2.i0.u35.cX_0<1)||(i4.i0.u25.cY_7<1))||(i2.i1.u26.L_0<1))||(i2.i1.u5.R_8<1))"))
Computing Next relation with stutter on 10188 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
965 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,231.243,2455952,1,0,4.30796e+06,93,1259,3.47437e+06,66,367,7348859
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA NQueens-PT-08-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((((G("((((i5.i1.u7.cX_2>=1)&&(i4.i1.u24.cY_6>=1))&&(i6.u28.L_3>=1))&&(i4.i1.u41.R_9>=1))"))U("((((i5.i1.u7.cX_2>=1)&&(i4.i1.u24.cY_6>=1))&&(i6.u28.L_3>=1))&&(i4.i1.u41.R_9>=1))"))&&(F(X((G("((((i0.i0.u21.cX_6>=1)&&(i7.u36.cY_1>=1))&&(i0.i1.u13.L_12>=1))&&(i2.i1.u5.R_8>=1))"))&&("((((i0.i1.u18.cX_7<1)||(i2.i0.u15.cY_0<1))||(i2.i1.u17.L_14<1))||(i2.i1.u5.R_8<1))"))))))
Formula 7 simplified : !((G"((((i5.i1.u7.cX_2>=1)&&(i4.i1.u24.cY_6>=1))&&(i6.u28.L_3>=1))&&(i4.i1.u41.R_9>=1))" U "((((i5.i1.u7.cX_2>=1)&&(i4.i1.u24.cY_6>=1))&&(i6.u28.L_3>=1))&&(i4.i1.u41.R_9>=1))") & FX("((((i0.i1.u18.cX_7<1)||(i2.i0.u15.cY_0<1))||(i2.i1.u17.L_14<1))||(i2.i1.u5.R_8<1))" & G"((((i0.i0.u21.cX_6>=1)&&(i7.u36.cY_1>=1))&&(i0.i1.u13.L_12>=1))&&(i2.i1.u5.R_8>=1))"))
Computing Next relation with stutter on 10188 deadlock states
9 unique states visited
9 strongly connected components in search stack
9 transitions explored
9 items max in DFS search stack
1845 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,249.698,2455952,1,0,4.30796e+06,93,1379,3.47437e+06,66,367,9457671
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA NQueens-PT-08-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X((((((!(("((((i5.i0.u12.cX_4>=1)&&(i6.u2.cY_4>=1))&&(i4.i1.u0.L_7>=1))&&(i4.i1.u41.R_9>=1))")U("((((i0.i0.u21.cX_6>=1)&&(i3.u23.cY_3>=1))&&(i0.i0.u10.L_10>=1))&&(i5.i1.u9.R_10>=1))")))&&("(i5.i0.u12.cX_4>=1)"))&&("(i6.u2.cY_4>=1)"))&&("(i4.i1.u0.L_7>=1)"))&&("(i4.i1.u41.R_9>=1)"))U(X(G("((((i5.i0.u12.cX_4<1)||(i6.u2.cY_4<1))||(i4.i1.u0.L_7<1))||(i4.i1.u41.R_9<1))"))))))
Formula 8 simplified : !X(("(i4.i1.u0.L_7>=1)" & "(i4.i1.u41.R_9>=1)" & "(i5.i0.u12.cX_4>=1)" & "(i6.u2.cY_4>=1)" & !("((((i5.i0.u12.cX_4>=1)&&(i6.u2.cY_4>=1))&&(i4.i1.u0.L_7>=1))&&(i4.i1.u41.R_9>=1))" U "((((i0.i0.u21.cX_6>=1)&&(i3.u23.cY_3>=1))&&(i0.i0.u10.L_10>=1))&&(i5.i1.u9.R_10>=1))")) U XG"((((i5.i0.u12.cX_4<1)||(i6.u2.cY_4<1))||(i4.i1.u0.L_7<1))||(i4.i1.u41.R_9<1))")
Computing Next relation with stutter on 10188 deadlock states
11 unique states visited
5 strongly connected components in search stack
12 transitions explored
9 items max in DFS search stack
1841 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,268.115,2455952,1,0,4.30796e+06,93,1558,3.47437e+06,66,367,11225812
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA NQueens-PT-08-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((X(X("((((((((i0.i1.u18.cX_7>=1)&&(i3.u23.cY_3>=1))&&(i7.u33.L_11>=1))&&(i6.u42.R_11>=1))&&(i5.i1.u7.cX_2>=1))&&(i3.u23.cY_3>=1))&&(i1.u31.L_6>=1))&&(i5.i0.u39.R_6>=1))")))||(!(G("((((i2.i0.u35.cX_0>=1)&&(i5.i1.u3.cY_5>=1))&&(i5.i1.u27.L_2>=1))&&(i5.i0.u39.R_6>=1))")))))
Formula 9 simplified : !(XX"((((((((i0.i1.u18.cX_7>=1)&&(i3.u23.cY_3>=1))&&(i7.u33.L_11>=1))&&(i6.u42.R_11>=1))&&(i5.i1.u7.cX_2>=1))&&(i3.u23.cY_3>=1))&&(i1.u31.L_6>=1))&&(i5.i0.u39.R_6>=1))" | !G"((((i2.i0.u35.cX_0>=1)&&(i5.i1.u3.cY_5>=1))&&(i5.i1.u27.L_2>=1))&&(i5.i0.u39.R_6>=1))")
Computing Next relation with stutter on 10188 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
384 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,271.955,2455952,1,0,4.30796e+06,93,1651,3.47437e+06,66,367,11788523
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA NQueens-PT-08-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1589828174249

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

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