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-158922814900865.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 DrinkVendingMachine-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814900865
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 344K
-rw-r--r-- 1 mcc users 3.5K Mar 31 07:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 31 07:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Mar 30 00:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K Mar 30 00:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.6K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Mar 28 14:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 14:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 27 07:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 27 07:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 68K 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 DrinkVendingMachine-PT-02-00
FORMULA_NAME DrinkVendingMachine-PT-02-01
FORMULA_NAME DrinkVendingMachine-PT-02-02
FORMULA_NAME DrinkVendingMachine-PT-02-03
FORMULA_NAME DrinkVendingMachine-PT-02-04
FORMULA_NAME DrinkVendingMachine-PT-02-05
FORMULA_NAME DrinkVendingMachine-PT-02-06
FORMULA_NAME DrinkVendingMachine-PT-02-07
FORMULA_NAME DrinkVendingMachine-PT-02-08
FORMULA_NAME DrinkVendingMachine-PT-02-09
FORMULA_NAME DrinkVendingMachine-PT-02-10
FORMULA_NAME DrinkVendingMachine-PT-02-11
FORMULA_NAME DrinkVendingMachine-PT-02-12
FORMULA_NAME DrinkVendingMachine-PT-02-13
FORMULA_NAME DrinkVendingMachine-PT-02-14
FORMULA_NAME DrinkVendingMachine-PT-02-15

=== Now, execution of the tool begins

BK_START 1590146533086

[2020-05-22 11:22:26] [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-22 11:22:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 11:22:26] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2020-05-22 11:22:26] [INFO ] Transformed 24 places.
[2020-05-22 11:22:26] [INFO ] Transformed 72 transitions.
[2020-05-22 11:22:26] [INFO ] Parsed PT model containing 24 places and 72 transitions in 149 ms.
Ensure Unique test removed 20 transitions
Reduce redundant transitions removed 20 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 370 ms. (steps per millisecond=270 ) properties seen :[1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 52 rows 24 cols
[2020-05-22 11:22:26] [INFO ] Computed 12 place invariants in 4 ms
[2020-05-22 11:22:26] [INFO ] [Real]Absence check using 12 positive place invariants in 16 ms returned unsat
[2020-05-22 11:22:26] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2020-05-22 11:22:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 11:22:26] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2020-05-22 11:22:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 11:22:27] [INFO ] [Nat]Absence check using 12 positive place invariants in 13 ms returned sat
[2020-05-22 11:22:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 11:22:27] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2020-05-22 11:22:27] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 16 ms.
[2020-05-22 11:22:27] [INFO ] Added : 36 causal constraints over 8 iterations in 120 ms. Result :sat
[2020-05-22 11:22:27] [INFO ] [Real]Absence check using 12 positive place invariants in 33 ms returned sat
[2020-05-22 11:22:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 11:22:27] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2020-05-22 11:22:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 11:22:27] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2020-05-22 11:22:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 11:22:27] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2020-05-22 11:22:27] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 11 ms.
[2020-05-22 11:22:27] [INFO ] Added : 36 causal constraints over 8 iterations in 74 ms. Result :sat
[2020-05-22 11:22:27] [INFO ] [Real]Absence check using 12 positive place invariants in 43 ms returned sat
[2020-05-22 11:22:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 11:22:27] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2020-05-22 11:22:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 11:22:27] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2020-05-22 11:22:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 11:22:27] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2020-05-22 11:22:27] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 18 ms.
[2020-05-22 11:22:27] [INFO ] Added : 36 causal constraints over 8 iterations in 67 ms. Result :sat
[2020-05-22 11:22:27] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2020-05-22 11:22:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 11:22:27] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-05-22 11:22:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 11:22:27] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2020-05-22 11:22:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 11:22:27] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2020-05-22 11:22:27] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 5 ms.
[2020-05-22 11:22:27] [INFO ] Added : 36 causal constraints over 8 iterations in 73 ms. Result :sat
[2020-05-22 11:22:27] [INFO ] [Real]Absence check using 12 positive place invariants in 29 ms returned unsat
[2020-05-22 11:22:27] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-05-22 11:22:27] [INFO ] [Real]Absence check using 12 positive place invariants in 24 ms returned unsat
[2020-05-22 11:22:27] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2020-05-22 11:22:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 11:22:27] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-05-22 11:22:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 11:22:27] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2020-05-22 11:22:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 11:22:27] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2020-05-22 11:22:27] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 4 ms.
[2020-05-22 11:22:28] [INFO ] Added : 36 causal constraints over 8 iterations in 57 ms. Result :sat
[2020-05-22 11:22:28] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2020-05-22 11:22:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 11:22:28] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2020-05-22 11:22:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 11:22:28] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2020-05-22 11:22:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 11:22:28] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2020-05-22 11:22:28] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 3 ms.
[2020-05-22 11:22:28] [INFO ] Added : 36 causal constraints over 8 iterations in 34 ms. Result :sat
[2020-05-22 11:22:28] [INFO ] [Real]Absence check using 12 positive place invariants in 1 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2020-05-22 11:22:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-22 11:22:28] [INFO ] Flatten gal took : 32 ms
FORMULA DrinkVendingMachine-PT-02-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 11:22:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-22 11:22:28] [INFO ] Flatten gal took : 13 ms
[2020-05-22 11:22:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DrinkVendingMachine-PT-02-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
[2020-05-22 11:22:28] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-22 11:22:28] [INFO ] Flatten gal took : 34 ms
[2020-05-22 11:22:28] [INFO ] Input system was already deterministic with 52 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/graph17891466372489684636.txt, -o, /tmp/graph17891466372489684636.bin, -w, /tmp/graph17891466372489684636.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 52 rows 24 cols
[2020-05-22 11:22:28] [INFO ] Computed 12 place invariants in 2 ms
inv : wait_6 + ready_6 = 1
inv : theProducts_2 + productSlots_2 = 1
inv : theOptions_2 + optionSlots_2 = 1
inv : wait_1 + ready_1 = 1
inv : theProducts_1 + productSlots_1 = 1
inv : wait_5 + ready_5 = 1
inv : wait_8 + ready_8 = 1
inv : wait_2 + ready_2 = 1
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph17891466372489684636.bin, -l, -1, -v, -w, /tmp/graph17891466372489684636.weights, -q, 0, -e, 0.001], workingDir=null]
inv : wait_4 + ready_4 = 1
inv : wait_7 + ready_7 = 1
inv : theOptions_1 + optionSlots_1 = 1
inv : wait_3 + ready_3 = 1
Total of 12 invariants.
[2020-05-22 11:22:28] [INFO ] Computed 12 place invariants in 5 ms
[2020-05-22 11:22:28] [INFO ] Decomposing Gal with order
[2020-05-22 11:22:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 11:22:28] [INFO ] Removed a total of 194 redundant transitions.
[2020-05-22 11:22:28] [INFO ] Flatten gal took : 114 ms
[2020-05-22 11:22:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2020-05-22 11:22:28] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 2 ms
[2020-05-22 11:22:28] [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-22 11:22:28] [INFO ] Proved 24 variables to be positive in 272 ms
[2020-05-22 11:22:28] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2020-05-22 11:22:28] [INFO ] Computation of disable matrix completed :0/52 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 11:22:28] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 11:22:28] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2020-05-22 11:22:28] [INFO ] Computation of Complete enable matrix. took 1 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 14 LTL properties
Checking formula 0 : !((("((((((((gu0.wait_1+gu0.wait_2)+gu0.wait_3)+gu0.wait_4)+gu0.wait_5)+gu0.wait_6)+gu0.wait_7)+gu0.wait_8)>(((((((gu3.ready_1+gu3.ready_3)+gu3.ready_2)+gu3.ready_5)+gu3.ready_4)+gu3.ready_7)+gu3.ready_6)+gu3.ready_8))")U(X(F(("((((((((gu3.ready_1+gu3.ready_3)+gu3.ready_2)+gu3.ready_5)+gu3.ready_4)+gu3.ready_7)+gu3.ready_6)+gu3.ready_8)>=1)")U("((((((((gu0.wait_1+gu0.wait_2)+gu0.wait_3)+gu0.wait_4)+gu0.wait_5)+gu0.wait_6)+gu0.wait_7)+gu0.wait_8)<=(((((((gu3.ready_1+gu3.ready_3)+gu3.ready_2)+gu3.ready_5)+gu3.ready_4)+gu3.ready_7)+gu3.ready_6)+gu3.ready_8))"))))))
Formula 0 simplified : !("((((((((gu0.wait_1+gu0.wait_2)+gu0.wait_3)+gu0.wait_4)+gu0.wait_5)+gu0.wait_6)+gu0.wait_7)+gu0.wait_8)>(((((((gu3.ready_1+gu3.ready_3)+gu3.ready_2)+gu3.ready_5)+gu3.ready_4)+gu3.ready_7)+gu3.ready_6)+gu3.ready_8))" U XF("((((((((gu3.ready_1+gu3.ready_3)+gu3.ready_2)+gu3.ready_5)+gu3.ready_4)+gu3.ready_7)+gu3.ready_6)+gu3.ready_8)>=1)" U "((((((((gu0.wait_1+gu0.wait_2)+gu0.wait_3)+gu0.wait_4)+gu0.wait_5)+gu0.wait_6)+gu0.wait_7)+gu0.wait_8)<=(((((((gu3.ready_1+gu3.ready_3)+gu3.ready_2)+gu3.ready_5)+gu3.ready_4)+gu3.ready_7)+gu3.ready_6)+gu3.ready_8))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
3 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.067396,17332,1,0,25,5655,20,11,835,6320,67
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X((!((F("((gi2.gu2.theOptions_1+gi2.gu2.theOptions_2)>=2)"))&&("((((((((gu3.ready_1+gu3.ready_3)+gu3.ready_2)+gu3.ready_5)+gu3.ready_4)+gu3.ready_7)+gu3.ready_6)+gu3.ready_8)<=(gi2.gu1.theProducts_1+gi2.gu1.theProducts_2))")))U(X("(((gi2.gu5.optionSlots_1+gi2.gu5.optionSlots_2)<=(((((((gu0.wait_1+gu0.wait_2)+gu0.wait_3)+gu0.wait_4)+gu0.wait_5)+gu0.wait_6)+gu0.wait_7)+gu0.wait_8))||((((((((gu3.ready_1+gu3.ready_3)+gu3.ready_2)+gu3.ready_5)+gu3.ready_4)+gu3.ready_7)+gu3.ready_6)+gu3.ready_8)<=(gi2.gu1.theProducts_1+gi2.gu1.theProducts_2)))")))))
Formula 1 simplified : !X(!("((((((((gu3.ready_1+gu3.ready_3)+gu3.ready_2)+gu3.ready_5)+gu3.ready_4)+gu3.ready_7)+gu3.ready_6)+gu3.ready_8)<=(gi2.gu1.theProducts_1+gi2.gu1.theProducts_2))" & F"((gi2.gu2.theOptions_1+gi2.gu2.theOptions_2)>=2)") U X"(((gi2.gu5.optionSlots_1+gi2.gu5.optionSlots_2)<=(((((((gu0.wait_1+gu0.wait_2)+gu0.wait_3)+gu0.wait_4)+gu0.wait_5)+gu0.wait_6)+gu0.wait_7)+gu0.wait_8))||((((((((gu3.ready_1+gu3.ready_3)+gu3.ready_2)+gu3.ready_5)+gu3.ready_4)+gu3.ready_7)+gu3.ready_6)+gu3.ready_8)<=(gi2.gu1.theProducts_1+gi2.gu1.theProducts_2)))")
5 unique states visited
0 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.075267,19176,1,0,29,5897,47,11,928,6468,89
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-PT-02-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(("((gi2.gu4.productSlots_1+gi2.gu4.productSlots_2)>=2)")U("((gi2.gu4.productSlots_1+gi2.gu4.productSlots_2)<=(gi2.gu2.theOptions_1+gi2.gu2.theOptions_2))"))))
Formula 2 simplified : !X("((gi2.gu4.productSlots_1+gi2.gu4.productSlots_2)>=2)" U "((gi2.gu4.productSlots_1+gi2.gu4.productSlots_2)<=(gi2.gu2.theOptions_1+gi2.gu2.theOptions_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.094313,19176,1,0,31,6217,63,11,977,6785,106
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(F((F(!(X("((gi2.gu4.productSlots_1+gi2.gu4.productSlots_2)<2)"))))||("((((((((gu0.wait_1+gu0.wait_2)+gu0.wait_3)+gu0.wait_4)+gu0.wait_5)+gu0.wait_6)+gu0.wait_7)+gu0.wait_8)<=(((((((gu3.ready_1+gu3.ready_3)+gu3.ready_2)+gu3.ready_5)+gu3.ready_4)+gu3.ready_7)+gu3.ready_6)+gu3.ready_8))")))))
Formula 3 simplified : !XF("((((((((gu0.wait_1+gu0.wait_2)+gu0.wait_3)+gu0.wait_4)+gu0.wait_5)+gu0.wait_6)+gu0.wait_7)+gu0.wait_8)<=(((((((gu3.ready_1+gu3.ready_3)+gu3.ready_2)+gu3.ready_5)+gu3.ready_4)+gu3.ready_7)+gu3.ready_6)+gu3.ready_8))" | F!X"((gi2.gu4.productSlots_1+gi2.gu4.productSlots_2)<2)")
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.121576,19432,1,0,52,8716,72,21,979,11313,163
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(X(G(((X("((gi2.gu4.productSlots_1+gi2.gu4.productSlots_2)<=(gi2.gu5.optionSlots_1+gi2.gu5.optionSlots_2))"))&&("((gi2.gu1.theProducts_1+gi2.gu1.theProducts_2)<=(gi2.gu5.optionSlots_1+gi2.gu5.optionSlots_2))"))&&("((gi2.gu5.optionSlots_1+gi2.gu5.optionSlots_2)<=(((((((gu0.wait_1+gu0.wait_2)+gu0.wait_3)+gu0.wait_4)+gu0.wait_5)+gu0.wait_6)+gu0.wait_7)+gu0.wait_8))"))))))
Formula 4 simplified : !GXG("((gi2.gu1.theProducts_1+gi2.gu1.theProducts_2)<=(gi2.gu5.optionSlots_1+gi2.gu5.optionSlots_2))" & "((gi2.gu5.optionSlots_1+gi2.gu5.optionSlots_2)<=(((((((gu0.wait_1+gu0.wait_2)+gu0.wait_3)+gu0.wait_4)+gu0.wait_5)+gu0.wait_6)+gu0.wait_7)+gu0.wait_8))" & X"((gi2.gu4.productSlots_1+gi2.gu4.productSlots_2)<=(gi2.gu5.optionSlots_1+gi2.gu5.optionSlots_2))")
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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.152883,21068,1,0,79,12266,94,32,1093,16377,233
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(!(F((G((("((gi2.gu1.theProducts_1+gi2.gu1.theProducts_2)<=(gi2.gu4.productSlots_1+gi2.gu4.productSlots_2))")U("((gi2.gu1.theProducts_1+gi2.gu1.theProducts_2)<=(((((((gu0.wait_1+gu0.wait_2)+gu0.wait_3)+gu0.wait_4)+gu0.wait_5)+gu0.wait_6)+gu0.wait_7)+gu0.wait_8))"))||("((gi2.gu5.optionSlots_1+gi2.gu5.optionSlots_2)>=2)")))&&(G(X(X("((gi2.gu1.theProducts_1+gi2.gu1.theProducts_2)<=(((((((gu0.wait_1+gu0.wait_2)+gu0.wait_3)+gu0.wait_4)+gu0.wait_5)+gu0.wait_6)+gu0.wait_7)+gu0.wait_8))")))))))))
Formula 5 simplified : !F!F(G("((gi2.gu5.optionSlots_1+gi2.gu5.optionSlots_2)>=2)" | ("((gi2.gu1.theProducts_1+gi2.gu1.theProducts_2)<=(gi2.gu4.productSlots_1+gi2.gu4.productSlots_2))" U "((gi2.gu1.theProducts_1+gi2.gu1.theProducts_2)<=(((((((gu0.wait_1+gu0.wait_2)+gu0.wait_3)+gu0.wait_4)+gu0.wait_5)+gu0.wait_6)+gu0.wait_7)+gu0.wait_8))")) & GXX"((gi2.gu1.theProducts_1+gi2.gu1.theProducts_2)<=(((((((gu0.wait_1+gu0.wait_2)+gu0.wait_3)+gu0.wait_4)+gu0.wait_5)+gu0.wait_6)+gu0.wait_7)+gu0.wait_8))")
4 unique states visited
4 strongly connected components in search stack
5 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.166702,21840,1,0,79,12354,120,32,1204,16451,247
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(G(!(X(F(X(F(!(F(X((G("((((((((gu3.ready_1+gu3.ready_3)+gu3.ready_2)+gu3.ready_5)+gu3.ready_4)+gu3.ready_7)+gu3.ready_6)+gu3.ready_8)<=(gi2.gu5.optionSlots_1+gi2.gu5.optionSlots_2))"))||("((gi2.gu4.productSlots_1+gi2.gu4.productSlots_2)>=1)")))))))))))))
Formula 6 simplified : !XG!XFXF!FX("((gi2.gu4.productSlots_1+gi2.gu4.productSlots_2)>=1)" | G"((((((((gu3.ready_1+gu3.ready_3)+gu3.ready_2)+gu3.ready_5)+gu3.ready_4)+gu3.ready_7)+gu3.ready_6)+gu3.ready_8)<=(gi2.gu5.optionSlots_1+gi2.gu5.optionSlots_2))")
2 unique states visited
0 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.194376,22324,1,0,111,16489,139,42,1367,22306,336
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-PT-02-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(X(X(F(X("((gi2.gu4.productSlots_1+gi2.gu4.productSlots_2)>=1)")))))))
Formula 7 simplified : !XXXFX"((gi2.gu4.productSlots_1+gi2.gu4.productSlots_2)>=1)"
5 unique states visited
0 strongly connected components in search stack
4 transitions explored
5 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.205359,22588,1,0,126,19325,146,46,1367,25868,380
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-PT-02-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X((X(G(!(F("(gu0.wait_2<=gu3.ready_5)")))))&&(("(gi2.gu5.optionSlots_2>=1)")U(X("(gi2.gu5.optionSlots_2>=1)"))))))
Formula 8 simplified : !X(XG!F"(gu0.wait_2<=gu3.ready_5)" & ("(gi2.gu5.optionSlots_2>=1)" U X"(gi2.gu5.optionSlots_2>=1)"))
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 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.228833,23616,1,0,158,23635,159,56,1375,31832,461
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((!(G(F("(gi2.gu4.productSlots_1<=gu3.ready_5)"))))U(G(X("(gi2.gu4.productSlots_1>gu3.ready_5)")))))
Formula 9 simplified : !(!GF"(gi2.gu4.productSlots_1<=gu3.ready_5)" U GX"(gi2.gu4.productSlots_1>gu3.ready_5)")
4 unique states visited
4 strongly connected components in search stack
5 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.231628,24116,1,0,161,23917,177,57,1383,32115,480
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(!((X(G(F(X(F("(gu0.wait_2<=gi2.gu4.productSlots_2)"))))))U("(gu3.ready_7<=gi2.gu1.theProducts_1)")))))
Formula 10 simplified : !F!(XGFXF"(gu0.wait_2<=gi2.gu4.productSlots_2)" U "(gu3.ready_7<=gi2.gu1.theProducts_1)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.238475,24116,1,0,171,24797,183,68,1386,33182,560
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X((("(gu0.wait_3>=1)")U("(gu0.wait_6<=gi2.gu4.productSlots_2)"))&&((G("(gu0.wait_3>=1)"))||("(gi2.gu4.productSlots_2<=gu0.wait_7)")))))
Formula 11 simplified : !X(("(gu0.wait_3>=1)" U "(gu0.wait_6<=gi2.gu4.productSlots_2)") & ("(gi2.gu4.productSlots_2<=gu0.wait_7)" | G"(gu0.wait_3>=1)"))
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.240998,24328,1,0,175,24985,198,68,1404,33313,572
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((!(((F("((gu0.wait_6<=gi2.gu5.optionSlots_2)&&(gi2.gu4.productSlots_1>=1))"))||(X((G("(gi2.gu4.productSlots_2>=1)"))&&(F("(gi2.gu4.productSlots_1>=1)")))))U(F("(gu0.wait_6<=gi2.gu5.optionSlots_2)")))))
Formula 12 simplified : (F"((gu0.wait_6<=gi2.gu5.optionSlots_2)&&(gi2.gu4.productSlots_1>=1))" | X(G"(gi2.gu4.productSlots_2>=1)" & F"(gi2.gu4.productSlots_1>=1)")) U F"(gu0.wait_6<=gi2.gu5.optionSlots_2)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.255983,24764,1,0,199,26890,204,79,1408,35859,635
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((((X("(gi2.gu5.optionSlots_2<=gi2.gu2.theOptions_1)"))&&(G("(gi2.gu5.optionSlots_1<=gi2.gu4.productSlots_2)")))&&(G(("(gu3.ready_1>=1)")U(F("(gi2.gu5.optionSlots_2<=gi2.gu2.theOptions_1)"))))))
Formula 13 simplified : !(X"(gi2.gu5.optionSlots_2<=gi2.gu2.theOptions_1)" & G"(gi2.gu5.optionSlots_1<=gi2.gu4.productSlots_2)" & G("(gu3.ready_1>=1)" U F"(gi2.gu5.optionSlots_2<=gi2.gu2.theOptions_1)"))
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.267763,25284,1,0,225,28859,215,84,1419,37921,737
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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 11:22:29] [INFO ] Built C files in 795ms 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 1590146549579

--------------------
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="DrinkVendingMachine-PT-02"
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 DrinkVendingMachine-PT-02, 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 r066-tajo-158922814900865"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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