Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r227-oct2-159033546300202.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 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 Sudoku-COL-AN07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-oct2-159033546300202
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 172K
-rw-r--r-- 1 mcc users 3.5K May 14 03:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 14 03:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 21:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 21:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 14 10:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.7K May 13 15:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 15:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 10:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K May 13 10:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 12 20:42 equiv_pt
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 5 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 6.5K May 12 20:42 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 Sudoku-COL-AN07-00
FORMULA_NAME Sudoku-COL-AN07-01
FORMULA_NAME Sudoku-COL-AN07-02
FORMULA_NAME Sudoku-COL-AN07-03
FORMULA_NAME Sudoku-COL-AN07-04
FORMULA_NAME Sudoku-COL-AN07-05
FORMULA_NAME Sudoku-COL-AN07-06
FORMULA_NAME Sudoku-COL-AN07-07
FORMULA_NAME Sudoku-COL-AN07-08
FORMULA_NAME Sudoku-COL-AN07-09
FORMULA_NAME Sudoku-COL-AN07-10
FORMULA_NAME Sudoku-COL-AN07-11
FORMULA_NAME Sudoku-COL-AN07-12
FORMULA_NAME Sudoku-COL-AN07-13
FORMULA_NAME Sudoku-COL-AN07-14
FORMULA_NAME Sudoku-COL-AN07-15

=== Now, execution of the tool begins

BK_START 1590484378255

[2020-05-26 09:12:59] [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-26 09:12:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-26 09:12:59] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-26 09:13:00] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 445 ms
[2020-05-26 09:13:00] [INFO ] sort/places :
N2->Rows,Cells,Columns,
N3->Board,

[2020-05-26 09:13:00] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition select
[2020-05-26 09:13:00] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition select
[2020-05-26 09:13:00] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition select
[2020-05-26 09:13:00] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 324 PT places and 216.0 transition bindings in 12 ms.
[2020-05-26 09:13:00] [INFO ] Computed order based on color domains.
[2020-05-26 09:13:00] [INFO ] Unfolded HLPN to a Petri net with 324 places and 216 transitions in 24 ms.
[2020-05-26 09:13:00] [INFO ] Unfolded HLPN properties in 1 ms.
Deduced a syphon composed of 320 places in 1 ms
Reduce places removed 320 places and 215 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 105 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 50000 resets, run finished after 94 ms. (steps per millisecond=1063 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 1, 1]
// Phase 1: matrix 1 rows 4 cols
[2020-05-26 09:13:00] [INFO ] Computed 3 place invariants in 2 ms
[2020-05-26 09:13:00] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-26 09:13:00] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-05-26 09:13:00] [INFO ] Flatten gal took : 14 ms
FORMULA Sudoku-COL-AN07-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-26 09:13:00] [INFO ] Flatten gal took : 2 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-26 09:13:00] [INFO ] Applying decomposition
[2020-05-26 09:13:00] [INFO ] Flatten gal took : 4 ms
[2020-05-26 09:13:00] [INFO ] Input system was already deterministic with 1 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/graph6380095784863206209.txt, -o, /tmp/graph6380095784863206209.bin, -w, /tmp/graph6380095784863206209.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 1 rows 4 cols
[2020-05-26 09:13:00] [INFO ] Computed 3 place invariants in 0 ms
inv : Board_0 + Cells_0 = 1
inv : Rows_0 + Board_0 = 1
inv : Board_0 + Columns_0 = 1
Total of 3 invariants.
[2020-05-26 09:13:00] [INFO ] Computed 3 place invariants in 1 ms
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph6380095784863206209.bin, -l, -1, -v, -w, /tmp/graph6380095784863206209.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-26 09:13:00] [INFO ] Proved 4 variables to be positive in 22 ms
[2020-05-26 09:13:00] [INFO ] Computing symmetric may disable matrix : 1 transitions.
[2020-05-26 09:13:00] [INFO ] Computation of disable matrix completed :0/1 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:13:00] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:13:00] [INFO ] Computing symmetric may enable matrix : 1 transitions.
[2020-05-26 09:13:00] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:13:00] [INFO ] Decomposing Gal with order
[2020-05-26 09:13:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-26 09:13:00] [INFO ] Flatten gal took : 1 ms
[2020-05-26 09:13:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2020-05-26 09:13:00] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 0 ms
[2020-05-26 09:13:00] [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]

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 9 LTL properties
Checking formula 0 : !((!(("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")U(G((X(G(X(F(!(G("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")))))))U("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))"))))))
Formula 0 simplified : "(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))" U G(XGXF!G"(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))" U "(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")
built 0 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.016879,16832,1,0,6,27,32,3,66,13,19
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Sudoku-COL-AN07-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!(G(((F(X("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")))&&(F(X(G("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")))))&&(G("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))"))))))
Formula 1 simplified : G(FX"(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))" & G"(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))" & FXG"(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")
Computing Next relation with stutter on 1 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.017402,17088,1,0,6,27,36,5,66,16,23
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Sudoku-COL-AN07-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F((G("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))"))&&((F("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))"))||("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")))))
Formula 2 simplified : !F(G"(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))" & ("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))" | F"(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))"))
Computing Next relation with stutter on 1 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.017823,17088,1,0,6,27,36,5,66,16,30
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Sudoku-COL-AN07-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X((X((F(((G(X("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")))||("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))"))||("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")))&&(G("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))"))))||("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))"))))
Formula 3 simplified : !X("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))" | X(F("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))" | GX"(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))") & G"(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))"))
Computing Next relation with stutter on 1 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.018435,17276,1,0,6,27,42,5,67,16,35
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Sudoku-COL-AN07-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(G("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))"))))
Formula 4 simplified : !FG"(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))"
Computing Next relation with stutter on 1 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.018792,17276,1,0,6,27,42,5,67,16,35
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Sudoku-COL-AN07-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G((X((!(F("((((((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))&&(u0.Rows_0>=1))&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")))||("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")))U(G(X("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))"))))))
Formula 5 simplified : !G(X("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))" | !F"((((((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))&&(u0.Rows_0>=1))&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))") U GX"(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
2 strongly connected components in search stack
6 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.021183,17672,1,0,6,27,64,6,85,17,52
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Sudoku-COL-AN07-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(X((X("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))"))U("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")))))
Formula 6 simplified : X(X"(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))" U "(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 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.02152,17672,1,0,6,27,64,6,85,17,52
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA Sudoku-COL-AN07-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F((X(X("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")))U(X(X("(((u0.Rows_0<1)||(u0.Cells_0<1))||(u0.Columns_0<1))"))))))
Formula 7 simplified : !F(XX"(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))" U XX"(((u0.Rows_0<1)||(u0.Cells_0<1))||(u0.Columns_0<1))")
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 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.021831,17672,1,0,6,27,76,6,87,17,56
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA Sudoku-COL-AN07-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G((X("(((u0.Rows_0<1)||(u0.Cells_0<1))||(u0.Columns_0<1))"))||(F("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")))))
Formula 8 simplified : !G(X"(((u0.Rows_0<1)||(u0.Cells_0<1))||(u0.Columns_0<1))" | F"(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 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.022393,17672,1,0,6,27,79,6,89,17,58
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA Sudoku-COL-AN07-15 TRUE 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-26 09:13:00] [INFO ] Built C files in 134ms 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 1590484380855

--------------------
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="Sudoku-COL-AN07"
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 Sudoku-COL-AN07, 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 r227-oct2-159033546300202"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN07.tgz
mv Sudoku-COL-AN07 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 ;