fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r194-smll-155234738900007
Last Updated
Apr 15, 2019

About the Execution of ITS-Tools.M for DrinkVendingMachine-COL-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
383.340 8286.00 16035.00 569.90 FFFFFTTFTFTTFFFT normal

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.r194-smll-155234738900007.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 itstoolsm
Input is DrinkVendingMachine-COL-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-smll-155234738900007
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 172K
-rw-r--r-- 1 mcc users 3.4K Feb 10 22:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Feb 10 22:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 6 19:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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 113 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 351 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.6K Feb 4 23:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 4 23:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 4 22:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.5K Feb 4 22:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 3 07:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 3 07:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Jan 31 00:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Jan 31 00:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 4 22:20 UpperBounds.xml

-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 22K 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-COL-02-LTLFireability-00
FORMULA_NAME DrinkVendingMachine-COL-02-LTLFireability-01
FORMULA_NAME DrinkVendingMachine-COL-02-LTLFireability-02
FORMULA_NAME DrinkVendingMachine-COL-02-LTLFireability-03
FORMULA_NAME DrinkVendingMachine-COL-02-LTLFireability-04
FORMULA_NAME DrinkVendingMachine-COL-02-LTLFireability-05
FORMULA_NAME DrinkVendingMachine-COL-02-LTLFireability-06
FORMULA_NAME DrinkVendingMachine-COL-02-LTLFireability-07
FORMULA_NAME DrinkVendingMachine-COL-02-LTLFireability-08
FORMULA_NAME DrinkVendingMachine-COL-02-LTLFireability-09
FORMULA_NAME DrinkVendingMachine-COL-02-LTLFireability-10
FORMULA_NAME DrinkVendingMachine-COL-02-LTLFireability-11
FORMULA_NAME DrinkVendingMachine-COL-02-LTLFireability-12
FORMULA_NAME DrinkVendingMachine-COL-02-LTLFireability-13
FORMULA_NAME DrinkVendingMachine-COL-02-LTLFireability-14
FORMULA_NAME DrinkVendingMachine-COL-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1553548395489

21:13:19.433 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
21:13:19.438 [main] ERROR import - Grammar file errors have been raised, the validation can't be done, process will continue without Grammar validation
Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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, --load-order, /home/mcc/execution/model.ord], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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 --load-order /home/mcc/execution/model.ord
Read 16 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G(X("(((((theProducts_0>=1)&&(wait_0>=1))||((theProducts_0>=1)&&(wait_1>=1)))||((theProducts_1>=1)&&(wait_0>=1)))||((theProducts_1>=1)&&(wait_1>=1)))")))))
Formula 0 simplified : !XGX"(((((theProducts_0>=1)&&(wait_0>=1))||((theProducts_0>=1)&&(wait_1>=1)))||((theProducts_1>=1)&&(wait_0>=1)))||((theProducts_1>=1)&&(wait_1>=1)))"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 52 rows 24 cols
invariant :theProducts_1 + productSlots_1 = 1
invariant :ready_2 + wait_2 = 1
invariant :ready_3 + wait_3 = 1
invariant :theOptions_0 + optionSlots_0 = 1
invariant :theOptions_1 + optionSlots_1 = 1
invariant :ready_6 + wait_6 = 1
invariant :theProducts_0 + productSlots_0 = 1
invariant :ready_0 + wait_0 = 1
invariant :ready_4 + wait_4 = 1
invariant :ready_5 + wait_5 = 1
invariant :ready_7 + wait_7 = 1
invariant :ready_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
25 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.302563,21436,1,0,41,19203,23,15,894,22726,102
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((("(((((theProducts_0>=1)&&(wait_0>=1))||((theProducts_0>=1)&&(wait_1>=1)))||((theProducts_1>=1)&&(wait_0>=1)))||((theProducts_1>=1)&&(wait_1>=1)))")U(G(X("(((((theProducts_0>=1)&&(wait_0>=1))||((theProducts_0>=1)&&(wait_1>=1)))||((theProducts_1>=1)&&(wait_0>=1)))||((theProducts_1>=1)&&(wait_1>=1)))")))))
Formula 1 simplified : !("(((((theProducts_0>=1)&&(wait_0>=1))||((theProducts_0>=1)&&(wait_1>=1)))||((theProducts_1>=1)&&(wait_0>=1)))||((theProducts_1>=1)&&(wait_1>=1)))" U GX"(((((theProducts_0>=1)&&(wait_0>=1))||((theProducts_0>=1)&&(wait_1>=1)))||((theProducts_1>=1)&&(wait_0>=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
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.340447,22288,1,0,53,20871,23,22,894,28138,140
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(X(G(("((((((((((((((((wait_4>=1)&&(theOptions_0>=1))&&(theOptions_0>=1))&&(theProducts_0>=1))&&(theOptions_0>=2))||(((((wait_5>=1)&&(theOptions_0>=1))&&(theOptions_0>=1))&&(theProducts_0>=1))&&(theOptions_0>=2)))||(((((wait_4>=1)&&(theOptions_0>=1))&&(theOptions_0>=1))&&(theProducts_1>=1))&&(theOptions_0>=2)))||(((((wait_5>=1)&&(theOptions_0>=1))&&(theOptions_0>=1))&&(theProducts_1>=1))&&(theOptions_0>=2)))||((((wait_4>=1)&&(theOptions_1>=1))&&(theOptions_0>=1))&&(theProducts_0>=1)))||((((wait_5>=1)&&(theOptions_1>=1))&&(theOptions_0>=1))&&(theProducts_0>=1)))||(((((wait_4>=1)&&(theOptions_1>=1))&&(theOptions_1>=1))&&(theProducts_0>=1))&&(theOptions_1>=2)))||(((((wait_5>=1)&&(theOptions_1>=1))&&(theOptions_1>=1))&&(theProducts_0>=1))&&(theOptions_1>=2)))||((((wait_4>=1)&&(theOptions_1>=1))&&(theOptions_0>=1))&&(theProducts_1>=1)))||((((wait_5>=1)&&(theOptions_1>=1))&&(theOptions_0>=1))&&(theProducts_1>=1)))||(((((wait_4>=1)&&(theOptions_1>=1))&&(theOptions_1>=1))&&(theProducts_1>=1))&&(theOptions_1>=2)))||(((((wait_5>=1)&&(theOptions_1>=1))&&(theOptions_1>=1))&&(theProducts_1>=1))&&(theOptions_1>=2)))")U("((((((((((((((((wait_4>=1)&&(theOptions_0>=1))&&(theOptions_0>=1))&&(theProducts_0>=1))&&(theOptions_0>=2))||(((((wait_5>=1)&&(theOptions_0>=1))&&(theOptions_0>=1))&&(theProducts_0>=1))&&(theOptions_0>=2)))||(((((wait_4>=1)&&(theOptions_0>=1))&&(theOptions_0>=1))&&(theProducts_1>=1))&&(theOptions_0>=2)))||(((((wait_5>=1)&&(theOptions_0>=1))&&(theOptions_0>=1))&&(theProducts_1>=1))&&(theOptions_0>=2)))||((((wait_4>=1)&&(theOptions_1>=1))&&(theOptions_0>=1))&&(theProducts_0>=1)))||((((wait_5>=1)&&(theOptions_1>=1))&&(theOptions_0>=1))&&(theProducts_0>=1)))||(((((wait_4>=1)&&(theOptions_1>=1))&&(theOptions_1>=1))&&(theProducts_0>=1))&&(theOptions_1>=2)))||(((((wait_5>=1)&&(theOptions_1>=1))&&(theOptions_1>=1))&&(theProducts_0>=1))&&(theOptions_1>=2)))||((((wait_4>=1)&&(theOptions_1>=1))&&(theOptions_0>=1))&&(theProducts_1>=1)))||((((wait_5>=1)&&(theOptions_1>=1))&&(theOptions_0>=1))&&(theProducts_1>=1)))||(((((wait_4>=1)&&(theOptions_1>=1))&&(theOptions_1>=1))&&(theProducts_1>=1))&&(theOptions_1>=2)))||(((((wait_5>=1)&&(theOptions_1>=1))&&(theOptions_1>=1))&&(theProducts_1>=1))&&(theOptions_1>=2)))"))))))
Formula 2 simplified : !FXG"((((((((((((((((wait_4>=1)&&(theOptions_0>=1))&&(theOptions_0>=1))&&(theProducts_0>=1))&&(theOptions_0>=2))||(((((wait_5>=1)&&(theOptions_0>=1))&&(theOptions_0>=1))&&(theProducts_0>=1))&&(theOptions_0>=2)))||(((((wait_4>=1)&&(theOptions_0>=1))&&(theOptions_0>=1))&&(theProducts_1>=1))&&(theOptions_0>=2)))||(((((wait_5>=1)&&(theOptions_0>=1))&&(theOptions_0>=1))&&(theProducts_1>=1))&&(theOptions_0>=2)))||((((wait_4>=1)&&(theOptions_1>=1))&&(theOptions_0>=1))&&(theProducts_0>=1)))||((((wait_5>=1)&&(theOptions_1>=1))&&(theOptions_0>=1))&&(theProducts_0>=1)))||(((((wait_4>=1)&&(theOptions_1>=1))&&(theOptions_1>=1))&&(theProducts_0>=1))&&(theOptions_1>=2)))||(((((wait_5>=1)&&(theOptions_1>=1))&&(theOptions_1>=1))&&(theProducts_0>=1))&&(theOptions_1>=2)))||((((wait_4>=1)&&(theOptions_1>=1))&&(theOptions_0>=1))&&(theProducts_1>=1)))||((((wait_5>=1)&&(theOptions_1>=1))&&(theOptions_0>=1))&&(theProducts_1>=1)))||(((((wait_4>=1)&&(theOptions_1>=1))&&(theOptions_1>=1))&&(theProducts_1>=1))&&(theOptions_1>=2)))||(((((wait_5>=1)&&(theOptions_1>=1))&&(theOptions_1>=1))&&(theProducts_1>=1))&&(theOptions_1>=2)))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
12 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.455484,24428,1,0,105,28122,36,46,944,38139,265
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((((X("((((((((((theProducts_0>=1)&&(wait_2>=1))&&(theOptions_0>=1))||(((theProducts_0>=1)&&(wait_3>=1))&&(theOptions_0>=1)))||(((theProducts_1>=1)&&(wait_2>=1))&&(theOptions_0>=1)))||(((theProducts_1>=1)&&(wait_3>=1))&&(theOptions_0>=1)))||(((theProducts_0>=1)&&(wait_2>=1))&&(theOptions_1>=1)))||(((theProducts_0>=1)&&(wait_3>=1))&&(theOptions_1>=1)))||(((theProducts_1>=1)&&(wait_2>=1))&&(theOptions_1>=1)))||(((theProducts_1>=1)&&(wait_3>=1))&&(theOptions_1>=1)))"))U(F("((((((((ready_0>=1)||(ready_1>=1))||(ready_2>=1))||(ready_3>=1))||(ready_4>=1))||(ready_5>=1))||(ready_6>=1))||(ready_7>=1))")))U(("((((((((((theProducts_0>=1)&&(wait_2>=1))&&(theOptions_0>=1))||(((theProducts_0>=1)&&(wait_3>=1))&&(theOptions_0>=1)))||(((theProducts_1>=1)&&(wait_2>=1))&&(theOptions_0>=1)))||(((theProducts_1>=1)&&(wait_3>=1))&&(theOptions_0>=1)))||(((theProducts_0>=1)&&(wait_2>=1))&&(theOptions_1>=1)))||(((theProducts_0>=1)&&(wait_3>=1))&&(theOptions_1>=1)))||(((theProducts_1>=1)&&(wait_2>=1))&&(theOptions_1>=1)))||(((theProducts_1>=1)&&(wait_3>=1))&&(theOptions_1>=1)))")U(X("((((((((((((((((wait_4>=1)&&(theOptions_0>=1))&&(theOptions_0>=1))&&(theProducts_0>=1))&&(theOptions_0>=2))||(((((wait_5>=1)&&(theOptions_0>=1))&&(theOptions_0>=1))&&(theProducts_0>=1))&&(theOptions_0>=2)))||(((((wait_4>=1)&&(theOptions_0>=1))&&(theOptions_0>=1))&&(theProducts_1>=1))&&(theOptions_0>=2)))||(((((wait_5>=1)&&(theOptions_0>=1))&&(theOptions_0>=1))&&(theProducts_1>=1))&&(theOptions_0>=2)))||((((wait_4>=1)&&(theOptions_1>=1))&&(theOptions_0>=1))&&(theProducts_0>=1)))||((((wait_5>=1)&&(theOptions_1>=1))&&(theOptions_0>=1))&&(theProducts_0>=1)))||(((((wait_4>=1)&&(theOptions_1>=1))&&(theOptions_1>=1))&&(theProducts_0>=1))&&(theOptions_1>=2)))||(((((wait_5>=1)&&(theOptions_1>=1))&&(theOptions_1>=1))&&(theProducts_0>=1))&&(theOptions_1>=2)))||((((wait_4>=1)&&(theOptions_1>=1))&&(theOptions_0>=1))&&(theProducts_1>=1)))||((((wait_5>=1)&&(theOptions_1>=1))&&(theOptions_0>=1))&&(theProducts_1>=1)))||(((((wait_4>=1)&&(theOptions_1>=1))&&(theOptions_1>=1))&&(theProducts_1>=1))&&(theOptions_1>=2)))||(((((wait_5>=1)&&(theOptions_1>=1))&&(theOptions_1>=1))&&(theProducts_1>=1))&&(theOptions_1>=2)))")))))
Formula 3 simplified : !((X"((((((((((theProducts_0>=1)&&(wait_2>=1))&&(theOptions_0>=1))||(((theProducts_0>=1)&&(wait_3>=1))&&(theOptions_0>=1)))||(((theProducts_1>=1)&&(wait_2>=1))&&(theOptions_0>=1)))||(((theProducts_1>=1)&&(wait_3>=1))&&(theOptions_0>=1)))||(((theProducts_0>=1)&&(wait_2>=1))&&(theOptions_1>=1)))||(((theProducts_0>=1)&&(wait_3>=1))&&(theOptions_1>=1)))||(((theProducts_1>=1)&&(wait_2>=1))&&(theOptions_1>=1)))||(((theProducts_1>=1)&&(wait_3>=1))&&(theOptions_1>=1)))" U F"((((((((ready_0>=1)||(ready_1>=1))||(ready_2>=1))||(ready_3>=1))||(ready_4>=1))||(ready_5>=1))||(ready_6>=1))||(ready_7>=1))") U ("((((((((((theProducts_0>=1)&&(wait_2>=1))&&(theOptions_0>=1))||(((theProducts_0>=1)&&(wait_3>=1))&&(theOptions_0>=1)))||(((theProducts_1>=1)&&(wait_2>=1))&&(theOptions_0>=1)))||(((theProducts_1>=1)&&(wait_3>=1))&&(theOptions_0>=1)))||(((theProducts_0>=1)&&(wait_2>=1))&&(theOptions_1>=1)))||(((theProducts_0>=1)&&(wait_3>=1))&&(theOptions_1>=1)))||(((theProducts_1>=1)&&(wait_2>=1))&&(theOptions_1>=1)))||(((theProducts_1>=1)&&(wait_3>=1))&&(theOptions_1>=1)))" U X"((((((((((((((((wait_4>=1)&&(theOptions_0>=1))&&(theOptions_0>=1))&&(theProducts_0>=1))&&(theOptions_0>=2))||(((((wait_5>=1)&&(theOptions_0>=1))&&(theOptions_0>=1))&&(theProducts_0>=1))&&(theOptions_0>=2)))||(((((wait_4>=1)&&(theOptions_0>=1))&&(theOptions_0>=1))&&(theProducts_1>=1))&&(theOptions_0>=2)))||(((((wait_5>=1)&&(theOptions_0>=1))&&(theOptions_0>=1))&&(theProducts_1>=1))&&(theOptions_0>=2)))||((((wait_4>=1)&&(theOptions_1>=1))&&(theOptions_0>=1))&&(theProducts_0>=1)))||((((wait_5>=1)&&(theOptions_1>=1))&&(theOptions_0>=1))&&(theProducts_0>=1)))||(((((wait_4>=1)&&(theOptions_1>=1))&&(theOptions_1>=1))&&(theProducts_0>=1))&&(theOptions_1>=2)))||(((((wait_5>=1)&&(theOptions_1>=1))&&(theOptions_1>=1))&&(theProducts_0>=1))&&(theOptions_1>=2)))||((((wait_4>=1)&&(theOptions_1>=1))&&(theOptions_0>=1))&&(theProducts_1>=1)))||((((wait_5>=1)&&(theOptions_1>=1))&&(theOptions_0>=1))&&(theProducts_1>=1)))||(((((wait_4>=1)&&(theOptions_1>=1))&&(theOptions_1>=1))&&(theProducts_1>=1))&&(theOptions_1>=2)))||(((((wait_5>=1)&&(theOptions_1>=1))&&(theOptions_1>=1))&&(theProducts_1>=1))&&(theOptions_1>=2)))"))
4 unique states visited
2 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
8 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.536901,26976,1,0,143,32879,55,61,999,46221,365
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(F(G("((optionSlots_0>=1)||(optionSlots_1>=1))")))))
Formula 4 simplified : !FG"((optionSlots_0>=1)||(optionSlots_1>=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
11 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.64655,29348,1,0,218,40925,68,91,1003,57760,527
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((true))
Formula 5 simplified : 0
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.647165,29348,1,0,218,40925,68,91,1003,57760,527
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-COL-02-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((true))
Formula 6 simplified : 0
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.647702,29348,1,0,218,40925,68,91,1003,57760,527
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-COL-02-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(G("((((((((((theProducts_0>=1)&&(wait_2>=1))&&(theOptions_0>=1))||(((theProducts_0>=1)&&(wait_3>=1))&&(theOptions_0>=1)))||(((theProducts_1>=1)&&(wait_2>=1))&&(theOptions_0>=1)))||(((theProducts_1>=1)&&(wait_3>=1))&&(theOptions_0>=1)))||(((theProducts_0>=1)&&(wait_2>=1))&&(theOptions_1>=1)))||(((theProducts_0>=1)&&(wait_3>=1))&&(theOptions_1>=1)))||(((theProducts_1>=1)&&(wait_2>=1))&&(theOptions_1>=1)))||(((theProducts_1>=1)&&(wait_3>=1))&&(theOptions_1>=1)))"))))
Formula 7 simplified : !FG"((((((((((theProducts_0>=1)&&(wait_2>=1))&&(theOptions_0>=1))||(((theProducts_0>=1)&&(wait_3>=1))&&(theOptions_0>=1)))||(((theProducts_1>=1)&&(wait_2>=1))&&(theOptions_0>=1)))||(((theProducts_1>=1)&&(wait_3>=1))&&(theOptions_0>=1)))||(((theProducts_0>=1)&&(wait_2>=1))&&(theOptions_1>=1)))||(((theProducts_0>=1)&&(wait_3>=1))&&(theOptions_1>=1)))||(((theProducts_1>=1)&&(wait_2>=1))&&(theOptions_1>=1)))||(((theProducts_1>=1)&&(wait_3>=1))&&(theOptions_1>=1)))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
9 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.737745,30404,1,0,273,46340,79,117,1013,65714,657
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(X(F(("((optionSlots_0>=1)||(optionSlots_1>=1))")U("((productSlots_0>=1)||(productSlots_1>=1))"))))))
Formula 8 simplified : !FXF("((optionSlots_0>=1)||(optionSlots_1>=1))" U "((productSlots_0>=1)||(productSlots_1>=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.73868,30404,1,0,273,46340,88,117,1017,65715,661
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-COL-02-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F((F(X("(((((theProducts_0>=1)&&(wait_0>=1))||((theProducts_0>=1)&&(wait_1>=1)))||((theProducts_1>=1)&&(wait_0>=1)))||((theProducts_1>=1)&&(wait_1>=1)))")))U(X(X("(((((theProducts_0>=1)&&(wait_0>=1))||((theProducts_0>=1)&&(wait_1>=1)))||((theProducts_1>=1)&&(wait_0>=1)))||((theProducts_1>=1)&&(wait_1>=1)))"))))))
Formula 9 simplified : !F(FX"(((((theProducts_0>=1)&&(wait_0>=1))||((theProducts_0>=1)&&(wait_1>=1)))||((theProducts_1>=1)&&(wait_0>=1)))||((theProducts_1>=1)&&(wait_1>=1)))" U XX"(((((theProducts_0>=1)&&(wait_0>=1))||((theProducts_0>=1)&&(wait_1>=1)))||((theProducts_1>=1)&&(wait_0>=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
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.811343,32252,1,0,322,52778,94,135,1017,79620,753
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((("((((((((ready_0>=1)||(ready_1>=1))||(ready_2>=1))||(ready_3>=1))||(ready_4>=1))||(ready_5>=1))||(ready_6>=1))||(ready_7>=1))")U((G("((((((((ready_0>=1)||(ready_1>=1))||(ready_2>=1))||(ready_3>=1))||(ready_4>=1))||(ready_5>=1))||(ready_6>=1))||(ready_7>=1))"))U("(((((theProducts_0>=1)&&(wait_0>=1))||((theProducts_0>=1)&&(wait_1>=1)))||((theProducts_1>=1)&&(wait_0>=1)))||((theProducts_1>=1)&&(wait_1>=1)))"))))
Formula 10 simplified : !("((((((((ready_0>=1)||(ready_1>=1))||(ready_2>=1))||(ready_3>=1))||(ready_4>=1))||(ready_5>=1))||(ready_6>=1))||(ready_7>=1))" U (G"((((((((ready_0>=1)||(ready_1>=1))||(ready_2>=1))||(ready_3>=1))||(ready_4>=1))||(ready_5>=1))||(ready_6>=1))||(ready_7>=1))" U "(((((theProducts_0>=1)&&(wait_0>=1))||((theProducts_0>=1)&&(wait_1>=1)))||((theProducts_1>=1)&&(wait_0>=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.814532,32676,1,0,322,52778,100,135,1029,79620,757
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-COL-02-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((true))
Formula 11 simplified : 0
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.814737,32676,1,0,322,52778,100,135,1029,79620,757
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-COL-02-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((("(((((theProducts_0>=1)&&(wait_0>=1))||((theProducts_0>=1)&&(wait_1>=1)))||((theProducts_1>=1)&&(wait_0>=1)))||((theProducts_1>=1)&&(wait_1>=1)))")U(F(X(G("((((((((((theProducts_0>=1)&&(wait_2>=1))&&(theOptions_0>=1))||(((theProducts_0>=1)&&(wait_3>=1))&&(theOptions_0>=1)))||(((theProducts_1>=1)&&(wait_2>=1))&&(theOptions_0>=1)))||(((theProducts_1>=1)&&(wait_3>=1))&&(theOptions_0>=1)))||(((theProducts_0>=1)&&(wait_2>=1))&&(theOptions_1>=1)))||(((theProducts_0>=1)&&(wait_3>=1))&&(theOptions_1>=1)))||(((theProducts_1>=1)&&(wait_2>=1))&&(theOptions_1>=1)))||(((theProducts_1>=1)&&(wait_3>=1))&&(theOptions_1>=1)))"))))))
Formula 12 simplified : !("(((((theProducts_0>=1)&&(wait_0>=1))||((theProducts_0>=1)&&(wait_1>=1)))||((theProducts_1>=1)&&(wait_0>=1)))||((theProducts_1>=1)&&(wait_1>=1)))" U FXG"((((((((((theProducts_0>=1)&&(wait_2>=1))&&(theOptions_0>=1))||(((theProducts_0>=1)&&(wait_3>=1))&&(theOptions_0>=1)))||(((theProducts_1>=1)&&(wait_2>=1))&&(theOptions_0>=1)))||(((theProducts_1>=1)&&(wait_3>=1))&&(theOptions_0>=1)))||(((theProducts_0>=1)&&(wait_2>=1))&&(theOptions_1>=1)))||(((theProducts_0>=1)&&(wait_3>=1))&&(theOptions_1>=1)))||(((theProducts_1>=1)&&(wait_2>=1))&&(theOptions_1>=1)))||(((theProducts_1>=1)&&(wait_3>=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.81961,32676,1,0,326,52840,100,137,1029,79758,768
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((false))
Formula 13 simplified : 1
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.827152,32676,1,0,326,53127,100,137,1029,80762,770
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F(G(G(("((productSlots_0>=1)||(productSlots_1>=1))")U("((((((((ready_0>=1)||(ready_1>=1))||(ready_2>=1))||(ready_3>=1))||(ready_4>=1))||(ready_5>=1))||(ready_6>=1))||(ready_7>=1))"))))))
Formula 14 simplified : !FG("((productSlots_0>=1)||(productSlots_1>=1))" U "((((((((ready_0>=1)||(ready_1>=1))||(ready_2>=1))||(ready_3>=1))||(ready_4>=1))||(ready_5>=1))||(ready_6>=1))||(ready_7>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.843264,33132,1,0,329,54191,112,137,1038,82010,792
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(((X(X("((productSlots_0>=1)||(productSlots_1>=1))")))U((X("((productSlots_0>=1)||(productSlots_1>=1))"))U("(((((theProducts_0>=1)&&(wait_0>=1))||((theProducts_0>=1)&&(wait_1>=1)))||((theProducts_1>=1)&&(wait_0>=1)))||((theProducts_1>=1)&&(wait_1>=1)))"))))
Formula 15 simplified : !(XX"((productSlots_0>=1)||(productSlots_1>=1))" U (X"((productSlots_0>=1)||(productSlots_1>=1))" U "(((((theProducts_0>=1)&&(wait_0>=1))||((theProducts_0>=1)&&(wait_1>=1)))||((theProducts_1>=1)&&(wait_0>=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.845373,33376,1,0,329,54191,112,137,1038,82010,794
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-COL-02-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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 1553548403775

--------------------
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
+ 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 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Mar 25, 2019 9:13:18 PM 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/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt]
Mar 25, 2019 9:13:18 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 25, 2019 9:13:18 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
Mar 25, 2019 9:13:20 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 1258 ms
Mar 25, 2019 9:13:20 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 6 places.
Mar 25, 2019 9:13:20 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Mar 25, 2019 9:13:20 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Options->theOptions,optionSlots,
Products->theProducts,productSlots,
Quality->ready,wait,

Mar 25, 2019 9:13:20 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer detectBindingSymmetry
INFO: o1 symmetric to o2 in transition elaborate3
Mar 25, 2019 9:13:20 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer detectBindingSymmetry
INFO: o2 symmetric to o3 in transition elaborate3
Mar 25, 2019 9:13:20 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer detectBindingSymmetry
INFO: o1 symmetric to o2 in transition elaborate2
Mar 25, 2019 9:13:20 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 7 transitions.
Mar 25, 2019 9:13:20 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Mar 25, 2019 9:13:20 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 10 ms
Mar 25, 2019 9:13:20 PM fr.lip6.move.gal.instantiate.Instantiator instantiateParameters
INFO: On-the-fly reduction of False transitions avoided exploring 176.0 instantiations of transitions. Total transitions/syncs built is 52
Mar 25, 2019 9:13:20 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 100 ms
Mar 25, 2019 9:13:21 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 43 ms
Mar 25, 2019 9:13:21 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was not deterministic with 42 transitions. Expanding to a total of 76 deterministic transitions.
Mar 25, 2019 9:13:21 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Determinization took 6 ms.
Mar 25, 2019 9:13:21 PM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 24 places.
Mar 25, 2019 9:13:21 PM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 52 transitions.
Mar 25, 2019 9:13:21 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was not deterministic with 42 transitions. Expanding to a total of 76 deterministic transitions.
Mar 25, 2019 9:13:21 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Determinization took 2 ms.
Mar 25, 2019 9:13:21 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 15 ms
Mar 25, 2019 9:13:21 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 7 ms
Mar 25, 2019 9:13:21 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 12 place invariants in 14 ms
Mar 25, 2019 9:13:21 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 24 variables to be positive in 173 ms
Mar 25, 2019 9:13:21 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 52 transitions.
Mar 25, 2019 9:13:21 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/52 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 25, 2019 9:13:21 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 25, 2019 9:13:21 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 52 transitions.
Mar 25, 2019 9:13:21 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 25, 2019 9:13:22 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (and (and (and (and (and (and (>= (select s0 20) 1) (>= (select s0 17) 1)) (>= (select s0 15) 1)) (>= (select s0 20) 2)) (>= (select s0 20) 2)) (>= (select s0 20) 2)) (>= (select s0 20) 1) (>= (select (store s0 20 (- (select s0 20) 1)) 20) 1) (>= (select (store (store s0 20 (- (select s0 20) 1)) 20 (- (select (store s0 20 (- (select s0 20) 1)) 20) 1)) 20) 1)) (= (store (store (store (store (store (store (store (store (store (store s0 20 (- (select s0 20) 1)) 20 (- (select (store s0 20 (- (select s0 20) 1)) 20) 1)) 20 (- (select (store (store s0 20 (- (select s0 20) 1)) 20 (- (select (store s0 20 (- (select s0 20) 1)) 20) 1)) 20) 1)) 17 (- (select s0 17) 1)) 15 (- (select s0 15) 1)) 7 (+ (select s0 7) 1)) 19 (+ (select s0 19) 1)) 22 (+ (select s0 22) 1)) 22 (+ (select (store (store (store (store (store (store (store (store s0 20 (- (select s0 20) 1)) 20 (- (select (store s0 20 (- (select s0 20) 1)) 20) 1)) 20 (- (select (store (store s0 20 (- (select s0 20) 1)) 20 (- (select (store s0 20 (- (select s0 20) 1)) 20) 1)) 20) 1)) 17 (- (select s0 17) 1)) 15 (- (select s0 15) 1)) 7 (+ (select s0 7) 1)) 19 (+ (select s0 19) 1)) 22 (+ (select s0 22) 1)) 22) 1)) 22 (+ (select (store (store (store (store (store (store (store (store (store s0 20 (- (select s0 20) 1)) 20 (- (select (store s0 20 (- (select s0 20) 1)) 20) 1)) 20 (- (select (store (store s0 20 (- (select s0 20) 1)) 20 (- (select (store s0 20 (- (select s0 20) 1)) 20) 1)) 20) 1)) 17 (- (select s0 17) 1)) 15 (- (select s0 15) 1)) 7 (+ (select s0 7) 1)) 19 (+ (select s0 19) 1)) 22 (+ (select s0 22) 1)) 22 (+ (select (store (store (store (store (store (store (store (store s0 20 (- (select s0 20) 1)) 20 (- (select (store s0 20 (- (select s0 20) 1)) 20) 1)) 20 (- (select (store (store s0 20 (- (select s0 20) 1)) 20 (- (select (store s0 20 (- (select s0 20) 1)) 20) 1)) 20) 1)) 17 (- (select s0 17) 1)) 15 (- (select s0 15) 1)) 7 (+ (select s0 7) 1)) 19 (+ (select s0 19) 1)) 22 (+ (select s0 22) 1)) 22) 1)) 22) 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:755)
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:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Mar 25, 2019 9:13:22 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 1220ms 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-COL-02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstoolsm"
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 itstoolsm"
echo " Input is DrinkVendingMachine-COL-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 r194-smll-155234738900007"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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