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.r081-smll-158922977900426.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 GPPP-PT-C0001N0000000010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r081-smll-158922977900426
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 3.7K Apr 4 20:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 4 20:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 4 09:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 4 09:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 8 14:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 3 21:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 3 21:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 3 13:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 3 13:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 4 01:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1 Mar 24 05:37 large_marking
-rw-r--r-- 1 mcc users 21K Mar 24 05:37 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-C0001N0000000010-00
FORMULA_NAME GPPP-PT-C0001N0000000010-01
FORMULA_NAME GPPP-PT-C0001N0000000010-02
FORMULA_NAME GPPP-PT-C0001N0000000010-03
FORMULA_NAME GPPP-PT-C0001N0000000010-04
FORMULA_NAME GPPP-PT-C0001N0000000010-05
FORMULA_NAME GPPP-PT-C0001N0000000010-06
FORMULA_NAME GPPP-PT-C0001N0000000010-07
FORMULA_NAME GPPP-PT-C0001N0000000010-08
FORMULA_NAME GPPP-PT-C0001N0000000010-09
FORMULA_NAME GPPP-PT-C0001N0000000010-10
FORMULA_NAME GPPP-PT-C0001N0000000010-11
FORMULA_NAME GPPP-PT-C0001N0000000010-12
FORMULA_NAME GPPP-PT-C0001N0000000010-13
FORMULA_NAME GPPP-PT-C0001N0000000010-14
FORMULA_NAME GPPP-PT-C0001N0000000010-15

=== Now, execution of the tool begins

BK_START 1589744919776

[2020-05-17 19:48:42] [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, -timeout, 3600]
[2020-05-17 19:48:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-17 19:48:42] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2020-05-17 19:48:42] [INFO ] Transformed 33 places.
[2020-05-17 19:48:42] [INFO ] Transformed 22 transitions.
[2020-05-17 19:48:42] [INFO ] Parsed PT model containing 33 places and 22 transitions in 134 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100003 steps, including 0 resets, run finished after 221 ms. (steps per millisecond=452 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1]
// Phase 1: matrix 22 rows 33 cols
[2020-05-17 19:48:43] [INFO ] Computed 13 place invariants in 6 ms
[2020-05-17 19:48:43] [INFO ] [Real]Absence check using 6 positive place invariants in 24 ms returned sat
[2020-05-17 19:48:43] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2020-05-17 19:48:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 19:48:43] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2020-05-17 19:48:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-17 19:48:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2020-05-17 19:48:43] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2020-05-17 19:48:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-17 19:48:43] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2020-05-17 19:48:43] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints in 9 ms.
[2020-05-17 19:48:43] [INFO ] Added : 20 causal constraints over 4 iterations in 54 ms. Result :sat
[2020-05-17 19:48:43] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-05-17 19:48:43] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 7 ms returned sat
[2020-05-17 19:48:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 19:48:43] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2020-05-17 19:48:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-17 19:48:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-05-17 19:48:43] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 18 ms returned sat
[2020-05-17 19:48:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-17 19:48:43] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2020-05-17 19:48:43] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints in 3 ms.
[2020-05-17 19:48:43] [INFO ] Added : 19 causal constraints over 4 iterations in 51 ms. Result :sat
[2020-05-17 19:48:43] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-05-17 19:48:43] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2020-05-17 19:48:43] [INFO ] [Real]Absence check using 6 positive place invariants in 12 ms returned sat
[2020-05-17 19:48:43] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-17 19:48:44] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-17 19:48:44] [INFO ] Flatten gal took : 38 ms
FORMULA GPPP-PT-C0001N0000000010-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-17 19:48:44] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-17 19:48:44] [INFO ] Applying decomposition
[2020-05-17 19:48:44] [INFO ] Flatten gal took : 10 ms
[2020-05-17 19:48:44] [INFO ] Input system was already deterministic with 22 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/graph13751194615407062142.txt, -o, /tmp/graph13751194615407062142.bin, -w, /tmp/graph13751194615407062142.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 22 rows 33 cols
[2020-05-17 19:48:44] [INFO ] Computed 13 place invariants in 4 ms
inv : 2*GSSG + GSH = 20
inv : 24*S7P - 24*GAP - 68*E4P - 44*F6P - 11*G6P - 48*FBP - 24*DHAP - 8*_1_3_BPG + 4*ADP - 4*_3PG - 4*_2PG - 4*PEP - 7*Gluc + 11*b2 + 16*c2 = 0
inv : b1 + b2 = 3
inv : Xu5P - 2*R5P - S7P - E4P + a2 = 0
inv : NADH - _1_3_BPG - _3PG - _2PG - PEP - Pyr = 0
inv : -14*S7P + 14*GAP + 42*E4P + 28*F6P + 7*G6P + 28*FBP + 14*DHAP + 4*_1_3_BPG + 4*_3PG + 4*_2PG + 4*PEP + 4*Pyr + 28*start + 4*Lac + 7*Gluc - 7*b2 - 10*c2 = 28
inv : NADplus + _1_3_BPG + _3PG + _2PG + PEP + Pyr = 20
inv : 2*Ru5P + 6*R5P + 9*S7P - 3*GAP - 9*E4P - 6*F6P - 6*FBP - 3*DHAP + 2*b2 - 2*a2 + 3*c2 = 0
inv : NADPplus + NADPH = 20
inv : 4*ATP - 24*S7P + 24*GAP + 68*E4P + 44*F6P + 11*G6P + 48*FBP + 24*DHAP + 8*_1_3_BPG + 4*_3PG + 4*_2PG + 4*PEP + 28*start + 7*Gluc - 11*b2 - 16*c2 = 188
inv : a1 + a2 = 2
inv : 4*Pi + 14*S7P - 14*GAP - 42*E4P - 28*F6P - 7*G6P - 28*FBP - 14*DHAP - 7*Gluc + 7*b2 + 10*c2 = 0
inv : c1 + c2 = 7
Total of 13 invariants.
[2020-05-17 19:48:44] [INFO ] Computed 13 place invariants in 6 ms
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph13751194615407062142.bin, -l, -1, -v, -w, /tmp/graph13751194615407062142.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-17 19:48:44] [INFO ] Proved 33 variables to be positive in 80 ms
[2020-05-17 19:48:44] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2020-05-17 19:48:44] [INFO ] Computation of disable matrix completed :0/22 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-17 19:48:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-17 19:48:44] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2020-05-17 19:48:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-17 19:48:44] [INFO ] Decomposing Gal with order
[2020-05-17 19:48:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-17 19:48:44] [INFO ] Removed a total of 1 redundant transitions.
[2020-05-17 19:48:44] [INFO ] Flatten gal took : 62 ms
[2020-05-17 19:48:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-17 19:48:44] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 9 ms
[2020-05-17 19:48:44] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 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/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 11 LTL properties
Checking formula 0 : !((F(!((F(((X("(i0.u0.start>=1)"))||("(i1.u2.NADPH<1)"))||("(i1.u3.GSSG<1)")))U(X(G((G("(i1.u3.GSH>=2)"))||("(i0.u0.start>=1)"))))))))
Formula 0 simplified : !F!(F("(i1.u2.NADPH<1)" | "(i1.u3.GSSG<1)" | X"(i0.u0.start>=1)") U XG("(i0.u0.start>=1)" | G"(i1.u3.GSH>=2)"))
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 2 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions Transketolase2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/21/1/22
81 unique states visited
64 strongly connected components in search stack
84 transitions explored
80 items max in DFS search stack
90 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.919539,40800,1,0,33632,10576,520,110960,544,41866,53288
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F((!(F(G("(i2.u4.DHAP>=1)"))))U(G((X(F(!(X("(i2.u4.DHAP>=1)")))))U("(u5._2PG<1)"))))))
Formula 1 simplified : !F(!FG"(i2.u4.DHAP>=1)" U G(XF!X"(i2.u4.DHAP>=1)" U "(u5._2PG<1)"))
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
24 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,1.16029,46884,1,0,44026,11814,567,138518,545,52656,62364
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(((G(F("(i1.u3.GSH>=2)")))&&("(u7.Xu5P>=1)"))&&("(u7.R5P>=1)"))))
Formula 2 simplified : !F("(u7.R5P>=1)" & "(u7.Xu5P>=1)" & GF"(i1.u3.GSH>=2)")
[2020-05-17 19:48:45] [INFO ] Computing symmetric co enabling matrix : 22 transitions.
26 unique states visited
26 strongly connected components in search stack
26 transitions explored
26 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,1.19044,47648,1,0,45428,11825,599,142070,551,52859,64489
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F((X(X("((((((i0.u0.Pi>=1)&&(i0.u1.NADplus>=1))&&(i2.u4.GAP>=1))&&(i2.u8.c2>=1))&&(i0.u0.ATP>=1))&&(i0.u0.Gluc>=1))")))U(("(((u7.S7P>=1)&&(i2.u4.GAP>=1))&&(i2.u8.c1>=7))")U((G(X("((i0.u0.ATP>=1)&&(i0.u0.Gluc>=1))")))||("((u7.Xu5P>=1)&&(i2.u4.E4P>=1))"))))))
Formula 3 simplified : !F(XX"((((((i0.u0.Pi>=1)&&(i0.u1.NADplus>=1))&&(i2.u4.GAP>=1))&&(i2.u8.c2>=1))&&(i0.u0.ATP>=1))&&(i0.u0.Gluc>=1))" U ("(((u7.S7P>=1)&&(i2.u4.GAP>=1))&&(i2.u8.c1>=7))" U ("((u7.Xu5P>=1)&&(i2.u4.E4P>=1))" | GX"((i0.u0.ATP>=1)&&(i0.u0.Gluc>=1))")))
30 unique states visited
29 strongly connected components in search stack
32 transitions explored
30 items max in DFS search stack
7 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,1.25795,49464,1,0,48739,11869,651,146999,554,53221,69890
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F("(i1.u3.GSH>=2)")))
Formula 4 simplified : !F"(i1.u3.GSH>=2)"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,1.26599,49728,1,0,49129,11910,663,148227,554,53447,70581
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(F(G(X((!(X(F("((i0.u1.NADH>=1)&&(i0.u0.Pyr>=1))"))))||(((!(G("((i0.u1.NADH>=1)&&(i0.u0.Pyr>=1))")))&&("((i0.u1.NADH<1)||(i0.u0.Pyr<1))"))&&("((u5._1_3_BPG<1)||(i0.u0.ADP<1))"))))))))
Formula 5 simplified : !GFGX(!XF"((i0.u1.NADH>=1)&&(i0.u0.Pyr>=1))" | ("((i0.u1.NADH<1)||(i0.u0.Pyr<1))" & "((u5._1_3_BPG<1)||(i0.u0.ADP<1))" & !G"((i0.u1.NADH>=1)&&(i0.u0.Pyr>=1))"))
405 unique states visited
2 strongly connected components in search stack
412 transitions explored
404 items max in DFS search stack
81 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,2.07656,67648,1,0,77692,13211,746,226534,555,61764,122611
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(X("((u5._1_3_BPG>=1)&&(i0.u0.ADP>=1))"))))
Formula 6 simplified : !GX"((u5._1_3_BPG>=1)&&(i0.u0.ADP>=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,2.07906,67648,1,0,77716,13211,764,226562,555,61764,122714
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((((((G("(i2.u4.DHAP>=1)"))&&("(u7.Xu5P>=1)"))&&("(u7.R5P>=1)"))U(X("(i1.u3.GSH>=2)")))&&(F(X((F("(u5._2PG>=1)"))U("(u5._2PG<1)"))))))
Formula 7 simplified : !((("(u7.R5P>=1)" & "(u7.Xu5P>=1)" & G"(i2.u4.DHAP>=1)") U X"(i1.u3.GSH>=2)") & FX(F"(u5._2PG>=1)" U "(u5._2PG<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,2.08445,67648,1,0,77716,13211,771,226562,555,61764,122730
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!(G(F("(((i1.u2.NADPH<1)||(i1.u3.GSSG<1))&&(((i1.u2.NADPplus<2)||(u6.G6P<1))||(u6.b2<1)))")))))
Formula 8 simplified : GF"(((i1.u2.NADPH<1)||(i1.u3.GSSG<1))&&(((i1.u2.NADPplus<2)||(u6.G6P<1))||(u6.b2<1)))"
[2020-05-17 19:48:47] [INFO ] Computation of Finished co-enabling matrix. took 1585 ms. Total solver calls (SAT/UNSAT): 165(150/15)
[2020-05-17 19:48:47] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
173 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,3.82312,104044,1,0,138868,15384,806,391478,556,73626,169227
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((("((u7.Xu5P>=1)&&(u7.R5P>=1))")U(F(G("(i2.u4.FBP>=1)")))))
Formula 9 simplified : !("((u7.Xu5P>=1)&&(u7.R5P>=1))" U FG"(i2.u4.FBP>=1)")
[2020-05-17 19:48:49] [INFO ] Computation of Completed DNA matrix. took 1800 ms. Total solver calls (SAT/UNSAT): 49(0/49)
[2020-05-17 19:48:49] [INFO ] Built C files in 4956ms 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]
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
157 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,5.38293,133876,1,0,201043,15693,831,480941,556,76611,194040
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X((G(((G("(((i1.u2.NADPplus>=2)&&(u6.G6P>=1))&&(u6.b2>=1))"))||("(u6.G6P<1)"))||("(u6.b1<3)")))||(F(X(F(X("((u6.G6P>=1)&&(u6.b1>=3))"))))))))
Formula 10 simplified : !X(G("(u6.G6P<1)" | "(u6.b1<3)" | G"(((i1.u2.NADPplus>=2)&&(u6.G6P>=1))&&(u6.b2>=1))") | FXFX"((u6.G6P>=1)&&(u6.b1>=3))")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,5.40708,134664,1,0,202231,15696,892,481903,568,76654,196047
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Compilation finished in 854 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 48 ms.
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1589744930957

--------------------
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 -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 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 -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="GPPP-PT-C0001N0000000010"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is GPPP-PT-C0001N0000000010, 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 r081-smll-158922977900426"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0001N0000000010.tgz
mv GPPP-PT-C0001N0000000010 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;