Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r074-smll-155234739000070.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-3957
Executing tool itstools
Input is DrinkVendingMachine-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074-smll-155234739000070
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 4.4K Feb 10 22:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 10 22:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 6 19:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 6 19:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 112 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 350 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 3.1K Feb 4 23:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 4 23:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Feb 4 22:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K Feb 4 22:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Feb 3 07:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 3 07:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Jan 31 00:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 26K Jan 31 00:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Feb 4 22:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Feb 4 22:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 68K Mar 10 17:31 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-LTLFireability-00
FORMULA_NAME DrinkVendingMachine-PT-02-LTLFireability-01
FORMULA_NAME DrinkVendingMachine-PT-02-LTLFireability-02
FORMULA_NAME DrinkVendingMachine-PT-02-LTLFireability-03
FORMULA_NAME DrinkVendingMachine-PT-02-LTLFireability-04
FORMULA_NAME DrinkVendingMachine-PT-02-LTLFireability-05
FORMULA_NAME DrinkVendingMachine-PT-02-LTLFireability-06
FORMULA_NAME DrinkVendingMachine-PT-02-LTLFireability-07
FORMULA_NAME DrinkVendingMachine-PT-02-LTLFireability-08
FORMULA_NAME DrinkVendingMachine-PT-02-LTLFireability-09
FORMULA_NAME DrinkVendingMachine-PT-02-LTLFireability-10
FORMULA_NAME DrinkVendingMachine-PT-02-LTLFireability-11
FORMULA_NAME DrinkVendingMachine-PT-02-LTLFireability-12
FORMULA_NAME DrinkVendingMachine-PT-02-LTLFireability-13
FORMULA_NAME DrinkVendingMachine-PT-02-LTLFireability-14
FORMULA_NAME DrinkVendingMachine-PT-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1552701789100

Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903111103/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.201903111103/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 16 LTL properties
Checking formula 0 : !((X(G(X("(((((theProducts_2>=1)&&(wait_1>=1))||((wait_2>=1)&&(theProducts_1>=1)))||((wait_2>=1)&&(theProducts_2>=1)))||((theProducts_1>=1)&&(wait_1>=1)))")))))
Formula 0 simplified : !XGX"(((((theProducts_2>=1)&&(wait_1>=1))||((wait_2>=1)&&(theProducts_1>=1)))||((wait_2>=1)&&(theProducts_2>=1)))||((theProducts_1>=1)&&(wait_1>=1)))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
6 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.094366,18408,1,0,41,10519,23,15,1010,10954,102
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((("(((((theProducts_2>=1)&&(wait_1>=1))||((wait_2>=1)&&(theProducts_1>=1)))||((wait_2>=1)&&(theProducts_2>=1)))||((theProducts_1>=1)&&(wait_1>=1)))")U(G(X("(((((theProducts_2>=1)&&(wait_1>=1))||((wait_2>=1)&&(theProducts_1>=1)))||((wait_2>=1)&&(theProducts_2>=1)))||((theProducts_1>=1)&&(wait_1>=1)))")))))
Formula 1 simplified : !("(((((theProducts_2>=1)&&(wait_1>=1))||((wait_2>=1)&&(theProducts_1>=1)))||((wait_2>=1)&&(theProducts_2>=1)))||((theProducts_1>=1)&&(wait_1>=1)))" U GX"(((((theProducts_2>=1)&&(wait_1>=1))||((wait_2>=1)&&(theProducts_1>=1)))||((wait_2>=1)&&(theProducts_2>=1)))||((theProducts_1>=1)&&(wait_1>=1)))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.120688,19260,1,0,53,13222,23,22,1010,14768,140
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((F(X(G(("((((((((((((((((((wait_5>=1)&&(theProducts_1>=1))&&(theOptions_1>=2))||(((theProducts_1>=1)&&(theOptions_1>=2))&&(wait_6>=1)))||(((wait_5>=1)&&(theProducts_1>=1))&&(theOptions_2>=2)))||((((theOptions_2>=1)&&(wait_5>=1))&&(theOptions_1>=1))&&(theProducts_1>=1)))||((((theOptions_1>=1)&&(wait_5>=1))&&(theOptions_2>=1))&&(theProducts_1>=1)))||((((theOptions_1>=1)&&(theProducts_2>=1))&&(theOptions_2>=1))&&(wait_5>=1)))||((((theProducts_2>=1)&&(theOptions_1>=1))&&(wait_5>=1))&&(theOptions_2>=1)))||(((theProducts_2>=1)&&(theOptions_2>=2))&&(wait_5>=1)))||(((theOptions_1>=2)&&(theProducts_2>=1))&&(wait_6>=1)))||((((wait_6>=1)&&(theProducts_1>=1))&&(theOptions_2>=1))&&(theOptions_1>=1)))||((((theOptions_2>=1)&&(theOptions_1>=1))&&(theProducts_1>=1))&&(wait_6>=1)))||(((theOptions_2>=2)&&(theProducts_1>=1))&&(wait_6>=1)))||(((theProducts_2>=1)&&(theOptions_1>=2))&&(wait_5>=1)))||((((theOptions_2>=1)&&(theProducts_2>=1))&&(wait_6>=1))&&(theOptions_1>=1)))||((((theOptions_1>=1)&&(theProducts_2>=1))&&(wait_6>=1))&&(theOptions_2>=1)))||(((wait_6>=1)&&(theProducts_2>=1))&&(theOptions_2>=2)))")U("((((((((((((((((((wait_5>=1)&&(theProducts_1>=1))&&(theOptions_1>=2))||(((theProducts_1>=1)&&(theOptions_1>=2))&&(wait_6>=1)))||(((wait_5>=1)&&(theProducts_1>=1))&&(theOptions_2>=2)))||((((theOptions_2>=1)&&(wait_5>=1))&&(theOptions_1>=1))&&(theProducts_1>=1)))||((((theOptions_1>=1)&&(wait_5>=1))&&(theOptions_2>=1))&&(theProducts_1>=1)))||((((theOptions_1>=1)&&(theProducts_2>=1))&&(theOptions_2>=1))&&(wait_5>=1)))||((((theProducts_2>=1)&&(theOptions_1>=1))&&(wait_5>=1))&&(theOptions_2>=1)))||(((theProducts_2>=1)&&(theOptions_2>=2))&&(wait_5>=1)))||(((theOptions_1>=2)&&(theProducts_2>=1))&&(wait_6>=1)))||((((wait_6>=1)&&(theProducts_1>=1))&&(theOptions_2>=1))&&(theOptions_1>=1)))||((((theOptions_2>=1)&&(theOptions_1>=1))&&(theProducts_1>=1))&&(wait_6>=1)))||(((theOptions_2>=2)&&(theProducts_1>=1))&&(wait_6>=1)))||(((theProducts_2>=1)&&(theOptions_1>=2))&&(wait_5>=1)))||((((theOptions_2>=1)&&(theProducts_2>=1))&&(wait_6>=1))&&(theOptions_1>=1)))||((((theOptions_1>=1)&&(theProducts_2>=1))&&(wait_6>=1))&&(theOptions_2>=1)))||(((wait_6>=1)&&(theProducts_2>=1))&&(theOptions_2>=2)))"))))))
Formula 2 simplified : !FXG"((((((((((((((((((wait_5>=1)&&(theProducts_1>=1))&&(theOptions_1>=2))||(((theProducts_1>=1)&&(theOptions_1>=2))&&(wait_6>=1)))||(((wait_5>=1)&&(theProducts_1>=1))&&(theOptions_2>=2)))||((((theOptions_2>=1)&&(wait_5>=1))&&(theOptions_1>=1))&&(theProducts_1>=1)))||((((theOptions_1>=1)&&(wait_5>=1))&&(theOptions_2>=1))&&(theProducts_1>=1)))||((((theOptions_1>=1)&&(theProducts_2>=1))&&(theOptions_2>=1))&&(wait_5>=1)))||((((theProducts_2>=1)&&(theOptions_1>=1))&&(wait_5>=1))&&(theOptions_2>=1)))||(((theProducts_2>=1)&&(theOptions_2>=2))&&(wait_5>=1)))||(((theOptions_1>=2)&&(theProducts_2>=1))&&(wait_6>=1)))||((((wait_6>=1)&&(theProducts_1>=1))&&(theOptions_2>=1))&&(theOptions_1>=1)))||((((theOptions_2>=1)&&(theOptions_1>=1))&&(theProducts_1>=1))&&(wait_6>=1)))||(((theOptions_2>=2)&&(theProducts_1>=1))&&(wait_6>=1)))||(((theProducts_2>=1)&&(theOptions_1>=2))&&(wait_5>=1)))||((((theOptions_2>=1)&&(theProducts_2>=1))&&(wait_6>=1))&&(theOptions_1>=1)))||((((theOptions_1>=1)&&(theProducts_2>=1))&&(wait_6>=1))&&(theOptions_2>=1)))||(((wait_6>=1)&&(theProducts_2>=1))&&(theOptions_2>=2)))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
7 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.184677,21176,1,0,105,20176,36,46,1074,24042,265
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((((X("((((((((((wait_3>=1)&&(theProducts_1>=1))&&(theOptions_2>=1))||(((theProducts_1>=1)&&(theOptions_1>=1))&&(wait_4>=1)))||(((wait_4>=1)&&(theProducts_1>=1))&&(theOptions_2>=1)))||(((wait_3>=1)&&(theOptions_1>=1))&&(theProducts_2>=1)))||(((wait_3>=1)&&(theOptions_1>=1))&&(theProducts_1>=1)))||(((wait_4>=1)&&(theProducts_2>=1))&&(theOptions_1>=1)))||(((theOptions_2>=1)&&(theProducts_2>=1))&&(wait_3>=1)))||(((theProducts_2>=1)&&(theOptions_2>=1))&&(wait_4>=1)))"))U(F("((((((((ready_3>=1)||(ready_2>=1))||(ready_5>=1))||(ready_4>=1))||(ready_1>=1))||(ready_7>=1))||(ready_6>=1))||(ready_8>=1))")))U(("((((((((((wait_3>=1)&&(theProducts_1>=1))&&(theOptions_2>=1))||(((theProducts_1>=1)&&(theOptions_1>=1))&&(wait_4>=1)))||(((wait_4>=1)&&(theProducts_1>=1))&&(theOptions_2>=1)))||(((wait_3>=1)&&(theOptions_1>=1))&&(theProducts_2>=1)))||(((wait_3>=1)&&(theOptions_1>=1))&&(theProducts_1>=1)))||(((wait_4>=1)&&(theProducts_2>=1))&&(theOptions_1>=1)))||(((theOptions_2>=1)&&(theProducts_2>=1))&&(wait_3>=1)))||(((theProducts_2>=1)&&(theOptions_2>=1))&&(wait_4>=1)))")U(X("((((((((((((((((((wait_5>=1)&&(theProducts_1>=1))&&(theOptions_1>=2))||(((theProducts_1>=1)&&(theOptions_1>=2))&&(wait_6>=1)))||(((wait_5>=1)&&(theProducts_1>=1))&&(theOptions_2>=2)))||((((theOptions_2>=1)&&(wait_5>=1))&&(theOptions_1>=1))&&(theProducts_1>=1)))||((((theOptions_1>=1)&&(wait_5>=1))&&(theOptions_2>=1))&&(theProducts_1>=1)))||((((theOptions_1>=1)&&(theProducts_2>=1))&&(theOptions_2>=1))&&(wait_5>=1)))||((((theProducts_2>=1)&&(theOptions_1>=1))&&(wait_5>=1))&&(theOptions_2>=1)))||(((theProducts_2>=1)&&(theOptions_2>=2))&&(wait_5>=1)))||(((theOptions_1>=2)&&(theProducts_2>=1))&&(wait_6>=1)))||((((wait_6>=1)&&(theProducts_1>=1))&&(theOptions_2>=1))&&(theOptions_1>=1)))||((((theOptions_2>=1)&&(theOptions_1>=1))&&(theProducts_1>=1))&&(wait_6>=1)))||(((theOptions_2>=2)&&(theProducts_1>=1))&&(wait_6>=1)))||(((theProducts_2>=1)&&(theOptions_1>=2))&&(wait_5>=1)))||((((theOptions_2>=1)&&(theProducts_2>=1))&&(wait_6>=1))&&(theOptions_1>=1)))||((((theOptions_1>=1)&&(theProducts_2>=1))&&(wait_6>=1))&&(theOptions_2>=1)))||(((wait_6>=1)&&(theProducts_2>=1))&&(theOptions_2>=2)))")))))
Formula 3 simplified : !((X"((((((((((wait_3>=1)&&(theProducts_1>=1))&&(theOptions_2>=1))||(((theProducts_1>=1)&&(theOptions_1>=1))&&(wait_4>=1)))||(((wait_4>=1)&&(theProducts_1>=1))&&(theOptions_2>=1)))||(((wait_3>=1)&&(theOptions_1>=1))&&(theProducts_2>=1)))||(((wait_3>=1)&&(theOptions_1>=1))&&(theProducts_1>=1)))||(((wait_4>=1)&&(theProducts_2>=1))&&(theOptions_1>=1)))||(((theOptions_2>=1)&&(theProducts_2>=1))&&(wait_3>=1)))||(((theProducts_2>=1)&&(theOptions_2>=1))&&(wait_4>=1)))" U F"((((((((ready_3>=1)||(ready_2>=1))||(ready_5>=1))||(ready_4>=1))||(ready_1>=1))||(ready_7>=1))||(ready_6>=1))||(ready_8>=1))") U ("((((((((((wait_3>=1)&&(theProducts_1>=1))&&(theOptions_2>=1))||(((theProducts_1>=1)&&(theOptions_1>=1))&&(wait_4>=1)))||(((wait_4>=1)&&(theProducts_1>=1))&&(theOptions_2>=1)))||(((wait_3>=1)&&(theOptions_1>=1))&&(theProducts_2>=1)))||(((wait_3>=1)&&(theOptions_1>=1))&&(theProducts_1>=1)))||(((wait_4>=1)&&(theProducts_2>=1))&&(theOptions_1>=1)))||(((theOptions_2>=1)&&(theProducts_2>=1))&&(wait_3>=1)))||(((theProducts_2>=1)&&(theOptions_2>=1))&&(wait_4>=1)))" U X"((((((((((((((((((wait_5>=1)&&(theProducts_1>=1))&&(theOptions_1>=2))||(((theProducts_1>=1)&&(theOptions_1>=2))&&(wait_6>=1)))||(((wait_5>=1)&&(theProducts_1>=1))&&(theOptions_2>=2)))||((((theOptions_2>=1)&&(wait_5>=1))&&(theOptions_1>=1))&&(theProducts_1>=1)))||((((theOptions_1>=1)&&(wait_5>=1))&&(theOptions_2>=1))&&(theProducts_1>=1)))||((((theOptions_1>=1)&&(theProducts_2>=1))&&(theOptions_2>=1))&&(wait_5>=1)))||((((theProducts_2>=1)&&(theOptions_1>=1))&&(wait_5>=1))&&(theOptions_2>=1)))||(((theProducts_2>=1)&&(theOptions_2>=2))&&(wait_5>=1)))||(((theOptions_1>=2)&&(theProducts_2>=1))&&(wait_6>=1)))||((((wait_6>=1)&&(theProducts_1>=1))&&(theOptions_2>=1))&&(theOptions_1>=1)))||((((theOptions_2>=1)&&(theOptions_1>=1))&&(theProducts_1>=1))&&(wait_6>=1)))||(((theOptions_2>=2)&&(theProducts_1>=1))&&(wait_6>=1)))||(((theProducts_2>=1)&&(theOptions_1>=2))&&(wait_5>=1)))||((((theOptions_2>=1)&&(theProducts_2>=1))&&(wait_6>=1))&&(theOptions_1>=1)))||((((theOptions_1>=1)&&(theProducts_2>=1))&&(wait_6>=1))&&(theOptions_2>=1)))||(((wait_6>=1)&&(theProducts_2>=1))&&(theOptions_2>=2)))"))
4 unique states visited
2 strongly connected components in search stack
4 transitions explored
4 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.242914,23432,1,0,143,24633,55,61,1141,30756,365
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((F(F(G("((optionSlots_2>=1)||(optionSlots_1>=1))")))))
Formula 4 simplified : !FG"((optionSlots_2>=1)||(optionSlots_1>=1))"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 52
// Phase 1: matrix 52 rows 24 cols
invariant :wait_7 + ready_7 = 1
invariant :wait_2 + ready_2 = 1
invariant :theProducts_2 + productSlots_2 = 1
invariant :wait_4 + ready_4 = 1
invariant :wait_6 + ready_6 = 1
invariant :theOptions_1 + optionSlots_1 = 1
invariant :theOptions_2 + optionSlots_2 = 1
invariant :theProducts_1 + productSlots_1 = 1
invariant :wait_5 + ready_5 = 1
invariant :wait_3 + ready_3 = 1
invariant :wait_8 + ready_8 = 1
invariant :wait_1 + ready_1 = 1
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
6 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.303834,25008,1,0,218,31891,68,91,1145,40700,527
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(("((((((((((wait_3>=1)&&(theProducts_1>=1))&&(theOptions_2>=1))||(((theProducts_1>=1)&&(theOptions_1>=1))&&(wait_4>=1)))||(((wait_4>=1)&&(theProducts_1>=1))&&(theOptions_2>=1)))||(((wait_3>=1)&&(theOptions_1>=1))&&(theProducts_2>=1)))||(((wait_3>=1)&&(theOptions_1>=1))&&(theProducts_1>=1)))||(((wait_4>=1)&&(theProducts_2>=1))&&(theOptions_1>=1)))||(((theOptions_2>=1)&&(theProducts_2>=1))&&(wait_3>=1)))||(((theProducts_2>=1)&&(theOptions_2>=1))&&(wait_4>=1)))"))
Formula 5 simplified : !"((((((((((wait_3>=1)&&(theProducts_1>=1))&&(theOptions_2>=1))||(((theProducts_1>=1)&&(theOptions_1>=1))&&(wait_4>=1)))||(((wait_4>=1)&&(theProducts_1>=1))&&(theOptions_2>=1)))||(((wait_3>=1)&&(theOptions_1>=1))&&(theProducts_2>=1)))||(((wait_3>=1)&&(theOptions_1>=1))&&(theProducts_1>=1)))||(((wait_4>=1)&&(theProducts_2>=1))&&(theOptions_1>=1)))||(((theOptions_2>=1)&&(theProducts_2>=1))&&(wait_3>=1)))||(((theProducts_2>=1)&&(theOptions_2>=1))&&(wait_4>=1)))"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.306411,25008,1,0,218,31891,69,91,1147,40700,529
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(("(((((theProducts_2>=1)&&(wait_1>=1))||((wait_2>=1)&&(theProducts_1>=1)))||((wait_2>=1)&&(theProducts_2>=1)))||((theProducts_1>=1)&&(wait_1>=1)))"))
Formula 6 simplified : !"(((((theProducts_2>=1)&&(wait_1>=1))||((wait_2>=1)&&(theProducts_1>=1)))||((wait_2>=1)&&(theProducts_2>=1)))||((theProducts_1>=1)&&(wait_1>=1)))"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.307544,25240,1,0,218,31891,69,91,1147,40700,531
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((F(G("((((((((((wait_3>=1)&&(theProducts_1>=1))&&(theOptions_2>=1))||(((theProducts_1>=1)&&(theOptions_1>=1))&&(wait_4>=1)))||(((wait_4>=1)&&(theProducts_1>=1))&&(theOptions_2>=1)))||(((wait_3>=1)&&(theOptions_1>=1))&&(theProducts_2>=1)))||(((wait_3>=1)&&(theOptions_1>=1))&&(theProducts_1>=1)))||(((wait_4>=1)&&(theProducts_2>=1))&&(theOptions_1>=1)))||(((theOptions_2>=1)&&(theProducts_2>=1))&&(wait_3>=1)))||(((theProducts_2>=1)&&(theOptions_2>=1))&&(wait_4>=1)))"))))
Formula 7 simplified : !FG"((((((((((wait_3>=1)&&(theProducts_1>=1))&&(theOptions_2>=1))||(((theProducts_1>=1)&&(theOptions_1>=1))&&(wait_4>=1)))||(((wait_4>=1)&&(theProducts_1>=1))&&(theOptions_2>=1)))||(((wait_3>=1)&&(theOptions_1>=1))&&(theProducts_2>=1)))||(((wait_3>=1)&&(theOptions_1>=1))&&(theProducts_1>=1)))||(((wait_4>=1)&&(theProducts_2>=1))&&(theOptions_1>=1)))||(((theOptions_2>=1)&&(theProducts_2>=1))&&(wait_3>=1)))||(((theProducts_2>=1)&&(theOptions_2>=1))&&(wait_4>=1)))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.359013,26296,1,0,273,39832,79,117,1155,50118,661
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !(("((((theProducts_2>=1)&&(theOptions_1>=1))&&(wait_5>=1))&&(theOptions_2>=1))"))
Formula 8 simplified : !"((((theProducts_2>=1)&&(theOptions_1>=1))&&(wait_5>=1))&&(theOptions_2>=1))"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.359858,26296,1,0,273,39832,82,117,1155,50118,663
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((X(X(G(F(F("(ready_8>=1)")))))))
Formula 9 simplified : !XXGF"(ready_8>=1)"
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.36227,26540,1,0,273,39863,91,117,1155,50241,671
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(("(((theProducts_1>=1)&&(theOptions_1>=2))&&(wait_6>=1))"))
Formula 10 simplified : !"(((theProducts_1>=1)&&(theOptions_1>=2))&&(wait_6>=1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.36315,26540,1,0,273,39868,94,117,1155,50250,675
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !(("(ready_4>=1)"))
Formula 11 simplified : !"(ready_4>=1)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.36349,26540,1,0,273,39868,97,117,1155,50250,677
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((X(X(G(G(X("(((theProducts_2>=1)&&(theOptions_2>=2))&&(wait_5>=1))")))))))
Formula 12 simplified : !XXGX"(((theProducts_2>=1)&&(theOptions_2>=2))&&(wait_5>=1))"
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.369726,26540,1,0,274,40395,103,117,1155,50977,690
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !(("((((wait_7>=1)&&(theOptions_2>=2))&&(theProducts_2>=1))&&(theOptions_1>=1))"))
Formula 13 simplified : !"((((wait_7>=1)&&(theOptions_2>=2))&&(theProducts_2>=1))&&(theOptions_1>=1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.370511,26788,1,0,274,40395,106,117,1160,50977,692
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((X("(((theProducts_1>=1)&&(theOptions_2>=3))&&(wait_8>=1))")))
Formula 14 simplified : !X"(((theProducts_1>=1)&&(theOptions_2>=3))&&(wait_8>=1))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.371202,26788,1,0,274,40395,109,117,1165,50978,694
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((G(G("((((theProducts_2>=1)&&(theOptions_1>=1))&&(theOptions_2>=2))&&(wait_7>=1))"))))
Formula 15 simplified : !G"((((theProducts_2>=1)&&(theOptions_1>=1))&&(theOptions_2>=2))&&(wait_7>=1))"
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.372197,26788,1,0,274,40395,112,117,1167,50978,697
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
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 1552701793760

--------------------
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/ -smt
+ 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/ -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Mar 16, 2019 2:03:11 AM fr.lip6.move.gal.application.Application start
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/, -smt]
Mar 16, 2019 2:03:11 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 16, 2019 2:03:11 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 63 ms
Mar 16, 2019 2:03:11 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 24 places.
Mar 16, 2019 2:03:11 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 72 transitions.
Mar 16, 2019 2:03:11 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 16 ms
Mar 16, 2019 2:03:12 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 55 ms
Mar 16, 2019 2:03:12 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
Mar 16, 2019 2:03:12 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 4 ms
Mar 16, 2019 2:03:12 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 72 transitions.
Mar 16, 2019 2:03:12 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 12 place invariants in 10 ms
Mar 16, 2019 2:03:12 AM fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver checkSat
WARNING: SMT solver unexpectedly returned 'unknown' answer, retrying.
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout :(error "Failed to check-sat")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:297)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:305)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
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:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Mar 16, 2019 2:03:12 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 441ms conformant to PINS in folder :/home/mcc/execution

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="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-3957"
echo " Executing tool itstools"
echo " Input is DrinkVendingMachine-PT-02, 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 r074-smll-155234739000070"
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 [ "LTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "UpperBounds" ] ; 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
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 ;