Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r311-tall-171662335800077.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is QuasiCertifProtocol-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662335800077
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 20K Apr 13 03:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 13 03:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 03:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 13 03:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 54K Apr 13 04:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 429K Apr 13 04:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 04:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 13 04:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.4K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 149K May 18 16:43 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-PT-10-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716656035163

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 16:53:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-25 16:53:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:53:56] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-05-25 16:53:56] [INFO ] Transformed 550 places.
[2024-05-25 16:53:56] [INFO ] Transformed 176 transitions.
[2024-05-25 16:53:56] [INFO ] Parsed PT model containing 550 places and 176 transitions and 1287 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 11, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 11, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 176 rows 550 cols
[2024-05-25 16:53:56] [INFO ] Computed 375 invariants in 42 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 11, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0] Max Struct:[+inf, +inf, 121, 121, +inf, 121, 121, +inf, 1, 11, +inf, 6, 1, 11, 1, +inf]
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (694 resets) in 78 ms. (126 steps per ms)
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130010 steps (962 resets) in 217 ms. (596 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 11, 11, 0, 11, 11, 0, 0, 1, 0, 0, 1, 0] Max Struct:[+inf, +inf, 121, 121, +inf, 121, 121, +inf, 11, +inf, 6, 11, +inf]
[2024-05-25 16:53:57] [INFO ] Invariant cache hit.
[2024-05-25 16:53:57] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2024-05-25 16:53:57] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 74 ms returned sat
[2024-05-25 16:53:57] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2024-05-25 16:53:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:53:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2024-05-25 16:53:57] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 52 ms returned sat
[2024-05-25 16:53:58] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2024-05-25 16:53:58] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 18 ms.
[2024-05-25 16:53:58] [INFO ] Added : 45 causal constraints over 9 iterations in 247 ms. Result :sat
Minimization took 545 ms.
[2024-05-25 16:53:59] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-25 16:53:59] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 58 ms returned sat
[2024-05-25 16:53:59] [INFO ] [Real]Absence check using state equation in 118 ms returned unsat
[2024-05-25 16:53:59] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned unsat
[2024-05-25 16:53:59] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-25 16:53:59] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 47 ms returned sat
[2024-05-25 16:53:59] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2024-05-25 16:53:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:53:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-25 16:53:59] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 52 ms returned sat
[2024-05-25 16:54:00] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2024-05-25 16:54:00] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 13 ms.
[2024-05-25 16:54:00] [INFO ] Added : 50 causal constraints over 10 iterations in 249 ms. Result :sat
Minimization took 543 ms.
[2024-05-25 16:54:00] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-25 16:54:00] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 49 ms returned sat
[2024-05-25 16:54:01] [INFO ] [Real]Absence check using state equation in 158 ms returned unsat
[2024-05-25 16:54:01] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned unsat
[2024-05-25 16:54:01] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-25 16:54:01] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 57 ms returned sat
[2024-05-25 16:54:01] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2024-05-25 16:54:01] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 16 ms.
[2024-05-25 16:54:01] [INFO ] Added : 53 causal constraints over 11 iterations in 304 ms. Result :sat
Minimization took 485 ms.
[2024-05-25 16:54:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:54:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-25 16:54:02] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 51 ms returned sat
[2024-05-25 16:54:02] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2024-05-25 16:54:02] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 14 ms.
[2024-05-25 16:54:03] [INFO ] Added : 53 causal constraints over 11 iterations in 245 ms. Result :sat
Minimization took 550 ms.
[2024-05-25 16:54:03] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-25 16:54:03] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 55 ms returned sat
[2024-05-25 16:54:03] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-05-25 16:54:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:54:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-25 16:54:04] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 54 ms returned sat
[2024-05-25 16:54:04] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2024-05-25 16:54:04] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 18 ms.
[2024-05-25 16:54:04] [INFO ] Added : 26 causal constraints over 6 iterations in 142 ms. Result :sat
Minimization took 515 ms.
[2024-05-25 16:54:05] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-25 16:54:05] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 49 ms returned sat
[2024-05-25 16:54:05] [INFO ] [Real]Absence check using state equation in 41 ms returned unsat
[2024-05-25 16:54:05] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-25 16:54:05] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 52 ms returned sat
[2024-05-25 16:54:05] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-05-25 16:54:05] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 16 ms.
[2024-05-25 16:54:05] [INFO ] Added : 31 causal constraints over 7 iterations in 185 ms. Result :sat
Minimization took 458 ms.
[2024-05-25 16:54:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:54:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-25 16:54:06] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 48 ms returned sat
[2024-05-25 16:54:06] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2024-05-25 16:54:06] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 21 ms.
[2024-05-25 16:54:06] [INFO ] Added : 31 causal constraints over 7 iterations in 163 ms. Result :sat
Minimization took 530 ms.
[2024-05-25 16:54:07] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-25 16:54:07] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 57 ms returned sat
[2024-05-25 16:54:07] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2024-05-25 16:54:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:54:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-25 16:54:07] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 56 ms returned sat
[2024-05-25 16:54:07] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2024-05-25 16:54:07] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 15 ms.
[2024-05-25 16:54:08] [INFO ] Added : 52 causal constraints over 11 iterations in 225 ms. Result :sat
Minimization took 521 ms.
[2024-05-25 16:54:08] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-25 16:54:08] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 50 ms returned sat
[2024-05-25 16:54:08] [INFO ] [Real]Absence check using state equation in 42 ms returned unsat
[2024-05-25 16:54:08] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-25 16:54:08] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 56 ms returned sat
[2024-05-25 16:54:08] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2024-05-25 16:54:09] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 10 ms.
[2024-05-25 16:54:09] [INFO ] Added : 38 causal constraints over 8 iterations in 200 ms. Result :sat
Minimization took 515 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 11, 11, 0, 11, 11, 0, 0, 1, 0, 0, 1, 0] Max Struct:[+inf, 11, 11, 121, 11, 11, 121, +inf, 1, +inf, 6, 1, +inf]
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-05 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-04 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-02 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-01 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[121, 8, 11, 11, 1, 6, 1] Max Struct:[+inf, 121, 121, +inf, +inf, 6, +inf]
Support contains 156 out of 550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 176/176 transitions.
Graph (complete) has 2400 edges and 550 vertex of which 415 are kept as prefixes of interest. Removing 135 places using SCC suffix rule.3 ms
Discarding 135 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 94 rules applied. Total rules applied 95 place count 393 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 96 place count 392 transition count 104
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 96 place count 392 transition count 81
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 32 places
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 174 place count 337 transition count 81
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 174 place count 337 transition count 79
Deduced a syphon composed of 2 places in 1 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 179 place count 334 transition count 79
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 189 place count 324 transition count 69
Iterating global reduction 2 with 10 rules applied. Total rules applied 199 place count 324 transition count 69
Applied a total of 199 rules in 85 ms. Remains 324 /550 variables (removed 226) and now considering 69/176 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 324/550 places, 69/176 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 69 rows 324 cols
[2024-05-25 16:54:10] [INFO ] Computed 255 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[121, 8, 11, 11, 1, 6, 1] Max Struct:[+inf, 121, 121, +inf, +inf, 6, +inf]
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-11 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (15389 resets) in 6716 ms. (148 steps per ms)
BEST_FIRST walk for 6000005 steps (11645 resets) in 14209 ms. (422 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[121, 11, 11, 11, 1, 1] Max Struct:[+inf, 121, 121, +inf, +inf, +inf]
[2024-05-25 16:54:30] [INFO ] Invariant cache hit.
[2024-05-25 16:54:31] [INFO ] [Real]Absence check using 0 positive and 255 generalized place invariants in 57 ms returned unsat
[2024-05-25 16:54:31] [INFO ] [Real]Absence check using 0 positive and 255 generalized place invariants in 41 ms returned sat
[2024-05-25 16:54:31] [INFO ] [Real]Absence check using state equation in 25 ms returned unsat
[2024-05-25 16:54:31] [INFO ] [Real]Absence check using 0 positive and 255 generalized place invariants in 42 ms returned sat
[2024-05-25 16:54:31] [INFO ] [Real]Absence check using state equation in 18 ms returned unsat
[2024-05-25 16:54:31] [INFO ] [Real]Absence check using 0 positive and 255 generalized place invariants in 38 ms returned unsat
[2024-05-25 16:54:31] [INFO ] [Real]Absence check using 0 positive and 255 generalized place invariants in 41 ms returned sat
[2024-05-25 16:54:31] [INFO ] [Real]Absence check using state equation in 64 ms returned unsat
[2024-05-25 16:54:31] [INFO ] [Real]Absence check using 0 positive and 255 generalized place invariants in 49 ms returned sat
[2024-05-25 16:54:31] [INFO ] [Real]Absence check using state equation in 34 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[121, 11, 11, 11, 1, 1] Max Struct:[121, 11, 11, 11, 1, 1]
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-07 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-06 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-03 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-00 121 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 35378 ms.
ITS solved all properties within timeout

BK_STOP 1716656071813

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-PT-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is QuasiCertifProtocol-PT-10, 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 r311-tall-171662335800077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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