fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r128-smll-174876524800565
Last Updated
June 24, 2025

About the Execution of ITS-Tools for Murphy-COL-D4N050

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 23712.00 0.00 0.00 255 253 15 255 253 255 10 255 15 255 5 255 255 255 10 5 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524800565.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 Murphy-COL-D4N050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524800565
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K 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.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 20K 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 Murphy-COL-D4N050-UpperBounds-00
FORMULA_NAME Murphy-COL-D4N050-UpperBounds-01
FORMULA_NAME Murphy-COL-D4N050-UpperBounds-02
FORMULA_NAME Murphy-COL-D4N050-UpperBounds-03
FORMULA_NAME Murphy-COL-D4N050-UpperBounds-04
FORMULA_NAME Murphy-COL-D4N050-UpperBounds-05
FORMULA_NAME Murphy-COL-D4N050-UpperBounds-06
FORMULA_NAME Murphy-COL-D4N050-UpperBounds-07
FORMULA_NAME Murphy-COL-D4N050-UpperBounds-08
FORMULA_NAME Murphy-COL-D4N050-UpperBounds-09
FORMULA_NAME Murphy-COL-D4N050-UpperBounds-10
FORMULA_NAME Murphy-COL-D4N050-UpperBounds-11
FORMULA_NAME Murphy-COL-D4N050-UpperBounds-12
FORMULA_NAME Murphy-COL-D4N050-UpperBounds-13
FORMULA_NAME Murphy-COL-D4N050-UpperBounds-14
FORMULA_NAME Murphy-COL-D4N050-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749319044931

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-COL-D4N050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2025-06-07 17:57:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 17:57:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:57:27] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-07 17:57:28] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-07 17:57:28] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 897 ms
[2025-06-07 17:57:28] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 30 PT places and 35.0 transition bindings in 40 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Reduction of identical properties reduced properties to check from 16 to 6
[2025-06-07 17:57:28] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 27 arcs in 9 ms.
[2025-06-07 17:57:28] [INFO ] Skeletonized 6 HLPN properties in 0 ms.
// Phase 1: matrix 7 rows 6 cols
[2025-06-07 17:57:28] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[5, 250, 15, 0, 5, 0] Max Struct:[255, 255, +inf, +inf, 255, +inf]
[2025-06-07 17:57:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 17:57:29] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2025-06-07 17:57:29] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-07 17:57:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-07 17:57:29] [INFO ] [Real]Added 2 Read/Feed constraints in 3 ms returned sat
[2025-06-07 17:57:29] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-07 17:57:29] [INFO ] Added : 0 causal constraints over 0 iterations in 25 ms. Result :sat
Minimization took 15 ms.
[2025-06-07 17:57:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 17:57:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 17:57:29] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-07 17:57:29] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-06-07 17:57:29] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-07 17:57:29] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 4 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 17:57:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 17:57:29] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-07 17:57:29] [INFO ] [Real]Added 2 Read/Feed constraints in 12 ms returned sat
[2025-06-07 17:57:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 17:57:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 17:57:29] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-07 17:57:29] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-06-07 17:57:29] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-07 17:57:29] [INFO ] Added : 1 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 6 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 17:57:29] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-07 17:57:29] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-07 17:57:29] [INFO ] [Real]Added 2 Read/Feed constraints in 4 ms returned sat
[2025-06-07 17:57:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 17:57:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 17:57:29] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-07 17:57:29] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-06-07 17:57:29] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-07 17:57:29] [INFO ] Added : 3 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 7 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 17:57:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 17:57:29] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-07 17:57:29] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-06-07 17:57:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 17:57:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 17:57:29] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-07 17:57:29] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-07 17:57:29] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-07 17:57:29] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 9 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 17:57:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 17:57:29] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-07 17:57:29] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-07 17:57:29] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-07 17:57:29] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 6 ms.
[2025-06-07 17:57:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 17:57:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-07 17:57:29] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-07 17:57:29] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-07 17:57:29] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-07 17:57:29] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 3 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 17:57:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-07 17:57:29] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-07 17:57:29] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-07 17:57:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 17:57:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-07 17:57:29] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-07 17:57:29] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-06-07 17:57:29] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-07 17:57:29] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[5, 250, 15, 0, 5, 0] Max Struct:[255, 255, +inf, +inf, 255, +inf]
Arc [0:1*[(MOD (ADD $x 1) 5)]] contains successor/predecessor on variables of sort CD
[2025-06-07 17:57:29] [INFO ] Unfolded HLPN to a Petri net with 30 places and 35 transitions 135 arcs in 29 ms.
[2025-06-07 17:57:29] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[5, 250, 15, 0, 5, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[5, 250, 15, 0, 5, 0] Max Struct:[255, 255, +inf, +inf, 255, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[5, 250, 15, 0, 5, 0] Max Struct:[255, 255, +inf, +inf, 255, +inf]
// Phase 1: matrix 35 rows 30 cols
[2025-06-07 17:57:29] [INFO ] Computed 6 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5, 250, 15, 0, 5, 0] Max Struct:[255, 255, +inf, +inf, 255, +inf]
RANDOM walk for 10053 steps (2 resets) in 41 ms. (239 steps per ms)
BEST_FIRST walk for 60005 steps (12 resets) in 153 ms. (389 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[220, 253, 15, 10, 220, 5] Max Struct:[255, 255, +inf, +inf, 255, +inf]
[2025-06-07 17:57:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 17:57:30] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-07 17:57:30] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2025-06-07 17:57:30] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2025-06-07 17:57:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 17:57:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 17:57:30] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-07 17:57:30] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2025-06-07 17:57:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 17:57:30] [INFO ] [Nat]Added 10 Read/Feed constraints in 10 ms returned sat
[2025-06-07 17:57:30] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-07 17:57:30] [INFO ] Added : 0 causal constraints over 0 iterations in 20 ms. Result :sat
Minimization took 37 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 17:57:30] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 17:57:30] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2025-06-07 17:57:30] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-07 17:57:30] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-06-07 17:57:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 17:57:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 17:57:30] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2025-06-07 17:57:30] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-07 17:57:30] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-06-07 17:57:30] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-07 17:57:30] [INFO ] Added : 3 causal constraints over 2 iterations in 37 ms. Result :sat
Minimization took 24 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 17:57:30] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-07 17:57:30] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2025-06-07 17:57:30] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2025-06-07 17:57:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 17:57:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-07 17:57:30] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2025-06-07 17:57:30] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2025-06-07 17:57:30] [INFO ] [Nat]Added 10 Read/Feed constraints in 7 ms returned sat
[2025-06-07 17:57:30] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-07 17:57:30] [INFO ] Added : 3 causal constraints over 1 iterations in 28 ms. Result :sat
Minimization took 14 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 17:57:30] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 17:57:30] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-07 17:57:30] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2025-06-07 17:57:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 17:57:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-07 17:57:30] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-07 17:57:31] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2025-06-07 17:57:31] [INFO ] [Nat]Added 10 Read/Feed constraints in 7 ms returned sat
[2025-06-07 17:57:31] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-07 17:57:31] [INFO ] Added : 3 causal constraints over 1 iterations in 26 ms. Result :sat
Minimization took 15 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 17:57:31] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 17:57:31] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-07 17:57:31] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-07 17:57:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 17:57:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 17:57:31] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-07 17:57:31] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-07 17:57:31] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2025-06-07 17:57:31] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-07 17:57:31] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Minimization took 37 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 17:57:31] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 17:57:31] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-07 17:57:31] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-07 17:57:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 17:57:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 17:57:31] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2025-06-07 17:57:31] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-07 17:57:31] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-06-07 17:57:31] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-07 17:57:31] [INFO ] Added : 2 causal constraints over 1 iterations in 22 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[220, 253, 15, 10, 220, 5] Max Struct:[255, 255, +inf, +inf, 255, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[252, 253, 15, 10, 252, 5] Max Struct:[255, 255, +inf, +inf, 255, +inf]
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 16 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2025-06-07 17:57:31] [INFO ] Invariant cache hit.
[2025-06-07 17:57:31] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 35/60 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 5/65 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/65 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 46 constraints, problems are : Problem set: 0 solved, 20 unsolved in 478 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 35/60 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 5/65 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 66 constraints, problems are : Problem set: 0 solved, 20 unsolved in 965 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1485ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 1497ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1531 ms. Remains : 30/30 places, 35/35 transitions.
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {19=1, 24=1, 34=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {17=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 6) seen :[255, 250, 15, 10, 255, 5]
Current structural bounds on expressions (after cover walk) : Max Seen:[255, 253, 15, 10, 255, 5] Max Struct:[255, 255, +inf, +inf, 255, +inf]
[2025-06-07 17:57:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[255, 253, 15, 10, 255, 5] Max Struct:[255, 255, +inf, +inf, 255, +inf]
FORMULA Murphy-COL-D4N050-UpperBounds-09 255 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N050-UpperBounds-11 255 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N050-UpperBounds-13 255 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N050-UpperBounds-07 255 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N050-UpperBounds-03 255 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N050-UpperBounds-05 255 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N050-UpperBounds-12 255 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N050-UpperBounds-00 255 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000001 steps (2 resets) in 775 ms. (1288 steps per ms)
BEST_FIRST walk for 4000004 steps (8 resets) in 2829 ms. (1413 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[253, 15, 10, 5] Max Struct:[255, +inf, +inf, +inf]
[2025-06-07 17:57:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-07 17:57:37] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 17:57:37] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-07 17:57:37] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-07 17:57:37] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 17:57:37] [INFO ] [Real]Added 10 Read/Feed constraints in 5 ms returned sat
[2025-06-07 17:57:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-07 17:57:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 17:57:37] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-07 17:57:37] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-07 17:57:37] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-06-07 17:57:37] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-07 17:57:37] [INFO ] Added : 3 causal constraints over 2 iterations in 23 ms. Result :sat
Minimization took 23 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-07 17:57:37] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 17:57:37] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-07 17:57:37] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-07 17:57:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-07 17:57:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 17:57:37] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2025-06-07 17:57:37] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-07 17:57:37] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2025-06-07 17:57:37] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-07 17:57:37] [INFO ] Added : 3 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 8 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-07 17:57:37] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-07 17:57:37] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-07 17:57:37] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-07 17:57:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-07 17:57:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 17:57:37] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-07 17:57:37] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-07 17:57:37] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-06-07 17:57:37] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-07 17:57:37] [INFO ] Added : 3 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 13 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-07 17:57:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-07 17:57:37] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-07 17:57:37] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-07 17:57:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-07 17:57:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 17:57:37] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-07 17:57:37] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-07 17:57:37] [INFO ] [Nat]Added 10 Read/Feed constraints in 6 ms returned sat
[2025-06-07 17:57:37] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-07 17:57:37] [INFO ] Added : 2 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[253, 15, 10, 5] Max Struct:[255, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[253, 15, 10, 5] Max Struct:[255, +inf, +inf, +inf]
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 30/30 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2025-06-07 17:57:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:57:38] [INFO ] Implicit Places using invariants in 61 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 69 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 76 ms. Remains : 25/30 places, 35/35 transitions.
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {19=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {19=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :[250, 15, 10, 5]
Current structural bounds on expressions (after cover walk) : Max Seen:[253, 15, 10, 5] Max Struct:[255, +inf, +inf, +inf]
// Phase 1: matrix 35 rows 25 cols
[2025-06-07 17:57:38] [INFO ] Computed 1 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[253, 15, 10, 5] Max Struct:[255, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 766 ms. (1303 steps per ms)
BEST_FIRST walk for 4000004 steps (8 resets) in 2264 ms. (1766 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[253, 15, 10, 5] Max Struct:[255, +inf, +inf, +inf]
[2025-06-07 17:57:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-07 17:57:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-07 17:57:41] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-07 17:57:41] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 17:57:41] [INFO ] [Real]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-06-07 17:57:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-07 17:57:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-07 17:57:41] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-07 17:57:41] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2025-06-07 17:57:41] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-07 17:57:41] [INFO ] Added : 6 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 14 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-07 17:57:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-07 17:57:41] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-07 17:57:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-07 17:57:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-07 17:57:41] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-07 17:57:41] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-06-07 17:57:41] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-07 17:57:41] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 9 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-07 17:57:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-07 17:57:41] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-07 17:57:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-07 17:57:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-07 17:57:41] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-07 17:57:41] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-06-07 17:57:41] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-07 17:57:41] [INFO ] Added : 3 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 8 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-07 17:57:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-07 17:57:41] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-07 17:57:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-07 17:57:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-07 17:57:41] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-07 17:57:41] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-06-07 17:57:41] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-07 17:57:41] [INFO ] Added : 2 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[253, 15, 10, 5] Max Struct:[255, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[253, 15, 10, 5] Max Struct:[255, +inf, +inf, +inf]
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2025-06-07 17:57:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:57:41] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-07 17:57:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:57:41] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 17:57:41] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:57:41] [INFO ] Redundant transitions in 1 ms returned []
Running 20 sub problems to find dead transitions.
[2025-06-07 17:57:41] [INFO ] Invariant cache hit.
[2025-06-07 17:57:41] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 589 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 842 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1455ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 1457ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1573 ms. Remains : 25/25 places, 35/35 transitions.
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {19=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {19=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :[250, 15, 10, 5]
Current structural bounds on expressions (after cover walk) : Max Seen:[253, 15, 10, 5] Max Struct:[255, +inf, +inf, +inf]
RANDOM walk for 40033 steps (8 resets) in 577 ms. (69 steps per ms) remains 5/5 properties
[2025-06-07 17:57:43] [INFO ] Flatten gal took : 38 ms
[2025-06-07 17:57:43] [INFO ] Flatten gal took : 14 ms
BEST_FIRST walk for 40004 steps (8 resets) in 328 ms. (121 steps per ms) remains 5/5 properties
[2025-06-07 17:57:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13188952853061766105.gal : 12 ms
[2025-06-07 17:57:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11838141019836787836.prop : 2 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/ReachabilityCardinality13188952853061766105.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11838141019836787836.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 5/5 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality11838141019836787836.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 5/5 properties
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :6 after 36
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :36 after 90
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :90 after 192
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 5/5 properties
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :192 after 30630
BEST_FIRST walk for 40003 steps (8 resets) in 244 ms. (163 steps per ms) remains 5/5 properties
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :30630 after 243534
Interrupted probabilistic random walk after 226716 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 5
Probabilistic random walk after 226716 steps, saw 155280 distinct states, run finished after 3005 ms. (steps per millisecond=75 ) properties seen :0
[2025-06-07 17:57:46] [INFO ] Invariant cache hit.
[2025-06-07 17:57:46] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:57:46] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:57:47] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:57:47] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:57:47] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:57:47] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:57:47] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 2 ms to minimize.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:57:47] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 3 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 35/60 variables, 25/33 constraints. Problems are: Problem set: 1 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 10/43 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 43 constraints, problems are : Problem set: 1 solved, 4 unsolved in 391 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:57:47] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 35/60 variables, 25/34 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 10/44 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem MIN0 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 4/48 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:57:47] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 1/49 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 0/49 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/60 variables, 0/49 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 49 constraints, problems are : Problem set: 2 solved, 3 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 619ms problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 70 ms.
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 15 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 15 transition count 20
Applied a total of 6 rules in 10 ms. Remains 15 /25 variables (removed 10) and now considering 20/35 (removed 15) transitions.
Running 15 sub problems to find dead transitions.
// Phase 1: matrix 20 rows 15 cols
[2025-06-07 17:57:47] [INFO ] Computed 0 invariants in 1 ms
[2025-06-07 17:57:47] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 20/30 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 5/35 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/35 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 20 constraints, problems are : Problem set: 0 solved, 15 unsolved in 192 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 20/30 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 5/35 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 35 constraints, problems are : Problem set: 0 solved, 15 unsolved in 266 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 469ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 469ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 480 ms. Remains : 15/25 places, 20/35 transitions.
RANDOM walk for 40001 steps (8 resets) in 221 ms. (180 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 172 ms. (231 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 3/3 properties
Probably explored full state space saw : 7776 states, properties seen :0
Probabilistic random walk after 59616 steps, saw 7776 distinct states, run finished after 148 ms. (steps per millisecond=402 ) properties seen :0
Explored full state space saw : 7776 states, properties seen :0
Exhaustive walk after 59616 steps, saw 7776 distinct states, run finished after 103 ms. (steps per millisecond=578 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA Murphy-COL-D4N050-UpperBounds-15 5 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D4N050-UpperBounds-10 5 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D4N050-UpperBounds-14 10 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D4N050-UpperBounds-06 10 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D4N050-UpperBounds-08 15 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D4N050-UpperBounds-02 15 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D4N050-UpperBounds-04 253 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D4N050-UpperBounds-01 253 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 4 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 21064 ms.

BK_STOP 1749319068643

--------------------
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="Murphy-COL-D4N050"
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 Murphy-COL-D4N050, 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 r128-smll-174876524800565"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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