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.r179-tall-171640602300781.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 HealthRecord-PT-11, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640602300781
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 15:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 20:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 20:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 20:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 20:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 70K May 18 16:42 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 HealthRecord-PT-11-UpperBounds-00
FORMULA_NAME HealthRecord-PT-11-UpperBounds-01
FORMULA_NAME HealthRecord-PT-11-UpperBounds-02
FORMULA_NAME HealthRecord-PT-11-UpperBounds-03
FORMULA_NAME HealthRecord-PT-11-UpperBounds-04
FORMULA_NAME HealthRecord-PT-11-UpperBounds-05
FORMULA_NAME HealthRecord-PT-11-UpperBounds-06
FORMULA_NAME HealthRecord-PT-11-UpperBounds-07
FORMULA_NAME HealthRecord-PT-11-UpperBounds-08
FORMULA_NAME HealthRecord-PT-11-UpperBounds-09
FORMULA_NAME HealthRecord-PT-11-UpperBounds-10
FORMULA_NAME HealthRecord-PT-11-UpperBounds-11
FORMULA_NAME HealthRecord-PT-11-UpperBounds-12
FORMULA_NAME HealthRecord-PT-11-UpperBounds-13
FORMULA_NAME HealthRecord-PT-11-UpperBounds-14
FORMULA_NAME HealthRecord-PT-11-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716490974824

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 19:02:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-23 19:02:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 19:02:56] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2024-05-23 19:02:56] [INFO ] Transformed 159 places.
[2024-05-23 19:02:56] [INFO ] Transformed 334 transitions.
[2024-05-23 19:02:56] [INFO ] Found NUPN structural information;
[2024-05-23 19:02:56] [INFO ] Parsed PT model containing 159 places and 334 transitions and 879 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-23 19:02:56] [INFO ] Flow matrix only has 295 transitions (discarded 12 similar events)
// Phase 1: matrix 295 rows 159 cols
[2024-05-23 19:02:56] [INFO ] Computed 18 invariants in 19 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (674 resets) in 40 ms. (243 steps per ms)
FORMULA HealthRecord-PT-11-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-11-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-11-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-11-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-11-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-11-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-11-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-11-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-11-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-11-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-11-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-11-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (386 resets) in 36 ms. (1081 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-05-23 19:02:56] [INFO ] Flow matrix only has 295 transitions (discarded 12 similar events)
[2024-05-23 19:02:56] [INFO ] Invariant cache hit.
[2024-05-23 19:02:56] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2024-05-23 19:02:56] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2024-05-23 19:02:56] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-23 19:02:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 19:02:56] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2024-05-23 19:02:56] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 27 ms.
[2024-05-23 19:02:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:02:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-23 19:02:56] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-23 19:02:56] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-23 19:02:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-23 19:02:57] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 26 ms.
[2024-05-23 19:02:57] [INFO ] Added : 29 causal constraints over 7 iterations in 145 ms. Result :sat
Minimization took 109 ms.
[2024-05-23 19:02:57] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-23 19:02:57] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-23 19:02:57] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-23 19:02:57] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 19:02:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:02:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-23 19:02:57] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-23 19:02:57] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-23 19:02:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 19:02:57] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 24 ms.
[2024-05-23 19:02:57] [INFO ] Added : 16 causal constraints over 4 iterations in 98 ms. Result :sat
Minimization took 109 ms.
[2024-05-23 19:02:57] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-23 19:02:57] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-23 19:02:57] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-23 19:02:57] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 19:02:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:02:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2024-05-23 19:02:57] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-23 19:02:57] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-23 19:02:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 19:02:58] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 18 ms.
[2024-05-23 19:02:58] [INFO ] Added : 14 causal constraints over 3 iterations in 82 ms. Result :sat
Minimization took 102 ms.
[2024-05-23 19:02:58] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-23 19:02:58] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-23 19:02:58] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-23 19:02:58] [INFO ] [Real]Added 1 Read/Feed constraints in 6 ms returned sat
[2024-05-23 19:02:58] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 23 ms.
[2024-05-23 19:02:58] [INFO ] Added : 8 causal constraints over 2 iterations in 82 ms. Result :sat
Minimization took 137 ms.
[2024-05-23 19:02:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:02:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-23 19:02:58] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-23 19:02:58] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-23 19:02:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 19:02:58] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 22 ms.
[2024-05-23 19:02:58] [INFO ] Added : 8 causal constraints over 2 iterations in 69 ms. Result :sat
Minimization took 121 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA HealthRecord-PT-11-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 159 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p148) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 305/305 transitions.
Graph (trivial) has 240 edges and 159 vertex of which 8 / 159 are part of one of the 4 SCC in 7 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 667 edges and 155 vertex of which 145 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 145 transition count 280
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 16 place count 141 transition count 274
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 19 place count 139 transition count 273
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 19 place count 139 transition count 271
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 3 with 5 rules applied. Total rules applied 24 place count 136 transition count 271
Discarding 80 places :
Symmetric choice reduction at 3 with 80 rule applications. Total rules 104 place count 56 transition count 111
Iterating global reduction 3 with 80 rules applied. Total rules applied 184 place count 56 transition count 111
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 194 place count 46 transition count 91
Iterating global reduction 3 with 10 rules applied. Total rules applied 204 place count 46 transition count 91
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 213 place count 46 transition count 82
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 216 place count 43 transition count 73
Iterating global reduction 4 with 3 rules applied. Total rules applied 219 place count 43 transition count 73
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 222 place count 40 transition count 67
Iterating global reduction 4 with 3 rules applied. Total rules applied 225 place count 40 transition count 67
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 234 place count 40 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 236 place count 39 transition count 57
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 248 place count 33 transition count 91
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 249 place count 33 transition count 90
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 251 place count 33 transition count 88
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 253 place count 31 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 255 place count 31 transition count 86
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 258 place count 31 transition count 149
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 262 place count 28 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 265 place count 28 transition count 145
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 266 place count 27 transition count 110
Iterating global reduction 7 with 1 rules applied. Total rules applied 267 place count 27 transition count 110
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 268 place count 26 transition count 107
Iterating global reduction 7 with 1 rules applied. Total rules applied 269 place count 26 transition count 107
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 279 place count 26 transition count 97
Applied a total of 279 rules in 100 ms. Remains 26 /159 variables (removed 133) and now considering 97/305 (removed 208) transitions.
Running 81 sub problems to find dead transitions.
[2024-05-23 19:02:59] [INFO ] Flow matrix only has 79 transitions (discarded 18 similar events)
// Phase 1: matrix 79 rows 26 cols
[2024-05-23 19:02:59] [INFO ] Computed 7 invariants in 3 ms
[2024-05-23 19:02:59] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 2/26 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Problem TDEAD96 is UNSAT
At refinement iteration 3 (OVERLAPS) 79/105 variables, 26/33 constraints. Problems are: Problem set: 1 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 20/53 constraints. Problems are: Problem set: 1 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 0/105 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 53 constraints, problems are : Problem set: 1 solved, 80 unsolved in 1024 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 26/26 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 2/26 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 79/105 variables, 26/33 constraints. Problems are: Problem set: 1 solved, 80 unsolved
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 20/53 constraints. Problems are: Problem set: 6 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 75/128 constraints. Problems are: Problem set: 6 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/128 constraints. Problems are: Problem set: 6 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 0/105 variables, 0/128 constraints. Problems are: Problem set: 6 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 128 constraints, problems are : Problem set: 6 solved, 75 unsolved in 1521 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 26/26 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 75/81 constraints, Known Traps: 0/0 constraints]
After SMT, in 2693ms problems are : Problem set: 6 solved, 75 unsolved
Search for dead transitions found 6 dead transitions in 2704ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 6 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 26/159 places, 91/305 transitions.
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 26 transition count 91
Applied a total of 7 rules in 6 ms. Remains 26 /26 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2832 ms. Remains : 26/159 places, 91/305 transitions.
[2024-05-23 19:03:01] [INFO ] Flow matrix only has 73 transitions (discarded 18 similar events)
// Phase 1: matrix 73 rows 26 cols
[2024-05-23 19:03:01] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (235114 resets) in 1570 ms. (636 steps per ms)
BEST_FIRST walk for 1000001 steps (26212 resets) in 353 ms. (2824 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-23 19:03:03] [INFO ] Flow matrix only has 73 transitions (discarded 18 similar events)
[2024-05-23 19:03:03] [INFO ] Invariant cache hit.
[2024-05-23 19:03:03] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 19:03:03] [INFO ] [Real]Absence check using 1 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-23 19:03:03] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-23 19:03:03] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-23 19:03:03] [INFO ] [Real]Added 19 Read/Feed constraints in 3 ms returned sat
[2024-05-23 19:03:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:03:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 19:03:03] [INFO ] [Nat]Absence check using 1 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-23 19:03:03] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-23 19:03:03] [INFO ] [Nat]Added 19 Read/Feed constraints in 4 ms returned sat
[2024-05-23 19:03:03] [INFO ] Computed and/alt/rep : 11/57/11 causal constraints (skipped 46 transitions) in 16 ms.
[2024-05-23 19:03:03] [INFO ] Added : 1 causal constraints over 1 iterations in 24 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 91/91 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 26/26 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 91/91 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-05-23 19:03:03] [INFO ] Flow matrix only has 73 transitions (discarded 18 similar events)
[2024-05-23 19:03:03] [INFO ] Invariant cache hit.
[2024-05-23 19:03:04] [INFO ] Implicit Places using invariants in 53 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 25/26 places, 91/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 75 ms. Remains : 25/26 places, 91/91 transitions.
[2024-05-23 19:03:04] [INFO ] Flow matrix only has 73 transitions (discarded 18 similar events)
// Phase 1: matrix 73 rows 25 cols
[2024-05-23 19:03:04] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA HealthRecord-PT-11-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (235220 resets) in 1418 ms. (704 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after 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 9434 ms.
ITS solved all properties within timeout

BK_STOP 1716490985530

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="HealthRecord-PT-11"
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 HealthRecord-PT-11, 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 r179-tall-171640602300781"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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