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 itstools
Input is EGFr-PT-02010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r284-csrt-152749174800258
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527925318645

Using solver Z3 to compute partial order matrices.
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805151631/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]
Built C files in :
/home/mcc/execution

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805151631/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(X(F(G(X("((((((AKT1_equals_1>=1)&&(ERBB1_equals_0>=1))&&(ERBB1_2_equals_0>=1))&&(ERBB1_3_equals_0>=1))&&(ERBB2_3_equals_0>=1))&&(IGF1R_equals_0>=1))")))))))
Formula 0 simplified : !GXFGX"((((((AKT1_equals_1>=1)&&(ERBB1_equals_0>=1))&&(ERBB1_2_equals_0>=1))&&(ERBB1_3_equals_0>=1))&&(ERBB2_3_equals_0>=1))&&(IGF1R_equals_0>=1))"
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
26 unique states visited
25 strongly connected components in search stack
28 transitions explored
26 items max in DFS search stack
9 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.120014,19584,1,0,140,15102,132,88,1478,15640,260
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA EGFr-PT-02010-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((((F("((CDK6_equals_0>=1)&&(pRB1_equals_1>=1))"))U(F("(((AKT1_0>=1)&&(ERalpha_equals_0>=1))&&(IGF1R_equals_1>=1))")))U("((CDK6_equals_0>=1)&&(CyclinD1_equals_1>=1))")))
Formula 1 simplified : !((F"((CDK6_equals_0>=1)&&(pRB1_equals_1>=1))" U F"(((AKT1_0>=1)&&(ERalpha_equals_0>=1))&&(IGF1R_equals_1>=1))") U "((CDK6_equals_0>=1)&&(CyclinD1_equals_1>=1))")
Computing Next relation with stutter on 1 deadlock states
23 unique states visited
22 strongly connected components in search stack
23 transitions explored
22 items max in DFS search stack
10 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.219393,23612,1,0,326,29214,146,339,1488,43860,961
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA EGFr-PT-02010-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(("((CDK6_equals_0>=1)&&(pRB1_equals_1>=1))"))
Formula 2 simplified : !"((CDK6_equals_0>=1)&&(pRB1_equals_1>=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.220333,23876,1,0,326,29227,151,339,1490,43879,968
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA EGFr-PT-02010-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((G(("((ERBB2_equals_0>=1)&&(ERBB2_3_equals_1>=1))")U(F(G("((ERBB2_3_equals_1>=1)&&(ERBB3_equals_0>=1))"))))))
Formula 3 simplified : !G("((ERBB2_equals_0>=1)&&(ERBB2_3_equals_1>=1))" U FG"((ERBB2_3_equals_1>=1)&&(ERBB3_equals_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
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.237483,24264,1,0,343,29675,164,375,1493,45212,1218
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA EGFr-PT-02010-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((F((X("((AKT1_equals_1>=1)&&(p21_equals_1>=1))"))U(("((CDK4_equals_1>=1)&&(p21_equals_1>=1))")U("((((CDK4_equals_0>=1)&&(CyclinD1_equals_1>=1))&&(p21_equals_0>=1))&&(p27_equals_0>=1))")))))
Formula 4 simplified : !F(X"((AKT1_equals_1>=1)&&(p21_equals_1>=1))" U ("((CDK4_equals_1>=1)&&(p21_equals_1>=1))" U "((((CDK4_equals_0>=1)&&(CyclinD1_equals_1>=1))&&(p21_equals_0>=1))&&(p27_equals_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
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.2499,24528,1,0,414,30861,173,418,1499,47712,1389
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA EGFr-PT-02010-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X("((ERBB1_2_equals_1>=1)&&(ERBB2_equals_0>=1))")))
Formula 5 simplified : !X"((ERBB1_2_equals_1>=1)&&(ERBB2_equals_0>=1))"
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.250827,24528,1,0,414,30870,176,418,1502,47730,1394
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA EGFr-PT-02010-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((G("((ERBB1_equals_0>=1)&&(ERBB1_3_equals_1>=1))")))
Formula 6 simplified : !G"((ERBB1_equals_0>=1)&&(ERBB1_3_equals_1>=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.251464,24784,1,0,414,30870,182,418,1504,47731,1399
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA EGFr-PT-02010-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(((G(G(G("((AKT1_equals_1>=1)&&(ERalpha_equals_0>=1))"))))U(F(F(G("(((AKT1_equals_1>=1)&&(ERBB2_3_equals_0>=1))&&(IGF1R_equals_0>=1))"))))))
Formula 7 simplified : !(G"((AKT1_equals_1>=1)&&(ERalpha_equals_0>=1))" U FG"(((AKT1_equals_1>=1)&&(ERBB2_3_equals_0>=1))&&(IGF1R_equals_0>=1))")
Computing Next relation with stutter on 1 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 39
// Phase 1: matrix 39 rows 40 cols
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
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
10 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.34958,28156,1,0,564,50094,195,552,1507,74472,1786
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA EGFr-PT-02010-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((G(G(("((CDK4_equals_1>=1)&&(p27_equals_1>=1))")U("((CDK4_equals_1>=1)&&(p21_equals_1>=1))")))))
Formula 8 simplified : !G("((CDK4_equals_1>=1)&&(p27_equals_1>=1))" U "((CDK4_equals_1>=1)&&(p21_equals_1>=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.351254,28852,1,0,564,50094,211,552,1520,74474,1793
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA EGFr-PT-02010-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !(("((CDK2_equals_1>=1)&&(p27_equals_1>=1))"))
Formula 9 simplified : !"((CDK2_equals_1>=1)&&(p27_equals_1>=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.351557,28852,1,0,564,50094,214,552,1522,74475,1795
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA EGFr-PT-02010-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((G(G((X("((EGF_equals_0>=1)&&(ERBB1_equals_1>=1))"))U(X("((IGF1R_equals_1>=1)&&(MEK1_equals_0>=1))"))))))
Formula 10 simplified : !G(X"((EGF_equals_0>=1)&&(ERBB1_equals_1>=1))" U X"((IGF1R_equals_1>=1)&&(MEK1_equals_0>=1))")
Computing Next relation with stutter on 1 deadlock states
27 unique states visited
27 strongly connected components in search stack
28 transitions explored
27 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.352521,29048,1,0,564,50094,221,552,1529,74475,1797
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA EGFr-PT-02010-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((("((ERBB1_3_equals_1>=1)&&(ERBB3_equals_0>=1))")U(F(X(G("((ERalpha_equals_1>=1)&&(MYC_equals_0>=1))"))))))
Formula 11 simplified : !("((ERBB1_3_equals_1>=1)&&(ERBB3_equals_0>=1))" U FXG"((ERalpha_equals_1>=1)&&(MYC_equals_0>=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
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.40587,30608,1,0,679,59879,234,659,1532,89182,2136
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA EGFr-PT-02010-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((X(F(X("((EGF_equals_1>=1)&&(ERBB3_equals_0>=1))")))))
Formula 12 simplified : !XFX"((EGF_equals_1>=1)&&(ERBB3_equals_0>=1))"
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.456222,32628,1,0,745,68316,243,727,1534,101371,2320
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA EGFr-PT-02010-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((X((X(F("((CDK4_equals_1>=1)&&(p27_equals_1>=1))")))U(X(F("((CyclinD1_equals_1>=1)&&(ERalpha_equals_0>=1))"))))))
Formula 13 simplified : !X(XF"((CDK4_equals_1>=1)&&(p27_equals_1>=1))" U XF"((CyclinD1_equals_1>=1)&&(ERalpha_equals_0>=1))")
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
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.468823,33156,1,0,760,69151,252,759,1535,103810,2450
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA EGFr-PT-02010-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !(("((((((ERBB1_equals_0>=1)&&(ERBB1_2_equals_0>=1))&&(ERBB1_3_equals_0>=1))&&(ERBB2_3_equals_0>=1))&&(IGF1R_equals_0>=1))&&(MEK1_equals_1>=1))"))
Formula 14 simplified : !"((((((ERBB1_equals_0>=1)&&(ERBB1_2_equals_0>=1))&&(ERBB1_3_equals_0>=1))&&(ERBB2_3_equals_0>=1))&&(IGF1R_equals_0>=1))&&(MEK1_equals_1>=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.469512,33156,1,0,760,69151,255,759,1537,103811,2452
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA EGFr-PT-02010-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !(((F(("((ERBB1_equals_1>=1)&&(MEK1_equals_0>=1))")U("((((((AKT1_equals_1>=1)&&(ERBB1_equals_0>=1))&&(ERBB1_2_equals_0>=1))&&(ERBB1_3_equals_0>=1))&&(ERBB2_3_equals_0>=1))&&(IGF1R_equals_0>=1))")))U(G("((MYC_equals_1>=1)&&(p21_equals_1>=1))"))))
Formula 15 simplified : !(F("((ERBB1_equals_1>=1)&&(MEK1_equals_0>=1))" U "((((((AKT1_equals_1>=1)&&(ERBB1_equals_0>=1))&&(ERBB1_2_equals_0>=1))&&(ERBB1_3_equals_0>=1))&&(ERBB2_3_equals_0>=1))&&(IGF1R_equals_0>=1))") U G"((MYC_equals_1>=1)&&(p21_equals_1>=1))")
Computing Next relation with stutter on 1 deadlock states
24 unique states visited
24 strongly connected components in search stack
24 transitions explored
24 items max in DFS search stack
9 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.554998,35008,1,0,851,74732,264,855,1541,114163,2808
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA EGFr-PT-02010-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, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527925322576

--------------------
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 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 -consoleLog -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
Jun 02, 2018 7:42:00 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]
Jun 02, 2018 7:42:01 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2018 7:42:01 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 43 ms
Jun 02, 2018 7:42:01 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 40 places.
Jun 02, 2018 7:42:01 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 68 transitions.
Jun 02, 2018 7:42:01 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 16 ms
Jun 02, 2018 7:42:01 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 83 ms
Jun 02, 2018 7:42:01 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 5 ms
Jun 02, 2018 7:42:01 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Jun 02, 2018 7:42:01 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 68 transitions.
Jun 02, 2018 7:42:02 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 20 place invariants in 10 ms
Jun 02, 2018 7:42:02 AM fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver checkSat
WARNING: SMT solver unexpectedly returned 'unknown' answer, retrying.
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout :(error "Failed to check-sat")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:297)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:305)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
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 02, 2018 7:42:02 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 559ms 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="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

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 itstools"
echo " Input is EGFr-PT-02010, 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 r284-csrt-152749174800258"
echo "====================================================================="
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 ;