Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.1K Feb 26 01:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 01:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 01:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 01:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 01:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 01:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 01:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 120K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678915728959

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-28
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 21:28:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-15 21:28:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 21:28:50] [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.
[2023-03-15 21:28:50] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 21:28:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 652 ms
[2023-03-15 21:28:51] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 2998 PT places and 446.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-15 21:28:51] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2023-03-15 21:28:51] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 26 rows 30 cols
[2023-03-15 21:28:51] [INFO ] Computed 5 place invariants in 6 ms
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-01 29 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-15 21:28:51] [INFO ] Invariant cache hit.
[2023-03-15 21:28:51] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-15 21:28:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:28:51] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-15 21:28:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:28:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:28:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:28:51] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-15 21:28:51] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 21:28:51] [INFO ] Added : 2 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 4 ms.
[2023-03-15 21:28:51] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 21:28:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:28:51] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-15 21:28:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:28:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 21:28:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:28:51] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-15 21:28:51] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-15 21:28:51] [INFO ] Added : 10 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 7 ms.
[2023-03-15 21:28:51] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 21:28:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:28:51] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-15 21:28:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:28:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 21:28:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:28:51] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-15 21:28:51] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 21:28:51] [INFO ] Added : 6 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 6 ms.
[2023-03-15 21:28:51] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:28:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:28:51] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-15 21:28:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:28:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:28:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:28:51] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-15 21:28:51] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 21:28:51] [INFO ] Added : 13 causal constraints over 3 iterations in 13 ms. Result :sat
Minimization took 7 ms.
[2023-03-15 21:28:51] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 21:28:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:28:51] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-15 21:28:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:28:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:28:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:28:51] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-15 21:28:51] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 21:28:51] [INFO ] Added : 8 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 6 ms.
[2023-03-15 21:28:51] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:28:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:28:51] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-15 21:28:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:28:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:28:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:28:51] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-15 21:28:51] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-15 21:28:51] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
[2023-03-15 21:28:51] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:28:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:28:51] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-15 21:28:51] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 21:28:51] [INFO ] Added : 4 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 5 ms.
[2023-03-15 21:28:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:28:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 21:28:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:28:51] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-15 21:28:51] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 21:28:51] [INFO ] Added : 4 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2023-03-15 21:28:51] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 21:28:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:28:51] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 21:28:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:28:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:28:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:28:52] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-15 21:28:52] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 21:28:52] [INFO ] Added : 13 causal constraints over 3 iterations in 18 ms. Result :sat
Minimization took 7 ms.
[2023-03-15 21:28:52] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 21:28:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:28:52] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 21:28:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:28:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:28:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:28:52] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-15 21:28:52] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 21:28:52] [INFO ] Added : 13 causal constraints over 3 iterations in 19 ms. Result :sat
Minimization took 7 ms.
[2023-03-15 21:28:52] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:28:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:28:52] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-15 21:28:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:28:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:28:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:28:52] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-15 21:28:52] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 21:28:52] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2023-03-15 21:28:52] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 21:28:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:28:52] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-15 21:28:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:28:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:28:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:28:52] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-15 21:28:52] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 21:28:52] [INFO ] Added : 11 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 6 ms.
[2023-03-15 21:28:52] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:28:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:28:52] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-15 21:28:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:28:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-15 21:28:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:28:52] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-15 21:28:52] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 21:28:52] [INFO ] Added : 5 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 7 ms.
[2023-03-15 21:28:52] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 21:28:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:28:52] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-15 21:28:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:28:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:28:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:28:52] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-15 21:28:52] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 21:28:52] [INFO ] Added : 10 causal constraints over 2 iterations in 26 ms. Result :sat
Minimization took 9 ms.
[2023-03-15 21:28:52] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 21:28:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:28:52] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-15 21:28:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:28:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-15 21:28:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:28:52] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-15 21:28:52] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 21:28:52] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [1, 29, 29, 29, -1, -1, 29, -1, 16, 1, 1, -1, -1, 1]
Domain [tsid(29), tsid(29)] of place n9 breaks symmetries in sort tsid
[2023-03-15 21:28:52] [INFO ] Unfolded HLPN to a Petri net with 2998 places and 446 transitions 6489 arcs in 32 ms.
[2023-03-15 21:28:52] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Incomplete random walk after 10000 steps, including 301 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 14) seen :45
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :42
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :42
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :42
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :42
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :42
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :58
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-07 29 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :29
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :29
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :29
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :29
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 12) seen :29
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :29
// Phase 1: matrix 446 rows 2998 cols
[2023-03-15 21:28:53] [INFO ] Computed 2553 place invariants in 95 ms
[2023-03-15 21:28:53] [INFO ] [Real]Absence check using 4 positive place invariants in 34 ms returned sat
[2023-03-15 21:28:54] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 484 ms returned sat
[2023-03-15 21:28:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:28:58] [INFO ] [Real]Absence check using state equation in 4251 ms returned unknown
[2023-03-15 21:28:58] [INFO ] [Real]Absence check using 4 positive place invariants in 26 ms returned sat
[2023-03-15 21:28:59] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 526 ms returned sat
[2023-03-15 21:28:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:29:03] [INFO ] [Real]Absence check using state equation in 4175 ms returned unknown
[2023-03-15 21:29:03] [INFO ] [Real]Absence check using 4 positive place invariants in 28 ms returned sat
[2023-03-15 21:29:04] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 557 ms returned sat
[2023-03-15 21:29:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:29:05] [INFO ] [Real]Absence check using state equation in 1212 ms returned sat
[2023-03-15 21:29:05] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 41 ms.
[2023-03-15 21:29:07] [INFO ] Added : 119 causal constraints over 24 iterations in 1986 ms. Result :sat
Minimization took 185 ms.
[2023-03-15 21:29:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:29:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 25 ms returned sat
[2023-03-15 21:29:08] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 567 ms returned sat
[2023-03-15 21:29:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:29:10] [INFO ] [Nat]Absence check using state equation in 1245 ms returned sat
[2023-03-15 21:29:10] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 38 ms.
[2023-03-15 21:29:11] [INFO ] Added : 119 causal constraints over 24 iterations in 1807 ms. Result :sat
Minimization took 142 ms.
[2023-03-15 21:29:12] [INFO ] [Real]Absence check using 4 positive place invariants in 22 ms returned sat
[2023-03-15 21:29:12] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 519 ms returned sat
[2023-03-15 21:29:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:29:16] [INFO ] [Real]Absence check using state equation in 3130 ms returned sat
[2023-03-15 21:29:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:29:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 23 ms returned sat
[2023-03-15 21:29:17] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 512 ms returned sat
[2023-03-15 21:29:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:29:20] [INFO ] [Nat]Absence check using state equation in 3282 ms returned sat
[2023-03-15 21:29:20] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 37 ms.
[2023-03-15 21:29:21] [INFO ] Added : 60 causal constraints over 12 iterations in 831 ms. Result :sat
Minimization took 8 ms.
[2023-03-15 21:29:21] [INFO ] [Real]Absence check using 4 positive place invariants in 23 ms returned sat
[2023-03-15 21:29:22] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 519 ms returned sat
[2023-03-15 21:29:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:29:23] [INFO ] [Real]Absence check using state equation in 1336 ms returned unsat
[2023-03-15 21:29:23] [INFO ] [Real]Absence check using 4 positive place invariants in 22 ms returned sat
[2023-03-15 21:29:24] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 509 ms returned sat
[2023-03-15 21:29:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:29:25] [INFO ] [Real]Absence check using state equation in 1343 ms returned sat
[2023-03-15 21:29:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:29:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 22 ms returned sat
[2023-03-15 21:29:26] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 496 ms returned sat
[2023-03-15 21:29:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:29:27] [INFO ] [Nat]Absence check using state equation in 1296 ms returned sat
[2023-03-15 21:29:27] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 47 ms.
[2023-03-15 21:29:29] [INFO ] Added : 134 causal constraints over 27 iterations in 1901 ms. Result :sat
Minimization took 511 ms.
[2023-03-15 21:29:30] [INFO ] [Real]Absence check using 4 positive place invariants in 22 ms returned sat
[2023-03-15 21:29:31] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 503 ms returned sat
[2023-03-15 21:29:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:29:32] [INFO ] [Real]Absence check using state equation in 1246 ms returned sat
[2023-03-15 21:29:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:29:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 24 ms returned sat
[2023-03-15 21:29:33] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 506 ms returned sat
[2023-03-15 21:29:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:29:34] [INFO ] [Nat]Absence check using state equation in 1236 ms returned sat
[2023-03-15 21:29:34] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 34 ms.
[2023-03-15 21:29:36] [INFO ] Added : 122 causal constraints over 25 iterations in 1768 ms. Result :sat
Minimization took 197 ms.
[2023-03-15 21:29:36] [INFO ] [Real]Absence check using 4 positive place invariants in 21 ms returned sat
[2023-03-15 21:29:37] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 456 ms returned sat
[2023-03-15 21:29:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:29:38] [INFO ] [Real]Absence check using state equation in 1310 ms returned sat
[2023-03-15 21:29:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:29:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 23 ms returned sat
[2023-03-15 21:29:39] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 425 ms returned sat
[2023-03-15 21:29:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:29:40] [INFO ] [Nat]Absence check using state equation in 1368 ms returned sat
[2023-03-15 21:29:40] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 37 ms.
[2023-03-15 21:29:41] [INFO ] Added : 59 causal constraints over 12 iterations in 896 ms. Result :sat
Minimization took 152 ms.
[2023-03-15 21:29:42] [INFO ] [Real]Absence check using 4 positive place invariants in 35 ms returned sat
[2023-03-15 21:29:42] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 405 ms returned sat
[2023-03-15 21:29:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:29:43] [INFO ] [Real]Absence check using state equation in 1237 ms returned sat
[2023-03-15 21:29:43] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 29 ms.
[2023-03-15 21:29:45] [INFO ] Added : 134 causal constraints over 27 iterations in 1970 ms. Result :sat
Minimization took 189 ms.
[2023-03-15 21:29:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:29:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 24 ms returned sat
[2023-03-15 21:29:47] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 516 ms returned sat
[2023-03-15 21:29:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:29:48] [INFO ] [Nat]Absence check using state equation in 1280 ms returned sat
[2023-03-15 21:29:48] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 36 ms.
[2023-03-15 21:29:50] [INFO ] Added : 134 causal constraints over 27 iterations in 1848 ms. Result :sat
Minimization took 163 ms.
[2023-03-15 21:29:50] [INFO ] [Real]Absence check using 4 positive place invariants in 21 ms returned sat
[2023-03-15 21:29:51] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 502 ms returned sat
[2023-03-15 21:29:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:29:54] [INFO ] [Real]Absence check using state equation in 3373 ms returned sat
[2023-03-15 21:29:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:29:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 22 ms returned sat
[2023-03-15 21:29:55] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 510 ms returned sat
[2023-03-15 21:29:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:29:59] [INFO ] [Nat]Absence check using state equation in 3735 ms returned sat
[2023-03-15 21:29:59] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 32 ms.
[2023-03-15 21:30:01] [INFO ] Deduced a trap composed of 6 places in 1890 ms of which 14 ms to minimize.
[2023-03-15 21:30:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 21:30:01] [INFO ] [Real]Absence check using 4 positive place invariants in 22 ms returned sat
[2023-03-15 21:30:02] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 594 ms returned sat
[2023-03-15 21:30:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:30:04] [INFO ] [Real]Absence check using state equation in 1898 ms returned sat
[2023-03-15 21:30:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:30:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 23 ms returned sat
[2023-03-15 21:30:05] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 566 ms returned sat
[2023-03-15 21:30:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:30:07] [INFO ] [Nat]Absence check using state equation in 1894 ms returned sat
[2023-03-15 21:30:07] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 33 ms.
[2023-03-15 21:30:09] [INFO ] Added : 120 causal constraints over 24 iterations in 1806 ms. Result :sat
Minimization took 289 ms.
[2023-03-15 21:30:09] [INFO ] [Real]Absence check using 4 positive place invariants in 20 ms returned sat
[2023-03-15 21:30:10] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 481 ms returned sat
[2023-03-15 21:30:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:30:11] [INFO ] [Real]Absence check using state equation in 1293 ms returned sat
[2023-03-15 21:30:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:30:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 22 ms returned sat
[2023-03-15 21:30:12] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 490 ms returned sat
[2023-03-15 21:30:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:30:13] [INFO ] [Nat]Absence check using state equation in 1293 ms returned sat
[2023-03-15 21:30:13] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 30 ms.
[2023-03-15 21:30:14] [INFO ] Added : 30 causal constraints over 6 iterations in 502 ms. Result :sat
Minimization took 143 ms.
Current structural bounds on expressions (after SMT) : [29, 29, 29, 2147483647, 29, 2147483647, 16, 1, 1, 2147483647, 2147483647, 1] Max seen :[0, 0, 0, 0, 29, 0, 0, 0, 0, 0, 0, 0]
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-06 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-03 29 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-02 29 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-09 16 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-04 29 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 928 out of 2998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 1166 are kept as prefixes of interest. Removing 1832 places using SCC suffix rule.11 ms
Discarding 1832 places :
Also discarding 174 output transitions
Drop transitions removed 174 transitions
Drop transitions removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Discarding 58 places :
Implicit places reduction removed 58 places
Iterating post reduction 0 with 179 rules applied. Total rules applied 180 place count 1108 transition count 151
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 31 Pre rules applied. Total rules applied 180 place count 1108 transition count 120
Deduced a syphon composed of 31 places in 1 ms
Ensure Unique test removed 57 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 1 with 119 rules applied. Total rules applied 299 place count 1020 transition count 120
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 299 place count 1020 transition count 119
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 302 place count 1018 transition count 119
Applied a total of 302 rules in 98 ms. Remains 1018 /2998 variables (removed 1980) and now considering 119/446 (removed 327) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 1018/2998 places, 119/446 transitions.
// Phase 1: matrix 119 rows 1018 cols
[2023-03-15 21:30:17] [INFO ] Computed 899 place invariants in 5 ms
Finished random walk after 795937 steps, including 6632 resets, run visited all 4 properties in 30001 ms. (steps per millisecond=26 )
Finished Best-First random walk after 634295 steps, including 338 resets, run visited all 4 properties in 5001 ms. (steps per millisecond=126 )
Finished Best-First random walk after 853306 steps, including 367 resets, run visited all 4 properties in 5001 ms. (steps per millisecond=170 )
Finished Best-First random walk after 728559 steps, including 351 resets, run visited all 4 properties in 5001 ms. (steps per millisecond=145 )
Finished Best-First random walk after 169317 steps, including 89 resets, run visited all 4 properties in 5001 ms. (steps per millisecond=33 )
[2023-03-15 21:31:07] [INFO ] Invariant cache hit.
[2023-03-15 21:31:07] [INFO ] [Real]Absence check using 0 positive and 899 generalized place invariants in 202 ms returned sat
[2023-03-15 21:31:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:31:08] [INFO ] [Real]Absence check using state equation in 705 ms returned unsat
[2023-03-15 21:31:08] [INFO ] [Real]Absence check using 0 positive and 899 generalized place invariants in 145 ms returned sat
[2023-03-15 21:31:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:31:08] [INFO ] [Real]Absence check using state equation in 202 ms returned unsat
[2023-03-15 21:31:08] [INFO ] [Real]Absence check using 0 positive and 899 generalized place invariants in 156 ms returned sat
[2023-03-15 21:31:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:31:09] [INFO ] [Real]Absence check using state equation in 183 ms returned unsat
[2023-03-15 21:31:09] [INFO ] [Real]Absence check using 0 positive and 899 generalized place invariants in 246 ms returned sat
[2023-03-15 21:31:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:31:10] [INFO ] [Real]Absence check using state equation in 875 ms returned unsat
Current structural bounds on expressions (after SMT) : [29, 29, 29, 841] Max seen :[29, 29, 29, 841]
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-14 841 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-13 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-08 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-05 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 139944 ms.
ITS solved all properties within timeout

BK_STOP 1678915871245

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-COL-28"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is QuasiCertifProtocol-COL-28, 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 r295-tall-167873948500845"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-28.tgz
mv QuasiCertifProtocol-COL-28 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;