About the Execution of ITS-Tools.M for GPPP-PT-C0001N0000000100
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
506.660 | 12190.00 | 29350.00 | 137.60 | FFFFFFTFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2019-input.r195-csrt-155246554300331.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-3954
Executing tool itstoolsm
Input is GPPP-PT-C0001N0000000100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r195-csrt-155246554300331
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.4K Feb 11 01:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 11 01:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Feb 7 00:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 7 00:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 111 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 349 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 4 23:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 4 23:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.7K Feb 4 22:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 3 08:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 3 08:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Jan 31 01:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Jan 31 01:39 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 17 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 1 Mar 10 17:31 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0001N0000000100-LTLFireability-00
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-01
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-02
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-03
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-04
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-05
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-06
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-07
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-08
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-09
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-10
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-11
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-12
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-13
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-14
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1553728863938
Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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, --load-order, /home/mcc/execution/model.ord], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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 --load-order /home/mcc/execution/model.ord
Read 16 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((false))
Formula 0 simplified : 1
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 22 rows 33 cols
invariant :c1 + c2 = 7
invariant :NADplus + _1_3_BPG + _3PG + _2PG + PEP + Pyr = 200
invariant :Xu5P + -2'R5P + -1'S7P + -1'E4P + a2 = 0
invariant :-2'Ru5P + -6'R5P + -9'S7P + 3'GAP + 9'E4P + 6'F6P + 6'FBP + 3'DHAP + -2'b2 + 2'a2 + -3'c2 = 0
invariant :Pi + _1_3_BPG + _3PG + _2PG + PEP + Pyr + 7'start + Lac = 7
invariant :21'ATP + 7'Ru5P + 21'R5P + 21'S7P + -21'E4P + -21'F6P + 9'_1_3_BPG + -12'_3PG + -12'_2PG + -12'PEP + -33'Pyr + -84'start + -33'Lac + -21'Gluc + 7'b2 + -7'a2 + 9'c2 = 8316
invariant :NADH + -1'_1_3_BPG + -1'_3PG + -1'_2PG + -1'PEP + -1'Pyr = 0
invariant :-7'Ru5P + -21'R5P + -21'S7P + 21'E4P + 21'F6P + -9'_1_3_BPG + 21'ADP + 12'_3PG + 12'_2PG + 12'PEP + 33'Pyr + 231'start + 33'Lac + 21'Gluc + -7'b2 + 7'a2 + -9'c2 = 231
invariant :2'GSSG + GSH = 200
invariant :b1 + b2 = 3
invariant :NADPplus + NADPH = 200
invariant :28'Ru5P + 84'R5P + 84'S7P + 21'G6P + 12'_1_3_BPG + 12'_3PG + 12'_2PG + 12'PEP + 12'Pyr + 84'start + 12'Lac + 21'Gluc + 7'b2 + -28'a2 + 12'c2 = 84
invariant :a1 + a2 = 2
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/21/1/22
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 723 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 68 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, false, --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 200 ms.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, []((LTLAP0==true)), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 221 ms.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, []([](<>([](X((LTLAP1==true)))))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 165 ms.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, false, --buchi-type=spotba], workingDir=/home/mcc/execution]
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
836 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,8.38028,131408,1,0,43,539189,65,25,1721,582999,59
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G("((((GAP>=1)&&(NADplus>=1))&&(Pi>=1))&&(c2>=1))")))
Formula 1 simplified : !G"((((GAP>=1)&&(NADplus>=1))&&(Pi>=1))&&(c2>=1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.38743,131732,1,0,44,539276,71,25,1730,583102,69
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((G(G(F(G(X("((G6P>=1)&&(b1>=3))")))))))
Formula 2 simplified : !GFGX"((G6P>=1)&&(b1>=3))"
2 unique states visited
1 strongly connected components in search stack
3 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,8.39592,132088,1,0,48,539679,76,27,1733,583829,83
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((false))
Formula 3 simplified : 1
2 unique states visited
2 strongly connected components in search stack
2 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,8.39608,132088,1,0,48,539679,76,27,1733,583829,83
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((G((("(GSH>=2)")U("(GAP>=1)"))U("((E4P>=1)&&(Xu5P>=1))"))))
Formula 4 simplified : !G(("(GSH>=2)" U "(GAP>=1)") U "((E4P>=1)&&(Xu5P>=1))")
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,8.39923,133040,1,0,48,539679,107,27,1757,583831,92
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(((F(G(F("(start>=1)"))))U(("((PEP>=1)&&(ADP>=1))")U(F("((((GAP>=1)&&(NADplus>=1))&&(Pi>=1))&&(c2>=1))")))))
Formula 5 simplified : !(FGF"(start>=1)" U ("((PEP>=1)&&(ADP>=1))" U F"((((GAP>=1)&&(NADplus>=1))&&(Pi>=1))&&(c2>=1))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
15 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,8.54891,136612,1,0,178,567768,113,59,1757,613298,380
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((F(F(F(("((Xu5P>=1)&&(R5P>=1))")U("((ATP>=1)&&(Gluc>=1))"))))))
Formula 6 simplified : !F("((Xu5P>=1)&&(R5P>=1))" U "((ATP>=1)&&(Gluc>=1))")
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,8.54966,136876,1,0,178,567768,122,60,1760,613303,388
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(((("((Ru5P>=1)&&(a2>=1))")U("((Xu5P>=1)&&(R5P>=1))"))U((G("((GSSG>=1)&&(NADPH>=1))"))U("(((NADPplus>=2)&&(G6P>=1))&&(b2>=1))"))))
Formula 7 simplified : !(("((Ru5P>=1)&&(a2>=1))" U "((Xu5P>=1)&&(R5P>=1))") U (G"((GSSG>=1)&&(NADPH>=1))" U "(((NADPplus>=2)&&(G6P>=1))&&(b2>=1))"))
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,8.55499,137412,1,0,178,567768,158,60,1807,613307,398
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((false))
Formula 8 simplified : 1
2 unique states visited
2 strongly connected components in search stack
2 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,8.55517,137412,1,0,178,567768,158,60,1807,613307,398
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((false))
Formula 9 simplified : 1
2 unique states visited
2 strongly connected components in search stack
2 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,8.55533,137412,1,0,178,567768,158,60,1807,613307,398
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((X("(FBP>=1)")))
Formula 10 simplified : !X"(FBP>=1)"
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,8.55975,137412,1,0,179,567889,161,60,1808,613457,405
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((false))
Formula 11 simplified : 1
2 unique states visited
2 strongly connected components in search stack
2 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,8.55992,137412,1,0,179,567889,161,60,1808,613457,405
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((false))
Formula 12 simplified : 1
2 unique states visited
2 strongly connected components in search stack
2 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,8.56008,137412,1,0,179,567889,161,60,1808,613457,405
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((false))
Formula 13 simplified : 1
2 unique states visited
2 strongly connected components in search stack
2 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,8.56026,137412,1,0,179,567889,161,60,1808,613457,405
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((G(X("((GSSG>=1)&&(NADPH>=1))"))))
Formula 14 simplified : !GX"((GSSG>=1)&&(NADPH>=1))"
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,8.56113,137412,1,0,179,567889,165,60,1808,613457,410
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((false))
Formula 15 simplified : 1
2 unique states visited
2 strongly connected components in search stack
2 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,8.5613,137412,1,0,179,567889,165,60,1808,613457,410
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
LTSmin run took 668 ms.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
BK_STOP 1553728876128
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -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 27, 2019 11:21:06 PM 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/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt]
Mar 27, 2019 11:21:06 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 27, 2019 11:21:06 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 36 ms
Mar 27, 2019 11:21:06 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 33 places.
Mar 27, 2019 11:21:06 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 22 transitions.
Mar 27, 2019 11:21:06 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 6 ms
Mar 27, 2019 11:21:06 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 58 ms
Mar 27, 2019 11:21:06 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 16 ms
Mar 27, 2019 11:21:06 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 22 transitions.
Mar 27, 2019 11:21:06 PM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 33 places.
Mar 27, 2019 11:21:06 PM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 22 transitions.
Mar 27, 2019 11:21:06 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 22 transitions.
Mar 27, 2019 11:21:06 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
Mar 27, 2019 11:21:06 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Mar 27, 2019 11:21:07 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 13 place invariants in 11 ms
Mar 27, 2019 11:21:07 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 33 variables to be positive in 358 ms
Mar 27, 2019 11:21:07 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 22 transitions.
Mar 27, 2019 11:21:07 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/22 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 27, 2019 11:21:07 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 27, 2019 11:21:07 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 22 transitions.
Mar 27, 2019 11:21:07 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 27, 2019 11:21:08 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 22 transitions.
SMT solver raised 'unknown', retrying with same input.
SMT solver raised 'unknown', retrying with same input.
SMT solver raised 'unknown', retrying with same input.
SMT solver raised 'unknown', retrying with same input.
SMT solver raised 'unknown', retrying with same input.
Mar 27, 2019 11:21:11 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(11/22) took 3131 ms. Total solver calls (SAT/UNSAT): 118(102/16)
Mar 27, 2019 11:21:12 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 4022 ms. Total solver calls (SAT/UNSAT): 163(128/35)
Mar 27, 2019 11:21:12 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 22 transitions.
Mar 27, 2019 11:21:13 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 1125 ms. Total solver calls (SAT/UNSAT): 42(0/42)
Mar 27, 2019 11:21:13 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 6921ms 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="GPPP-PT-C0001N0000000100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstoolsm"
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-3954"
echo " Executing tool itstoolsm"
echo " Input is GPPP-PT-C0001N0000000100, 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 r195-csrt-155246554300331"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0001N0000000100.tgz
mv GPPP-PT-C0001N0000000100 execution
cd execution
if [ "LTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;