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.r245-tall-171654350400685.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 PGCD-COL-D02N005, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654350400685
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.3K Apr 11 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 11 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 11 15:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 11 15:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 6 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 6 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 6 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 6 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 15:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Apr 11 15:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 11 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 6 10:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 6 10:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 11K 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 PGCD-COL-D02N005-UpperBounds-00
FORMULA_NAME PGCD-COL-D02N005-UpperBounds-01
FORMULA_NAME PGCD-COL-D02N005-UpperBounds-02
FORMULA_NAME PGCD-COL-D02N005-UpperBounds-03
FORMULA_NAME PGCD-COL-D02N005-UpperBounds-04
FORMULA_NAME PGCD-COL-D02N005-UpperBounds-05
FORMULA_NAME PGCD-COL-D02N005-UpperBounds-06
FORMULA_NAME PGCD-COL-D02N005-UpperBounds-07
FORMULA_NAME PGCD-COL-D02N005-UpperBounds-08
FORMULA_NAME PGCD-COL-D02N005-UpperBounds-09
FORMULA_NAME PGCD-COL-D02N005-UpperBounds-10
FORMULA_NAME PGCD-COL-D02N005-UpperBounds-11
FORMULA_NAME PGCD-COL-D02N005-UpperBounds-12
FORMULA_NAME PGCD-COL-D02N005-UpperBounds-13
FORMULA_NAME PGCD-COL-D02N005-UpperBounds-14
FORMULA_NAME PGCD-COL-D02N005-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716701795965

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PGCD-COL-D02N005
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 05:36:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-26 05:36:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 05:36:37] [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.
[2024-05-26 05:36:37] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 05:36:37] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 512 ms
[2024-05-26 05:36:37] [INFO ] Imported 3 HL places and 3 HL transitions for a total of 9 PT places and 9.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Reduction of identical properties reduced properties to check from 16 to 3
[2024-05-26 05:36:37] [INFO ] Built PT skeleton of HLPN with 3 places and 3 transitions 14 arcs in 3 ms.
[2024-05-26 05:36:37] [INFO ] Skeletonized 3 HLPN properties in 0 ms.
// Phase 1: matrix 3 rows 3 cols
[2024-05-26 05:36:37] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[3, 3, 15] Max Struct:[18, 18, 18]
[2024-05-26 05:36:37] [INFO ] Invariant cache hit.
[2024-05-26 05:36:37] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-26 05:36:37] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-26 05:36:38] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 05:36:38] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 7 ms.
[2024-05-26 05:36:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 05:36:38] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-26 05:36:38] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 05:36:38] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Minimization took 2 ms.
[2024-05-26 05:36:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 05:36:38] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-26 05:36:38] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-26 05:36:38] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[3, 3, 15] Max Struct:[18, 18, 18]
Arc [1:1*[(MOD (ADD $x 1) 3)]] contains successor/predecessor on variables of sort CD
[2024-05-26 05:36:38] [INFO ] Unfolded HLPN to a Petri net with 9 places and 9 transitions 42 arcs in 10 ms.
[2024-05-26 05:36:38] [INFO ] Unfolded 3 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[3, 3, 15] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[3, 3, 15] Max Struct:[18, 18, 18]
Current structural bounds on expressions (Before main loop) : Max Seen:[3, 3, 15] Max Struct:[18, 18, 18]
// Phase 1: matrix 9 rows 9 cols
[2024-05-26 05:36:38] [INFO ] Computed 4 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 3, 15] Max Struct:[18, 18, 18]
RANDOM walk for 10001 steps (2 resets) in 16 ms. (588 steps per ms)
FORMULA PGCD-COL-D02N005-UpperBounds-10 18 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N005-UpperBounds-04 18 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N005-UpperBounds-01 18 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N005-UpperBounds-02 18 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N005-UpperBounds-03 18 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N005-UpperBounds-05 18 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N005-UpperBounds-07 18 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N005-UpperBounds-08 18 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N005-UpperBounds-11 18 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N005-UpperBounds-13 18 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N005-UpperBounds-14 18 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N005-UpperBounds-15 18 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D02N005-UpperBounds-00 18 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20001 steps (4 resets) in 19 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[16] Max Struct:[18]
[2024-05-26 05:36:38] [INFO ] Invariant cache hit.
[2024-05-26 05:36:38] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-26 05:36:38] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-26 05:36:38] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-26 05:36:38] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 05:36:38] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 05:36:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 05:36:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-26 05:36:38] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 05:36:38] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-26 05:36:38] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 05:36:38] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 05:36:38] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[16] Max Struct:[18]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16] Max Struct:[18]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 8 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Running 3 sub problems to find dead transitions.
[2024-05-26 05:36:38] [INFO ] Invariant cache hit.
[2024-05-26 05:36:38] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 3/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 9/18 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 16 constraints, problems are : Problem set: 0 solved, 3 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 9/9 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 3/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 9/18 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/18 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 19 constraints, problems are : Problem set: 0 solved, 3 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 9/9 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 158ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 165ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 9/9 places, 9/9 transitions.
[2024-05-26 05:36:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[16] Max Struct:[18]
RANDOM walk for 1000006 steps (6 resets) in 422 ms. (2364 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 309 ms. (3225 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[16] Max Struct:[18]
[2024-05-26 05:36:39] [INFO ] Invariant cache hit.
[2024-05-26 05:36:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 05:36:39] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 05:36:39] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-26 05:36:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 05:36:39] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 05:36:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 05:36:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-26 05:36:39] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 05:36:39] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-26 05:36:39] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 05:36:39] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 05:36:39] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[16] Max Struct:[18]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16] Max Struct:[18]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 9/9 places, 9/9 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 05:36:39] [INFO ] Invariant cache hit.
[2024-05-26 05:36:39] [INFO ] Implicit Places using invariants in 40 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 43 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 6/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 45 ms. Remains : 6/9 places, 9/9 transitions.
// Phase 1: matrix 9 rows 6 cols
[2024-05-26 05:36:39] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[16] Max Struct:[18]
RANDOM walk for 1000000 steps (8 resets) in 406 ms. (2457 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 218 ms. (4566 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[16] Max Struct:[18]
[2024-05-26 05:36:39] [INFO ] Invariant cache hit.
[2024-05-26 05:36:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 05:36:39] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-26 05:36:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 05:36:40] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-26 05:36:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 05:36:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-26 05:36:40] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-26 05:36:40] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 05:36:40] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 05:36:40] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[16] Max Struct:[18]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16] Max Struct:[18]
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 6/6 places, 9/9 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 05:36:40] [INFO ] Invariant cache hit.
[2024-05-26 05:36:40] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-26 05:36:40] [INFO ] Invariant cache hit.
[2024-05-26 05:36:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 05:36:40] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-26 05:36:40] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-26 05:36:40] [INFO ] Invariant cache hit.
[2024-05-26 05:36:40] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 13 constraints, problems are : Problem set: 0 solved, 3 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 84ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 85ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 6/6 places, 9/9 transitions.
RANDOM walk for 40005 steps (8 resets) in 351 ms. (113 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
Probably explored full state space saw : 8484 states, properties seen :0
Probabilistic random walk after 51828 steps, saw 8484 distinct states, run finished after 177 ms. (steps per millisecond=292 ) properties seen :0
Explored full state space saw : 8484 states, properties seen :0
Exhaustive walk after 51828 steps, saw 8484 distinct states, run finished after 106 ms. (steps per millisecond=488 ) properties seen :0
FORMULA PGCD-COL-D02N005-UpperBounds-09 16 TECHNIQUES REACHABILITY_MIN
FORMULA PGCD-COL-D02N005-UpperBounds-12 16 TECHNIQUES REACHABILITY_MIN
FORMULA PGCD-COL-D02N005-UpperBounds-06 16 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 3627 ms.
ITS solved all properties within timeout

BK_STOP 1716701800789

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="PGCD-COL-D02N005"
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 PGCD-COL-D02N005, 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 r245-tall-171654350400685"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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