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

About the Execution of ITS-Tools for QuasiCertifProtocol-COL-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
462.899 13468.00 12564.00 2529.60 1 3 3 3 1 3 3 3 1 3 1 3 1 9 1 3 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r293-tall-167873945900805.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 itstools
Input is QuasiCertifProtocol-COL-02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945900805
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 7.4K Feb 26 01:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 01:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.9K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 01:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 01:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:28 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 34K 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-02-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-COL-02-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-COL-02-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-COL-02-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-COL-02-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-COL-02-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-COL-02-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-COL-02-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-COL-02-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-COL-02-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-COL-02-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-COL-02-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-COL-02-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-COL-02-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-COL-02-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-COL-02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678977901509

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-02
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202303021504
[2023-03-16 14:45:03] [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]
[2023-03-16 14:45:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 14:45:03] [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-16 14:45:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 14:45:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 438 ms
[2023-03-16 14:45:04] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 86 PT places and 56.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-16 14:45:04] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 3 ms.
[2023-03-16 14:45:04] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 26 rows 30 cols
[2023-03-16 14:45:04] [INFO ] Computed 5 place invariants in 6 ms
FORMULA QuasiCertifProtocol-COL-02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-16 14:45:04] [INFO ] Invariant cache hit.
[2023-03-16 14:45:04] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2023-03-16 14:45:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:04] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-16 14:45:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 14:45:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-16 14:45:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:04] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-16 14:45:04] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-16 14:45:04] [INFO ] Added : 11 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 7 ms.
[2023-03-16 14:45:04] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-16 14:45:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:04] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-16 14:45:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 14:45:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-16 14:45:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:04] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-16 14:45:04] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 14:45:04] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2023-03-16 14:45:04] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-16 14:45:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:04] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-16 14:45:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 14:45:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-16 14:45:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:04] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-16 14:45:04] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-16 14:45:04] [INFO ] Added : 13 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 7 ms.
[2023-03-16 14:45:04] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-16 14:45:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:04] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-16 14:45:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 14:45:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-16 14:45:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:04] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-16 14:45:04] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 14:45:04] [INFO ] Added : 7 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 5 ms.
[2023-03-16 14:45:04] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-16 14:45:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:04] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-16 14:45:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 14:45:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-16 14:45:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:04] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-16 14:45:04] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-16 14:45:04] [INFO ] Added : 6 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 6 ms.
[2023-03-16 14:45:04] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-16 14:45:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:04] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-16 14:45:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 14:45:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-16 14:45:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:04] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-16 14:45:04] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-16 14:45:04] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2023-03-16 14:45:04] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-16 14:45:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:04] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-16 14:45:04] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 14:45:04] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2023-03-16 14:45:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 14:45:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-16 14:45:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:04] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-16 14:45:04] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 14:45:04] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2023-03-16 14:45:05] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-16 14:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:05] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-16 14:45:05] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 14:45:05] [INFO ] Added : 4 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2023-03-16 14:45:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 14:45:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-16 14:45:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:05] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-16 14:45:05] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 14:45:05] [INFO ] Added : 4 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 7 ms.
[2023-03-16 14:45:05] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-16 14:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:05] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-16 14:45:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 14:45:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-16 14:45:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:05] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-16 14:45:05] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-16 14:45:05] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 8 ms.
[2023-03-16 14:45:05] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-16 14:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:05] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-16 14:45:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 14:45:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-16 14:45:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:05] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-16 14:45:05] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 14:45:05] [INFO ] Added : 5 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 6 ms.
[2023-03-16 14:45:05] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-16 14:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:05] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-16 14:45:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 14:45:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-16 14:45:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:05] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-16 14:45:05] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 14:45:05] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2023-03-16 14:45:05] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-16 14:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:05] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-16 14:45:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 14:45:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-16 14:45:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:05] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-16 14:45:05] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 14:45:05] [INFO ] Added : 13 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 5 ms.
[2023-03-16 14:45:05] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-16 14:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:05] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-16 14:45:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 14:45:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-16 14:45:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:05] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-16 14:45:05] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 14:45:05] [INFO ] Added : 12 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [1, -1, 3, 1, 3, -1, -1, 3, 1, -1, -1, 1, 3]
Domain [tsid(3), tsid(3)] of place n9 breaks symmetries in sort tsid
[2023-03-16 14:45:05] [INFO ] Unfolded HLPN to a Petri net with 86 places and 56 transitions 223 arcs in 8 ms.
[2023-03-16 14:45:05] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Incomplete random walk after 10000 steps, including 1640 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :18
FORMULA QuasiCertifProtocol-COL-02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-02-UpperBounds-09 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 570 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10001 steps, including 439 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :5
Incomplete Best-First random walk after 10000 steps, including 566 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10000 steps, including 568 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10001 steps, including 559 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :15
FORMULA QuasiCertifProtocol-COL-02-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 552 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :11
Incomplete Best-First random walk after 10001 steps, including 572 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :12
Incomplete Best-First random walk after 10000 steps, including 563 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 9) seen :11
Incomplete Best-First random walk after 10001 steps, including 563 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 9) seen :11
// Phase 1: matrix 56 rows 86 cols
[2023-03-16 14:45:05] [INFO ] Computed 31 place invariants in 4 ms
[2023-03-16 14:45:05] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-16 14:45:05] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 3 ms returned sat
[2023-03-16 14:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:05] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-16 14:45:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 14:45:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-16 14:45:05] [INFO ] [Nat]Absence check using 7 positive and 24 generalized place invariants in 3 ms returned sat
[2023-03-16 14:45:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:05] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-16 14:45:05] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 14:45:05] [INFO ] Added : 18 causal constraints over 4 iterations in 28 ms. Result :sat
Minimization took 10 ms.
[2023-03-16 14:45:05] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-16 14:45:05] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 2 ms returned sat
[2023-03-16 14:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:05] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2023-03-16 14:45:05] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-16 14:45:05] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 3 ms returned sat
[2023-03-16 14:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:05] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-16 14:45:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 14:45:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-16 14:45:05] [INFO ] [Nat]Absence check using 7 positive and 24 generalized place invariants in 3 ms returned sat
[2023-03-16 14:45:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:05] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-16 14:45:05] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-16 14:45:05] [INFO ] Added : 29 causal constraints over 6 iterations in 38 ms. Result :sat
Minimization took 16 ms.
[2023-03-16 14:45:06] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-16 14:45:06] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 3 ms returned sat
[2023-03-16 14:45:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:06] [INFO ] [Real]Absence check using state equation in 12 ms returned unsat
[2023-03-16 14:45:06] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-16 14:45:06] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 3 ms returned sat
[2023-03-16 14:45:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:06] [INFO ] [Real]Absence check using state equation in 12 ms returned unsat
[2023-03-16 14:45:06] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-16 14:45:06] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 2 ms returned sat
[2023-03-16 14:45:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:06] [INFO ] [Real]Absence check using state equation in 17 ms returned unsat
[2023-03-16 14:45:06] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-16 14:45:06] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 3 ms returned sat
[2023-03-16 14:45:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:06] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-16 14:45:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 14:45:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-16 14:45:06] [INFO ] [Nat]Absence check using 7 positive and 24 generalized place invariants in 3 ms returned sat
[2023-03-16 14:45:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:06] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-16 14:45:06] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 14:45:06] [INFO ] Added : 23 causal constraints over 5 iterations in 38 ms. Result :sat
Minimization took 16 ms.
[2023-03-16 14:45:06] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-16 14:45:06] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 3 ms returned sat
[2023-03-16 14:45:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:06] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-16 14:45:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 14:45:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-16 14:45:06] [INFO ] [Nat]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2023-03-16 14:45:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:06] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-16 14:45:06] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-16 14:45:06] [INFO ] Added : 19 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 10 ms.
[2023-03-16 14:45:06] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-16 14:45:06] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 3 ms returned sat
[2023-03-16 14:45:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:06] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-16 14:45:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 14:45:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-16 14:45:06] [INFO ] [Nat]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2023-03-16 14:45:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:06] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-16 14:45:06] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 14:45:06] [INFO ] Added : 23 causal constraints over 5 iterations in 41 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [1, 3, 3, 3, 3, 3, 2147483647, 1, 3] Max seen :[0, 3, 0, 3, 3, 3, 0, 0, 0]
FORMULA QuasiCertifProtocol-COL-02-UpperBounds-11 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-02-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-02-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-02-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-02-UpperBounds-15 3 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-02-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 9 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 56/56 transitions.
Graph (complete) has 184 edges and 86 vertex of which 56 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 50 transition count 18
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 36 place count 45 transition count 18
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 36 place count 45 transition count 12
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 56 place count 31 transition count 12
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 31 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 58 place count 30 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 58 place count 30 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 61 place count 28 transition count 10
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 73 place count 19 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 74 place count 18 transition count 6
Ensure Unique test removed 3 places
Iterating post reduction 4 with 3 rules applied. Total rules applied 77 place count 15 transition count 6
Applied a total of 77 rules in 16 ms. Remains 15 /86 variables (removed 71) and now considering 6/56 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 15/86 places, 6/56 transitions.
// Phase 1: matrix 6 rows 15 cols
[2023-03-16 14:45:06] [INFO ] Computed 9 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 142857 resets, run finished after 560 ms. (steps per millisecond=1785 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 58823 resets, run finished after 401 ms. (steps per millisecond=2493 ) properties (out of 1) seen :9
[2023-03-16 14:45:07] [INFO ] Invariant cache hit.
[2023-03-16 14:45:07] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 1 ms returned sat
[2023-03-16 14:45:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:45:07] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
Current structural bounds on expressions (after SMT) : [9] Max seen :[9]
FORMULA QuasiCertifProtocol-COL-02-UpperBounds-13 9 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 4533 ms.

BK_STOP 1678977914977

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="QuasiCertifProtocol-COL-02"
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-5348"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-COL-02, 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 r293-tall-167873945900805"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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