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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-csrt-152749176000258
=====================================================================

--------------------
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 1527990628931

Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/convert-linux64, -i, /tmp/graph1026078890099215383.txt, -o, /tmp/graph1026078890099215383.bin, -w, /tmp/graph1026078890099215383.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/louvain-linux64, /tmp/graph1026078890099215383.bin, -l, -1, -v, -w, /tmp/graph1026078890099215383.weights, -q, 0, -e, 0.001], workingDir=null]
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/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.201805241334/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("((((((i4.u0.AKT1_equals_1>=1)&&(i3.u7.ERBB1_equals_0>=1))&&(i3.u8.ERBB1_2_equals_0>=1))&&(i3.u9.ERBB1_3_equals_0>=1))&&(i2.u11.ERBB2_3_equals_0>=1))&&(i4.u14.IGF1R_equals_0>=1))")))))))
Formula 0 simplified : !GXFGX"((((((i4.u0.AKT1_equals_1>=1)&&(i3.u7.ERBB1_equals_0>=1))&&(i3.u8.ERBB1_2_equals_0>=1))&&(i3.u9.ERBB1_3_equals_0>=1))&&(i2.u11.ERBB2_3_equals_0>=1))&&(i4.u14.IGF1R_equals_0>=1))"
built 19 ordering constraints for composite.
built 5 ordering constraints for composite.
built 26 ordering constraints for composite.
built 20 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 19 ordering constraints for composite.
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, 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, i2.u6.EGF_equals_0_to_EGF_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
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,0.22541,22620,1,0,10872,37,882,16508,43,32,28066
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 USE_NUPN
Checking formula 1 : !((((F("((i0.u3.CDK6_equals_0>=1)&&(i0.u19.pRB1_equals_1>=1))"))U(F("(((i4.u0.AKT1_0>=1)&&(i1.u13.ERalpha_equals_0>=1))&&(i4.u14.IGF1R_equals_1>=1))")))U("((i0.u3.CDK6_equals_0>=1)&&(i1.u4.CyclinD1_equals_1>=1))")))
Formula 1 simplified : !((F"((i0.u3.CDK6_equals_0>=1)&&(i0.u19.pRB1_equals_1>=1))" U F"(((i4.u0.AKT1_0>=1)&&(i1.u13.ERalpha_equals_0>=1))&&(i4.u14.IGF1R_equals_1>=1))") U "((i0.u3.CDK6_equals_0>=1)&&(i1.u4.CyclinD1_equals_1>=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 :i5:u1:CDK2_equals_0 + i5:u1:CDK2_equals_1 = 1
invariant :i5:u18:p27_equals_0 + i5:u18:p27_equals_1 = 1
invariant :i5:u17:p21_equals_0 + i5:u17:p21_equals_1 = 1
invariant :i5:u2:CDK4_equals_0 + i5:u2:CDK4_equals_1 = 1
invariant :i2:u10:ERBB2_equals_0 + i2:u10:ERBB2_equals_1 = 1
invariant :i3:u7:ERBB1_equals_0 + i3:u7:ERBB1_equals_1 = 1
invariant :i4:u14:IGF1R_equals_0 + i4:u14:IGF1R_equals_1 = 1
invariant :i4:u0:AKT1_0 + i4:u0:AKT1_equals_1 = 1
invariant :i1:u5:CyclinE1_equals_0 + i1:u5:CyclinE1_equals_1 = 1
invariant :i1:u4:CyclinD1_equals_0 + i1:u4:CyclinD1_equals_1 = 1
invariant :i0:u3:CDK6_equals_0 + i0:u3:CDK6_equals_1 = 1
invariant :i2:u12:ERBB3_equals_0 + i2:u12:ERBB3_equals_1 = 1
invariant :i3:u15:MEK1_equals_0 + i3:u15:MEK1_equals_1 = 1
invariant :i2:u6:EGF_equals_0 + i2:u6:EGF_equals_1 = 1
invariant :i3:u9:ERBB1_3_equals_0 + i3:u9:ERBB1_3_equals_1 = 1
invariant :i2:u11:ERBB2_3_equals_0 + i2:u11:ERBB2_3_equals_1 = 1
invariant :i1:u13:ERalpha_equals_0 + i1:u13:ERalpha_equals_1 = 1
invariant :i3:u8:ERBB1_2_equals_0 + i3:u8:ERBB1_2_equals_1 = 1
invariant :i0:u19:pRB1_equals_0 + i0:u19:pRB1_equals_1 = 1
invariant :i1:u16:MYC_equals_0 + i1:u16:MYC_equals_1 = 1
23 unique states visited
22 strongly connected components in search stack
23 transitions explored
22 items max in DFS search stack
14 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.370466,27708,1,0,20817,37,937,31603,43,32,61324
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 USE_NUPN
Checking formula 2 : !(("((i0.u3.CDK6_equals_0>=1)&&(i0.u19.pRB1_equals_1>=1))"))
Formula 2 simplified : !"((i0.u3.CDK6_equals_0>=1)&&(i0.u19.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.371937,27972,1,0,20836,37,945,31640,43,32,61462
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 USE_NUPN
Checking formula 3 : !((G(("((i2.u10.ERBB2_equals_0>=1)&&(i2.u11.ERBB2_3_equals_1>=1))")U(F(G("((i2.u11.ERBB2_3_equals_1>=1)&&(i2.u12.ERBB3_equals_0>=1))"))))))
Formula 3 simplified : !G("((i2.u10.ERBB2_equals_0>=1)&&(i2.u11.ERBB2_3_equals_1>=1))" U FG"((i2.u11.ERBB2_3_equals_1>=1)&&(i2.u12.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
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.408323,29680,1,0,24766,37,972,35085,43,32,71704
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 USE_NUPN
Checking formula 4 : !((F((X("((i4.u0.AKT1_equals_1>=1)&&(i5.u17.p21_equals_1>=1))"))U(("((i5.u2.CDK4_equals_1>=1)&&(i5.u17.p21_equals_1>=1))")U("((((i5.u2.CDK4_equals_0>=1)&&(i1.u4.CyclinD1_equals_1>=1))&&(i5.u17.p21_equals_0>=1))&&(i5.u18.p27_equals_0>=1))")))))
Formula 4 simplified : !F(X"((i4.u0.AKT1_equals_1>=1)&&(i5.u17.p21_equals_1>=1))" U ("((i5.u2.CDK4_equals_1>=1)&&(i5.u17.p21_equals_1>=1))" U "((((i5.u2.CDK4_equals_0>=1)&&(i1.u4.CyclinD1_equals_1>=1))&&(i5.u17.p21_equals_0>=1))&&(i5.u18.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.417732,29944,1,0,25200,37,1003,36138,43,32,73233
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA EGFr-PT-02010-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X("((i3.u8.ERBB1_2_equals_1>=1)&&(i2.u10.ERBB2_equals_0>=1))")))
Formula 5 simplified : !X"((i3.u8.ERBB1_2_equals_1>=1)&&(i2.u10.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.419032,30200,1,0,25224,37,1007,36177,43,32,73400
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 USE_NUPN
Checking formula 6 : !((G("((i3.u7.ERBB1_equals_0>=1)&&(i3.u9.ERBB1_3_equals_1>=1))")))
Formula 6 simplified : !G"((i3.u7.ERBB1_equals_0>=1)&&(i3.u9.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.419806,30200,1,0,25224,37,1027,36177,43,32,73416
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 USE_NUPN
Checking formula 7 : !(((G(G(G("((i4.u0.AKT1_equals_1>=1)&&(i1.u13.ERalpha_equals_0>=1))"))))U(F(F(G("(((i4.u0.AKT1_equals_1>=1)&&(i2.u11.ERBB2_3_equals_0>=1))&&(i4.u14.IGF1R_equals_0>=1))"))))))
Formula 7 simplified : !(G"((i4.u0.AKT1_equals_1>=1)&&(i1.u13.ERalpha_equals_0>=1))" U FG"(((i4.u0.AKT1_equals_1>=1)&&(i2.u11.ERBB2_3_equals_0>=1))&&(i4.u14.IGF1R_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
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.477075,32252,1,0,29996,37,1056,40987,43,32,86057
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 USE_NUPN
Checking formula 8 : !((G(G(("((i5.u2.CDK4_equals_1>=1)&&(i5.u18.p27_equals_1>=1))")U("((i5.u2.CDK4_equals_1>=1)&&(i5.u17.p21_equals_1>=1))")))))
Formula 8 simplified : !G("((i5.u2.CDK4_equals_1>=1)&&(i5.u18.p27_equals_1>=1))" U "((i5.u2.CDK4_equals_1>=1)&&(i5.u17.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.478782,32684,1,0,29996,37,1098,40987,43,32,86078
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 USE_NUPN
Checking formula 9 : !(("((i5.u1.CDK2_equals_1>=1)&&(i5.u18.p27_equals_1>=1))"))
Formula 9 simplified : !"((i5.u1.CDK2_equals_1>=1)&&(i5.u18.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.479134,32684,1,0,29996,37,1106,40987,43,32,86082
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 USE_NUPN
Checking formula 10 : !((G(G((X("((i2.u6.EGF_equals_0>=1)&&(i3.u7.ERBB1_equals_1>=1))"))U(X("((i4.u14.IGF1R_equals_1>=1)&&(i3.u15.MEK1_equals_0>=1))"))))))
Formula 10 simplified : !G(X"((i2.u6.EGF_equals_0>=1)&&(i3.u7.ERBB1_equals_1>=1))" U X"((i4.u14.IGF1R_equals_1>=1)&&(i3.u15.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.480089,32684,1,0,29996,37,1116,40987,43,32,86092
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 USE_NUPN
Checking formula 11 : !((("((i3.u9.ERBB1_3_equals_1>=1)&&(i2.u12.ERBB3_equals_0>=1))")U(F(X(G("((i1.u13.ERalpha_equals_1>=1)&&(i1.u16.MYC_equals_0>=1))"))))))
Formula 11 simplified : !("((i3.u9.ERBB1_3_equals_1>=1)&&(i2.u12.ERBB3_equals_0>=1))" U FXG"((i1.u13.ERalpha_equals_1>=1)&&(i1.u16.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.529321,34440,1,0,34143,37,1138,45403,43,32,98611
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 USE_NUPN
Checking formula 12 : !((X(F(X("((i2.u6.EGF_equals_1>=1)&&(i2.u12.ERBB3_equals_0>=1))")))))
Formula 12 simplified : !XFX"((i2.u6.EGF_equals_1>=1)&&(i2.u12.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
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.570785,36024,1,0,37168,37,1167,48106,43,32,107413
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 USE_NUPN
Checking formula 13 : !((X((X(F("((i5.u2.CDK4_equals_1>=1)&&(i5.u18.p27_equals_1>=1))")))U(X(F("((i1.u4.CyclinD1_equals_1>=1)&&(i1.u13.ERalpha_equals_0>=1))"))))))
Formula 13 simplified : !X(XF"((i5.u2.CDK4_equals_1>=1)&&(i5.u18.p27_equals_1>=1))" U XF"((i1.u4.CyclinD1_equals_1>=1)&&(i1.u13.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.576849,36288,1,0,37410,37,1185,48358,43,32,109002
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 USE_NUPN
Checking formula 14 : !(("((((((i3.u7.ERBB1_equals_0>=1)&&(i3.u8.ERBB1_2_equals_0>=1))&&(i3.u9.ERBB1_3_equals_0>=1))&&(i2.u11.ERBB2_3_equals_0>=1))&&(i4.u14.IGF1R_equals_0>=1))&&(i3.u15.MEK1_equals_1>=1))"))
Formula 14 simplified : !"((((((i3.u7.ERBB1_equals_0>=1)&&(i3.u8.ERBB1_2_equals_0>=1))&&(i3.u9.ERBB1_3_equals_0>=1))&&(i2.u11.ERBB2_3_equals_0>=1))&&(i4.u14.IGF1R_equals_0>=1))&&(i3.u15.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.577494,36288,1,0,37410,37,1198,48358,43,32,109010
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 USE_NUPN
Checking formula 15 : !(((F(("((i3.u7.ERBB1_equals_1>=1)&&(i3.u15.MEK1_equals_0>=1))")U("((((((i4.u0.AKT1_equals_1>=1)&&(i3.u7.ERBB1_equals_0>=1))&&(i3.u8.ERBB1_2_equals_0>=1))&&(i3.u9.ERBB1_3_equals_0>=1))&&(i2.u11.ERBB2_3_equals_0>=1))&&(i4.u14.IGF1R_equals_0>=1))")))U(G("((i1.u16.MYC_equals_1>=1)&&(i5.u17.p21_equals_1>=1))"))))
Formula 15 simplified : !(F("((i3.u7.ERBB1_equals_1>=1)&&(i3.u15.MEK1_equals_0>=1))" U "((((((i4.u0.AKT1_equals_1>=1)&&(i3.u7.ERBB1_equals_0>=1))&&(i3.u8.ERBB1_2_equals_0>=1))&&(i3.u9.ERBB1_3_equals_0>=1))&&(i2.u11.ERBB2_3_equals_0>=1))&&(i4.u14.IGF1R_equals_0>=1))") U G"((i1.u16.MYC_equals_1>=1)&&(i5.u17.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.670991,38668,1,0,41988,37,1216,55005,43,32,124241
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 USE_NUPN
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, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527990633246

--------------------
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/ -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 LTLFireability -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:30 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/, -louvain, -smt]
Jun 03, 2018 1:50:30 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 03, 2018 1:50:31 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 57 ms
Jun 03, 2018 1:50:31 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 40 places.
Jun 03, 2018 1:50:31 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 68 transitions.
Jun 03, 2018 1:50:31 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 16 ms
Jun 03, 2018 1:50:31 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 03, 2018 1:50:31 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 34 ms
Jun 03, 2018 1:50:31 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 13 ms
Begin: Sun Jun 3 01:50:31 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Sun Jun 3 01:50:31 2018
network size: 40 nodes, 220 links, 136 weight
quality increased from -0.0284021 to 0.390939
end computation: Sun Jun 3 01:50:31 2018
level 1:
start computation: Sun Jun 3 01:50:31 2018
network size: 20 nodes, 108 links, 136 weight
quality increased from 0.390939 to 0.523724
end computation: Sun Jun 3 01:50:31 2018
level 2:
start computation: Sun Jun 3 01:50:31 2018
network size: 8 nodes, 40 links, 136 weight
quality increased from 0.523724 to 0.534907
end computation: Sun Jun 3 01:50:31 2018
level 3:
start computation: Sun Jun 3 01:50:31 2018
network size: 6 nodes, 24 links, 136 weight
quality increased from 0.534907 to 0.534907
end computation: Sun Jun 3 01:50:31 2018
End: Sun Jun 3 01:50:31 2018
Total duration: 0 sec
0.534907
Jun 03, 2018 1:50:31 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 03, 2018 1:50:31 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 17 ms
Jun 03, 2018 1:50:31 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 03, 2018 1:50:31 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 92 redundant transitions.
Jun 03, 2018 1:50:31 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
Jun 03, 2018 1:50:31 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Jun 03, 2018 1:50:32 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 68 transitions.
Jun 03, 2018 1:50:32 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 20 place invariants in 9 ms
Jun 03, 2018 1:50:32 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 40 variables to be positive in 234 ms
Jun 03, 2018 1:50:32 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 68 transitions.
Jun 03, 2018 1:50:32 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/68 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 03, 2018 1:50:32 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 03, 2018 1:50:32 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 68 transitions.
Jun 03, 2018 1:50:32 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 03, 2018 1:50:32 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:32 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:32 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (and (>= (select s0 5) 1) (>= (select s0 32) 1) (>= (select s0 34) 1) (>= (select s0 38) 1)) (= (store (store s0 33 (+ (select s0 33) 1)) 32 (- (select s0 32) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (and (>= (select s0 5) 1) (>= (select s0 32) 1) (>= (select s0 34) 1) (>= (select s0 38) 1)) (= (store (store s0 33 (+ (select s0 33) 1)) 32 (- (select s0 32) 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:32 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 699ms 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="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 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 r285-csrt-152749176000258"
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 ;