fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r006-smll-158897515900325
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for Angiogenesis-PT-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15740.320 1578936.00 1613574.00 3713.80 FTFFTFFFFFFFFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r006-smll-158897515900325.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Angiogenesis-PT-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-smll-158897515900325
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 3.5K Apr 28 14:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 28 14:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 28 14:22 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 28 14:22 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 28 14:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 28 14:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Apr 28 14:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Apr 28 14:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 28 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 28 14:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 28 14:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 28 14:22 equiv_col
-rw-r--r-- 1 mcc users 3 Apr 28 14:22 instance
-rw-r--r-- 1 mcc users 6 Apr 28 14:22 iscolored
-rw-r--r-- 1 mcc users 33K Apr 28 14:22 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 Angiogenesis-PT-05-00
FORMULA_NAME Angiogenesis-PT-05-01
FORMULA_NAME Angiogenesis-PT-05-02
FORMULA_NAME Angiogenesis-PT-05-03
FORMULA_NAME Angiogenesis-PT-05-04
FORMULA_NAME Angiogenesis-PT-05-05
FORMULA_NAME Angiogenesis-PT-05-06
FORMULA_NAME Angiogenesis-PT-05-07
FORMULA_NAME Angiogenesis-PT-05-08
FORMULA_NAME Angiogenesis-PT-05-09
FORMULA_NAME Angiogenesis-PT-05-10
FORMULA_NAME Angiogenesis-PT-05-11
FORMULA_NAME Angiogenesis-PT-05-12
FORMULA_NAME Angiogenesis-PT-05-13
FORMULA_NAME Angiogenesis-PT-05-14
FORMULA_NAME Angiogenesis-PT-05-15

=== Now, execution of the tool begins

BK_START 1589480905834

[2020-05-14 18:28:28] [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/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-14 18:28:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-14 18:28:28] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2020-05-14 18:28:28] [INFO ] Transformed 39 places.
[2020-05-14 18:28:28] [INFO ] Transformed 64 transitions.
[2020-05-14 18:28:28] [INFO ] Parsed PT model containing 39 places and 64 transitions in 143 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100004 steps, including 3 resets, run finished after 190 ms. (steps per millisecond=526 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 64 rows 39 cols
[2020-05-14 18:28:29] [INFO ] Computed 8 place invariants in 6 ms
[2020-05-14 18:28:29] [INFO ] [Real]Absence check using 8 positive place invariants in 22 ms returned sat
[2020-05-14 18:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 18:28:29] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2020-05-14 18:28:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-14 18:28:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2020-05-14 18:28:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-14 18:28:29] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2020-05-14 18:28:29] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 11 ms.
[2020-05-14 18:28:29] [INFO ] Added : 52 causal constraints over 11 iterations in 154 ms. Result :sat
[2020-05-14 18:28:29] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-05-14 18:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 18:28:29] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2020-05-14 18:28:29] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 8 ms.
[2020-05-14 18:28:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-14 18:28:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-05-14 18:28:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-14 18:28:29] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2020-05-14 18:28:29] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 9 ms.
[2020-05-14 18:28:30] [INFO ] Added : 56 causal constraints over 12 iterations in 122 ms. Result :sat
[2020-05-14 18:28:30] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-05-14 18:28:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 18:28:30] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-05-14 18:28:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-14 18:28:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2020-05-14 18:28:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-14 18:28:30] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2020-05-14 18:28:30] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 9 ms.
[2020-05-14 18:28:30] [INFO ] Added : 57 causal constraints over 12 iterations in 114 ms. Result :sat
[2020-05-14 18:28:30] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-05-14 18:28:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 18:28:30] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-05-14 18:28:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-14 18:28:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-05-14 18:28:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-14 18:28:30] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2020-05-14 18:28:30] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 9 ms.
[2020-05-14 18:28:30] [INFO ] Added : 59 causal constraints over 12 iterations in 104 ms. Result :sat
[2020-05-14 18:28:30] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-14 18:28:30] [INFO ] Flatten gal took : 47 ms
FORMULA Angiogenesis-PT-05-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-05-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-14 18:28:30] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-14 18:28:30] [INFO ] Applying decomposition
[2020-05-14 18:28:30] [INFO ] Flatten gal took : 19 ms
[2020-05-14 18:28:30] [INFO ] Input system was already deterministic with 64 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph3816331624391526260.txt, -o, /tmp/graph3816331624391526260.bin, -w, /tmp/graph3816331624391526260.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph3816331624391526260.bin, -l, -1, -v, -w, /tmp/graph3816331624391526260.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 64 rows 39 cols
[2020-05-14 18:28:31] [INFO ] Computed 8 place invariants in 4 ms
inv : KdStar + KdStarG + KdStarGP3 + KdStarGStar + KdStarGStarP3 + KdStarGStarP3k + KdStarGStarP3kP3 + KdStarGStarP3kStar + KdStarGStarP3kStarP2 + KdStarGStarP3kStarP3 + KdStarGStarP3kStarP3P2 + KdStarGStarPg + KdStarGStarPgP3 + KdStarGStarPgStar + KdStarGStarPgStarP2 + KdStarGStarPgStarP3 + KdStarGStarPgStarP3P2 + KdStarPg + KdStarPgStar + KdStarPgStarP2 = 5
inv : Gab1 + GP3 + GStarP3 + GStarP3kP3 + GStarPgP3 + KdStarG + KdStarGP3 + KdStarGStar + KdStarGStarP3 + KdStarGStarP3k + KdStarGStarP3kP3 + KdStarGStarP3kStar + KdStarGStarP3kStarP2 + KdStarGStarP3kStarP3 + KdStarGStarP3kStarP3P2 + KdStarGStarPg + KdStarGStarPgP3 + KdStarGStarPgStar + KdStarGStarPgStarP2 + KdStarGStarPgStarP3 + KdStarGStarPgStarP3P2 = 5
inv : DAGE + Enz = 5
inv : GStarPgP3 + KdStarGStarPg + KdStarGStarPgP3 + KdStarGStarPgStar + KdStarGStarPgStarP2 + KdStarGStarPgStarP3 + KdStarGStarPgStarP3P2 + KdStarPg + KdStarPgStar + KdStarPgStarP2 + Pg = 5
inv : Pten + PtP2 + PtP3 + PtP3P2 = 5
inv : AktP3 + DAG + DAGE + GP3 + GStarP3 + GStarP3kP3 + GStarPgP3 + KdStarGP3 + KdStarGStarP3 + KdStarGStarP3kP3 + KdStarGStarP3kStarP2 + KdStarGStarP3kStarP3 + 2*KdStarGStarP3kStarP3P2 + KdStarGStarPgP3 + KdStarGStarPgStarP2 + KdStarGStarPgStarP3 + 2*KdStarGStarPgStarP3P2 + KdStarPgStarP2 + Pip2 + Pip3 + PtP2 + PtP3 + 2*PtP3P2 = 5
inv : Akt + AktP3 + AktStar = 5
inv : GStarP3kP3 + KdStarGStarP3k + KdStarGStarP3kP3 + KdStarGStarP3kStar + KdStarGStarP3kStarP2 + KdStarGStarP3kStarP3 + KdStarGStarP3kStarP3P2 + P3k = 5
Total of 8 invariants.
[2020-05-14 18:28:31] [INFO ] Computed 8 place invariants in 7 ms
[2020-05-14 18:28:31] [INFO ] Decomposing Gal with order
[2020-05-14 18:28:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-14 18:28:31] [INFO ] Removed a total of 75 redundant transitions.
[2020-05-14 18:28:31] [INFO ] Flatten gal took : 67 ms
[2020-05-14 18:28:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2020-05-14 18:28:31] [INFO ] Proved 39 variables to be positive in 161 ms
[2020-05-14 18:28:31] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2020-05-14 18:28:31] [INFO ] Computation of disable matrix completed :0/64 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-14 18:28:31] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-14 18:28:31] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2020-05-14 18:28:31] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-14 18:28:31] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 13 ms
[2020-05-14 18:28:31] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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 --gen-order FOLLOW
Read 14 LTL properties
Checking formula 0 : !((!(X((G(X(F("(gi4.gu10.KdStarGStarP3k<=gi4.gu10.KdStarPg)"))))||((("(gi4.gu10.KdStarGStarP3k<=gi4.gu10.KdStarPg)")U("(gi2.gu2.Akt>gi2.gu2.DAG)"))&&("(gi4.gu10.KdStarPg>=3)"))))))
Formula 0 simplified : X(GXF"(gi4.gu10.KdStarGStarP3k<=gi4.gu10.KdStarPg)" | ("(gi4.gu10.KdStarPg>=3)" & ("(gi4.gu10.KdStarGStarP3k<=gi4.gu10.KdStarPg)" U "(gi2.gu2.Akt>gi2.gu2.DAG)")))
[2020-05-14 18:28:33] [INFO ] Computing symmetric co enabling matrix : 64 transitions.
[2020-05-14 18:28:34] [INFO ] Computation of co-enabling matrix(5/64) took 1152 ms. Total solver calls (SAT/UNSAT): 329(329/0)
[2020-05-14 18:28:37] [INFO ] Computation of co-enabling matrix(21/64) took 4183 ms. Total solver calls (SAT/UNSAT): 1059(1059/0)
[2020-05-14 18:28:40] [INFO ] Computation of co-enabling matrix(48/64) took 7233 ms. Total solver calls (SAT/UNSAT): 1731(1731/0)
[2020-05-14 18:28:40] [INFO ] Computation of Finished co-enabling matrix. took 7802 ms. Total solver calls (SAT/UNSAT): 1836(1836/0)
[2020-05-14 18:28:40] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2020-05-14 18:28:44] [INFO ] Computation of Completed DNA matrix. took 3274 ms. Total solver calls (SAT/UNSAT): 371(0/371)
[2020-05-14 18:28:44] [INFO ] Built C files in 13328ms conformant to PINS in folder :/home/mcc/execution
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]
Compilation finished in 1460 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 43 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( X(( [](X(<>((LTLAP0==true))))) || ( ( ((LTLAP0==true))U((LTLAP1==true)) ) && ( (LTLAP2==true) )) )) , --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( X(( [](X(<>((LTLAP0==true))))) || ( ( ((LTLAP0==true))U((LTLAP1==true)) ) && ( (LTLAP2==true) )) )) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( X(( [](X(<>((LTLAP0==true))))) || ( ( ((LTLAP0==true))U((LTLAP1==true)) ) && ( (LTLAP2==true) )) )) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
Reverse transition relation is NOT exact ! Due to transitions k2, k55, k60, k7, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/60/4/64
Computing Next relation with stutter on 36 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
78130 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,781.334,4095800,1,0,178,1.86044e+07,26,120,799,2.89158e+07,213
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Angiogenesis-PT-05-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(F(!(G(F(!(X((F(X("(gi2.gu12.KdStarGStarPg>=1)")))||(G("((gi2.gu2.GStarP3kP3<=gi3.gu7.PtP2)||(gi3.gu4.KdStarGStar<=gi3.gu4.AktP3))")))))))))))
Formula 1 simplified : !XF!GF!X(FX"(gi2.gu12.KdStarGStarPg>=1)" | G"((gi2.gu2.GStarP3kP3<=gi3.gu7.PtP2)||(gi3.gu4.KdStarGStar<=gi3.gu4.AktP3))")
Computing Next relation with stutter on 36 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
22073 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,1002.06,4561980,1,0,178,2.06341e+07,23,120,803,2.89158e+07,97
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Angiogenesis-PT-05-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G((G(!(X(X(F("(gu8.KdStarGStarP3kStarP3P2<=gu8.KdStarGStarP3kStar)"))))))U(X("((gi7.gu9.KdStar<=gi2.gu2.GStarP3kP3)||((gi4.gu5.KdStarGStarPgP3>=0)&&(gi4.gu5.KdStarGStarPgP3<2)))")))))
Formula 2 simplified : !G(G!XXF"(gu8.KdStarGStarP3kStarP3P2<=gu8.KdStarGStarP3kStar)" U X"((gi7.gu9.KdStar<=gi2.gu2.GStarP3kP3)||((gi4.gu5.KdStarGStarPgP3>=0)&&(gi4.gu5.KdStarGStarPgP3<2)))")
Computing Next relation with stutter on 36 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
7484 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,1076.91,4562140,1,0,178,2.06341e+07,39,120,1015,2.89158e+07,271
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Angiogenesis-PT-05-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X((G((("(gi3.gu7.KdStarGStarP3kP3<=gi3.gu7.KdStarGStarP3kStarP3)")U("(gi4.gu5.KdStarGStarP3>=3)"))&&("(gu6.KdStarGStarPgStar<=gu6.KdStarGStarP3kStarP2)")))||(F("(gi3.gu7.KdStarGStarP3kP3<=gi3.gu7.KdStarGStarP3kStarP3)")))))
Formula 3 simplified : !X(G("(gu6.KdStarGStarPgStar<=gu6.KdStarGStarP3kStarP2)" & ("(gi3.gu7.KdStarGStarP3kP3<=gi3.gu7.KdStarGStarP3kStarP3)" U "(gi4.gu5.KdStarGStarP3>=3)")) | F"(gi3.gu7.KdStarGStarP3kP3<=gi3.gu7.KdStarGStarP3kStarP3)")
Computing Next relation with stutter on 36 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 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,1076.91,4562140,1,0,178,2.06341e+07,58,120,1032,2.89158e+07,279
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA Angiogenesis-PT-05-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((F((("(gi7.gu13.PtP3>=3)")U(("(gi7.gu9.KdStarGStarPgStarP3>=2)")U("(gi7.gu13.PtP3<3)")))||("((gi4.gu5.KdStarGStarP3<=gi4.gu10.KdStarGStarP3k)&&(gi1.gu1.GP3<=gi1.gu1.PtP3P2))")))&&(G("(gi1.gu1.GP3<=gi1.gu1.PtP3P2)"))))
Formula 4 simplified : !(F("((gi4.gu5.KdStarGStarP3<=gi4.gu10.KdStarGStarP3k)&&(gi1.gu1.GP3<=gi1.gu1.PtP3P2))" | ("(gi7.gu13.PtP3>=3)" U ("(gi7.gu9.KdStarGStarPgStarP3>=2)" U "(gi7.gu13.PtP3<3)"))) & G"(gi1.gu1.GP3<=gi1.gu1.PtP3P2)")
Computing Next relation with stutter on 36 deadlock states
Detected timeout of ITS tools.
[2020-05-14 18:48:31] [INFO ] Flatten gal took : 6 ms
[2020-05-14 18:48:31] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 1 ms
[2020-05-14 18:48:31] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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 --gen-order FOLLOW
Read 10 LTL properties
Checking formula 0 : !(((F((("(PtP3>=3)")U(("(KdStarGStarPgStarP3>=2)")U("(PtP3<3)")))||("((KdStarGStarP3<=KdStarGStarP3k)&&(GP3<=PtP3P2))")))&&(G("(GP3<=PtP3P2)"))))
Formula 0 simplified : !(F("((KdStarGStarP3<=KdStarGStarP3k)&&(GP3<=PtP3P2))" | ("(PtP3>=3)" U ("(KdStarGStarPgStarP3>=2)" U "(PtP3<3)"))) & G"(GP3<=PtP3P2)")
Reverse transition relation is NOT exact ! Due to transitions k2, k55, k60, k7, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/60/4/64
Computing Next relation with stutter on 36 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
4939 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,49.3951,989016,1,0,205,4.90006e+06,174,199,1665,6.4229e+06,471
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Angiogenesis-PT-05-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G(X(F(G(("(Enz>=2)")||((F("(((GStarPgP3<=Pip2)&&(GStarP3kP3>=1))&&(GStarPgP3<=DAGE))"))&&(F("(GStarPgP3<=DAGE)")))))))))
Formula 1 simplified : !GXFG("(Enz>=2)" | (F"(((GStarPgP3<=Pip2)&&(GStarP3kP3>=1))&&(GStarPgP3<=DAGE))" & F"(GStarPgP3<=DAGE)"))
Computing Next relation with stutter on 36 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
3136 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,80.7611,1496668,1,0,309,7.23724e+06,198,313,1700,1.00012e+07,735
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Angiogenesis-PT-05-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((G("(KdStarGStarPgP3<=KdStarGStarP3)")))
Formula 2 simplified : !G"(KdStarGStarPgP3<=KdStarGStarP3)"
Computing Next relation with stutter on 36 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
3741 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,118.169,2137192,1,0,427,1.04929e+07,204,448,1708,1.44178e+07,1041
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Angiogenesis-PT-05-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((X(((F("(KdStarGStarPgStar>=3)"))||(X(X(("(Pg<=KdStarGStarPg)")U("(KdStarGStarPgStar>=3)")))))U(F(X("(Pg<=DAG)"))))))
Formula 3 simplified : !X((F"(KdStarGStarPgStar>=3)" | XX("(Pg<=KdStarGStarPg)" U "(KdStarGStarPgStar>=3)")) U FX"(Pg<=DAG)")
Computing Next relation with stutter on 36 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
4018 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,158.346,2217828,1,0,478,1.08569e+07,17,500,781,1.49221e+07,157
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Angiogenesis-PT-05-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((X(((G("(KdStarGStar>=2)"))&&(F(!(X("(Pip3<=KdStarPgStarP2)")))))&&(G((X(X("(Pip3<=KdStarPgStarP2)")))&&("(Pten<=KdStarGStarPgStarP2)"))))))
Formula 4 simplified : !X(G"(KdStarGStar>=2)" & F!X"(Pip3<=KdStarPgStarP2)" & G("(Pten<=KdStarGStarPgStarP2)" & XX"(Pip3<=KdStarPgStarP2)"))
Computing Next relation with stutter on 36 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
198 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,160.326,2218356,1,0,478,1.08569e+07,36,500,978,1.49221e+07,182
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Angiogenesis-PT-05-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((F((F("(KdStarGStarP3kStarP3P2>=1)"))||(X("(PtP2<=KdStarGStarPgStarP2)")))))
Formula 5 simplified : !F(F"(KdStarGStarP3kStarP3P2>=1)" | X"(PtP2<=KdStarGStarPgStarP2)")
Computing Next relation with stutter on 36 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
2518 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,185.51,2218460,1,0,478,1.08569e+07,50,500,989,1.49221e+07,476
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Angiogenesis-PT-05-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((X((G("(KdStarGStarP3kStarP3<=PtP2)"))&&(((!(X("((KdStarGStarP3kStarP3<=PtP2)||(GStarP3kP3<=DAG))")))U("(KdStarGStarP3kP3<3)"))||(F("(GStarP3kP3<=DAG)"))))))
Formula 6 simplified : !X(G"(KdStarGStarP3kStarP3<=PtP2)" & ((!X"((KdStarGStarP3kStarP3<=PtP2)||(GStarP3kP3<=DAG))" U "(KdStarGStarP3kP3<3)") | F"(GStarP3kP3<=DAG)"))
Computing Next relation with stutter on 36 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
2567 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,211.172,2218572,1,0,478,1.08569e+07,71,500,1016,1.49221e+07,804
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Angiogenesis-PT-05-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((!(F(X(G(("(Pten>KdStarGP3)")U((!(X(X("(Pten<=KdStarGP3)"))))||("(KdStarGStarP3kP3>GStarP3kP3)"))))))))
Formula 7 simplified : FXG("(Pten>KdStarGP3)" U ("(KdStarGStarP3kP3>GStarP3kP3)" | !XX"(Pten<=KdStarGP3)"))
Computing Next relation with stutter on 36 deadlock states
5 unique states visited
4 strongly connected components in search stack
8 transitions explored
5 items max in DFS search stack
572 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,216.901,2218572,1,0,478,1.08569e+07,88,500,1047,1.49221e+07,914
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Angiogenesis-PT-05-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((!(G(X(F("(KdStarGStarPgStarP2<=KdStar)"))))))
Formula 8 simplified : GXF"(KdStarGStarPgStarP2<=KdStar)"
Computing Next relation with stutter on 36 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
8892 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,305.818,2450152,1,0,478,1.21698e+07,20,500,787,1.69821e+07,352
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Angiogenesis-PT-05-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((X(G(!(F(X(F("((KdStarGStarPgStarP3>KdStarGStarPgStarP2)&&(PtP2<=KdStarGStar))"))))))))
Formula 9 simplified : !XG!FXF"((KdStarGStarPgStarP3>KdStarGStarPgStarP2)&&(PtP2<=KdStarGStar))"
Computing Next relation with stutter on 36 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
4071 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,346.535,2450152,1,0,478,1.21698e+07,34,500,997,1.75343e+07,685
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Angiogenesis-PT-05-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1589482484770

--------------------
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/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="Angiogenesis-PT-05"
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-4028"
echo " Executing tool itstools"
echo " Input is Angiogenesis-PT-05, 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 r006-smll-158897515900325"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Angiogenesis-PT-05.tgz
mv Angiogenesis-PT-05 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; 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
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;