fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r153-tall-171631151800436
Last Updated
July 7, 2024

About the Execution of 2023-gold for DrinkVendingMachine-COL-98

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
216.304 4764.00 7448.00 445.50 98 98 98 392 98 392 392 98 392 98 98 98 98 98 98 98 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r153-tall-171631151800436.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is DrinkVendingMachine-COL-98, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151800436
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 8.1K Apr 12 23:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 12 23:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 23:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 23:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 23:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 23:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 12 23:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 12 23:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 48K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DrinkVendingMachine-COL-98-UpperBounds-00
FORMULA_NAME DrinkVendingMachine-COL-98-UpperBounds-01
FORMULA_NAME DrinkVendingMachine-COL-98-UpperBounds-02
FORMULA_NAME DrinkVendingMachine-COL-98-UpperBounds-03
FORMULA_NAME DrinkVendingMachine-COL-98-UpperBounds-04
FORMULA_NAME DrinkVendingMachine-COL-98-UpperBounds-05
FORMULA_NAME DrinkVendingMachine-COL-98-UpperBounds-06
FORMULA_NAME DrinkVendingMachine-COL-98-UpperBounds-07
FORMULA_NAME DrinkVendingMachine-COL-98-UpperBounds-08
FORMULA_NAME DrinkVendingMachine-COL-98-UpperBounds-09
FORMULA_NAME DrinkVendingMachine-COL-98-UpperBounds-10
FORMULA_NAME DrinkVendingMachine-COL-98-UpperBounds-11
FORMULA_NAME DrinkVendingMachine-COL-98-UpperBounds-12
FORMULA_NAME DrinkVendingMachine-COL-98-UpperBounds-13
FORMULA_NAME DrinkVendingMachine-COL-98-UpperBounds-14
FORMULA_NAME DrinkVendingMachine-COL-98-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716449426027

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DrinkVendingMachine-COL-98
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202304061127
[2024-05-23 07:30:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 07:30:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 07:30:27] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-23 07:30:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-23 07:30:28] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 668 ms
[2024-05-23 07:30:28] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 1176 PT places and 3.6529582908E10 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2024-05-23 07:30:28] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 28 arcs in 4 ms.
[2024-05-23 07:30:28] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
// Phase 1: matrix 7 rows 6 cols
[2024-05-23 07:30:28] [INFO ] Computed 3 invariants in 6 ms
FORMULA DrinkVendingMachine-COL-98-UpperBounds-15 98 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DrinkVendingMachine-COL-98-UpperBounds-14 98 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DrinkVendingMachine-COL-98-UpperBounds-13 98 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DrinkVendingMachine-COL-98-UpperBounds-09 98 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DrinkVendingMachine-COL-98-UpperBounds-05 392 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DrinkVendingMachine-COL-98-UpperBounds-02 98 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DrinkVendingMachine-COL-98-UpperBounds-00 98 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-23 07:30:28] [INFO ] Invariant cache hit.
[2024-05-23 07:30:28] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 07:30:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 07:30:28] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-23 07:30:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:30:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 07:30:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 07:30:28] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-23 07:30:28] [INFO ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 07:30:28] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 8 ms.
[2024-05-23 07:30:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 07:30:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 07:30:28] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-23 07:30:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:30:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 07:30:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 07:30:28] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-23 07:30:28] [INFO ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 07:30:28] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2024-05-23 07:30:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 07:30:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 07:30:28] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-23 07:30:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:30:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 07:30:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 07:30:28] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-23 07:30:28] [INFO ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 07:30:28] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2024-05-23 07:30:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 07:30:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 07:30:28] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-23 07:30:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:30:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 07:30:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 07:30:28] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-23 07:30:28] [INFO ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 07:30:28] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2024-05-23 07:30:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 07:30:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 07:30:28] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-23 07:30:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:30:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 07:30:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 07:30:28] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-23 07:30:28] [INFO ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 07:30:28] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2024-05-23 07:30:28] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 07:30:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 07:30:28] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-23 07:30:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:30:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 07:30:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 07:30:28] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-23 07:30:28] [INFO ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-23 07:30:28] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2024-05-23 07:30:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 07:30:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 07:30:28] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-23 07:30:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:30:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 07:30:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 07:30:28] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-23 07:30:28] [INFO ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 07:30:28] [INFO ] Added : 3 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 3 ms.
[2024-05-23 07:30:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 07:30:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 07:30:28] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-23 07:30:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:30:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 07:30:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 07:30:28] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-23 07:30:28] [INFO ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 07:30:28] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2024-05-23 07:30:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 07:30:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 07:30:28] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-23 07:30:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:30:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 07:30:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 07:30:29] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-23 07:30:29] [INFO ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 07:30:29] [INFO ] Added : 3 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [98, 392, 98, 392, 98, 392, 98, 98, 98]
Symmetric sort wr.t. initial and guards and successors and join/free detected :Quality
Symmetric sort wr.t. initial detected :Quality
Transition elaborate0 : guard parameter $x(Quality:392) in guard (LEQ $x 97)introduces in Quality(392) partition with 2 elements
Transition elaborate1 : guard parameter $x(Quality:392) in guard (AND (GT $x 97) (LEQ $x 195))introduces in Quality(392) partition with 2 elements
Transition elaborate2 : guard parameter $x(Quality:392) in guard (AND (GT $x 195) (LEQ $x 293))introduces in Quality(392) partition with 2 elements
Transition elaborate3 : guard parameter $x(Quality:392) in guard (AND (GT $x 293) (LEQ $x 391))introduces in Quality(392) partition with 2 elements
Sort wr.t. initial and guards Quality has partition 4
Applying symmetric unfolding of partitioned symmetric sort :Quality domain size was 392 reducing to 4 values.
For transition elaborate0:(LEQ $x 97) -> (EQ $x 3)
For transition elaborate1:(AND (GT $x 97) (LEQ $x 195)) -> (EQ $x 2)
For transition elaborate2:(AND (GT $x 195) (LEQ $x 293)) -> (EQ $x 1)
For transition elaborate3:(AND (GT $x 293) (LEQ $x 391)) -> (EQ $x 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Options
Symmetric sort wr.t. initial detected :Options
Symmetric sort wr.t. initial and guards detected :Options
Applying symmetric unfolding of full symmetric sort :Options domain size was 98
Symmetric sort wr.t. initial and guards and successors and join/free detected :Products
Symmetric sort wr.t. initial detected :Products
Symmetric sort wr.t. initial and guards detected :Products
Applying symmetric unfolding of full symmetric sort :Products domain size was 98
[2024-05-23 07:30:29] [INFO ] Unfolded HLPN to a Petri net with 12 places and 10 transitions 34 arcs in 40 ms.
[2024-05-23 07:30:29] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :1224
FORMULA DrinkVendingMachine-COL-98-UpperBounds-12 98 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-COL-98-UpperBounds-11 98 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-COL-98-UpperBounds-10 98 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-COL-98-UpperBounds-07 98 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-COL-98-UpperBounds-04 98 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-COL-98-UpperBounds-01 98 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :603
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :606
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :594
// Phase 1: matrix 10 rows 12 cols
[2024-05-23 07:30:29] [INFO ] Computed 6 invariants in 1 ms
[2024-05-23 07:30:29] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-23 07:30:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 07:30:29] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-23 07:30:29] [INFO ] Computed and/alt/rep : 6/11/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 07:30:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:30:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-23 07:30:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 07:30:29] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-23 07:30:29] [INFO ] Computed and/alt/rep : 6/11/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 07:30:29] [INFO ] Added : 3 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2024-05-23 07:30:29] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-23 07:30:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 07:30:29] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-23 07:30:29] [INFO ] Computed and/alt/rep : 6/11/6 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 07:30:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:30:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-23 07:30:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 07:30:29] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-23 07:30:29] [INFO ] Computed and/alt/rep : 6/11/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 07:30:29] [INFO ] Added : 3 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2024-05-23 07:30:29] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-23 07:30:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 07:30:29] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-23 07:30:29] [INFO ] Computed and/alt/rep : 6/11/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 07:30:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 07:30:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-23 07:30:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 07:30:29] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-23 07:30:29] [INFO ] Computed and/alt/rep : 6/11/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 07:30:29] [INFO ] Added : 3 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [392, 392, 392] Max seen :[212, 212, 212]
FORMULA DrinkVendingMachine-COL-98-UpperBounds-08 392 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DrinkVendingMachine-COL-98-UpperBounds-06 392 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DrinkVendingMachine-COL-98-UpperBounds-03 392 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 2063 ms.

BK_STOP 1716449430791

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-98"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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-5568"
echo " Executing tool gold2023"
echo " Input is DrinkVendingMachine-COL-98, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r153-tall-171631151800436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DrinkVendingMachine-COL-98.tgz
mv DrinkVendingMachine-COL-98 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;