fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r285-csrt-152749176000257
Last Updated
June 26, 2018

About the Execution of ITS-Tools.L for EGFr-PT-02010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15755.360 3683.00 7959.00 51.20 FTFFTFTTTFTFFFTF normal

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 224K
-rw-r--r-- 1 mcc users 3.7K May 30 21:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 30 21:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K May 29 15:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 29 15:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 2.7K May 28 09:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 28 09:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 28 08:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 28 08:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.7K May 28 06:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 28 06:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 7.4K May 27 03:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K May 27 03:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 28 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 6 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw------- 1 mcc users 57K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is EGFr-PT-02010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-csrt-152749176000257
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527990622681

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 : !((X("(ERBB1_2_equals_1>=2)")))
Formula 0 simplified : !X"(ERBB1_2_equals_1>=2)"
Reverse transition relation is NOT exact ! Due to transitions AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_equals_1, AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_2_equals_1, AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_3_equals_1, AKT1_equals_0_to_AKT1_equals_1_when_ERBB2_3_equals_1, AKT1_equals_0_to_AKT1_equals_1_when_IGF1R_equals_1, CDK4_equals_0_to_CDK4_equals_1_when_CyclinD1_equals_1_and_p21_equals_0_and_p27_equals_0, CDK6_equals_0_to_CDK6_equals_1_when_CyclinD1_equals_1, CyclinD1_equals_0_to_CyclinD1_equals_1_when_AKT1_equals_0_and_ERalpha_equals_1_and_MEK1_equals_1_and_MYC_equals_1, CyclinD1_equals_0_to_CyclinD1_equals_1_when_AKT1_equals_1_and_ERalpha_equals_1_and_MYC_equals_1, CyclinE1_equals_0_to_CyclinE1_equals_1_when_MYC_equals_1, EGF_equals_0_to_EGF_equals_1, ERBB1_equals_0_to_ERBB1_equals_1_when_EGF_equals_1, ERBB2_equals_0_to_ERBB2_equals_1_when_EGF_equals_1, ERBB2_3_equals_0_to_ERBB2_3_equals_1_when_ERBB2_equals_1_and_ERBB3_equals_1, ERBB3_equals_0_to_ERBB3_equals_1_when_EGF_equals_1, ERalpha_equals_0_to_ERalpha_equals_1_when_AKT1_equals_1, ERalpha_equals_0_to_ERalpha_equals_1_when_MEK1_equals_1, IGF1R_equals_1_to_IGF1R_equals_0_when_ERBB2_3_equals_1, MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_equals_1, MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_2_equals_1, MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_3_equals_1, MEK1_equals_0_to_MEK1_equals_1_when_ERBB2_3_equals_1, MEK1_equals_0_to_MEK1_equals_1_when_IGF1R_equals_1, MYC_equals_0_to_MYC_equals_1_when_AKT1_equals_1, MYC_equals_0_to_MYC_equals_1_when_ERalpha_equals_1, MYC_equals_0_to_MYC_equals_1_when_MEK1_equals_1, p21_equals_1_to_p21_equals_0_when_AKT1_equals_1, p21_equals_1_to_p21_equals_0_when_MYC_equals_1, p27_equals_1_to_p27_equals_0_when_AKT1_equals_1, p27_equals_1_to_p27_equals_0_when_MYC_equals_1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :30/8/30/68
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
6 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.085667,19000,1,0,141,15161,132,86,1469,13052,196
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA EGFr-PT-02010-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((("(ERalpha_equals_0<=CDK6_equals_1)")U("(MYC_equals_1<=pRB1_equals_1)")))
Formula 1 simplified : !("(ERalpha_equals_0<=CDK6_equals_1)" U "(MYC_equals_1<=pRB1_equals_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.086906,19284,1,0,141,15161,142,86,1481,13054,200
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA EGFr-PT-02010-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G((X("(IGF1R_equals_0>=2)"))U(F("(ERBB2_equals_0>=2)")))))
Formula 2 simplified : !G(X"(IGF1R_equals_0>=2)" U F"(ERBB2_equals_0>=2)")
Computing Next relation with stutter on 1 deadlock states
26 unique states visited
26 strongly connected components in search stack
27 transitions explored
26 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.100147,19504,1,0,142,15219,151,90,1483,15746,326
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA EGFr-PT-02010-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(F(("(EGF_equals_0<=AKT1_equals_1)")U("(AKT1_equals_1<=CDK4_equals_0)")))))
Formula 3 simplified : !GF("(EGF_equals_0<=AKT1_equals_1)" U "(AKT1_equals_1<=CDK4_equals_0)")
Computing Next relation with stutter on 1 deadlock states
26 unique states visited
26 strongly connected components in search stack
27 transitions explored
26 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.10963,20120,1,0,156,15983,160,113,1488,16888,414
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA EGFr-PT-02010-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(G(F(F("(AKT1_0<=p21_equals_0)"))))))
Formula 4 simplified : !GF"(AKT1_0<=p21_equals_0)"
Computing Next relation with stutter on 1 deadlock states
42 unique states visited
0 strongly connected components in search stack
43 transitions explored
24 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.134893,20632,1,0,192,18684,169,148,1493,22055,588
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA EGFr-PT-02010-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(G("(IGF1R_equals_0>=2)"))))
Formula 5 simplified : !XG"(IGF1R_equals_0>=2)"
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 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.135693,20888,1,0,192,18684,175,148,1495,22055,593
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA EGFr-PT-02010-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(X(X(F("(MYC_equals_0<=CDK4_equals_1)"))))))
Formula 6 simplified : !XXXF"(MYC_equals_0<=CDK4_equals_1)"
Computing Next relation with stutter on 1 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
4 unique states visited
0 strongly connected components in search stack
3 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,0.16603,21660,1,0,251,23243,184,185,1499,29059,722
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA EGFr-PT-02010-LTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((("(IGF1R_equals_1<=MEK1_equals_1)")U("(MYC_equals_1>=2)"))U(("(MYC_equals_1<=ERBB1_2_equals_1)")U("(p21_equals_1<=ERalpha_equals_1)"))))
Formula 7 simplified : !(("(IGF1R_equals_1<=MEK1_equals_1)" U "(MYC_equals_1>=2)") U ("(MYC_equals_1<=ERBB1_2_equals_1)" U "(p21_equals_1<=ERalpha_equals_1)"))
Normalized transition count is 39
Computing Next relation with stutter on 1 deadlock states
// Phase 1: matrix 39 rows 40 cols
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.168731,22956,1,0,251,23243,217,185,1536,29063,730
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA EGFr-PT-02010-LTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(F(G(X("(CyclinE1_equals_0<=pRB1_equals_0)"))))))
Formula 8 simplified : !FGX"(CyclinE1_equals_0<=pRB1_equals_0)"
Computing Next relation with stutter on 1 deadlock states
invariant :p27_equals_0 + p27_equals_1 = 1
invariant :pRB1_equals_0 + pRB1_equals_1 = 1
invariant :p21_equals_0 + p21_equals_1 = 1
invariant :MYC_equals_0 + MYC_equals_1 = 1
invariant :ERBB1_equals_0 + ERBB1_equals_1 = 1
invariant :ERBB2_equals_0 + ERBB2_equals_1 = 1
invariant :MEK1_equals_0 + MEK1_equals_1 = 1
invariant :IGF1R_equals_0 + IGF1R_equals_1 = 1
invariant :CyclinD1_equals_0 + CyclinD1_equals_1 = 1
invariant :CDK4_equals_0 + CDK4_equals_1 = 1
invariant :AKT1_0 + AKT1_equals_1 = 1
invariant :ERBB1_3_equals_0 + ERBB1_3_equals_1 = 1
invariant :ERalpha_equals_0 + ERalpha_equals_1 = 1
invariant :EGF_equals_0 + EGF_equals_1 = 1
invariant :ERBB3_equals_0 + ERBB3_equals_1 = 1
invariant :ERBB1_2_equals_0 + ERBB1_2_equals_1 = 1
invariant :CDK6_equals_0 + CDK6_equals_1 = 1
invariant :ERBB2_3_equals_0 + ERBB2_3_equals_1 = 1
invariant :CDK2_equals_0 + CDK2_equals_1 = 1
invariant :CyclinE1_equals_0 + CyclinE1_equals_1 = 1
97 unique states visited
0 strongly connected components in search stack
186 transitions explored
25 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.18054,22956,1,0,302,24567,222,292,1540,32303,1076
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA EGFr-PT-02010-LTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(("(ERBB1_3_equals_0<=CyclinE1_equals_1)"))
Formula 9 simplified : !"(ERBB1_3_equals_0<=CyclinE1_equals_1)"
Computing Next relation with stutter on 1 deadlock states
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,0.181694,23220,1,0,302,24568,225,292,1544,32310,1081
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA EGFr-PT-02010-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(("(ERBB1_3_equals_1<=p27_equals_1)"))
Formula 10 simplified : !"(ERBB1_3_equals_1<=p27_equals_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.182029,23220,1,0,302,24568,228,292,1548,32311,1083
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA EGFr-PT-02010-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X("(MEK1_equals_0<=EGF_equals_0)")))
Formula 11 simplified : !X"(MEK1_equals_0<=EGF_equals_0)"
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 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.182876,23220,1,0,305,24601,231,295,1551,32359,1096
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA EGFr-PT-02010-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(G(F(F("(ERBB1_3_equals_1>=3)"))))))
Formula 12 simplified : !XGF"(ERBB1_3_equals_1>=3)"
Computing Next relation with stutter on 1 deadlock states
26 unique states visited
26 strongly connected components in search stack
27 transitions explored
26 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.184642,23220,1,0,305,24604,240,295,1553,32375,1146
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA EGFr-PT-02010-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F(G("(MEK1_equals_1<=ERBB1_2_equals_0)"))))
Formula 13 simplified : !FG"(MEK1_equals_1<=ERBB1_2_equals_0)"
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
8 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.272011,26120,1,0,391,35300,253,411,1557,51278,1480
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA EGFr-PT-02010-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(("(CyclinE1_equals_1<=p21_equals_0)"))
Formula 14 simplified : !"(CyclinE1_equals_1<=p21_equals_0)"
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.272497,26120,1,0,391,35300,256,411,1560,51279,1482
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA EGFr-PT-02010-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((X(G(("(AKT1_0>=1)")U("(IGF1R_equals_1<=CDK4_equals_1)")))))
Formula 15 simplified : !XG("(AKT1_0>=1)" U "(IGF1R_equals_1<=CDK4_equals_1)")
Computing Next relation with stutter on 1 deadlock states
26 unique states visited
23 strongly connected components in search stack
27 transitions explored
24 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.350545,28664,1,0,503,47085,272,523,1572,68337,1803
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA EGFr-PT-02010-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 1527990626364

--------------------
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 1:50:25 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 1:50:25 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 03, 2018 1:50:25 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 46 ms
Jun 03, 2018 1:50:25 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 40 places.
Jun 03, 2018 1:50:25 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 68 transitions.
Jun 03, 2018 1:50:25 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 15 ms
Jun 03, 2018 1:50:25 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 81 ms
Jun 03, 2018 1:50:25 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 3 ms
Jun 03, 2018 1:50:25 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Jun 03, 2018 1:50:25 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 68 transitions.
Jun 03, 2018 1:50:25 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 20 place invariants in 14 ms
Jun 03, 2018 1:50:26 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 40 variables to be positive in 97 ms
Jun 03, 2018 1:50:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 68 transitions.
Jun 03, 2018 1:50:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/68 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 03, 2018 1:50:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 03, 2018 1:50:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 68 transitions.
Jun 03, 2018 1:50:26 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)
Jun 03, 2018 1:50:26 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
Jun 03, 2018 1:50:26 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")
Jun 03, 2018 1:50:26 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (and (and (and (>= (select s0 4) 1) (>= (select s0 9) 1)) (>= (select s0 34) 1)) (>= (select s0 36) 1)) (= (store (store s0 5 (+ (select s0 5) 1)) 4 (- (select s0 4) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (and (and (and (>= (select s0 4) 1) (>= (select s0 9) 1)) (>= (select s0 34) 1)) (>= (select s0 36) 1)) (= (store (store s0 5 (+ (select s0 5) 1)) 4 (- (select s0 4) 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)
Jun 03, 2018 1:50:26 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 452ms 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="EGFr-PT-02010"
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/EGFr-PT-02010.tgz
mv EGFr-PT-02010 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 EGFr-PT-02010, 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 r285-csrt-152749176000257"
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 ;