fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of Smart+red for QuasiCertifProtocol-COL-22

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
446.172 57507.00 69742.00 400.30 23 1 529 1 23 23 23 23 23 23 1 23 1 13 23 1 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.r299-tall-167873953500837.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 smartxred
Input is QuasiCertifProtocol-COL-22, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tall-167873953500837
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 01:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 01:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 01:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 01:30 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 104K 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-22-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679556549946

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-22
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 07:29:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 07:29:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 07:29:11] [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-23 07:29:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-23 07:29:12] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 674 ms
[2023-03-23 07:29:12] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1966 PT places and 356.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-23 07:29:12] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2023-03-23 07:29:12] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 26 rows 30 cols
[2023-03-23 07:29:12] [INFO ] Computed 5 place invariants in 9 ms
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-06 23 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-00 23 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-23 07:29:12] [INFO ] Invariant cache hit.
[2023-03-23 07:29:12] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-23 07:29:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:12] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-23 07:29:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 07:29:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-23 07:29:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:12] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-23 07:29:12] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 07:29:12] [INFO ] Added : 7 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 8 ms.
[2023-03-23 07:29:12] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-23 07:29:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:12] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-23 07:29:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 07:29:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-23 07:29:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:12] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-23 07:29:12] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-23 07:29:12] [INFO ] Added : 13 causal constraints over 3 iterations in 39 ms. Result :sat
Minimization took 7 ms.
[2023-03-23 07:29:12] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-23 07:29:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:12] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-23 07:29:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 07:29:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-23 07:29:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:12] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-23 07:29:12] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 07:29:12] [INFO ] Added : 6 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 6 ms.
[2023-03-23 07:29:12] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-23 07:29:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:12] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-23 07:29:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 07:29:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-23 07:29:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:12] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-23 07:29:12] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-23 07:29:12] [INFO ] Added : 10 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2023-03-23 07:29:12] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-23 07:29:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:12] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-23 07:29:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 07:29:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-23 07:29:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:12] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-23 07:29:12] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 07:29:12] [INFO ] Added : 9 causal constraints over 2 iterations in 32 ms. Result :sat
Minimization took 12 ms.
[2023-03-23 07:29:12] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-23 07:29:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:12] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-23 07:29:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 07:29:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-23 07:29:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:13] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-23 07:29:13] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 07:29:13] [INFO ] Added : 8 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2023-03-23 07:29:13] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-23 07:29:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:13] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-23 07:29:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 07:29:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-23 07:29:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:13] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-23 07:29:13] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 07:29:13] [INFO ] Added : 13 causal constraints over 3 iterations in 15 ms. Result :sat
Minimization took 7 ms.
[2023-03-23 07:29:13] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-23 07:29:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:13] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-23 07:29:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 07:29:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-23 07:29:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:13] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-23 07:29:13] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 07:29:13] [INFO ] Added : 13 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 5 ms.
[2023-03-23 07:29:13] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-23 07:29:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:13] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-23 07:29:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 07:29:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-23 07:29:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:13] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-23 07:29:13] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 07:29:13] [INFO ] Added : 5 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 7 ms.
[2023-03-23 07:29:13] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-23 07:29:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:13] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-23 07:29:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 07:29:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-23 07:29:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:13] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-23 07:29:13] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-23 07:29:13] [INFO ] Added : 12 causal constraints over 3 iterations in 31 ms. Result :sat
Minimization took 11 ms.
[2023-03-23 07:29:13] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-23 07:29:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:13] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-23 07:29:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 07:29:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-23 07:29:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:13] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-23 07:29:13] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 07:29:13] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 7 ms.
[2023-03-23 07:29:13] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-23 07:29:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:13] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-23 07:29:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 07:29:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-23 07:29:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:13] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-23 07:29:13] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 07:29:13] [INFO ] Added : 13 causal constraints over 3 iterations in 16 ms. Result :sat
Minimization took 6 ms.
[2023-03-23 07:29:13] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-23 07:29:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:13] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-23 07:29:13] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 07:29:13] [INFO ] Added : 4 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 7 ms.
[2023-03-23 07:29:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 07:29:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-23 07:29:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:13] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-23 07:29:13] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 07:29:13] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 11 ms.
[2023-03-23 07:29:13] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-23 07:29:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:13] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-23 07:29:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 07:29:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-23 07:29:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:13] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-23 07:29:13] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 07:29:13] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [1, 529, 1, 23, 23, -1, 23, 23, 1, 23, 1, 13, 23, 1]
Domain [tsid(23), tsid(23)] of place n9 breaks symmetries in sort tsid
[2023-03-23 07:29:13] [INFO ] Unfolded HLPN to a Petri net with 1966 places and 356 transitions 4323 arcs in 24 ms.
[2023-03-23 07:29:13] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Incomplete random walk after 10000 steps, including 371 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 14) seen :15
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :23
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-14 23 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 356 rows 1966 cols
[2023-03-23 07:29:14] [INFO ] Computed 1611 place invariants in 131 ms
[2023-03-23 07:29:14] [INFO ] [Real]Absence check using 4 positive place invariants in 28 ms returned sat
[2023-03-23 07:29:14] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 351 ms returned sat
[2023-03-23 07:29:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:16] [INFO ] [Real]Absence check using state equation in 1922 ms returned sat
[2023-03-23 07:29:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 07:29:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 17 ms returned sat
[2023-03-23 07:29:17] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 355 ms returned sat
[2023-03-23 07:29:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:20] [INFO ] [Nat]Absence check using state equation in 3204 ms returned sat
[2023-03-23 07:29:20] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 30 ms.
[2023-03-23 07:29:22] [INFO ] Deduced a trap composed of 4 places in 965 ms of which 7 ms to minimize.
[2023-03-23 07:29:22] [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 0
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-23 07:29:23] [INFO ] [Real]Absence check using 4 positive place invariants in 23 ms returned sat
[2023-03-23 07:29:23] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 278 ms returned sat
[2023-03-23 07:29:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:24] [INFO ] [Real]Absence check using state equation in 626 ms returned sat
[2023-03-23 07:29:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 07:29:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 14 ms returned sat
[2023-03-23 07:29:24] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 298 ms returned sat
[2023-03-23 07:29:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:25] [INFO ] [Nat]Absence check using state equation in 651 ms returned sat
[2023-03-23 07:29:25] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 27 ms.
[2023-03-23 07:29:25] [INFO ] Added : 60 causal constraints over 12 iterations in 635 ms. Result :sat
Minimization took 98 ms.
[2023-03-23 07:29:26] [INFO ] [Real]Absence check using 4 positive place invariants in 14 ms returned sat
[2023-03-23 07:29:26] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 294 ms returned sat
[2023-03-23 07:29:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:27] [INFO ] [Real]Absence check using state equation in 640 ms returned sat
[2023-03-23 07:29:27] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 25 ms.
[2023-03-23 07:29:28] [INFO ] Added : 95 causal constraints over 19 iterations in 1079 ms. Result :sat
Minimization took 118 ms.
[2023-03-23 07:29:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 07:29:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 14 ms returned sat
[2023-03-23 07:29:29] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 288 ms returned sat
[2023-03-23 07:29:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:29] [INFO ] [Nat]Absence check using state equation in 640 ms returned sat
[2023-03-23 07:29:29] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 27 ms.
[2023-03-23 07:29:30] [INFO ] Added : 95 causal constraints over 19 iterations in 975 ms. Result :sat
Minimization took 134 ms.
[2023-03-23 07:29:31] [INFO ] [Real]Absence check using 4 positive place invariants in 13 ms returned sat
[2023-03-23 07:29:31] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 297 ms returned sat
[2023-03-23 07:29:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:32] [INFO ] [Real]Absence check using state equation in 1090 ms returned sat
[2023-03-23 07:29:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 07:29:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 14 ms returned sat
[2023-03-23 07:29:32] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 298 ms returned sat
[2023-03-23 07:29:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:34] [INFO ] [Nat]Absence check using state equation in 1130 ms returned sat
[2023-03-23 07:29:34] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 24 ms.
[2023-03-23 07:29:34] [INFO ] Added : 72 causal constraints over 15 iterations in 748 ms. Result :sat
Minimization took 242 ms.
[2023-03-23 07:29:35] [INFO ] [Real]Absence check using 4 positive place invariants in 13 ms returned sat
[2023-03-23 07:29:35] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 296 ms returned sat
[2023-03-23 07:29:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:36] [INFO ] [Real]Absence check using state equation in 934 ms returned sat
[2023-03-23 07:29:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 07:29:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 15 ms returned sat
[2023-03-23 07:29:37] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 304 ms returned sat
[2023-03-23 07:29:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:38] [INFO ] [Nat]Absence check using state equation in 1066 ms returned sat
[2023-03-23 07:29:38] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 31 ms.
[2023-03-23 07:29:38] [INFO ] Added : 60 causal constraints over 12 iterations in 656 ms. Result :sat
Minimization took 159 ms.
[2023-03-23 07:29:39] [INFO ] [Real]Absence check using 4 positive place invariants in 13 ms returned sat
[2023-03-23 07:29:39] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 298 ms returned sat
[2023-03-23 07:29:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:40] [INFO ] [Real]Absence check using state equation in 572 ms returned sat
[2023-03-23 07:29:40] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 26 ms.
[2023-03-23 07:29:41] [INFO ] Added : 108 causal constraints over 22 iterations in 1280 ms. Result :sat
Minimization took 119 ms.
[2023-03-23 07:29:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 07:29:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 16 ms returned sat
[2023-03-23 07:29:42] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 295 ms returned sat
[2023-03-23 07:29:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:42] [INFO ] [Nat]Absence check using state equation in 575 ms returned sat
[2023-03-23 07:29:42] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 21 ms.
[2023-03-23 07:29:43] [INFO ] Added : 108 causal constraints over 22 iterations in 1147 ms. Result :sat
Minimization took 167 ms.
[2023-03-23 07:29:44] [INFO ] [Real]Absence check using 4 positive place invariants in 14 ms returned sat
[2023-03-23 07:29:44] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 347 ms returned sat
[2023-03-23 07:29:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:47] [INFO ] [Real]Absence check using state equation in 2490 ms returned sat
[2023-03-23 07:29:47] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 22 ms.
[2023-03-23 07:29:48] [INFO ] Added : 117 causal constraints over 24 iterations in 1345 ms. Result :sat
Minimization took 243 ms.
[2023-03-23 07:29:49] [INFO ] [Real]Absence check using 4 positive place invariants in 13 ms returned sat
[2023-03-23 07:29:49] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 300 ms returned sat
[2023-03-23 07:29:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:50] [INFO ] [Real]Absence check using state equation in 653 ms returned sat
[2023-03-23 07:29:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 07:29:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 16 ms returned sat
[2023-03-23 07:29:50] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 304 ms returned sat
[2023-03-23 07:29:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:51] [INFO ] [Nat]Absence check using state equation in 651 ms returned sat
[2023-03-23 07:29:51] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 21 ms.
[2023-03-23 07:29:51] [INFO ] Added : 37 causal constraints over 8 iterations in 467 ms. Result :sat
Minimization took 94 ms.
[2023-03-23 07:29:52] [INFO ] [Real]Absence check using 4 positive place invariants in 13 ms returned sat
[2023-03-23 07:29:52] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 298 ms returned sat
[2023-03-23 07:29:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:53] [INFO ] [Real]Absence check using state equation in 1027 ms returned sat
[2023-03-23 07:29:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 07:29:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 14 ms returned sat
[2023-03-23 07:29:53] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 284 ms returned sat
[2023-03-23 07:29:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:55] [INFO ] [Nat]Absence check using state equation in 1088 ms returned sat
[2023-03-23 07:29:55] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 26 ms.
[2023-03-23 07:29:56] [INFO ] Added : 95 causal constraints over 19 iterations in 977 ms. Result :sat
Minimization took 559 ms.
[2023-03-23 07:29:56] [INFO ] [Real]Absence check using 4 positive place invariants in 13 ms returned sat
[2023-03-23 07:29:57] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 298 ms returned sat
[2023-03-23 07:29:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:57] [INFO ] [Real]Absence check using state equation in 562 ms returned sat
[2023-03-23 07:29:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 07:29:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 20 ms returned sat
[2023-03-23 07:29:58] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 291 ms returned sat
[2023-03-23 07:29:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 07:29:58] [INFO ] [Nat]Absence check using state equation in 553 ms returned sat
[2023-03-23 07:29:58] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 29 ms.
[2023-03-23 07:30:00] [INFO ] Added : 107 causal constraints over 22 iterations in 1179 ms. Result :sat
Minimization took 244 ms.
[2023-03-23 07:30:00] [INFO ] [Real]Absence check using 4 positive place invariants in 21 ms returned sat
[2023-03-23 07:30:00] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 295 ms returned sat
[2023-03-23 07:30:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:30:01] [INFO ] [Real]Absence check using state equation in 644 ms returned sat
[2023-03-23 07:30:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 07:30:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 14 ms returned sat
[2023-03-23 07:30:01] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 278 ms returned sat
[2023-03-23 07:30:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 07:30:02] [INFO ] [Nat]Absence check using state equation in 636 ms returned sat
[2023-03-23 07:30:02] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 24 ms.
[2023-03-23 07:30:03] [INFO ] Added : 36 causal constraints over 8 iterations in 460 ms. Result :sat
Minimization took 93 ms.
Current structural bounds on expressions (after SMT) : [529, 1, 23, 23, 2147483647, 23, 23, 1, 23, 13, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-13 13 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-04 23 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-11 23 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-08 23 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-09 23 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-02 529 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-05 23 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 23 out of 1966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Graph (complete) has 16044 edges and 1966 vertex of which 189 are kept as prefixes of interest. Removing 1777 places using SCC suffix rule.6 ms
Discarding 1777 places :
Also discarding 209 output transitions
Drop transitions removed 209 transitions
Drop transitions removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Discarding 46 places :
Implicit places reduction removed 46 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 120 rules applied. Total rules applied 121 place count 143 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 122 place count 142 transition count 73
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 122 place count 142 transition count 26
Deduced a syphon composed of 47 places in 0 ms
Ensure Unique test removed 68 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 284 place count 27 transition count 26
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 284 place count 27 transition count 24
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 289 place count 24 transition count 24
Applied a total of 289 rules in 34 ms. Remains 24 /1966 variables (removed 1942) and now considering 24/356 (removed 332) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 24/1966 places, 24/356 transitions.
// Phase 1: matrix 24 rows 24 cols
[2023-03-23 07:30:04] [INFO ] Computed 0 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 40000 resets, run finished after 1262 ms. (steps per millisecond=792 ) properties (out of 1) seen :23
Incomplete Best-First random walk after 1000001 steps, including 3333 resets, run finished after 641 ms. (steps per millisecond=1560 ) properties (out of 1) seen :23
[2023-03-23 07:30:06] [INFO ] Invariant cache hit.
[2023-03-23 07:30:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:30:06] [INFO ] [Real]Absence check using state equation in 12 ms returned unsat
Current structural bounds on expressions (after SMT) : [23] Max seen :[23]
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-07 23 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 54948 ms.
ITS solved all properties within timeout

BK_STOP 1679556607453

--------------------
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-22"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is QuasiCertifProtocol-COL-22, 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 r299-tall-167873953500837"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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