Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r066-tajo-158922814100322.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 Dekker-PT-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814100322
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 4 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rw-r--r-- 1 mcc users 247K Apr 27 14:36 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 Dekker-PT-020-00
FORMULA_NAME Dekker-PT-020-01
FORMULA_NAME Dekker-PT-020-02
FORMULA_NAME Dekker-PT-020-03
FORMULA_NAME Dekker-PT-020-04
FORMULA_NAME Dekker-PT-020-05
FORMULA_NAME Dekker-PT-020-06
FORMULA_NAME Dekker-PT-020-07
FORMULA_NAME Dekker-PT-020-08
FORMULA_NAME Dekker-PT-020-09
FORMULA_NAME Dekker-PT-020-10
FORMULA_NAME Dekker-PT-020-11
FORMULA_NAME Dekker-PT-020-12
FORMULA_NAME Dekker-PT-020-13
FORMULA_NAME Dekker-PT-020-14
FORMULA_NAME Dekker-PT-020-15

=== Now, execution of the tool begins

BK_START 1590110912217

[2020-05-22 01:28:34] [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-22 01:28:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 01:28:34] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2020-05-22 01:28:34] [INFO ] Transformed 100 places.
[2020-05-22 01:28:34] [INFO ] Transformed 440 transitions.
[2020-05-22 01:28:34] [INFO ] Found NUPN structural information;
[2020-05-22 01:28:34] [INFO ] Parsed PT model containing 100 places and 440 transitions in 202 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 535 ms. (steps per millisecond=186 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1]
[2020-05-22 01:28:35] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 100 cols
[2020-05-22 01:28:35] [INFO ] Computed 60 place invariants in 6 ms
[2020-05-22 01:28:35] [INFO ] [Real]Absence check using 40 positive place invariants in 52 ms returned sat
[2020-05-22 01:28:35] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 5 ms returned sat
[2020-05-22 01:28:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:28:35] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2020-05-22 01:28:35] [INFO ] State equation strengthened by 20 read => feed constraints.
[2020-05-22 01:28:35] [INFO ] [Real]Added 20 Read/Feed constraints in 16 ms returned sat
[2020-05-22 01:28:36] [INFO ] Deduced a trap composed of 5 places in 55 ms
[2020-05-22 01:28:36] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2020-05-22 01:28:36] [INFO ] Deduced a trap composed of 4 places in 40 ms
[2020-05-22 01:28:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 220 ms
[2020-05-22 01:28:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:28:36] [INFO ] [Nat]Absence check using 40 positive place invariants in 82 ms returned sat
[2020-05-22 01:28:36] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 10 ms returned sat
[2020-05-22 01:28:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:28:36] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2020-05-22 01:28:36] [INFO ] [Nat]Added 20 Read/Feed constraints in 7 ms returned sat
[2020-05-22 01:28:36] [INFO ] Deduced a trap composed of 5 places in 36 ms
[2020-05-22 01:28:36] [INFO ] Deduced a trap composed of 4 places in 15 ms
[2020-05-22 01:28:36] [INFO ] Deduced a trap composed of 4 places in 22 ms
[2020-05-22 01:28:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 110 ms
[2020-05-22 01:28:36] [INFO ] Computed and/alt/rep : 420/1200/60 causal constraints in 16 ms.
[2020-05-22 01:28:36] [INFO ] Added : 21 causal constraints over 5 iterations in 90 ms. Result :sat
[2020-05-22 01:28:36] [INFO ] [Real]Absence check using 40 positive place invariants in 250 ms returned sat
[2020-05-22 01:28:37] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 131 ms returned sat
[2020-05-22 01:28:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:28:37] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2020-05-22 01:28:37] [INFO ] [Real]Added 20 Read/Feed constraints in 31 ms returned sat
[2020-05-22 01:28:37] [INFO ] Computed and/alt/rep : 420/1200/60 causal constraints in 30 ms.
[2020-05-22 01:28:37] [INFO ] Added : 0 causal constraints over 0 iterations in 61 ms. Result :sat
[2020-05-22 01:28:37] [INFO ] [Real]Absence check using 40 positive place invariants in 114 ms returned sat
[2020-05-22 01:28:37] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 5 ms returned sat
[2020-05-22 01:28:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:28:37] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2020-05-22 01:28:37] [INFO ] [Real]Added 20 Read/Feed constraints in 5 ms returned sat
[2020-05-22 01:28:37] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2020-05-22 01:28:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2020-05-22 01:28:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:28:37] [INFO ] [Nat]Absence check using 40 positive place invariants in 38 ms returned sat
[2020-05-22 01:28:37] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 7 ms returned sat
[2020-05-22 01:28:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:28:37] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2020-05-22 01:28:37] [INFO ] [Nat]Added 20 Read/Feed constraints in 5 ms returned sat
[2020-05-22 01:28:37] [INFO ] Deduced a trap composed of 4 places in 27 ms
[2020-05-22 01:28:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2020-05-22 01:28:37] [INFO ] Computed and/alt/rep : 420/1200/60 causal constraints in 14 ms.
[2020-05-22 01:28:37] [INFO ] Added : 21 causal constraints over 5 iterations in 101 ms. Result :sat
[2020-05-22 01:28:38] [INFO ] [Real]Absence check using 40 positive place invariants in 35 ms returned sat
[2020-05-22 01:28:38] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 6 ms returned sat
[2020-05-22 01:28:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:28:38] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2020-05-22 01:28:38] [INFO ] [Real]Added 20 Read/Feed constraints in 4 ms returned sat
[2020-05-22 01:28:38] [INFO ] Computed and/alt/rep : 420/1200/60 causal constraints in 26 ms.
[2020-05-22 01:28:38] [INFO ] Added : 0 causal constraints over 0 iterations in 37 ms. Result :sat
[2020-05-22 01:28:38] [INFO ] [Real]Absence check using 40 positive place invariants in 35 ms returned sat
[2020-05-22 01:28:38] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 7 ms returned sat
[2020-05-22 01:28:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:28:38] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2020-05-22 01:28:38] [INFO ] [Real]Added 20 Read/Feed constraints in 5 ms returned sat
[2020-05-22 01:28:38] [INFO ] Deduced a trap composed of 4 places in 10 ms
[2020-05-22 01:28:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2020-05-22 01:28:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:28:38] [INFO ] [Nat]Absence check using 40 positive place invariants in 10 ms returned sat
[2020-05-22 01:28:38] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 4 ms returned sat
[2020-05-22 01:28:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:28:38] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2020-05-22 01:28:38] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2020-05-22 01:28:38] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-05-22 01:28:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2020-05-22 01:28:38] [INFO ] Computed and/alt/rep : 420/1200/60 causal constraints in 24 ms.
[2020-05-22 01:28:38] [INFO ] Added : 21 causal constraints over 5 iterations in 88 ms. Result :sat
[2020-05-22 01:28:38] [INFO ] [Real]Absence check using 40 positive place invariants in 33 ms returned sat
[2020-05-22 01:28:38] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 4 ms returned sat
[2020-05-22 01:28:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:28:38] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2020-05-22 01:28:38] [INFO ] [Real]Added 20 Read/Feed constraints in 4 ms returned sat
[2020-05-22 01:28:38] [INFO ] Deduced a trap composed of 6 places in 15 ms
[2020-05-22 01:28:38] [INFO ] Deduced a trap composed of 4 places in 22 ms
[2020-05-22 01:28:38] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-05-22 01:28:38] [INFO ] Deduced a trap composed of 4 places in 10 ms
[2020-05-22 01:28:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 85 ms
[2020-05-22 01:28:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:28:38] [INFO ] [Nat]Absence check using 40 positive place invariants in 137 ms returned sat
[2020-05-22 01:28:39] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 131 ms returned sat
[2020-05-22 01:28:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:28:39] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2020-05-22 01:28:39] [INFO ] [Nat]Added 20 Read/Feed constraints in 5 ms returned sat
[2020-05-22 01:28:39] [INFO ] Deduced a trap composed of 6 places in 29 ms
[2020-05-22 01:28:39] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-05-22 01:28:39] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2020-05-22 01:28:39] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2020-05-22 01:28:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 153 ms
[2020-05-22 01:28:39] [INFO ] Computed and/alt/rep : 420/1200/60 causal constraints in 32 ms.
[2020-05-22 01:28:39] [INFO ] Added : 21 causal constraints over 5 iterations in 101 ms. Result :sat
[2020-05-22 01:28:39] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-22 01:28:39] [INFO ] Flatten gal took : 119 ms
FORMULA Dekker-PT-020-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 01:28:39] [INFO ] Flatten gal took : 44 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 01:28:40] [INFO ] Applying decomposition
[2020-05-22 01:28:40] [INFO ] Input system was already deterministic with 440 transitions.
[2020-05-22 01:28:40] [INFO ] Flatten gal took : 118 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/graph9367588475769619830.txt, -o, /tmp/graph9367588475769619830.bin, -w, /tmp/graph9367588475769619830.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/graph9367588475769619830.bin, -l, -1, -v, -w, /tmp/graph9367588475769619830.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 80 out of 440 initially.
// Phase 1: matrix 80 rows 100 cols
[2020-05-22 01:28:40] [INFO ] Computed 60 place invariants in 4 ms
inv : flag_1_17 - p1_17 - p3_17 = 0
inv : flag_0_15 + p1_15 + p3_15 = 1
inv : flag_0_18 + p1_18 + p3_18 = 1
inv : flag_1_1 - p1_1 - p3_1 = 0
inv : flag_0_12 + p1_12 + p3_12 = 1
inv : p0_4 + p1_4 + p3_4 = 1
inv : flag_0_9 + p1_9 + p3_9 = 1
inv : p0_7 + p1_7 + p3_7 = 1
inv : flag_1_11 - p1_11 - p3_11 = 0
inv : p0_17 + p1_17 + p3_17 = 1
inv : flag_1_7 - p1_7 - p3_7 = 0
inv : p0_8 + p1_8 + p3_8 = 1
inv : p0_13 + p1_13 + p3_13 = 1
inv : flag_0_19 + p1_19 + p3_19 = 1
inv : flag_1_2 - p1_2 - p3_2 = 0
inv : flag_1_13 - p1_13 - p3_13 = 0
inv : flag_1_10 - p1_10 - p3_10 = 0
inv : p0_11 + p1_11 + p3_11 = 1
inv : flag_1_5 - p1_5 - p3_5 = 0
inv : p0_14 + p1_14 + p3_14 = 1
inv : flag_0_14 + p1_14 + p3_14 = 1
inv : flag_0_3 + p1_3 + p3_3 = 1
inv : flag_0_11 + p1_11 + p3_11 = 1
inv : p0_19 + p1_19 + p3_19 = 1
inv : flag_0_6 + p1_6 + p3_6 = 1
inv : flag_0_2 + p1_2 + p3_2 = 1
inv : p0_16 + p1_16 + p3_16 = 1
inv : p0_1 + p1_1 + p3_1 = 1
inv : flag_1_18 - p1_18 - p3_18 = 0
inv : p0_6 + p1_6 + p3_6 = 1
inv : flag_1_14 - p1_14 - p3_14 = 0
inv : p0_18 + p1_18 + p3_18 = 1
inv : flag_0_4 + p1_4 + p3_4 = 1
inv : p0_15 + p1_15 + p3_15 = 1
inv : p0_12 + p1_12 + p3_12 = 1
inv : flag_1_9 - p1_9 - p3_9 = 0
inv : flag_1_6 - p1_6 - p3_6 = 0
inv : flag_1_3 - p1_3 - p3_3 = 0
inv : flag_0_7 + p1_7 + p3_7 = 1
inv : flag_0_1 + p1_1 + p3_1 = 1
inv : p0_9 + p1_9 + p3_9 = 1
inv : flag_0_10 + p1_10 + p3_10 = 1
inv : flag_1_15 - p1_15 - p3_15 = 0
inv : flag_1_19 - p1_19 - p3_19 = 0
inv : p0_3 + p1_3 + p3_3 = 1
inv : p0_2 + p1_2 + p3_2 = 1
inv : flag_0_0 + p1_0 + p3_0 = 1
inv : p0_5 + p1_5 + p3_5 = 1
inv : flag_0_5 + p1_5 + p3_5 = 1
inv : flag_0_16 + p1_16 + p3_16 = 1
inv : flag_0_13 + p1_13 + p3_13 = 1
inv : flag_0_8 + p1_8 + p3_8 = 1
inv : flag_1_4 - p1_4 - p3_4 = 0
inv : p0_10 + p1_10 + p3_10 = 1
inv : flag_1_0 - p1_0 - p3_0 = 0
inv : flag_0_17 + p1_17 + p3_17 = 1
inv : p0_0 + p1_0 + p3_0 = 1
inv : flag_1_8 - p1_8 - p3_8 = 0
inv : flag_1_16 - p1_16 - p3_16 = 0
inv : flag_1_12 - p1_12 - p3_12 = 0
Total of 60 invariants.
[2020-05-22 01:28:40] [INFO ] Computed 60 place invariants in 5 ms
[2020-05-22 01:28:40] [INFO ] Decomposing Gal with order
[2020-05-22 01:28:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 01:28:40] [INFO ] Removed a total of 1213 redundant transitions.
[2020-05-22 01:28:40] [INFO ] Flatten gal took : 209 ms
[2020-05-22 01:28:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2020-05-22 01:28:40] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 7 ms
[2020-05-22 01:28:40] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 16 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 10 LTL properties
Checking formula 0 : !((X(!((!(G(X(((G(!(X("(((i16.u6.flag_1_6==1)&&(i16.u21.p3_6==1))||(((u16.flag_1_16==1)&&(i18.u17.flag_1_17==1))&&(u16.p1_16==1)))"))))&&("(i16.u6.flag_1_6==1)"))&&("(i16.u21.p3_6==1)")))))U("(((u0.flag_1_0==1)&&(u8.flag_1_9==1))&&(u8.p1_9==1))")))))
Formula 0 simplified : !X!(!GX("(i16.u6.flag_1_6==1)" & "(i16.u21.p3_6==1)" & G!X"(((i16.u6.flag_1_6==1)&&(i16.u21.p3_6==1))||(((u16.flag_1_16==1)&&(i18.u17.flag_1_17==1))&&(u16.p1_16==1)))") U "(((u0.flag_1_0==1)&&(u8.flag_1_9==1))&&(u8.p1_9==1))")
built 191 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
[2020-05-22 01:28:40] [INFO ] Proved 100 variables to be positive in 517 ms
[2020-05-22 01:28:40] [INFO ] Computing symmetric may disable matrix : 440 transitions.
[2020-05-22 01:28:40] [INFO ] Computation of disable matrix completed :0/440 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 01:28:41] [INFO ] Computation of Complete disable matrix. took 75 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 01:28:41] [INFO ] Computing symmetric may enable matrix : 440 transitions.
[2020-05-22 01:28:41] [INFO ] Computation of Complete enable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions u0.exit_0, u1.exit_1, u2.exit_2, u5.exit_5, u7.exit_8, u8.exit_9, u11.exit_11, u13.exit_13, u14.exit_14, u15.exit_15, u16.exit_16, u22.exit_7, u25.exit_18, i3.exit_4, i7.exit_10, i9.exit_12, i14.exit_19, i15.exit_3, i16.exit_6, i18.exit_17, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/420/20/440
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
28 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.323835,23932,1,0,13553,266,4225,9118,274,339,22454
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Dekker-PT-020-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((!(F("(((u13.flag_1_13==1)&&(u14.flag_1_14==1))&&(u13.p1_13==1))")))||(("(((u0.flag_1_0==1)&&(u7.flag_1_8==1))&&(u7.p1_8==1))")U("(((u8.flag_1_9==1)&&(i14.u18.flag_1_19==1))&&(u8.p1_9==1))"))))
Formula 1 simplified : !(!F"(((u13.flag_1_13==1)&&(u14.flag_1_14==1))&&(u13.p1_13==1))" | ("(((u0.flag_1_0==1)&&(u7.flag_1_8==1))&&(u7.p1_8==1))" U "(((u8.flag_1_9==1)&&(i14.u18.flag_1_19==1))&&(u8.p1_9==1))"))
4 unique states visited
4 strongly connected components in search stack
4 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.367512,24896,1,0,14600,266,4460,10464,274,339,25165
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Dekker-PT-020-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(((X(G("(((u14.flag_1_14==1)&&(i18.u17.flag_1_17==1))&&(i18.u24.p1_17==1))")))||(G(X(F(!(X(G("(((u15.flag_1_15==1)&&(i18.u17.flag_1_17==1))&&(u15.p1_15==1))"))))))))||("((((((((((((((((((((u0.flag_0_0==1)&&(u1.flag_0_1==1))&&(u2.flag_0_2==1))&&(i15.u3.flag_0_3==1))&&(i3.u4.flag_0_4==1))&&(u5.flag_0_5==1))&&(i16.u6.flag_0_6==1))&&(u22.flag_0_7==1))&&(u8.flag_0_9==1))&&(i7.u9.flag_0_10==1))&&(u11.flag_0_11==1))&&(i9.u12.flag_0_12==1))&&(u13.flag_0_13==1))&&(u14.flag_0_14==1))&&(u15.flag_0_15==1))&&(u16.flag_0_16==1))&&(i18.u17.flag_0_17==1))&&(u25.flag_0_18==1))&&(i14.u18.flag_0_19==1))&&(u7.p1_8==1))"))))
Formula 2 simplified : !X("((((((((((((((((((((u0.flag_0_0==1)&&(u1.flag_0_1==1))&&(u2.flag_0_2==1))&&(i15.u3.flag_0_3==1))&&(i3.u4.flag_0_4==1))&&(u5.flag_0_5==1))&&(i16.u6.flag_0_6==1))&&(u22.flag_0_7==1))&&(u8.flag_0_9==1))&&(i7.u9.flag_0_10==1))&&(u11.flag_0_11==1))&&(i9.u12.flag_0_12==1))&&(u13.flag_0_13==1))&&(u14.flag_0_14==1))&&(u15.flag_0_15==1))&&(u16.flag_0_16==1))&&(i18.u17.flag_0_17==1))&&(u25.flag_0_18==1))&&(i14.u18.flag_0_19==1))&&(u7.p1_8==1))" | XG"(((u14.flag_1_14==1)&&(i18.u17.flag_1_17==1))&&(i18.u24.p1_17==1))" | GXF!XG"(((u15.flag_1_15==1)&&(i18.u17.flag_1_17==1))&&(u15.p1_15==1))")
7 unique states visited
7 strongly connected components in search stack
9 transitions explored
7 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.408775,25744,1,0,15668,266,4754,11903,275,339,27991
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Dekker-PT-020-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(G(F(G(F((X("(((i15.u3.flag_1_3==1)&&(u7.flag_1_8==1))&&(i15.u19.p1_3==1))"))&&(G("(((i3.u4.flag_1_4==1)&&(i14.u18.flag_1_19==1))&&(i14.u26.p1_19==1))")))))))))
Formula 3 simplified : GFGF(X"(((i15.u3.flag_1_3==1)&&(u7.flag_1_8==1))&&(i15.u19.p1_3==1))" & G"(((i3.u4.flag_1_4==1)&&(i14.u18.flag_1_19==1))&&(i14.u26.p1_19==1))")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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.458691,26272,1,0,17074,266,5026,13806,275,339,31148
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Dekker-PT-020-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X((G((F(("((u8.flag_1_9==1)&&(u8.p3_9==1))")U(X("(((u5.flag_1_5==1)&&(i9.u23.flag_1_12==1))&&(u5.p1_5==1))"))))&&(G("((u8.flag_1_9==1)&&(u8.p3_9==1))"))))U(F(G("(((i16.u6.flag_1_6!=1)||(u16.flag_1_16!=1))||(i16.u21.p1_6!=1))"))))))
Formula 4 simplified : !X(G(F("((u8.flag_1_9==1)&&(u8.p3_9==1))" U X"(((u5.flag_1_5==1)&&(i9.u23.flag_1_12==1))&&(u5.p1_5==1))") & G"((u8.flag_1_9==1)&&(u8.p3_9==1))") U FG"(((i16.u6.flag_1_6!=1)||(u16.flag_1_16!=1))||(i16.u21.p1_6!=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,0.481233,27328,1,0,19234,266,5103,16783,275,339,35965
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Dekker-PT-020-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((!(X((X(G("(((u1.flag_1_1==1)&&(i16.u6.flag_1_6==1))&&(i16.u21.p1_6==1))")))U("((((((((((((((((((((u0.flag_0_0==1)&&(u1.flag_0_1==1))&&(u2.flag_0_2==1))&&(i3.u4.flag_0_4==1))&&(u5.flag_0_5==1))&&(i16.u6.flag_0_6==1))&&(u22.flag_0_7==1))&&(u7.flag_0_8==1))&&(u8.flag_0_9==1))&&(i7.u9.flag_0_10==1))&&(u11.flag_0_11==1))&&(i9.u12.flag_0_12==1))&&(u13.flag_0_13==1))&&(u14.flag_0_14==1))&&(u15.flag_0_15==1))&&(u16.flag_0_16==1))&&(i18.u17.flag_0_17==1))&&(u25.flag_0_18==1))&&(i14.u18.flag_0_19==1))&&(i15.u19.p1_3==1))"))))||(!(F("(((u13.flag_1_13==1)&&(u14.flag_1_14==1))&&(u13.p1_13==1))")))))
Formula 5 simplified : !(!X(XG"(((u1.flag_1_1==1)&&(i16.u6.flag_1_6==1))&&(i16.u21.p1_6==1))" U "((((((((((((((((((((u0.flag_0_0==1)&&(u1.flag_0_1==1))&&(u2.flag_0_2==1))&&(i3.u4.flag_0_4==1))&&(u5.flag_0_5==1))&&(i16.u6.flag_0_6==1))&&(u22.flag_0_7==1))&&(u7.flag_0_8==1))&&(u8.flag_0_9==1))&&(i7.u9.flag_0_10==1))&&(u11.flag_0_11==1))&&(i9.u12.flag_0_12==1))&&(u13.flag_0_13==1))&&(u14.flag_0_14==1))&&(u15.flag_0_15==1))&&(u16.flag_0_16==1))&&(i18.u17.flag_0_17==1))&&(u25.flag_0_18==1))&&(i14.u18.flag_0_19==1))&&(i15.u19.p1_3==1))") | !F"(((u13.flag_1_13==1)&&(u14.flag_1_14==1))&&(u13.p1_13==1))")
8 unique states visited
5 strongly connected components in search stack
11 transitions explored
5 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.53235,29176,1,0,22741,266,5409,20273,281,339,44639
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Dekker-PT-020-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(((X("(((u14.flag_1_14!=1)||(u25.flag_1_18!=1))||(u25.p1_18!=1))"))||(X("(((i15.u3.flag_1_3!=1)||(u11.flag_1_11!=1))||(i15.u19.p1_3!=1))")))||(X("(((u11.flag_1_11!=1)||(u14.flag_1_14!=1))||(u14.p1_14!=1))")))))
Formula 6 simplified : !G(X"(((u14.flag_1_14!=1)||(u25.flag_1_18!=1))||(u25.p1_18!=1))" | X"(((i15.u3.flag_1_3!=1)||(u11.flag_1_11!=1))||(i15.u19.p1_3!=1))" | X"(((u11.flag_1_11!=1)||(u14.flag_1_14!=1))||(u14.p1_14!=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,0.558058,29704,1,0,24186,266,5574,22219,283,339,48290
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Dekker-PT-020-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(X(F(("(((u2.flag_1_2==1)&&(u8.flag_1_9==1))&&(u2.p1_2==1))")U("(((u2.flag_1_2==1)&&(i18.u17.flag_1_17==1))&&(u2.p1_2==1))"))))))
Formula 7 simplified : !FXF("(((u2.flag_1_2==1)&&(u8.flag_1_9==1))&&(u2.p1_2==1))" U "(((u2.flag_1_2==1)&&(i18.u17.flag_1_17==1))&&(u2.p1_2==1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,0.582465,30496,1,0,25520,266,5824,24174,283,339,51465
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Dekker-PT-020-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(F(X(X("(((u1.flag_1_1==1)&&(i16.u6.flag_1_6==1))&&(u1.p1_1==1))"))))))
Formula 8 simplified : !GFXX"(((u1.flag_1_1==1)&&(i16.u6.flag_1_6==1))&&(u1.p1_1==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.623453,31024,1,0,26298,266,6081,25340,283,339,53056
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Dekker-PT-020-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(!((G("(((u5.flag_1_5==1)&&(i18.u17.flag_1_17==1))&&(u5.p1_5==1))"))U("((i7.u10.flag_1_10==1)&&(i7.u9.p3_10==1))")))))
Formula 9 simplified : !X!(G"(((u5.flag_1_5==1)&&(i18.u17.flag_1_17==1))&&(u5.p1_5==1))" U "((i7.u10.flag_1_10==1)&&(i7.u9.p3_10==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.62507,31288,1,0,26298,266,6107,25340,283,339,53116
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA Dekker-PT-020-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-22 01:28:41] [WARNING] Script execution failed on command (assert (and (and (and (>= (select s0 1) 1) (>= (select s0 9) 1)) (>= (select s0 41) 1)) (= (store (store (store (store s0 0 (+ (select s0 0) 1)) 41 (- (select s0 41) 1)) 40 (+ (select s0 40) 1)) 1 (- (select s0 1) 1)) s1))) with error
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-22 01:28:41] [INFO ] Built C files in 1695ms 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 1590110922161

--------------------
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="Dekker-PT-020"
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 Dekker-PT-020, 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 r066-tajo-158922814100322"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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