About the Execution of 2023-gold for RobotManipulation-PT-01000
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.r351-tall-171679101700141.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 RobotManipulation-PT-01000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-tall-171679101700141
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 18:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 11 18:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 11 18:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 11 18:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 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 RobotManipulation-PT-01000-UpperBounds-00
FORMULA_NAME RobotManipulation-PT-01000-UpperBounds-01
FORMULA_NAME RobotManipulation-PT-01000-UpperBounds-02
FORMULA_NAME RobotManipulation-PT-01000-UpperBounds-03
FORMULA_NAME RobotManipulation-PT-01000-UpperBounds-04
FORMULA_NAME RobotManipulation-PT-01000-UpperBounds-05
FORMULA_NAME RobotManipulation-PT-01000-UpperBounds-06
FORMULA_NAME RobotManipulation-PT-01000-UpperBounds-07
FORMULA_NAME RobotManipulation-PT-01000-UpperBounds-08
FORMULA_NAME RobotManipulation-PT-01000-UpperBounds-09
FORMULA_NAME RobotManipulation-PT-01000-UpperBounds-10
FORMULA_NAME RobotManipulation-PT-01000-UpperBounds-11
FORMULA_NAME RobotManipulation-PT-01000-UpperBounds-12
FORMULA_NAME RobotManipulation-PT-01000-UpperBounds-13
FORMULA_NAME RobotManipulation-PT-01000-UpperBounds-14
FORMULA_NAME RobotManipulation-PT-01000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716858503819
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=RobotManipulation-PT-01000
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-28 01:08:32] [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-28 01:08:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 01:08:32] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2024-05-28 01:08:32] [INFO ] Transformed 15 places.
[2024-05-28 01:08:32] [INFO ] Transformed 11 transitions.
[2024-05-28 01:08:32] [INFO ] Parsed PT model containing 15 places and 11 transitions and 34 arcs in 94 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 11 rows 15 cols
[2024-05-28 01:08:32] [INFO ] Computed 6 invariants in 8 ms
FORMULA RobotManipulation-PT-01000-UpperBounds-08 2001 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10010 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1112 ) properties (out of 15) seen :12001
FORMULA RobotManipulation-PT-01000-UpperBounds-13 2000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RobotManipulation-PT-01000-UpperBounds-06 2000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RobotManipulation-PT-01000-UpperBounds-00 2001 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 12) seen :2070
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :2212
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :2204
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 12) seen :2121
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 12) seen :2954
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :2222
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 12) seen :2099
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 12) seen :2214
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 12) seen :2193
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 12) seen :2219
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 12) seen :2246
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 12) seen :2954
[2024-05-28 01:08:32] [INFO ] Invariant cache hit.
[2024-05-28 01:08:32] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 01:08:32] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned unsat
[2024-05-28 01:08:32] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 01:08:32] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 01:08:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 01:08:32] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-28 01:08:32] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 01:08:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:08:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 01:08:32] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 01:08:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 01:08:32] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-28 01:08:32] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-28 01:08:32] [INFO ] Added : 8 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 19 ms.
[2024-05-28 01:08:32] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 01:08:32] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 01:08:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 01:08:32] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-28 01:08:32] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-28 01:08:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:08:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 01:08:32] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 01:08:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 01:08:32] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-28 01:08:32] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-28 01:08:32] [INFO ] Added : 8 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 606 ms.
[2024-05-28 01:08:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 01:08:33] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 01:08:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 01:08:33] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-28 01:08:33] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-28 01:08:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:08:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 01:08:33] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-28 01:08:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 01:08:33] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-28 01:08:33] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-28 01:08:33] [INFO ] Added : 8 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2024-05-28 01:08:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 01:08:33] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned unsat
[2024-05-28 01:08:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 01:08:33] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 01:08:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 01:08:33] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-28 01:08:33] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-28 01:08:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:08:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 01:08:33] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 01:08:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 01:08:33] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-28 01:08:33] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-28 01:08:33] [INFO ] Added : 8 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2024-05-28 01:08:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 01:08:33] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 01:08:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 01:08:33] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-28 01:08:33] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-28 01:08:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:08:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 01:08:33] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 01:08:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 01:08:33] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-28 01:08:33] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-28 01:08:33] [INFO ] Added : 8 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-05-28 01:08:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 01:08:33] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 01:08:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 01:08:33] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-28 01:08:33] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-28 01:08:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:08:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-28 01:08:33] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 01:08:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 01:08:33] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-28 01:08:33] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-28 01:08:33] [INFO ] Added : 8 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2024-05-28 01:08:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 01:08:33] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 01:08:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 01:08:33] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-28 01:08:33] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-28 01:08:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:08:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 01:08:33] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 01:08:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 01:08:33] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-28 01:08:33] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-28 01:08:33] [INFO ] Added : 9 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 13 ms.
[2024-05-28 01:08:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 01:08:33] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 01:08:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 01:08:33] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-28 01:08:33] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-28 01:08:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:08:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 01:08:33] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 01:08:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 01:08:33] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-28 01:08:33] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-28 01:08:33] [INFO ] Added : 8 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2024-05-28 01:08:33] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-28 01:08:33] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 01:08:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 01:08:33] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-28 01:08:33] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-28 01:08:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:08:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 01:08:33] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 01:08:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 01:08:33] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-28 01:08:33] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-28 01:08:33] [INFO ] Added : 8 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2024-05-28 01:08:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 01:08:33] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned unsat
Current structural bounds on expressions (after SMT) : [2000, 2001, 2001, 2001, 2000, 2000, 2001, 2000, 4001, 2000, 2001, 2000] Max seen :[2000, 210, 57, 57, 2000, 45, 33, 45, 150, 45, 57, 2000]
FORMULA RobotManipulation-PT-01000-UpperBounds-15 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-01000-UpperBounds-05 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-01000-UpperBounds-01 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-01000-UpperBounds-12 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA RobotManipulation-PT-01000-UpperBounds-10 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA RobotManipulation-PT-01000-UpperBounds-07 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 13 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 13 transition count 9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 12 transition count 9
Applied a total of 5 rules in 120 ms. Remains 12 /15 variables (removed 3) and now considering 9/11 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 12/15 places, 9/11 transitions.
// Phase 1: matrix 9 rows 12 cols
[2024-05-28 01:08:38] [INFO ] Computed 5 invariants in 1 ms
FORMULA RobotManipulation-PT-01000-UpperBounds-11 2000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 1000507 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=6539 ) properties (out of 5) seen :10000
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 247 ms. (steps per millisecond=4048 ) properties (out of 5) seen :2004
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 272 ms. (steps per millisecond=3676 ) properties (out of 5) seen :6017
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 263 ms. (steps per millisecond=3802 ) properties (out of 5) seen :2037
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=4405 ) properties (out of 5) seen :2058
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=4484 ) properties (out of 5) seen :6013
[2024-05-28 01:08:40] [INFO ] Invariant cache hit.
[2024-05-28 01:08:40] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 01:08:40] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned unsat
[2024-05-28 01:08:40] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 01:08:40] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned unsat
[2024-05-28 01:08:40] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 01:08:40] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned unsat
[2024-05-28 01:08:40] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 01:08:40] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned unsat
[2024-05-28 01:08:40] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 01:08:40] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned unsat
Current structural bounds on expressions (after SMT) : [2000, 2000, 2000, 2000, 2000] Max seen :[2000, 2000, 2000, 2000, 2000]
FORMULA RobotManipulation-PT-01000-UpperBounds-14 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-01000-UpperBounds-09 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-01000-UpperBounds-04 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-01000-UpperBounds-03 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-01000-UpperBounds-02 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 8269 ms.
BK_STOP 1716858526521
--------------------
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="RobotManipulation-PT-01000"
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 RobotManipulation-PT-01000, 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 r351-tall-171679101700141"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-01000.tgz
mv RobotManipulation-PT-01000 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 '
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 ;