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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.1K Apr 4 20:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 4 20:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 4 09:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 4 09:13 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:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 8 14:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 3 21:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 3 21:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 3 13:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 3 13:50 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-C0100N0000000010-00
FORMULA_NAME GPPP-PT-C0100N0000000010-01
FORMULA_NAME GPPP-PT-C0100N0000000010-02
FORMULA_NAME GPPP-PT-C0100N0000000010-03
FORMULA_NAME GPPP-PT-C0100N0000000010-04
FORMULA_NAME GPPP-PT-C0100N0000000010-05
FORMULA_NAME GPPP-PT-C0100N0000000010-06
FORMULA_NAME GPPP-PT-C0100N0000000010-07
FORMULA_NAME GPPP-PT-C0100N0000000010-08
FORMULA_NAME GPPP-PT-C0100N0000000010-09
FORMULA_NAME GPPP-PT-C0100N0000000010-10
FORMULA_NAME GPPP-PT-C0100N0000000010-11
FORMULA_NAME GPPP-PT-C0100N0000000010-12
FORMULA_NAME GPPP-PT-C0100N0000000010-13
FORMULA_NAME GPPP-PT-C0100N0000000010-14
FORMULA_NAME GPPP-PT-C0100N0000000010-15

=== Now, execution of the tool begins

BK_START 1589773680828

[2020-05-18 03:48:03] [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-18 03:48:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 03:48:03] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2020-05-18 03:48:03] [INFO ] Transformed 33 places.
[2020-05-18 03:48:03] [INFO ] Transformed 22 transitions.
[2020-05-18 03:48:03] [INFO ] Parsed PT model containing 33 places and 22 transitions in 135 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 230 resets, run finished after 343 ms. (steps per millisecond=291 ) properties seen :[1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0]
// Phase 1: matrix 22 rows 33 cols
[2020-05-18 03:48:04] [INFO ] Computed 12 place invariants in 9 ms
[2020-05-18 03:48:04] [INFO ] [Real]Absence check using 6 positive place invariants in 15 ms returned unsat
[2020-05-18 03:48:04] [INFO ] [Real]Absence check using 6 positive place invariants in 12 ms returned sat
[2020-05-18 03:48:04] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 7 ms returned sat
[2020-05-18 03:48:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 03:48:04] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2020-05-18 03:48:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 03:48:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 14 ms returned sat
[2020-05-18 03:48:04] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-18 03:48:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 03:48:05] [INFO ] [Nat]Absence check using state equation in 686 ms returned unsat
[2020-05-18 03:48:05] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2020-05-18 03:48:05] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 6 ms returned sat
[2020-05-18 03:48:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 03:48:05] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2020-05-18 03:48:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 03:48:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 10 ms returned sat
[2020-05-18 03:48:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 03:48:11] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 6026 ms returned unknown
[2020-05-18 03:48:11] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-05-18 03:48:11] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2020-05-18 03:48:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 03:48:11] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2020-05-18 03:48:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 03:48:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-05-18 03:48:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 03:48:20] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 9038 ms returned unknown
[2020-05-18 03:48:20] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2020-05-18 03:48:20] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-18 03:48:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 03:48:20] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2020-05-18 03:48:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 03:48:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2020-05-18 03:48:20] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2020-05-18 03:48:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 03:48:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 03:48:30] [INFO ] [Nat]Absence check using state equation in 9854 ms returned unknown
[2020-05-18 03:48:30] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2020-05-18 03:48:30] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2020-05-18 03:48:30] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
[2020-05-18 03:48:30] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-05-18 03:48:30] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2020-05-18 03:48:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 03:48:30] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2020-05-18 03:48:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 03:48:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2020-05-18 03:48:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 03:48:37] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 6432 ms returned unknown
[2020-05-18 03:48:37] [INFO ] [Real]Absence check using 6 positive place invariants in 17 ms returned sat
[2020-05-18 03:48:37] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2020-05-18 03:48:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 03:48:37] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2020-05-18 03:48:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 03:48:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2020-05-18 03:48:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 03:48:43] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 6010 ms returned unknown
[2020-05-18 03:48:43] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2020-05-18 03:48:43] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 7 ms returned sat
[2020-05-18 03:48:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 03:48:43] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2020-05-18 03:48:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 03:48:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-05-18 03:48:46] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 03:48:49] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 6007 ms returned unknown
[2020-05-18 03:48:49] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-05-18 03:48:49] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2020-05-18 03:48:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 03:48:49] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2020-05-18 03:48:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 03:48:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-05-18 03:48:49] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 7 ms returned sat
[2020-05-18 03:48:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 03:48:55] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 03:48:58] [INFO ] [Nat]Absence check using state equation in 9376 ms returned unknown
[2020-05-18 03:48:58] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned unsat
[2020-05-18 03:48:58] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 9 simplifications.
[2020-05-18 03:48:59] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-18 03:48:59] [INFO ] Flatten gal took : 36 ms
FORMULA GPPP-PT-C0100N0000000010-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000010-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000010-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000010-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000010-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000010-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-18 03:48:59] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-18 03:48:59] [INFO ] Applying decomposition
[2020-05-18 03:48:59] [INFO ] Flatten gal took : 17 ms
[2020-05-18 03:48:59] [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/graph9123482497681210510.txt, -o, /tmp/graph9123482497681210510.bin, -w, /tmp/graph9123482497681210510.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/graph9123482497681210510.bin, -l, -1, -v, -w, /tmp/graph9123482497681210510.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 22 rows 33 cols
[2020-05-18 03:48:59] [INFO ] Computed 12 place invariants in 3 ms
inv : 2*GSSG + GSH = 20
inv : 28*Ru5P + 21*Xu5P + 1428*R5P + 1435*S7P + 14*GAP + 21*E4P + 28*F6P + 28*G6P + 28*FBP + 14*DHAP + 16*_1_3_BPG + 16*_3PG + 16*_2PG + 16*PEP + 16*Pyr + 11200*start + 16*Lac + 28*Gluc - 7*a2 + 2*c2 = 11200
inv : -Ru5P - Xu5P - R5P - S7P - GAP - E4P - F6P - G6P - 2*FBP - DHAP - _1_3_BPG + ADP + Pyr + 700*start + Lac = 700
inv : NADH - _1_3_BPG - _3PG - _2PG - PEP - Pyr = 0
inv : -2*Ru5P + 1051*Xu5P - 210602*R5P - 209851*S7P + 300*GAP - 151*E4P + 600*F6P + 600*FBP + 300*DHAP + 2*b1 + 1053*a2 - 300*c2 = 600
inv : NADplus + _1_3_BPG + _3PG + _2PG + PEP + Pyr = 20
inv : Pi + _1_3_BPG + _3PG + _2PG + PEP + Pyr + 700*start + Lac = 700
inv : NADPplus + NADPH = 20
inv : a1 + a2 = 200
inv : 2*Ru5P - 1051*Xu5P + 210602*R5P + 209851*S7P - 300*GAP + 151*E4P - 600*F6P - 600*FBP - 300*DHAP + 2*b2 - 1053*a2 + 300*c2 = 0
inv : c1 + c2 = 700
inv : ATP + Ru5P + Xu5P + R5P + S7P + GAP + E4P + F6P + G6P + 2*FBP + DHAP + _1_3_BPG - Pyr - Lac = 40
Total of 12 invariants.
[2020-05-18 03:48:59] [INFO ] Computed 12 place invariants in 4 ms
[2020-05-18 03:48:59] [INFO ] Decomposing Gal with order
[2020-05-18 03:48:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-18 03:48:59] [INFO ] Removed a total of 5 redundant transitions.
[2020-05-18 03:48:59] [INFO ] Flatten gal took : 61 ms
[2020-05-18 03:48:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-18 03:48:59] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 3 ms
[2020-05-18 03:48:59] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 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]

[2020-05-18 03:48:59] [INFO ] Proved 33 variables to be positive in 154 ms
[2020-05-18 03:48:59] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2020-05-18 03:48:59] [INFO ] Computation of disable matrix completed :0/22 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 03:48:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 03:48:59] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2020-05-18 03:48:59] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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(G((G((X(G("(gi0.gu5.F6P<=gi0.gu5.Gluc)")))||("(gi0.gu0.Pi<=gi0.gu5.Gluc)")))||("(gi0.gu5.F6P<=gi0.gu5.Gluc)")))))
Formula 0 simplified : !FG("(gi0.gu5.F6P<=gi0.gu5.Gluc)" | G("(gi0.gu0.Pi<=gi0.gu5.Gluc)" | XG"(gi0.gu5.F6P<=gi0.gu5.Gluc)"))
[2020-05-18 03:49:00] [INFO ] Computing symmetric co enabling matrix : 22 transitions.
[2020-05-18 03:49:01] [INFO ] Computation of Finished co-enabling matrix. took 859 ms. Total solver calls (SAT/UNSAT): 192(159/33)
[2020-05-18 03:49:01] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2020-05-18 03:49:02] [INFO ] Computation of Completed DNA matrix. took 1428 ms. Total solver calls (SAT/UNSAT): 43(0/43)
[2020-05-18 03:49:02] [INFO ] Built C files in 3721ms 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 976 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 55 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>([](( [](( X([]((LTLAP0==true)))) || ( (LTLAP1==true)) )) || ( (LTLAP0==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([]((LTLAP0==true)))) || ( (LTLAP1==true)) )) || ( (LTLAP0==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([]((LTLAP0==true)))) || ( (LTLAP1==true)) )) || ( (LTLAP0==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)
Detected timeout of ITS tools.
[2020-05-18 04:09:17] [INFO ] Flatten gal took : 5 ms
[2020-05-18 04:09:17] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 1 ms
[2020-05-18 04:09:17] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 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(G((G((X(G("(F6P<=Gluc)")))||("(Pi<=Gluc)")))||("(F6P<=Gluc)")))))
Formula 0 simplified : !FG("(F6P<=Gluc)" | G("(Pi<=Gluc)" | XG"(F6P<=Gluc)"))
Detected timeout of ITS tools.
[2020-05-18 04:29:37] [INFO ] Flatten gal took : 685 ms
[2020-05-18 04:29:37] [INFO ] Input system was already deterministic with 22 transitions.
[2020-05-18 04:29:38] [INFO ] Transformed 33 places.
[2020-05-18 04:29:38] [INFO ] Transformed 22 transitions.
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
[2020-05-18 04:29:38] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 6 ms
[2020-05-18 04:29:38] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 8 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, --load-order, /home/mcc/execution/model.ord, --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 --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 10 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G((G((X(G("(F6P<=Gluc)")))||("(Pi<=Gluc)")))||("(F6P<=Gluc)")))))
Formula 0 simplified : !FG("(F6P<=Gluc)" | G("(Pi<=Gluc)" | XG"(F6P<=Gluc)"))
Reverse transition relation is NOT exact ! Due to transitions t8, t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :1/19/2/22
Computing Next relation with stutter on 4 deadlock states
278 unique states visited
0 strongly connected components in search stack
278 transitions explored
278 items max in DFS search stack
27997 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,279.991,2433332,1,0,627,1.38572e+07,22,1277,1210,1.51424e+07,3622
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPPP-PT-C0100N0000000010-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G(F("(Xu5P>start)"))))
Formula 1 simplified : !GF"(Xu5P>start)"
Computing Next relation with stutter on 4 deadlock states
280 unique states visited
280 strongly connected components in search stack
281 transitions explored
280 items max in DFS search stack
991 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,289.897,2433332,1,0,1111,1.38572e+07,37,1523,1494,1.51424e+07,5747
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA GPPP-PT-C0100N0000000010-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((G(F((!(F(X(!(X(F("(NADPH>Lac)")))))))||(!(F("(ATP>=2)")))))))
Formula 2 simplified : !GF(!FX!XF"(NADPH>Lac)" | !F"(ATP>=2)")
Computing Next relation with stutter on 4 deadlock states
281 unique states visited
281 strongly connected components in search stack
282 transitions explored
281 items max in DFS search stack
2561 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,315.51,2433704,1,0,1827,1.38572e+07,56,2117,1518,1.51424e+07,7350
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA GPPP-PT-C0100N0000000010-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((F((!(X("(_3PG<=_2PG)")))&&("(_3PG>_2PG)"))))
Formula 3 simplified : !F("(_3PG>_2PG)" & !X"(_3PG<=_2PG)")
Computing Next relation with stutter on 4 deadlock states
please improve composition of basic homs
371 unique states visited
371 strongly connected components in search stack
371 transitions explored
371 items max in DFS search stack
12211 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,437.62,2703996,1,0,2092,1.489e+07,25,2304,1127,1.80205e+07,5074
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA GPPP-PT-C0100N0000000010-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((!(("(GSH>=3)")U(F(X("(GAP<=G6P)"))))))
Formula 4 simplified : "(GSH>=3)" U FX"(GAP<=G6P)"
Computing Next relation with stutter on 4 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
873 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,446.362,2703996,1,0,2092,1.489e+07,39,2604,1411,1.80205e+07,5928
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA GPPP-PT-C0100N0000000010-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(((!(G("(GAP<=c2)")))||((F("(Gluc>a2)"))&&(G("(b2<=GAP)")))))
Formula 5 simplified : !(!G"(GAP<=c2)" | (F"(Gluc>a2)" & G"(b2<=GAP)"))
Computing Next relation with stutter on 4 deadlock states
83 unique states visited
0 strongly connected components in search stack
83 transitions explored
44 items max in DFS search stack
1557 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,461.934,2827672,1,0,39580,1.57604e+07,72,26242,1437,1.88746e+07,77018
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA GPPP-PT-C0100N0000000010-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((!(F(X(G((G(X("(Lac<=R5P)")))U((F("(NADH>=1)"))&&("(GSH>ADP)"))))))))
Formula 6 simplified : FXG(GX"(Lac<=R5P)" U ("(GSH>ADP)" & F"(NADH>=1)"))
Computing Next relation with stutter on 4 deadlock states
1106 unique states visited
0 strongly connected components in search stack
1384 transitions explored
281 items max in DFS search stack
3916 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,501.087,2971876,1,0,39858,1.58471e+07,24,26522,1219,1.95584e+07,3174
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA GPPP-PT-C0100N0000000010-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(((X(X(X((!(F(G("(GSSG>=3)"))))&&(!(F("(GSSG>=3)")))))))U(G("(E4P<=Xu5P)"))))
Formula 7 simplified : !(XXX(!FG"(GSSG>=3)" & !F"(GSSG>=3)") U G"(E4P<=Xu5P)")
Computing Next relation with stutter on 4 deadlock states
233 unique states visited
233 strongly connected components in search stack
233 transitions explored
233 items max in DFS search stack
27859 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,779.699,3536712,1,0,39858,1.97189e+07,20,26522,1130,2.12403e+07,6087
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA GPPP-PT-C0100N0000000010-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((X(((G((G("(_2PG<=a2)"))U(X("(a1>=2)"))))||(F("(a1>=2)")))||("(_2PG>a2)"))))
Formula 8 simplified : !X("(_2PG>a2)" | G(G"(_2PG<=a2)" U X"(a1>=2)") | F"(a1>=2)")
Computing Next relation with stutter on 4 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
188 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.581,3579404,1,0,39858,1.99832e+07,28,26522,1384,2.14934e+07,6096
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA GPPP-PT-C0100N0000000010-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((!(X(F(X("(_1_3_BPG<=Pi)"))))))
Formula 9 simplified : XFX"(_1_3_BPG<=Pi)"
Computing Next relation with stutter on 4 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
3827 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,819.848,3604068,1,0,39858,1.99976e+07,18,26522,1125,2.15115e+07,835
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA GPPP-PT-C0100N0000000010-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

BK_STOP 1589777002282

--------------------
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="GPPP-PT-C0100N0000000010"
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 GPPP-PT-C0100N0000000010, 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 r081-smll-158922978000489"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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