fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r170-smll-174889233700333
Last Updated
June 24, 2025

About the Execution of ITS-Tools for RefineWMG-PT-025026

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 12295.00 0.00 0.00 26 26 26 7 7 26 26 26 26 26 26 7 26 26 7 26 normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r170-smll-174889233700333.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is RefineWMG-PT-025026, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-174889233700333
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 56K May 29 14:32 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

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME RefineWMG-PT-025026-UpperBounds-00
FORMULA_NAME RefineWMG-PT-025026-UpperBounds-01
FORMULA_NAME RefineWMG-PT-025026-UpperBounds-02
FORMULA_NAME RefineWMG-PT-025026-UpperBounds-03
FORMULA_NAME RefineWMG-PT-025026-UpperBounds-04
FORMULA_NAME RefineWMG-PT-025026-UpperBounds-05
FORMULA_NAME RefineWMG-PT-025026-UpperBounds-06
FORMULA_NAME RefineWMG-PT-025026-UpperBounds-07
FORMULA_NAME RefineWMG-PT-025026-UpperBounds-08
FORMULA_NAME RefineWMG-PT-025026-UpperBounds-09
FORMULA_NAME RefineWMG-PT-025026-UpperBounds-10
FORMULA_NAME RefineWMG-PT-025026-UpperBounds-11
FORMULA_NAME RefineWMG-PT-025026-UpperBounds-12
FORMULA_NAME RefineWMG-PT-025026-UpperBounds-13
FORMULA_NAME RefineWMG-PT-025026-UpperBounds-14
FORMULA_NAME RefineWMG-PT-025026-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749012962998

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RefineWMG-PT-025026
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-04 04:56:05] [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]
[2025-06-04 04:56:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 04:56:06] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2025-06-04 04:56:06] [INFO ] Transformed 129 places.
[2025-06-04 04:56:06] [INFO ] Transformed 103 transitions.
[2025-06-04 04:56:06] [INFO ] Parsed PT model containing 129 places and 103 transitions and 308 arcs in 376 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 26, 26, 0, 0, 0, 0, 0, 0, 26, 0, 0, 26, 0, 0, 26] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 26, 26, 0, 0, 0, 0, 0, 0, 26, 0, 0, 26, 0, 0, 26] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 103 rows 129 cols
[2025-06-04 04:56:06] [INFO ] Computed 52 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 26, 26, 0, 0, 0, 0, 0, 0, 26, 0, 0, 26, 0, 0, 26] Max Struct:[26, 26, 26, 7, 7, 26, 26, 26, 26, 26, 26, 7, 26, 26, 7, 26]
FORMULA RefineWMG-PT-025026-UpperBounds-15 26 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025026-UpperBounds-12 26 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025026-UpperBounds-09 26 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025026-UpperBounds-02 26 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025026-UpperBounds-01 26 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (2 resets) in 59 ms. (166 steps per ms)
FORMULA RefineWMG-PT-025026-UpperBounds-07 26 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RefineWMG-PT-025026-UpperBounds-06 26 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RefineWMG-PT-025026-UpperBounds-05 26 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RefineWMG-PT-025026-UpperBounds-00 26 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70007 steps (14 resets) in 281 ms. (248 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 0, 0, 0, 0, 0, 0] Max Struct:[7, 7, 26, 26, 7, 26, 7]
[2025-06-04 04:56:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 04:56:07] [INFO ] [Real]Absence check using 52 positive place invariants in 42 ms returned sat
[2025-06-04 04:56:07] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2025-06-04 04:56:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 04:56:07] [INFO ] [Nat]Absence check using 52 positive place invariants in 23 ms returned sat
[2025-06-04 04:56:07] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2025-06-04 04:56:07] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints (skipped 0 transitions) in 35 ms.
[2025-06-04 04:56:07] [INFO ] Added : 53 causal constraints over 11 iterations in 327 ms. Result :sat
Minimization took 46 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 04:56:08] [INFO ] [Real]Absence check using 52 positive place invariants in 31 ms returned sat
[2025-06-04 04:56:08] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2025-06-04 04:56:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 04:56:08] [INFO ] [Nat]Absence check using 52 positive place invariants in 25 ms returned sat
[2025-06-04 04:56:08] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2025-06-04 04:56:08] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints (skipped 0 transitions) in 24 ms.
[2025-06-04 04:56:08] [INFO ] Added : 15 causal constraints over 3 iterations in 83 ms. Result :sat
Minimization took 56 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 04:56:08] [INFO ] [Real]Absence check using 52 positive place invariants in 33 ms returned sat
[2025-06-04 04:56:08] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2025-06-04 04:56:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 04:56:08] [INFO ] [Nat]Absence check using 52 positive place invariants in 19 ms returned sat
[2025-06-04 04:56:08] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2025-06-04 04:56:08] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-04 04:56:09] [INFO ] Added : 56 causal constraints over 12 iterations in 183 ms. Result :sat
Minimization took 34 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 04:56:09] [INFO ] [Real]Absence check using 52 positive place invariants in 15 ms returned sat
[2025-06-04 04:56:09] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2025-06-04 04:56:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 04:56:09] [INFO ] [Nat]Absence check using 52 positive place invariants in 19 ms returned sat
[2025-06-04 04:56:09] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2025-06-04 04:56:09] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints (skipped 0 transitions) in 14 ms.
[2025-06-04 04:56:09] [INFO ] Added : 56 causal constraints over 12 iterations in 193 ms. Result :sat
Minimization took 72 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 04:56:09] [INFO ] [Real]Absence check using 52 positive place invariants in 19 ms returned sat
[2025-06-04 04:56:09] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2025-06-04 04:56:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 04:56:09] [INFO ] [Nat]Absence check using 52 positive place invariants in 13 ms returned sat
[2025-06-04 04:56:09] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2025-06-04 04:56:10] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints (skipped 0 transitions) in 16 ms.
[2025-06-04 04:56:10] [INFO ] Added : 40 causal constraints over 8 iterations in 128 ms. Result :sat
Minimization took 129 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 04:56:10] [INFO ] [Real]Absence check using 52 positive place invariants in 13 ms returned sat
[2025-06-04 04:56:10] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2025-06-04 04:56:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 04:56:10] [INFO ] [Nat]Absence check using 52 positive place invariants in 19 ms returned sat
[2025-06-04 04:56:10] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2025-06-04 04:56:10] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints (skipped 0 transitions) in 16 ms.
[2025-06-04 04:56:10] [INFO ] Added : 55 causal constraints over 11 iterations in 176 ms. Result :sat
Minimization took 43 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 04:56:10] [INFO ] [Real]Absence check using 52 positive place invariants in 19 ms returned sat
[2025-06-04 04:56:10] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2025-06-04 04:56:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 04:56:11] [INFO ] [Nat]Absence check using 52 positive place invariants in 22 ms returned sat
[2025-06-04 04:56:11] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2025-06-04 04:56:11] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-04 04:56:11] [INFO ] Added : 58 causal constraints over 12 iterations in 215 ms. Result :sat
Minimization took 72 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 0, 0, 0, 0, 0, 0] Max Struct:[7, 7, 26, 26, 7, 26, 7]
FORMULA RefineWMG-PT-025026-UpperBounds-14 7 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA RefineWMG-PT-025026-UpperBounds-13 26 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA RefineWMG-PT-025026-UpperBounds-08 26 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA RefineWMG-PT-025026-UpperBounds-11 7 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA RefineWMG-PT-025026-UpperBounds-10 26 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA RefineWMG-PT-025026-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[7]
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 75 edges and 129 vertex of which 50 / 129 are part of one of the 25 SCC in 4 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 79 transition count 53
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 1 with 75 rules applied. Total rules applied 101 place count 29 transition count 28
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 21 rules applied. Total rules applied 122 place count 29 transition count 7
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 22 rules applied. Total rules applied 144 place count 8 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 145 place count 7 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 145 place count 7 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 147 place count 6 transition count 5
Applied a total of 147 rules in 94 ms. Remains 6 /129 variables (removed 123) and now considering 5/103 (removed 98) transitions.
Running 4 sub problems to find dead transitions.
// Phase 1: matrix 5 rows 6 cols
[2025-06-04 04:56:13] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 202ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 211ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 319 ms. Remains : 6/129 places, 5/103 transitions.
[2025-06-04 04:56:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[7] Max Struct:[7]
FORMULA RefineWMG-PT-025026-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 584 ms. (1709 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-04 04:56:15] [INFO ] Flatten gal took : 36 ms
[2025-06-04 04:56:15] [INFO ] Flatten gal took : 3 ms
[2025-06-04 04:56:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16971122303573991844.gal : 6 ms
[2025-06-04 04:56:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11901146408943088863.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16971122303573991844.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11901146408943088863.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 9532 ms.

BK_STOP 1749012975293

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="RefineWMG-PT-025026"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is RefineWMG-PT-025026, 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 r170-smll-174889233700333"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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