Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.................
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.5K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 244K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is Dekker-PT-020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r237-blw3-152732477600025
=====================================================================

--------------------
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 Dekker-PT-020-LTLCardinality-00
FORMULA_NAME Dekker-PT-020-LTLCardinality-01
FORMULA_NAME Dekker-PT-020-LTLCardinality-02
FORMULA_NAME Dekker-PT-020-LTLCardinality-03
FORMULA_NAME Dekker-PT-020-LTLCardinality-04
FORMULA_NAME Dekker-PT-020-LTLCardinality-05
FORMULA_NAME Dekker-PT-020-LTLCardinality-06
FORMULA_NAME Dekker-PT-020-LTLCardinality-07
FORMULA_NAME Dekker-PT-020-LTLCardinality-08
FORMULA_NAME Dekker-PT-020-LTLCardinality-09
FORMULA_NAME Dekker-PT-020-LTLCardinality-10
FORMULA_NAME Dekker-PT-020-LTLCardinality-11
FORMULA_NAME Dekker-PT-020-LTLCardinality-12
FORMULA_NAME Dekker-PT-020-LTLCardinality-13
FORMULA_NAME Dekker-PT-020-LTLCardinality-14
FORMULA_NAME Dekker-PT-020-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527985618599

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.201805241334/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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.201805241334/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(((F("(flag_1_10>=1)"))U(G(G("(p1_8<=p3_16)")))))
Formula 0 simplified : !(F"(flag_1_10>=1)" U G"(p1_8<=p3_16)")
Reverse transition relation is NOT exact ! Due to transitions exit_0, exit_1, exit_2, exit_3, exit_4, exit_5, exit_6, exit_7, exit_8, exit_9, exit_10, exit_11, exit_12, exit_13, exit_14, exit_15, exit_16, exit_17, exit_18, exit_19, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/420/20/440
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 80
// Phase 1: matrix 80 rows 100 cols
invariant :p0_8 + p1_8 + p3_8 = 1
invariant :p0_12 + p1_12 + p3_12 = 1
invariant :flag_0_1 + p1_1 + p3_1 = 1
invariant :flag_1_5 + -1'p1_5 + -1'p3_5 = 0
invariant :p0_4 + p1_4 + p3_4 = 1
invariant :p0_11 + p1_11 + p3_11 = 1
invariant :flag_0_13 + p1_13 + p3_13 = 1
invariant :flag_1_9 + -1'p1_9 + -1'p3_9 = 0
invariant :flag_0_19 + p1_19 + p3_19 = 1
invariant :p0_1 + p1_1 + p3_1 = 1
invariant :flag_0_15 + p1_15 + p3_15 = 1
invariant :flag_0_9 + p1_9 + p3_9 = 1
invariant :flag_0_12 + p1_12 + p3_12 = 1
invariant :flag_1_14 + -1'p1_14 + -1'p3_14 = 0
invariant :flag_1_15 + -1'p1_15 + -1'p3_15 = 0
invariant :flag_1_7 + -1'p1_7 + -1'p3_7 = 0
invariant :p0_15 + p1_15 + p3_15 = 1
invariant :flag_1_4 + -1'p1_4 + -1'p3_4 = 0
invariant :flag_1_13 + -1'p1_13 + -1'p3_13 = 0
invariant :p0_3 + p1_3 + p3_3 = 1
invariant :p0_16 + p1_16 + p3_16 = 1
invariant :p0_6 + p1_6 + p3_6 = 1
invariant :flag_1_11 + -1'p1_11 + -1'p3_11 = 0
invariant :p0_17 + p1_17 + p3_17 = 1
invariant :flag_1_6 + -1'p1_6 + -1'p3_6 = 0
invariant :flag_0_18 + p1_18 + p3_18 = 1
invariant :p0_2 + p1_2 + p3_2 = 1
invariant :flag_0_3 + p1_3 + p3_3 = 1
invariant :flag_1_0 + -1'p1_0 + -1'p3_0 = 0
invariant :flag_0_17 + p1_17 + p3_17 = 1
invariant :flag_0_8 + p1_8 + p3_8 = 1
invariant :p0_18 + p1_18 + p3_18 = 1
invariant :flag_0_14 + p1_14 + p3_14 = 1
invariant :p0_13 + p1_13 + p3_13 = 1
invariant :flag_1_1 + -1'p1_1 + -1'p3_1 = 0
invariant :flag_0_11 + p1_11 + p3_11 = 1
invariant :p0_10 + p1_10 + p3_10 = 1
invariant :p0_14 + p1_14 + p3_14 = 1
invariant :flag_1_2 + -1'p1_2 + -1'p3_2 = 0
invariant :p0_9 + p1_9 + p3_9 = 1
invariant :flag_0_10 + p1_10 + p3_10 = 1
invariant :flag_0_2 + p1_2 + p3_2 = 1
invariant :flag_1_12 + -1'p1_12 + -1'p3_12 = 0
invariant :flag_1_3 + -1'p1_3 + -1'p3_3 = 0
invariant :flag_1_17 + -1'p1_17 + -1'p3_17 = 0
invariant :flag_1_19 + -1'p1_19 + -1'p3_19 = 0
invariant :flag_0_4 + p1_4 + p3_4 = 1
invariant :flag_0_6 + p1_6 + p3_6 = 1
invariant :p0_7 + p1_7 + p3_7 = 1
invariant :flag_0_7 + p1_7 + p3_7 = 1
invariant :flag_0_16 + p1_16 + p3_16 = 1
invariant :flag_0_5 + p1_5 + p3_5 = 1
invariant :p0_19 + p1_19 + p3_19 = 1
invariant :flag_1_8 + -1'p1_8 + -1'p3_8 = 0
invariant :flag_1_18 + -1'p1_18 + -1'p3_18 = 0
invariant :flag_1_10 + -1'p1_10 + -1'p3_10 = 0
invariant :p0_0 + p1_0 + p3_0 = 1
invariant :flag_0_0 + p1_0 + p3_0 = 1
invariant :p0_5 + p1_5 + p3_5 = 1
invariant :flag_1_16 + -1'p1_16 + -1'p3_16 = 0
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
81 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.888285,47412,1,0,956,205802,907,464,8002,117540,1016
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Dekker-PT-020-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((F(X("(p0_19<=p0_5)")))U(G(X("(p1_9>=1)")))))
Formula 1 simplified : !(FX"(p0_19<=p0_5)" U GX"(p1_9>=1)")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
7 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.963869,50072,1,0,960,217194,924,465,8009,126068,1044
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Dekker-PT-020-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((("(flag_1_0>=3)")U(F(F("(flag_1_4<=p1_4)")))))
Formula 2 simplified : !("(flag_1_0>=3)" U F"(flag_1_4<=p1_4)")
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.964517,50324,1,0,960,217194,933,465,8013,126068,1048
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Dekker-PT-020-LTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(X(X(G("(flag_1_1>=3)"))))))
Formula 3 simplified : !FXXG"(flag_1_1>=3)"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
19 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,1.15076,59180,1,0,980,278959,946,484,8015,155448,1195
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Dekker-PT-020-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G("(p1_6<=p0_15)")))
Formula 4 simplified : !G"(p1_6<=p0_15)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
38 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,1.52839,71848,1,0,1003,366427,954,486,8020,197578,1313
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Dekker-PT-020-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(("(flag_1_14<=flag_1_17)"))
Formula 5 simplified : !"(flag_1_14<=flag_1_17)"
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,1.52884,71848,1,0,1003,366427,957,486,8024,197578,1315
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Dekker-PT-020-LTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F("(flag_0_16<=flag_0_14)")))
Formula 6 simplified : !F"(flag_0_16<=flag_0_14)"
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,1.52928,72112,1,0,1003,366427,966,486,8027,197578,1319
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA Dekker-PT-020-LTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G("(p1_10>=1)")))
Formula 7 simplified : !G"(p1_10>=1)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.53381,72112,1,0,1003,366640,972,486,8028,197742,1326
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Dekker-PT-020-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((("(p3_10>=3)")U(G(X("(p0_2<=flag_1_9)")))))
Formula 8 simplified : !("(p3_10>=3)" U GX"(p0_2<=flag_1_9)")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
4 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,1.57669,73464,1,0,1005,376631,985,487,8037,204020,1339
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Dekker-PT-020-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G("(flag_0_8>=2)")))
Formula 9 simplified : !G"(flag_0_8>=2)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.57752,73728,1,0,1005,376631,991,487,8039,204020,1344
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Dekker-PT-020-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(X("(flag_1_12<=flag_0_2)"))))
Formula 10 simplified : !FX"(flag_1_12<=flag_0_2)"
2 unique states visited
0 strongly connected components in search stack
1 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,1.57805,73728,1,0,1005,376631,1000,487,8043,204020,1348
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA Dekker-PT-020-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(G("(p1_14>=2)"))))
Formula 11 simplified : !FG"(p1_14>=2)"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.58122,73728,1,0,1005,376638,1013,487,8045,204076,1446
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Dekker-PT-020-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(G("(p3_8<=p3_6)"))))
Formula 12 simplified : !G"(p3_8<=p3_6)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
20 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,1.77666,79528,1,0,1025,419085,1019,506,8049,225492,1559
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Dekker-PT-020-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((F(X("(p3_5>=1)")))U(("(flag_0_15>=1)")U("(p3_7>=1)"))))
Formula 13 simplified : !(FX"(p3_5>=1)" U ("(flag_0_15>=1)" U "(p3_7>=1)"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
39 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,2.16109,93460,1,0,1124,515833,1034,547,8054,286608,1778
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Dekker-PT-020-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((X((G("(flag_0_5<=flag_1_13)"))U(F("(p3_11>=2)")))))
Formula 14 simplified : !X(G"(flag_0_5<=flag_1_13)" U F"(p3_11>=2)")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.16733,93720,1,0,1124,515990,1043,548,8056,287005,1828
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Dekker-PT-020-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((X(G("(p0_2>=1)"))))
Formula 15 simplified : !XG"(p0_2>=1)"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
32 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,2.49135,107760,1,0,1166,598119,1049,568,8057,334354,1939
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Dekker-PT-020-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527985624224

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Jun 03, 2018 12:27:00 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -louvain, -smt]
Jun 03, 2018 12:27:00 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 03, 2018 12:27:00 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 93 ms
Jun 03, 2018 12:27:00 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 100 places.
Jun 03, 2018 12:27:00 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 440 transitions.
Jun 03, 2018 12:27:00 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 35 ms
Jun 03, 2018 12:27:00 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 208 ms
Jun 03, 2018 12:27:00 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 5 ms
Jun 03, 2018 12:27:00 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Jun 03, 2018 12:27:01 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 440 transitions.
Jun 03, 2018 12:27:01 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 60 place invariants in 26 ms
Jun 03, 2018 12:27:01 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 100 variables to be positive in 274 ms
Jun 03, 2018 12:27:01 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 440 transitions.
Jun 03, 2018 12:27:01 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/440 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 03, 2018 12:27:01 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 57 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 03, 2018 12:27:01 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 440 transitions.
Jun 03, 2018 12:27:02 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 03, 2018 12:27:03 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 440 transitions.
Jun 03, 2018 12:27:03 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (and (and (and (and (and (and (and (and (and (and (and (and (and (and (and (and (and (and (>= (select s0 0) 1) (>= (select s0 2) 1)) (>= (select s0 4) 1)) (>= (select s0 6) 1)) (>= (select s0 8) 1)) (>= (select s0 10) 1)) (>= (select s0 12) 1)) (>= (select s0 14) 1)) (>= (select s0 16) 1)) (>= (select s0 18) 1)) (>= (select s0 20) 1)) (>= (select s0 22) 1)) (>= (select s0 24) 1)) (>= (select s0 26) 1)) (>= (select s0 28) 1)) (>= (select s0 32) 1)) (>= (select s0 34) 1)) (>= (select s0 36) 1)) (>= (select s0 38) 1)) (>= (select s0 86) 1))) with error
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.computeCoEnablingMatrix(NecessaryEnablingsolver.java:480)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
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)
Jun 03, 2018 12:27:03 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 2825ms 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="Dekker-PT-020"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstoolsl"
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

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-020.tgz
mv Dekker-PT-020 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstoolsl"
echo " Input is Dekker-PT-020, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r237-blw3-152732477600025"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;