Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r107-oct2-155272230000007.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-3954
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 r107-oct2-155272230000007
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.2K Feb 11 23:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 11 23:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 7 23:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 7 23:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 100 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 338 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 5 00:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 00:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 4 06:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 4 06:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 1 00:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 1 00:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 27K Mar 10 17:31 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-LTLFireability-00
FORMULA_NAME NQueens-PT-05-LTLFireability-01
FORMULA_NAME NQueens-PT-05-LTLFireability-02
FORMULA_NAME NQueens-PT-05-LTLFireability-03
FORMULA_NAME NQueens-PT-05-LTLFireability-04
FORMULA_NAME NQueens-PT-05-LTLFireability-05
FORMULA_NAME NQueens-PT-05-LTLFireability-06
FORMULA_NAME NQueens-PT-05-LTLFireability-07
FORMULA_NAME NQueens-PT-05-LTLFireability-08
FORMULA_NAME NQueens-PT-05-LTLFireability-09
FORMULA_NAME NQueens-PT-05-LTLFireability-10
FORMULA_NAME NQueens-PT-05-LTLFireability-11
FORMULA_NAME NQueens-PT-05-LTLFireability-12
FORMULA_NAME NQueens-PT-05-LTLFireability-13
FORMULA_NAME NQueens-PT-05-LTLFireability-14
FORMULA_NAME NQueens-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1552909591838

Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903111103/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.201903111103/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 16 LTL properties
Checking formula 0 : !((G((F(F("((((cY_0>=1)&&(L_7>=1))&&(R_4>=1))&&(cX_3>=1))")))U(G(X("((((cY_2>=1)&&(L_4>=1))&&(R_5>=1))&&(cX_2>=1))"))))))
Formula 0 simplified : !G(F"((((cY_0>=1)&&(L_7>=1))&&(R_4>=1))&&(cX_3>=1))" U GX"((((cY_2>=1)&&(L_4>=1))&&(R_5>=1))&&(cX_2>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 58 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 25 rows 53 cols
invariant :P_4_0 + L_8 = 1
invariant :P_4_1 + P_4_2 + P_4_3 + cX_4 + -1'L_8 + -1'R_9 = -1
invariant :P_2_1 + -1'P_3_3 + -1'P_4_2 + -1'cX_3 + -2'cX_4 + -1'cY_2 + -2'cY_3 + -3'cY_4 + 2'L_0 + L_1 + L_2 + L_8 + R_4 + R_5 + 2'R_6 + 2'R_7 + 4'R_8 + 5'R_9 = 11
invariant :P_0_4 + L_0 = 1
invariant :P_2_2 + -1'cX_3 + -2'cX_4 + -1'cY_3 + -2'cY_4 + L_0 + L_1 + L_7 + L_8 + R_5 + R_6 + 2'R_7 + 3'R_8 + 4'R_9 = 9
invariant :P_0_2 + P_3_2 + -1'cX_4 + -1'cY_3 + -2'cY_4 + 2'L_0 + L_1 + L_2 + L_8 + R_6 + R_7 + 2'R_8 + 3'R_9 = 8
invariant :P_4_4 + R_9 = 1
invariant :P_2_0 + -1'P_3_2 + -1'P_3_3 + -1'cX_3 + -1'cX_4 + L_6 + L_7 + L_8 + R_8 + R_9 = 3
invariant :cX_0 + cX_3 + 3'cX_4 + cY_2 + 3'cY_3 + 6'cY_4 + -6'L_0 + -3'L_1 + -2'L_2 + L_5 + -2'L_8 + -1'R_1 + -1'R_2 + -1'R_4 + -1'R_5 + -3'R_6 + -4'R_7 + -7'R_8 + -9'R_9 = -24
invariant :L_1 + L_3 + L_5 + L_7 + -1'R_2 + -1'R_4 + -1'R_6 + -1'R_8 = 0
invariant :P_1_0 + P_3_2 + P_3_3 + P_4_2 + P_4_3 + cX_3 + 2'cX_4 + cY_2 + 2'cY_3 + 3'cY_4 + -2'L_0 + -1'L_1 + -1'L_2 + L_5 + -1'L_8 + -1'R_4 + -1'R_5 + -2'R_6 + -2'R_7 + -4'R_8 + -5'R_9 = -10
invariant :P_0_3 + P_3_3 + P_4_2 + P_4_3 + -1'cY_4 + L_0 + L_1 + R_7 + R_8 + R_9 = 4
invariant :P_3_4 + P_4_3 + R_8 = 1
invariant :P_1_3 + -1'P_3_2 + -1'P_3_3 + -1'P_4_2 + cX_4 + cY_3 + 2'cY_4 + -2'L_0 + -1'L_1 + -1'L_8 + -1'R_6 + -2'R_7 + -2'R_8 + -3'R_9 = -8
invariant :cY_0 + -1'cY_2 + -2'cY_3 + -3'cY_4 + 2'L_0 + L_1 + L_2 + -1'L_5 + -1'L_6 + -2'L_7 + -2'L_8 + -1'R_1 + R_4 + R_5 + 2'R_6 + 2'R_7 + 3'R_8 + 3'R_9 = 4
invariant :P_3_0 + -1'P_4_2 + -1'P_4_3 + -1'cX_4 + L_7 + L_8 + R_9 = 2
invariant :P_3_1 + P_3_2 + P_3_3 + P_4_2 + cX_3 + cX_4 + -1'L_7 + -1'L_8 + -1'R_8 + -1'R_9 = -2
invariant :cY_1 + 2'cY_2 + 3'cY_3 + 4'cY_4 + -2'L_0 + -1'L_1 + -1'L_2 + L_5 + L_6 + 2'L_7 + 2'L_8 + -1'R_2 + -1'R_3 + -2'R_4 + -2'R_5 + -3'R_6 + -3'R_7 + -4'R_8 + -4'R_9 = -8
invariant :P_1_2 + P_4_2 + cX_3 + 3'cX_4 + cY_2 + 2'cY_3 + 4'cY_4 + -3'L_0 + -2'L_1 + -1'L_2 + -1'L_7 + -2'L_8 + -1'R_5 + -2'R_6 + -3'R_7 + -5'R_8 + -7'R_9 = -16
invariant :L_0 + L_2 + L_4 + L_6 + L_8 + -1'R_1 + -1'R_3 + -1'R_5 + -1'R_7 + -1'R_9 = 0
invariant :P_1_4 + -1'P_3_3 + -1'P_4_2 + -1'P_4_3 + cY_4 + -1'L_0 + -1'R_7 + -1'R_8 + -1'R_9 = -3
invariant :P_1_1 + P_3_3 + cX_3 + 2'cX_4 + cY_3 + 2'cY_4 + -2'L_0 + -1'L_1 + -1'L_2 + -1'L_6 + -1'L_7 + -2'L_8 + R_3 + -1'R_6 + -1'R_7 + -3'R_8 + -4'R_9 = -10
invariant :cX_2 + 3'cX_3 + 6'cX_4 + cY_2 + 3'cY_3 + 6'cY_4 + -4'L_0 + -2'L_1 + -1'L_2 + -1'L_6 + -2'L_7 + -4'L_8 + -1'R_4 + -2'R_5 + -4'R_6 + -6'R_7 + -9'R_8 + -12'R_9 = -28
invariant :cX_1 + -3'cX_3 + -8'cX_4 + -2'cY_2 + -6'cY_3 + -12'cY_4 + 10'L_0 + 5'L_1 + 3'L_2 + -1'L_5 + L_6 + 2'L_7 + 6'L_8 + -1'R_3 + R_4 + 2'R_5 + 6'R_6 + 9'R_7 + 15'R_8 + 20'R_9 = 48
invariant :P_0_0 + R_1 = 1
invariant :P_0_1 + -1'P_3_2 + -1'P_3_3 + -1'P_4_2 + -1'P_4_3 + -1'cX_3 + -2'cX_4 + -1'cY_2 + -2'cY_3 + -3'cY_4 + 2'L_0 + L_1 + L_2 + -1'L_5 + L_8 + R_2 + R_4 + R_5 + 2'R_6 + 2'R_7 + 4'R_8 + 5'R_9 = 11
invariant :P_2_3 + P_3_2 + P_3_3 + -1'cX_4 + -1'cY_4 + L_0 + L_8 + R_6 + R_7 + R_8 + 2'R_9 = 5
invariant :P_2_4 + P_3_3 + P_4_2 + R_7 = 1
9 unique states visited
9 strongly connected components in search stack
10 transitions explored
9 items max in DFS search stack
21 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.232891,27240,1,0,18,38276,32,21,1018,22144,72
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !(("((((cY_0>=1)&&(L_8>=1))&&(R_5>=1))&&(cX_4>=1))"))
Formula 1 simplified : !"((((cY_0>=1)&&(L_8>=1))&&(R_5>=1))&&(cX_4>=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
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.233446,27240,1,0,18,38276,35,21,1024,22144,74
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA NQueens-PT-05-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((F(X("((((cY_1>=1)&&(L_5>=1))&&(R_4>=1))&&(cX_2>=1))"))))
Formula 2 simplified : !FX"((((cY_1>=1)&&(L_5>=1))&&(R_4>=1))&&(cX_2>=1))"
Computing Next relation with stutter on 58 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.279801,28556,1,0,37,43567,44,40,1030,34136,125
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((F(X((G("((((cY_1>=1)&&(L_3>=1))&&(R_2>=1))&&(cX_0>=1))"))U(F("((((cY_3>=1)&&(L_4>=1))&&(R_7>=1))&&(cX_3>=1))"))))))
Formula 3 simplified : !FX(G"((((cY_1>=1)&&(L_3>=1))&&(R_2>=1))&&(cX_0>=1))" U F"((((cY_3>=1)&&(L_4>=1))&&(R_7>=1))&&(cX_3>=1))")
Computing Next relation with stutter on 58 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.303498,29592,1,0,53,46857,53,58,1036,40678,173
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((F("((((cY_2>=1)&&(L_3>=1))&&(R_4>=1))&&(cX_1>=1))")))
Formula 4 simplified : !F"((((cY_2>=1)&&(L_3>=1))&&(R_4>=1))&&(cX_1>=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
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.304134,29592,1,0,53,46857,62,58,1042,40678,177
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA NQueens-PT-05-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X(G("((((cY_4>=1)&&(L_0>=1))&&(R_5>=1))&&(cX_0>=1))"))))
Formula 5 simplified : !XG"((((cY_4>=1)&&(L_0>=1))&&(R_5>=1))&&(cX_0>=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
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.336815,30904,1,0,74,50974,70,77,1051,48556,227
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((X(X(G(F(F("((((cY_0>=1)&&(L_4>=1))&&(R_1>=1))&&(cX_0>=1))")))))))
Formula 6 simplified : !XXGF"((((cY_0>=1)&&(L_4>=1))&&(R_1>=1))&&(cX_0>=1))"
Computing Next relation with stutter on 58 deadlock states
8 unique states visited
8 strongly connected components in search stack
9 transitions explored
8 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.353858,31668,1,0,79,52230,79,83,1056,50119,253
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((X(G(G(G("((((cY_3>=1)&&(L_3>=1))&&(R_6>=1))&&(cX_2>=1))"))))))
Formula 7 simplified : !XG"((((cY_3>=1)&&(L_3>=1))&&(R_6>=1))&&(cX_2>=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.401171,32460,1,0,100,55919,85,102,1063,57222,301
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((((X("((((cY_2>=1)&&(L_2>=1))&&(R_3>=1))&&(cX_0>=1))"))U("((((cY_4>=1)&&(L_4>=1))&&(R_9>=1))&&(cX_4>=1))"))U(X(("((((cY_4>=1)&&(L_0>=1))&&(R_5>=1))&&(cX_0>=1))")U("((((cY_0>=1)&&(L_4>=1))&&(R_1>=1))&&(cX_0>=1))")))))
Formula 8 simplified : !((X"((((cY_2>=1)&&(L_2>=1))&&(R_3>=1))&&(cX_0>=1))" U "((((cY_4>=1)&&(L_4>=1))&&(R_9>=1))&&(cX_4>=1))") U X("((((cY_4>=1)&&(L_0>=1))&&(R_5>=1))&&(cX_0>=1))" U "((((cY_0>=1)&&(L_4>=1))&&(R_1>=1))&&(cX_0>=1))"))
Computing Next relation with stutter on 58 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.444555,34924,1,0,122,60701,106,126,1087,67403,363
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((X(F(G(("((((cY_3>=1)&&(L_5>=1))&&(R_8>=1))&&(cX_4>=1))")U("((((cY_1>=1)&&(L_7>=1))&&(R_6>=1))&&(cX_4>=1))"))))))
Formula 9 simplified : !XFG("((((cY_3>=1)&&(L_5>=1))&&(R_8>=1))&&(cX_4>=1))" U "((((cY_1>=1)&&(L_7>=1))&&(R_6>=1))&&(cX_4>=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
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.48476,36704,1,0,143,65357,122,146,1108,75198,440
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((X("((((cY_3>=1)&&(L_2>=1))&&(R_5>=1))&&(cX_1>=1))")))
Formula 10 simplified : !X"((((cY_3>=1)&&(L_2>=1))&&(R_5>=1))&&(cX_1>=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
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.493973,37256,1,0,149,66551,125,153,1112,76924,459
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((F("((((cY_4>=1)&&(L_3>=1))&&(R_8>=1))&&(cX_3>=1))")))
Formula 11 simplified : !F"((((cY_4>=1)&&(L_3>=1))&&(R_8>=1))&&(cX_3>=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
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.494566,37256,1,0,149,66551,134,153,1116,76924,463
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA NQueens-PT-05-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((F((F(G("((((cY_1>=1)&&(L_7>=1))&&(R_6>=1))&&(cX_4>=1))")))U("((((cY_4>=1)&&(L_0>=1))&&(R_5>=1))&&(cX_0>=1))"))))
Formula 12 simplified : !F(FG"((((cY_1>=1)&&(L_7>=1))&&(R_6>=1))&&(cX_4>=1))" U "((((cY_4>=1)&&(L_0>=1))&&(R_5>=1))&&(cX_0>=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
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.495171,37520,1,0,149,66551,140,153,1116,76924,467
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA NQueens-PT-05-LTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((G(X(("((((cY_4>=1)&&(L_2>=1))&&(R_7>=1))&&(cX_2>=1))")U(X("((((cY_3>=1)&&(L_3>=1))&&(R_6>=1))&&(cX_2>=1))"))))))
Formula 13 simplified : !GX("((((cY_4>=1)&&(L_2>=1))&&(R_7>=1))&&(cX_2>=1))" U X"((((cY_3>=1)&&(L_3>=1))&&(R_6>=1))&&(cX_2>=1))")
Computing Next relation with stutter on 58 deadlock states
10 unique states visited
10 strongly connected components in search stack
11 transitions explored
10 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.498148,37520,1,0,149,66566,143,153,1120,76987,471
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((G(F(X(("((((cY_1>=1)&&(L_6>=1))&&(R_5>=1))&&(cX_3>=1))")U("((((cY_3>=1)&&(L_3>=1))&&(R_6>=1))&&(cX_2>=1))"))))))
Formula 14 simplified : !GFX("((((cY_1>=1)&&(L_6>=1))&&(R_5>=1))&&(cX_3>=1))" U "((((cY_3>=1)&&(L_3>=1))&&(R_6>=1))&&(cX_2>=1))")
Computing Next relation with stutter on 58 deadlock states
8 unique states visited
8 strongly connected components in search stack
9 transitions explored
8 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.498783,37712,1,0,149,66566,149,153,1120,76987,475
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((G(F((F("((((cY_4>=1)&&(L_2>=1))&&(R_7>=1))&&(cX_2>=1))"))U("((((cY_2>=1)&&(L_4>=1))&&(R_5>=1))&&(cX_2>=1))")))))
Formula 15 simplified : !GF(F"((((cY_4>=1)&&(L_2>=1))&&(R_7>=1))&&(cX_2>=1))" U "((((cY_2>=1)&&(L_4>=1))&&(R_5>=1))&&(cX_2>=1))")
Computing Next relation with stutter on 58 deadlock states
8 unique states visited
8 strongly connected components in search stack
9 transitions explored
8 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.509651,37712,1,0,154,67808,153,160,1120,78434,500
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
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 1552909594207

--------------------
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/ -smt
+ 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/ -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Mar 18, 2019 11:46:33 AM fr.lip6.move.gal.application.Application start
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/, -smt]
Mar 18, 2019 11:46:33 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 18, 2019 11:46:33 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 27 ms
Mar 18, 2019 11:46:33 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 55 places.
Mar 18, 2019 11:46:33 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 25 transitions.
Mar 18, 2019 11:46:33 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 6 ms
Mar 18, 2019 11:46:33 AM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 2 fixed domain variables (out of 55 variables) in GAL type NQueens_PT_05
Mar 18, 2019 11:46:33 AM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: Found a total of 2 constant array cells/variables (out of 55 variables) in type NQueens_PT_05
Mar 18, 2019 11:46:33 AM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: L_9,R_0,
Mar 18, 2019 11:46:33 AM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 2 fixed domain variables (out of 55 variables) in GAL type NQueens_PT_05
Mar 18, 2019 11:46:33 AM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: Found a total of 2 constant array cells/variables (out of 55 variables) in type NQueens_PT_05
Mar 18, 2019 11:46:33 AM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: L_9,R_0,
Mar 18, 2019 11:46:33 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Removed 2 constant variables :L_9=1, R_0=1
Mar 18, 2019 11:46:33 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 28 ms
Mar 18, 2019 11:46:33 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
Mar 18, 2019 11:46:33 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Mar 18, 2019 11:46:33 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 25 transitions.
Mar 18, 2019 11:46:33 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 28 place invariants in 11 ms
Mar 18, 2019 11:46:33 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 53 variables to be positive in 95 ms
Mar 18, 2019 11:46:33 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 25 transitions.
Mar 18, 2019 11:46:33 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/25 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 18, 2019 11:46:33 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 18, 2019 11:46:33 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 25 transitions.
Mar 18, 2019 11:46:33 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 18, 2019 11:46:34 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
Mar 18, 2019 11:46:34 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s1 () (Array Int Int)) with error (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Mar 18, 2019 11:46:34 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (and (and (and (>= (select s0 33) 1) (>= (select s0 36) 1)) (>= (select s0 47) 1)) (>= (select s0 25) 1)) (= (store (store (store (store (store s0 47 (- (select s0 47) 1)) 33 (- (select s0 33) 1)) 36 (- (select s0 36) 1)) 25 (- (select s0 25) 1)) 3 (+ (select s0 3) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (and (and (and (>= (select s0 33) 1) (>= (select s0 36) 1)) (>= (select s0 47) 1)) (>= (select s0 25) 1)) (= (store (store (store (store (store s0 47 (- (select s0 47) 1)) 33 (- (select s0 33) 1)) 36 (- (select s0 36) 1)) 25 (- (select s0 25) 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:755)
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:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Mar 18, 2019 11:46:34 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 502ms conformant to PINS in folder :/home/mcc/execution

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-3954"
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 r107-oct2-155272230000007"
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" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "UpperBounds" ] ; 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
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 ;