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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.4K Apr 4 20:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 4 20:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 4 09:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.5K Apr 8 14:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 8 14:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 3 21:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 3 21:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Apr 3 13:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 3 13:48 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-C0001N0000000001-00
FORMULA_NAME GPPP-PT-C0001N0000000001-01
FORMULA_NAME GPPP-PT-C0001N0000000001-02
FORMULA_NAME GPPP-PT-C0001N0000000001-03
FORMULA_NAME GPPP-PT-C0001N0000000001-04
FORMULA_NAME GPPP-PT-C0001N0000000001-05
FORMULA_NAME GPPP-PT-C0001N0000000001-06
FORMULA_NAME GPPP-PT-C0001N0000000001-07
FORMULA_NAME GPPP-PT-C0001N0000000001-08
FORMULA_NAME GPPP-PT-C0001N0000000001-09
FORMULA_NAME GPPP-PT-C0001N0000000001-10
FORMULA_NAME GPPP-PT-C0001N0000000001-11
FORMULA_NAME GPPP-PT-C0001N0000000001-12
FORMULA_NAME GPPP-PT-C0001N0000000001-13
FORMULA_NAME GPPP-PT-C0001N0000000001-14
FORMULA_NAME GPPP-PT-C0001N0000000001-15

=== Now, execution of the tool begins

BK_START 1589744708874

[2020-05-17 19:45:11] [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:45:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-17 19:45:11] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2020-05-17 19:45:11] [INFO ] Transformed 33 places.
[2020-05-17 19:45:11] [INFO ] Transformed 22 transitions.
[2020-05-17 19:45:11] [INFO ] Parsed PT model containing 33 places and 22 transitions in 146 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 135 steps, including 0 resets, run visited all 23 properties in 8 ms. (steps per millisecond=16 )
[2020-05-17 19:45:12] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-17 19:45:12] [INFO ] Flatten gal took : 55 ms
FORMULA GPPP-PT-C0001N0000000001-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000001-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-17 19:45:12] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-17 19:45:12] [INFO ] Applying decomposition
[2020-05-17 19:45:12] [INFO ] Flatten gal took : 13 ms
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/graph11282233462320889166.txt, -o, /tmp/graph11282233462320889166.bin, -w, /tmp/graph11282233462320889166.weights], workingDir=null]
[2020-05-17 19:45:12] [INFO ] Input system was already deterministic with 22 transitions.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph11282233462320889166.bin, -l, -1, -v, -w, /tmp/graph11282233462320889166.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-17 19:45:12] [INFO ] Decomposing Gal with order
[2020-05-17 19:45:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-17 19:45:12] [INFO ] Removed a total of 2 redundant transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 22 rows 33 cols
[2020-05-17 19:45:12] [INFO ] Computed 13 place invariants in 10 ms
inv : 2*GSSG + GSH = 2
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 = 2
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 = 2
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 = 44
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:45:12] [INFO ] Computed 13 place invariants in 15 ms
[2020-05-17 19:45:12] [INFO ] Flatten gal took : 98 ms
[2020-05-17 19:45:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2020-05-17 19:45:12] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2020-05-17 19:45:12] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 4 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 14 LTL properties
Checking formula 0 : !((G(F("(((((i1.u2.NADPH>=1)&&(i1.u3.GSSG>=1))&&(u8.S7P>=1))&&(i2.u4.GAP>=1))&&(i2.u9.c1>=7))"))))
Formula 0 simplified : !GF"(((((i1.u2.NADPH>=1)&&(i1.u3.GSSG>=1))&&(u8.S7P>=1))&&(i2.u4.GAP>=1))&&(i2.u9.c1>=7))"
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 2 ordering constraints for composite.
[2020-05-17 19:45:12] [INFO ] Proved 33 variables to be positive in 175 ms
[2020-05-17 19:45:12] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2020-05-17 19:45:12] [INFO ] Computation of disable matrix completed :0/22 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-17 19:45:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-17 19:45:12] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2020-05-17 19:45:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
12 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.147844,18692,1,0,4852,1778,521,7004,438,4416,10428
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F((F(G("(i2.u4.DHAP>=1)")))||((G("((i0.u0.ADP>=1)&&(u5.PEP>=1))"))U("(i0.u6.start>=1)"))))))
Formula 1 simplified : !GF(FG"(i2.u4.DHAP>=1)" | (G"((i0.u0.ADP>=1)&&(u5.PEP>=1))" U "(i0.u6.start>=1)"))
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.196516,20468,1,0,6903,1963,566,10809,439,5558,13467
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(F(((G(((F("((i0.u0._1_3_BPG>=1)&&(i0.u0.ADP>=1))"))||("(i1.u3.GSH>=2)"))U("(i1.u3.GSH>=2)")))&&("(i0.u0._1_3_BPG>=1)"))&&("(i0.u0.ADP>=1)")))))
Formula 2 simplified : !XF("(i0.u0.ADP>=1)" & "(i0.u0._1_3_BPG>=1)" & G(("(i1.u3.GSH>=2)" | F"((i0.u0._1_3_BPG>=1)&&(i0.u0.ADP>=1))") U "(i1.u3.GSH>=2)"))
26 unique states visited
26 strongly connected components in search stack
26 transitions explored
26 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.233038,21744,1,0,7933,1974,636,12025,452,5645,16536
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(F(G(X(G(F((!(X(F(G("((i0.u1.NADH>=1)&&(i0.u1.Pyr>=1))")))))&&(X("((((i0.u6.Pi>=1)&&(i0.u1.NADplus>=1))&&(i2.u4.GAP>=1))&&(i2.u9.c2>=1))"))))))))))
Formula 3 simplified : FGXGF(!XFG"((i0.u1.NADH>=1)&&(i0.u1.Pyr>=1))" & X"((((i0.u6.Pi>=1)&&(i0.u1.NADplus>=1))&&(i2.u4.GAP>=1))&&(i2.u9.c2>=1))")
10 unique states visited
10 strongly connected components in search stack
11 transitions explored
10 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.274974,23160,1,0,10046,2062,706,15889,461,6122,21453
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(((X("(((i1.u2.NADPplus>=2)&&(u7.G6P>=1))&&(u7.b2>=1))"))U("(i1.u3.GSH>=2)"))&&(!(F("((i0.u0.ATP>=7)&&(i0.u1.Lac>=7))"))))))
Formula 4 simplified : !X((X"(((i1.u2.NADPplus>=2)&&(u7.G6P>=1))&&(u7.b2>=1))" U "(i1.u3.GSH>=2)") & !F"((i0.u0.ATP>=7)&&(i0.u1.Lac>=7))")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.280792,23360,1,0,10096,2062,766,15940,462,6124,21670
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(X((F((G(X(G("(u5._2PG>=1)"))))U("(u5._2PG>=1)")))U(X("(i1.u3.GSH>=2)"))))))
Formula 5 simplified : !FX(F(GXG"(u5._2PG>=1)" U "(u5._2PG>=1)") U X"(i1.u3.GSH>=2)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.283864,23360,1,0,10185,2062,779,16011,462,6124,22040
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(X(F(((X(G(X("(((u8.S7P>=1)&&(i2.u4.GAP>=1))&&(i2.u9.c1>=7))"))))&&("(i0.u0._1_3_BPG>=1)"))&&("(i0.u0.ADP>=1)"))))))
Formula 6 simplified : !FXF("(i0.u0.ADP>=1)" & "(i0.u0._1_3_BPG>=1)" & XGX"(((u8.S7P>=1)&&(i2.u4.GAP>=1))&&(i2.u9.c1>=7))")
26 unique states visited
26 strongly connected components in search stack
26 transitions explored
26 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.292819,23580,1,0,10365,2062,779,16206,462,6124,22640
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(("(((u8.S7P>=1)&&(i2.u4.GAP>=1))&&(i2.u9.c1>=7))")U(X("((u8.Ru5P>=1)&&(u8.a1>=2))")))))
Formula 7 simplified : "(((u8.S7P>=1)&&(i2.u4.GAP>=1))&&(i2.u9.c1>=7))" U X"((u8.Ru5P>=1)&&(u8.a1>=2))"
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,0.294608,23580,1,0,10365,2062,806,16206,465,6124,22652
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA GPPP-PT-C0001N0000000001-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((!((G("(i1.u3.GSH>=2)"))U(X("(u5._2PG>=1)"))))&&(!(X("(u5._2PG>=1)")))))
Formula 8 simplified : !(!(G"(i1.u3.GSH>=2)" U X"(u5._2PG>=1)") & !X"(u5._2PG>=1)")
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,0.296263,23580,1,0,10365,2062,808,16206,465,6124,22664
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA GPPP-PT-C0001N0000000001-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(!((!(X(("((i1.u2.NADPH>=1)&&(i1.u3.GSSG>=1))")U("((i0.u0.ATP>=7)&&(i0.u1.Lac>=7))"))))U(G("((i0.u0.ATP<7)||(i0.u1.Lac<7))"))))))
Formula 9 simplified : !X!(!X("((i1.u2.NADPH>=1)&&(i1.u3.GSSG>=1))" U "((i0.u0.ATP>=7)&&(i0.u1.Lac>=7))") U G"((i0.u0.ATP<7)||(i0.u1.Lac<7))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,0.37378,25120,1,0,13730,2082,837,20175,467,6196,31578
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(F(!(X((G(F(X(("((i0.u0.ATP>=7)&&(i0.u1.Lac>=7))")U("((i0.u0.ATP>=7)&&(i0.u1.Lac>=7))")))))&&(F("(((i1.u2.NADPH>=1)&&(i1.u3.GSSG>=1))||(((i1.u2.NADPplus>=2)&&(u7.G6P>=1))&&(u7.b2>=1)))"))))))))
Formula 10 simplified : !XF!X(GFX"((i0.u0.ATP>=7)&&(i0.u1.Lac>=7))" & F"(((i1.u2.NADPH>=1)&&(i1.u3.GSSG>=1))||(((i1.u2.NADPplus>=2)&&(u7.G6P>=1))&&(u7.b2>=1)))")
24 unique states visited
9 strongly connected components in search stack
28 transitions explored
24 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.42566,25876,1,0,15472,2094,881,22257,467,6334,36549
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(X(G(((G(X(F("(i2.u4.FBP>=1)"))))U(F("((i0.u0.ATP>=1)&&(u7.F6P>=1))")))||(G("(i2.u4.FBP>=1)")))))))
Formula 11 simplified : !FXG((GXF"(i2.u4.FBP>=1)" U F"((i0.u0.ATP>=1)&&(u7.F6P>=1))") | G"(i2.u4.FBP>=1)")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.463067,26876,1,0,17112,2114,919,24523,467,6609,39896
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((F("(((u8.S7P>=1)&&(i2.u4.GAP>=1))&&(i2.u9.c1>=7))")))
Formula 12 simplified : !F"(((u8.S7P>=1)&&(i2.u4.GAP>=1))&&(i2.u9.c1>=7))"
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,0.474275,27140,1,0,17687,2117,931,24997,467,6615,41271
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((G("((u7.G6P<1)||(u7.b1<3))"))&&((X("((i0.u0.ATP>=1)&&(u7.F6P>=1))"))U(X("((u8.Ru5P>=1)&&(u8.a1>=2))")))))
Formula 13 simplified : !(G"((u7.G6P<1)||(u7.b1<3))" & (X"((i0.u0.ATP>=1)&&(u7.F6P>=1))" U X"((u8.Ru5P>=1)&&(u8.a1>=2))"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.479972,27668,1,0,17691,2117,964,25000,471,6615,41327
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000001-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-17 19:45:13] [WARNING] Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
[2020-05-17 19:45:13] [WARNING] Script execution failed on command (declare-fun s1 () (Array Int Int)) with error (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
[2020-05-17 19:45:13] [WARNING] Script execution failed on command (assert (and (>= (select s0 16) 1) (= (store (store (store s0 12 (+ (select s0 12) 1)) 16 (- (select s0 16) 1)) 17 (+ (select s0 17) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (>= (select s0 16) 1) (= (store (store (store s0 12 (+ (select s0 12) 1)) 16 (- (select s0 16) 1)) 17 (+ (select s0 17) 1)) s1))")
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-17 19:45:13] [INFO ] Built C files in 851ms 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]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1589744714499

--------------------
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-C0001N0000000001"
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-C0001N0000000001, 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-158922977900418"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0001N0000000001.tgz
mv GPPP-PT-C0001N0000000001 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 ;