Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r074-smll-155234739000088.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-3957
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 r074-smll-155234739000088
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.6K Feb 10 22:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 10 22:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 6 20:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 6 20:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 100 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 338 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.7K Feb 4 23:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 4 23:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 4 22:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K Feb 4 22:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 3 07:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 3 07:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jan 31 00:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Jan 31 00:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw------- 1 mcc users 57K Mar 10 17:31 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1552708260931

Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903111103/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903111103/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((X(G("((EGF_equals_0>=1)&&(ERBB1_equals_1>=1))"))))
Formula 0 simplified : !XG"((EGF_equals_0>=1)&&(ERBB1_equals_1>=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
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.116302,19012,1,0,141,15161,135,86,1470,13052,199
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 : !(("((MYC_equals_1>=1)&&(p27_equals_1>=1))"))
Formula 1 simplified : !"((MYC_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
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.12039,19012,1,0,142,15203,138,88,1473,13167,209
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 : !((F(("((CDK4_equals_0>=1)&&(pRB1_equals_1>=1))")U(G(F("(((AKT1_equals_1>=1)&&(ERBB2_3_equals_0>=1))&&(IGF1R_equals_0>=1))"))))))
Formula 2 simplified : !F("((CDK4_equals_0>=1)&&(pRB1_equals_1>=1))" U GF"(((AKT1_equals_1>=1)&&(ERBB2_3_equals_0>=1))&&(IGF1R_equals_0>=1))")
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
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.168632,20812,1,0,182,19363,147,130,1478,20160,393
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 : !((F(F(("((CyclinD1_equals_1>=1)&&(MYC_equals_0>=1))")U(F("((EGF_equals_1>=1)&&(ERBB3_equals_0>=1))"))))))
Formula 3 simplified : !F("((CyclinD1_equals_1>=1)&&(MYC_equals_0>=1))" U F"((EGF_equals_1>=1)&&(ERBB3_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
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.170798,20812,1,0,193,19486,156,138,1481,20514,421
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA EGFr-PT-02010-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((G(X(G("((IGF1R_equals_1>=1)&&(MEK1_equals_0>=1))")))))
Formula 4 simplified : !GXG"((IGF1R_equals_1>=1)&&(MEK1_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.171961,21072,1,0,193,19486,162,138,1484,20516,426
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA EGFr-PT-02010-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(("((AKT1_equals_1>=1)&&(p27_equals_1>=1))"))
Formula 5 simplified : !"((AKT1_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.172541,21072,1,0,193,19486,165,138,1485,20517,428
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(F((G("((ERBB2_equals_0>=1)&&(ERBB2_3_equals_1>=1))"))U(X("((AKT1_equals_1>=1)&&(p27_equals_1>=1))"))))))
Formula 6 simplified : !GF(G"((ERBB2_equals_0>=1)&&(ERBB2_3_equals_1>=1))" U X"((AKT1_equals_1>=1)&&(p27_equals_1>=1))")
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.173576,21072,1,0,193,19486,171,138,1485,20518,434
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("(((((AKT1_0>=1)&&(CyclinD1_equals_0>=1))&&(ERalpha_equals_1>=1))&&(MEK1_equals_1>=1))&&(MYC_equals_1>=1))"))))
Formula 7 simplified : !G"(((((AKT1_0>=1)&&(CyclinD1_equals_0>=1))&&(ERalpha_equals_1>=1))&&(MEK1_equals_1>=1))&&(MYC_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.174843,21072,1,0,193,19486,177,138,1494,20520,439
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 : !((X(X(X("((AKT1_equals_1>=1)&&(ERalpha_equals_0>=1))")))))
Formula 8 simplified : !XXX"((AKT1_equals_1>=1)&&(ERalpha_equals_0>=1))"
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.17965,21240,1,0,196,19870,180,140,1496,20929,450
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 : !(("((EGF_equals_0>=1)&&(ERBB2_equals_1>=1))"))
Formula 9 simplified : !"((EGF_equals_0>=1)&&(ERBB2_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.180401,21240,1,0,196,19870,183,140,1498,20930,452
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 : !((F(X(X(F(F("((ERBB2_equals_0>=1)&&(ERBB2_3_equals_1>=1))")))))))
Formula 10 simplified : !FXXF"((ERBB2_equals_0>=1)&&(ERBB2_3_equals_1>=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
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.228213,22292,1,0,225,25407,192,172,1501,30581,579
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 : !(("((EGF_equals_1>=1)&&(ERBB2_equals_0>=1))"))
Formula 11 simplified : !"((EGF_equals_1>=1)&&(ERBB2_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
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.228967,22292,1,0,225,25407,195,172,1502,30581,581
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(X((X("((ERBB1_3_equals_1>=1)&&(MEK1_equals_0>=1))"))U(X("((ERBB1_equals_0>=1)&&(ERBB1_3_equals_1>=1))"))))))
Formula 12 simplified : !XX(X"((ERBB1_3_equals_1>=1)&&(MEK1_equals_0>=1))" U X"((ERBB1_equals_0>=1)&&(ERBB1_3_equals_1>=1))")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.232459,22696,1,0,226,25469,205,173,1511,30733,590
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 : !((((G("((CDK4_equals_0>=1)&&(pRB1_equals_1>=1))"))U(F("(((CDK4_equals_1>=1)&&(CDK6_equals_1>=1))&&(pRB1_equals_0>=1))")))U((F("((((CDK4_equals_0>=1)&&(CyclinD1_equals_1>=1))&&(p21_equals_0>=1))&&(p27_equals_0>=1))"))U(X("((EGF_equals_1>=1)&&(ERBB2_equals_0>=1))")))))
Formula 13 simplified : !((G"((CDK4_equals_0>=1)&&(pRB1_equals_1>=1))" U F"(((CDK4_equals_1>=1)&&(CDK6_equals_1>=1))&&(pRB1_equals_0>=1))") U (F"((((CDK4_equals_0>=1)&&(CyclinD1_equals_1>=1))&&(p21_equals_0>=1))&&(p27_equals_0>=1))" U X"((EGF_equals_1>=1)&&(ERBB2_equals_0>=1))"))
Computing Next relation with stutter on 1 deadlock states
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
9 unique states visited
0 strongly connected components in search stack
8 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.281492,24932,1,0,360,30052,225,267,1530,37580,911
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA EGFr-PT-02010-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((X(F((F("((AKT1_0>=1)&&(ERBB1_equals_1>=1))"))U("((EGF_equals_0>=1)&&(ERBB2_equals_1>=1))")))))
Formula 14 simplified : !XF(F"((AKT1_0>=1)&&(ERBB1_equals_1>=1))" U "((EGF_equals_0>=1)&&(ERBB2_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
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.293935,25460,1,0,376,30672,231,301,1530,39840,1045
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_0>=1)&&(ERBB1_3_equals_1>=1))"))U(F("((IGF1R_equals_1>=1)&&(MEK1_equals_0>=1))")))U(X(G(F("((AKT1_equals_1>=1)&&(ERalpha_equals_0>=1))"))))))
Formula 15 simplified : !((F"((ERBB1_equals_0>=1)&&(ERBB1_3_equals_1>=1))" U F"((IGF1R_equals_1>=1)&&(MEK1_equals_0>=1))") U XGF"((AKT1_equals_1>=1)&&(ERalpha_equals_0>=1))")
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
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.328197,26352,1,0,409,33481,237,336,1530,42765,1149
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
ITS tools runner thread asked to quit. Dying gracefully.
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 1552708268072

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Mar 16, 2019 3:51:03 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -smt]
Mar 16, 2019 3:51:03 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 16, 2019 3:51:03 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 59 ms
Mar 16, 2019 3:51:03 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 40 places.
Mar 16, 2019 3:51:03 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 68 transitions.
Mar 16, 2019 3:51:03 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 14 ms
Mar 16, 2019 3:51:03 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 56 ms
Mar 16, 2019 3:51:03 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
Mar 16, 2019 3:51:03 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Mar 16, 2019 3:51:03 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 68 transitions.
Mar 16, 2019 3:51:04 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 20 place invariants in 26 ms
Mar 16, 2019 3:51:04 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 40 variables to be positive in 130 ms
Mar 16, 2019 3:51:04 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 68 transitions.
Mar 16, 2019 3:51:04 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)
Mar 16, 2019 3:51:04 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 16, 2019 3:51:04 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 68 transitions.
Mar 16, 2019 3:51:04 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 16, 2019 3:51:05 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 68 transitions.
Mar 16, 2019 3:51:07 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 1823 ms. Total solver calls (SAT/UNSAT): 626(291/335)
Skipping mayMatrices nes/nds SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
java.lang.RuntimeException: SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.addKnownInvariants(KInductionSolver.java:456)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeDoNotAccord(NecessaryEnablingsolver.java:572)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:538)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Mar 16, 2019 3:51:07 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 3255ms 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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3957"
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 r074-smll-155234739000088"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EGFr-PT-02010.tgz
mv EGFr-PT-02010 execution
cd execution
if [ "LTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;