fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r361-smll-167891810800085
Last Updated
May 14, 2023

About the Execution of LTSMin+red for RobotManipulation-PT-02000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
663.960 24913.00 32554.00 448.80 4000 4000 4001 4000 4000 4000 4000 4001 4001 4000 4000 4000 4000 4000 4000 4000 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r361-smll-167891810800085.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is RobotManipulation-PT-02000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r361-smll-167891810800085
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 7.7K Feb 26 05:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 05:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 05:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 05:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 05:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 05:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 05:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 05:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.4K Mar 5 18:23 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-02000-UpperBounds-00
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-01
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-02
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-03
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-04
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-05
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-06
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-07
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-08
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-09
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-10
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-11
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-12
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-13
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-14
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679024130203

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RobotManipulation-PT-02000
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-17 03:35:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-17 03:35:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 03:35:33] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2023-03-17 03:35:33] [INFO ] Transformed 15 places.
[2023-03-17 03:35:33] [INFO ] Transformed 11 transitions.
[2023-03-17 03:35:33] [INFO ] Parsed PT model containing 15 places and 11 transitions and 34 arcs in 121 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 11 rows 15 cols
[2023-03-17 03:35:33] [INFO ] Computed 6 place invariants in 6 ms
FORMULA RobotManipulation-PT-02000-UpperBounds-15 4000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-02000-UpperBounds-02 4001 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 12008 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=1091 ) properties (out of 14) seen :8002
FORMULA RobotManipulation-PT-02000-UpperBounds-08 4001 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RobotManipulation-PT-02000-UpperBounds-07 4001 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :167
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :322
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :216
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :443
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 :556
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :212
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 :147
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 :354
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 :301
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 :1431
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 12) seen :511
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 :1431
[2023-03-17 03:35:33] [INFO ] Invariant cache hit.
[2023-03-17 03:35:33] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-17 03:35:33] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 03:35:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:35:33] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-17 03:35:33] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-17 03:35:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:35:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-17 03:35:33] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 03:35:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:35:33] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-17 03:35:33] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-17 03:35:33] [INFO ] Added : 8 causal constraints over 2 iterations in 32 ms. Result :sat
Minimization took 10 ms.
[2023-03-17 03:35:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-17 03:35:33] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 03:35:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:35:33] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-17 03:35:33] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-17 03:35:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:35:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-17 03:35:33] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 03:35:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:35:33] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-17 03:35:33] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-17 03:35:33] [INFO ] Added : 8 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 6 ms.
[2023-03-17 03:35:33] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-17 03:35:33] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-17 03:35:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:35:33] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-17 03:35:33] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-17 03:35:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:35:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-17 03:35:33] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 03:35:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:35:33] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-17 03:35:33] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-17 03:35:33] [INFO ] Added : 8 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 6 ms.
[2023-03-17 03:35:34] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-17 03:35:34] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 03:35:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:35:34] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-17 03:35:34] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 03:35:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:35:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-17 03:35:34] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 03:35:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:35:34] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-17 03:35:34] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 03:35:34] [INFO ] Added : 8 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 6 ms.
[2023-03-17 03:35:34] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-17 03:35:34] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 03:35:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:35:34] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-17 03:35:34] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 03:35:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:35:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-17 03:35:34] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-17 03:35:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:35:34] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-17 03:35:34] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-17 03:35:34] [INFO ] Added : 9 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 9 ms.
[2023-03-17 03:35:34] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-17 03:35:34] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 03:35:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:35:34] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-17 03:35:34] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-17 03:35:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:35:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-17 03:35:34] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-17 03:35:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:35:34] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-17 03:35:34] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 03:35:34] [INFO ] Added : 8 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 6 ms.
[2023-03-17 03:35:34] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-17 03:35:34] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 03:35:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:35:34] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-17 03:35:34] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 03:35:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:35:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-17 03:35:34] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-17 03:35:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:35:34] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-17 03:35:34] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-17 03:35:34] [INFO ] Added : 8 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 5 ms.
[2023-03-17 03:35:34] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-17 03:35:34] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 03:35:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:35:34] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-17 03:35:34] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-17 03:35:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:35:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-17 03:35:34] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 6 ms returned sat
[2023-03-17 03:35:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:35:34] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-17 03:35:34] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-17 03:35:34] [INFO ] Added : 8 causal constraints over 2 iterations in 33 ms. Result :sat
Minimization took 5 ms.
[2023-03-17 03:35:34] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-17 03:35:34] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 03:35:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:35:34] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-17 03:35:34] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 03:35:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:35:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-17 03:35:34] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 03:35:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:35:34] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-17 03:35:34] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 03:35:34] [INFO ] Added : 8 causal constraints over 2 iterations in 27 ms. Result :sat
Minimization took 13 ms.
[2023-03-17 03:35:34] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-17 03:35:34] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 6 ms returned sat
[2023-03-17 03:35:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:35:34] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-17 03:35:34] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-17 03:35:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:35:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 30 ms returned sat
[2023-03-17 03:35:34] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 16 ms returned sat
[2023-03-17 03:35:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:35:35] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2023-03-17 03:35:35] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-17 03:35:35] [INFO ] Added : 8 causal constraints over 2 iterations in 39 ms. Result :sat
Minimization took 6 ms.
[2023-03-17 03:35:35] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-17 03:35:35] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 03:35:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:35:35] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-17 03:35:35] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 03:35:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:35:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-17 03:35:35] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 03:35:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:35:35] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-17 03:35:35] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-17 03:35:35] [INFO ] Added : 9 causal constraints over 2 iterations in 29 ms. Result :sat
Minimization took 8 ms.
[2023-03-17 03:35:35] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-17 03:35:35] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 03:35:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 03:35:35] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-17 03:35:35] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 03:35:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 03:35:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-17 03:35:35] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 03:35:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 03:35:35] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-17 03:35:35] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 03:35:35] [INFO ] Added : 8 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [4001, 4001, 4000, 4000, 8001, 4000, 4001, 4001, 4001, 4001, 8001, 4001] Max seen :[61, 61, 47, 477, 156, 47, 35, 158, 61, 477, 156, 477]
FORMULA RobotManipulation-PT-02000-UpperBounds-04 4000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA RobotManipulation-PT-02000-UpperBounds-06 4000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA RobotManipulation-PT-02000-UpperBounds-03 4000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 6 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 0 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 24 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 24 ms. Remains : 12/15 places, 9/11 transitions.
// Phase 1: matrix 9 rows 12 cols
[2023-03-17 03:35:51] [INFO ] Computed 5 place invariants in 1 ms
FORMULA RobotManipulation-PT-02000-UpperBounds-13 4000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-02000-UpperBounds-05 4000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 1000278 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=4809 ) properties (out of 7) seen :28000
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 416 ms. (steps per millisecond=2403 ) properties (out of 7) seen :4390
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 375 ms. (steps per millisecond=2666 ) properties (out of 7) seen :12578
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 342 ms. (steps per millisecond=2923 ) properties (out of 7) seen :4278
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 289 ms. (steps per millisecond=3460 ) properties (out of 7) seen :4330
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 348 ms. (steps per millisecond=2873 ) properties (out of 7) seen :12554
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 301 ms. (steps per millisecond=3322 ) properties (out of 7) seen :8005
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 302 ms. (steps per millisecond=3311 ) properties (out of 7) seen :8005
[2023-03-17 03:35:53] [INFO ] Invariant cache hit.
[2023-03-17 03:35:53] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-17 03:35:53] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned unsat
[2023-03-17 03:35:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-17 03:35:53] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned unsat
[2023-03-17 03:35:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-17 03:35:53] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned unsat
[2023-03-17 03:35:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-17 03:35:53] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned unsat
[2023-03-17 03:35:53] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-17 03:35:53] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned unsat
[2023-03-17 03:35:54] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-17 03:35:54] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned unsat
[2023-03-17 03:35:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-17 03:35:54] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 7 ms returned unsat
Current structural bounds on expressions (after SMT) : [4000, 4000, 4000, 4000, 4000, 4000, 4000] Max seen :[4000, 4000, 4000, 4000, 4000, 4000, 4000]
FORMULA RobotManipulation-PT-02000-UpperBounds-14 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-02000-UpperBounds-12 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-02000-UpperBounds-11 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-02000-UpperBounds-10 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-02000-UpperBounds-09 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-02000-UpperBounds-01 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-02000-UpperBounds-00 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 21085 ms.
ITS solved all properties within timeout

BK_STOP 1679024155116

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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-02000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is RobotManipulation-PT-02000, 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 r361-smll-167891810800085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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