fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r074-smll-155234739000087
Last Updated
Apr 15, 2019

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
341.070 8192.00 13590.00 449.50 TFFFTTFFFFFFTFTT normal

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-155234739000087.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074-smll-155234739000087
=====================================================================

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

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/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.201903111103/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((F(F(F(F("(IGF1R_equals_1<=ERBB2_equals_1)"))))))
Formula 0 simplified : !F"(IGF1R_equals_1<=ERBB2_equals_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
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.069118,17644,1,0,118,10364,132,42,1398,7736,116
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA EGFr-PT-02010-LTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !(("(ERBB1_equals_0>=3)"))
Formula 1 simplified : !"(ERBB1_equals_0>=3)"
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
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.107424,19120,1,0,141,15127,141,87,1472,13058,200
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA EGFr-PT-02010-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(("(ERBB1_3_equals_0>=2)"))
Formula 2 simplified : !"(ERBB1_3_equals_0>=2)"
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.108021,19384,1,0,141,15127,144,87,1474,13058,202
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
Checking formula 3 : !((G("(CyclinE1_equals_0>=2)")))
Formula 3 simplified : !G"(CyclinE1_equals_0>=2)"
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.108635,19384,1,0,141,15127,150,87,1476,13058,207
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
Checking formula 4 : !(((G(G("(p21_equals_0<=ERBB1_3_equals_1)")))U(X(X("(CDK4_equals_0<=pRB1_equals_0)")))))
Formula 4 simplified : !(G"(p21_equals_0<=ERBB1_3_equals_1)" U XX"(CDK4_equals_0<=pRB1_equals_0)")
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 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.117016,21048,1,0,142,15188,157,88,1482,13101,216
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA EGFr-PT-02010-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((("(MYC_equals_0>=3)")U(G(G("(EGF_equals_0<=ERBB1_3_equals_0)")))))
Formula 5 simplified : !("(MYC_equals_0>=3)" U G"(EGF_equals_0<=ERBB1_3_equals_0)")
Computing Next relation with stutter on 1 deadlock states
24 unique states visited
0 strongly connected components in search stack
24 transitions explored
24 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.195962,22408,1,0,173,21516,179,142,1497,26184,422
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA EGFr-PT-02010-LTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((G(G(F(F("(pRB1_equals_1<=p27_equals_1)"))))))
Formula 6 simplified : !GF"(pRB1_equals_1<=p27_equals_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
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.223203,22916,1,0,184,22013,188,163,1502,29546,575
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA EGFr-PT-02010-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(("(IGF1R_equals_0>=3)"))
Formula 7 simplified : !"(IGF1R_equals_0>=3)"
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.223925,23180,1,0,184,22013,191,163,1504,29546,577
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA EGFr-PT-02010-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((G("(ERBB1_2_equals_0>=2)")))
Formula 8 simplified : !G"(ERBB1_2_equals_0>=2)"
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.224851,23180,1,0,184,22013,197,163,1506,29546,582
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA EGFr-PT-02010-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((G(X(("(MEK1_equals_0<=CDK4_equals_1)")U("(pRB1_equals_0<=ERBB1_2_equals_1)")))))
Formula 9 simplified : !GX("(MEK1_equals_0<=CDK4_equals_1)" U "(pRB1_equals_0<=ERBB1_2_equals_1)")
Computing Next relation with stutter on 1 deadlock states
34 unique states visited
22 strongly connected components in search stack
38 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.233753,23180,1,0,195,22714,209,175,1519,30500,643
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
Checking formula 10 : !((("(p27_equals_0<=ERBB3_equals_1)")U(X(X("(ERBB1_2_equals_0<=CyclinE1_equals_1)")))))
Formula 10 simplified : !("(p27_equals_0<=ERBB3_equals_1)" U XX"(ERBB1_2_equals_0<=CyclinE1_equals_1)")
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.237406,23416,1,0,196,22761,216,176,1526,30572,655
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA EGFr-PT-02010-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !(((F(G("(ERBB1_3_equals_1<=pRB1_equals_0)")))U(G(X("(MYC_equals_0>=1)")))))
Formula 11 simplified : !(FG"(ERBB1_3_equals_1<=pRB1_equals_0)" U GX"(MYC_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.240379,23644,1,0,196,22761,234,176,1531,30573,668
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
Checking formula 12 : !((F("(AKT1_0>=1)")))
Formula 12 simplified : !F"(AKT1_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.240991,23644,1,0,196,22761,243,176,1532,30573,672
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA EGFr-PT-02010-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((X((G("(ERBB1_2_equals_0<=p21_equals_0)"))U(G("(MYC_equals_1<=CDK2_equals_1)")))))
Formula 13 simplified : !X(G"(ERBB1_2_equals_0<=p21_equals_0)" U G"(MYC_equals_1<=CDK2_equals_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
546 unique states visited
16 strongly connected components in search stack
785 transitions explored
23 items max in DFS search stack
58 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.814061,34284,1,0,841,61754,268,1432,1549,103184,5379
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
Checking formula 14 : !(((X(F("(MYC_equals_0>=3)")))U(X(F("(p27_equals_1<=CDK4_equals_1)")))))
Formula 14 simplified : !(XF"(MYC_equals_0>=3)" U XF"(p27_equals_1<=CDK4_equals_1)")
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 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.847424,34548,1,0,928,63058,277,1485,1553,105881,5560
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA EGFr-PT-02010-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((F("(ERBB2_equals_0<=IGF1R_equals_1)")))
Formula 15 simplified : !F"(ERBB2_equals_0<=IGF1R_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
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.87908,35452,1,0,1004,68789,286,1533,1558,113063,5728
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA EGFr-PT-02010-LTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
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 1552708245637

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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:50:40 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/, -smt]
Mar 16, 2019 3:50:40 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 16, 2019 3:50:40 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 53 ms
Mar 16, 2019 3:50:40 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 40 places.
Mar 16, 2019 3:50:40 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 68 transitions.
Mar 16, 2019 3:50:40 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 15 ms
Mar 16, 2019 3:50:40 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 84 ms
Mar 16, 2019 3:50:40 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 5 ms
Mar 16, 2019 3:50:40 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 ms
Mar 16, 2019 3:50:41 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 68 transitions.
Mar 16, 2019 3:50:41 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 20 place invariants in 18 ms
Mar 16, 2019 3:50:41 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 40 variables to be positive in 142 ms
Mar 16, 2019 3:50:41 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 68 transitions.
Mar 16, 2019 3:50:41 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:50:41 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 16, 2019 3:50:41 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 68 transitions.
Mar 16, 2019 3:50:41 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 16, 2019 3:50:42 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 68 transitions.
Mar 16, 2019 3:50:44 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 1779 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:50:44 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 3197ms 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="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 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 r074-smll-155234739000087"
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 [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "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 [ "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 ;