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.r180-tall-171640604200781.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 itstools
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 r180-tall-171640604200781
=====================================================================

--------------------
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 1716520450179

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-24 03:14:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 03:14:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:14:11] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-05-24 03:14:11] [INFO ] Transformed 159 places.
[2024-05-24 03:14:11] [INFO ] Transformed 334 transitions.
[2024-05-24 03:14:11] [INFO ] Found NUPN structural information;
[2024-05-24 03:14:11] [INFO ] Parsed PT model containing 159 places and 334 transitions and 879 arcs in 170 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-24 03:14:11] [INFO ] Flow matrix only has 295 transitions (discarded 12 similar events)
// Phase 1: matrix 295 rows 159 cols
[2024-05-24 03:14:11] [INFO ] Computed 18 invariants in 23 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 (672 resets) in 38 ms. (256 steps per ms)
FORMULA HealthRecord-PT-11-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-11-UpperBounds-14 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-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (488 resets) in 42 ms. (1162 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-05-24 03:14:11] [INFO ] Flow matrix only has 295 transitions (discarded 12 similar events)
[2024-05-24 03:14:11] [INFO ] Invariant cache hit.
[2024-05-24 03:14:11] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-05-24 03:14:11] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2024-05-24 03:14:12] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-05-24 03:14:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:14:12] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-24 03:14:12] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 29 ms.
[2024-05-24 03:14:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:14:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-24 03:14:12] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-24 03:14:12] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-24 03:14:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:14:12] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 24 ms.
[2024-05-24 03:14:12] [INFO ] Added : 14 causal constraints over 3 iterations in 91 ms. Result :sat
Minimization took 116 ms.
[2024-05-24 03:14:12] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 03:14:12] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2024-05-24 03:14:12] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-24 03:14:12] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:14:12] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 25 ms.
[2024-05-24 03:14:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:14:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 03:14:12] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 03:14:12] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-24 03:14:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-24 03:14:12] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 28 ms.
[2024-05-24 03:14:13] [INFO ] Added : 29 causal constraints over 7 iterations in 150 ms. Result :sat
Minimization took 143 ms.
[2024-05-24 03:14:13] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-24 03:14:13] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 03:14:13] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-24 03:14:13] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:14:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:14:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-05-24 03:14:13] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2024-05-24 03:14:13] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-24 03:14:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:14:13] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 23 ms.
[2024-05-24 03:14:13] [INFO ] Added : 16 causal constraints over 4 iterations in 94 ms. Result :sat
Minimization took 110 ms.
[2024-05-24 03:14:13] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-24 03:14:13] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 03:14:13] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-24 03:14:13] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:14:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:14:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-24 03:14:13] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-24 03:14:13] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-24 03:14:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:14:14] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 31 ms.
[2024-05-24 03:14:14] [INFO ] Added : 14 causal constraints over 3 iterations in 92 ms. Result :sat
Minimization took 109 ms.
[2024-05-24 03:14:14] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-24 03:14:14] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 03:14:14] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-24 03:14:14] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:14:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:14:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 03:14:14] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2024-05-24 03:14:14] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-24 03:14:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:14:14] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 26 ms.
[2024-05-24 03:14:14] [INFO ] Added : 12 causal constraints over 3 iterations in 85 ms. Result :sat
Minimization took 109 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-11-UpperBounds-12 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:[1, 0] Max Struct:[1, 1]
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 307/307 transitions.
Graph (trivial) has 238 edges and 159 vertex of which 8 / 159 are part of one of the 4 SCC in 2 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 669 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 282
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 276
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 275
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 273
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 24 place count 136 transition count 273
Discarding 79 places :
Symmetric choice reduction at 3 with 79 rule applications. Total rules 103 place count 57 transition count 115
Iterating global reduction 3 with 79 rules applied. Total rules applied 182 place count 57 transition count 115
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 192 place count 47 transition count 95
Iterating global reduction 3 with 10 rules applied. Total rules applied 202 place count 47 transition count 95
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 211 place count 47 transition count 86
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 214 place count 44 transition count 77
Iterating global reduction 4 with 3 rules applied. Total rules applied 217 place count 44 transition count 77
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 220 place count 41 transition count 71
Iterating global reduction 4 with 3 rules applied. Total rules applied 223 place count 41 transition count 71
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 231 place count 41 transition count 63
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 233 place count 40 transition count 62
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 245 place count 34 transition count 96
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 246 place count 34 transition count 95
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 247 place count 34 transition count 166
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 251 place count 33 transition count 163
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 252 place count 33 transition count 162
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 253 place count 32 transition count 124
Iterating global reduction 6 with 1 rules applied. Total rules applied 254 place count 32 transition count 124
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 255 place count 31 transition count 121
Iterating global reduction 6 with 1 rules applied. Total rules applied 256 place count 31 transition count 121
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 266 place count 31 transition count 111
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 275 place count 31 transition count 111
Applied a total of 275 rules in 84 ms. Remains 31 /159 variables (removed 128) and now considering 111/307 (removed 196) transitions.
Running 95 sub problems to find dead transitions.
[2024-05-24 03:14:14] [INFO ] Flow matrix only has 95 transitions (discarded 16 similar events)
// Phase 1: matrix 95 rows 31 cols
[2024-05-24 03:14:14] [INFO ] Computed 7 invariants in 6 ms
[2024-05-24 03:14:14] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 95 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD110 is UNSAT
At refinement iteration 3 (OVERLAPS) 95/126 variables, 31/38 constraints. Problems are: Problem set: 2 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 20/58 constraints. Problems are: Problem set: 2 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/58 constraints. Problems are: Problem set: 2 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 0/126 variables, 0/58 constraints. Problems are: Problem set: 2 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 58 constraints, problems are : Problem set: 2 solved, 93 unsolved in 1200 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 31/31 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 2/31 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 95/126 variables, 31/38 constraints. Problems are: Problem set: 2 solved, 93 unsolved
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 20/58 constraints. Problems are: Problem set: 6 solved, 89 unsolved
Problem TDEAD38 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 89/147 constraints. Problems are: Problem set: 7 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/147 constraints. Problems are: Problem set: 7 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 0/126 variables, 0/147 constraints. Problems are: Problem set: 7 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 147 constraints, problems are : Problem set: 7 solved, 88 unsolved in 1938 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 31/31 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 89/95 constraints, Known Traps: 0/0 constraints]
After SMT, in 3322ms problems are : Problem set: 7 solved, 88 unsolved
Search for dead transitions found 7 dead transitions in 3334ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 7 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 31/159 places, 104/307 transitions.
Graph (complete) has 119 edges and 31 vertex of which 30 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output 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 8 place count 30 transition count 104
Applied a total of 8 rules in 8 ms. Remains 30 /31 variables (removed 1) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3441 ms. Remains : 30/159 places, 104/307 transitions.
[2024-05-24 03:14:18] [INFO ] Flow matrix only has 88 transitions (discarded 16 similar events)
// Phase 1: matrix 88 rows 30 cols
[2024-05-24 03:14:18] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0] Max Struct:[1, 1]
FORMULA HealthRecord-PT-11-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (227235 resets) in 1580 ms. (632 steps per ms)
BEST_FIRST walk for 1000001 steps (25665 resets) in 367 ms. (2717 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 03:14:20] [INFO ] Flow matrix only has 88 transitions (discarded 16 similar events)
[2024-05-24 03:14:20] [INFO ] Invariant cache hit.
[2024-05-24 03:14:20] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-24 03:14:20] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-24 03:14:20] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-24 03:14:20] [INFO ] [Real]Added 19 Read/Feed constraints in 4 ms returned sat
[2024-05-24 03:14:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:14:20] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-24 03:14:20] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-24 03:14:20] [INFO ] [Nat]Added 19 Read/Feed constraints in 3 ms returned sat
[2024-05-24 03:14:20] [INFO ] Computed and/alt/rep : 20/117/20 causal constraints (skipped 52 transitions) in 11 ms.
[2024-05-24 03:14:20] [INFO ] Added : 2 causal constraints over 2 iterations in 26 ms. Result :sat
Minimization took 21 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:[0] Max Struct:[1]
Support contains 1 out of 30 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p148) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 102/102 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 29 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 28 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 28 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 28 transition count 97
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 28 transition count 96
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 27 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 11 place count 27 transition count 92
Applied a total of 11 rules in 11 ms. Remains 27 /30 variables (removed 3) and now considering 92/102 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 27/30 places, 92/102 transitions.
[2024-05-24 03:14:20] [INFO ] Flow matrix only has 74 transitions (discarded 18 similar events)
// Phase 1: matrix 74 rows 27 cols
[2024-05-24 03:14:20] [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 (228571 resets) in 1460 ms. (684 steps per ms)
BEST_FIRST walk for 1000000 steps (25987 resets) in 340 ms. (2932 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 03:14:22] [INFO ] Flow matrix only has 74 transitions (discarded 18 similar events)
[2024-05-24 03:14:22] [INFO ] Invariant cache hit.
[2024-05-24 03:14:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 03:14:22] [INFO ] [Real]Absence check using 1 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-24 03:14:22] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-24 03:14:22] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-24 03:14:22] [INFO ] [Real]Added 19 Read/Feed constraints in 3 ms returned sat
[2024-05-24 03:14:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:14:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 03:14:22] [INFO ] [Nat]Absence check using 1 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-24 03:14:22] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-24 03:14:22] [INFO ] [Nat]Added 19 Read/Feed constraints in 3 ms returned sat
[2024-05-24 03:14:22] [INFO ] Computed and/alt/rep : 12/58/12 causal constraints (skipped 46 transitions) in 9 ms.
[2024-05-24 03:14:22] [INFO ] Added : 2 causal constraints over 1 iterations in 18 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:[0] Max Struct:[1]
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 92/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 27/27 places, 92/92 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 92/92 transitions.
Applied a total of 0 rules in 9 ms. Remains 27 /27 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-24 03:14:22] [INFO ] Flow matrix only has 74 transitions (discarded 18 similar events)
[2024-05-24 03:14:22] [INFO ] Invariant cache hit.
[2024-05-24 03:14:22] [INFO ] Implicit Places using invariants in 44 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 26/27 places, 92/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 57 ms. Remains : 26/27 places, 92/92 transitions.
[2024-05-24 03:14:22] [INFO ] Flow matrix only has 74 transitions (discarded 18 similar events)
// Phase 1: matrix 74 rows 26 cols
[2024-05-24 03:14:22] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (228344 resets) in 1429 ms. (699 steps per ms)
BEST_FIRST walk for 1000001 steps (25914 resets) in 326 ms. (3058 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 03:14:24] [INFO ] Flow matrix only has 74 transitions (discarded 18 similar events)
[2024-05-24 03:14:24] [INFO ] Invariant cache hit.
[2024-05-24 03:14:24] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 03:14:24] [INFO ] [Real]Absence check using 1 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-24 03:14:24] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-24 03:14:24] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-24 03:14:24] [INFO ] [Real]Added 19 Read/Feed constraints in 3 ms returned sat
[2024-05-24 03:14:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:14:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 03:14:24] [INFO ] [Nat]Absence check using 1 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-24 03:14:24] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-24 03:14:24] [INFO ] [Nat]Added 19 Read/Feed constraints in 4 ms returned sat
[2024-05-24 03:14:24] [INFO ] Computed and/alt/rep : 12/58/12 causal constraints (skipped 46 transitions) in 8 ms.
[2024-05-24 03:14:24] [INFO ] Added : 2 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 15 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:[0] Max Struct:[1]
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 92/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 26/26 places, 92/92 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-24 03:14:24] [INFO ] Flow matrix only has 74 transitions (discarded 18 similar events)
[2024-05-24 03:14:24] [INFO ] Invariant cache hit.
[2024-05-24 03:14:24] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-24 03:14:24] [INFO ] Flow matrix only has 74 transitions (discarded 18 similar events)
[2024-05-24 03:14:24] [INFO ] Invariant cache hit.
[2024-05-24 03:14:24] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-24 03:14:24] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2024-05-24 03:14:24] [INFO ] Redundant transitions in 14 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-24 03:14:24] [INFO ] Flow matrix only has 74 transitions (discarded 18 similar events)
[2024-05-24 03:14:24] [INFO ] Invariant cache hit.
[2024-05-24 03:14:24] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 2/26 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
At refinement iteration 4 (OVERLAPS) 74/100 variables, 26/33 constraints. Problems are: Problem set: 7 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 19/52 constraints. Problems are: Problem set: 7 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/52 constraints. Problems are: Problem set: 7 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/100 variables, 0/52 constraints. Problems are: Problem set: 7 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 52 constraints, problems are : Problem set: 7 solved, 69 unsolved in 658 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 26/26 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 6/6 constraints. Problems are: Problem set: 7 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 7 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 2/26 variables, 1/7 constraints. Problems are: Problem set: 7 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 7 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 74/100 variables, 26/33 constraints. Problems are: Problem set: 7 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 19/52 constraints. Problems are: Problem set: 7 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 69/121 constraints. Problems are: Problem set: 7 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/121 constraints. Problems are: Problem set: 7 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/100 variables, 0/121 constraints. Problems are: Problem set: 7 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 121 constraints, problems are : Problem set: 7 solved, 69 unsolved in 1141 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 26/26 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 69/76 constraints, Known Traps: 0/0 constraints]
After SMT, in 1863ms problems are : Problem set: 7 solved, 69 unsolved
Search for dead transitions found 7 dead transitions in 1865ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 26/26 places, 85/92 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 25 transition count 84
Applied a total of 2 rules in 5 ms. Remains 25 /26 variables (removed 1) and now considering 84/85 (removed 1) transitions.
[2024-05-24 03:14:26] [INFO ] Flow matrix only has 66 transitions (discarded 18 similar events)
// Phase 1: matrix 66 rows 25 cols
[2024-05-24 03:14:26] [INFO ] Computed 8 invariants in 0 ms
[2024-05-24 03:14:26] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-24 03:14:26] [INFO ] Flow matrix only has 66 transitions (discarded 18 similar events)
[2024-05-24 03:14:26] [INFO ] Invariant cache hit.
[2024-05-24 03:14:26] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-24 03:14:26] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 25/26 places, 84/92 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2067 ms. Remains : 25/26 places, 84/92 transitions.
[2024-05-24 03:14:26] [INFO ] Flow matrix only has 66 transitions (discarded 18 similar events)
[2024-05-24 03:14:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (235384 resets) in 1416 ms. (705 steps per ms)
BEST_FIRST walk for 1000001 steps (26198 resets) in 321 ms. (3105 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 03:14:28] [INFO ] Flow matrix only has 66 transitions (discarded 18 similar events)
[2024-05-24 03:14:28] [INFO ] Invariant cache hit.
[2024-05-24 03:14:28] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 03:14:28] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-24 03:14:28] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-24 03:14:28] [INFO ] [Real]Added 19 Read/Feed constraints in 3 ms returned sat
[2024-05-24 03:14:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:14:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 03:14:28] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-24 03:14:28] [INFO ] [Nat]Added 19 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:14:28] [INFO ] Computed and/alt/rep : 11/57/11 causal constraints (skipped 39 transitions) in 9 ms.
[2024-05-24 03:14:28] [INFO ] Added : 1 causal constraints over 1 iterations in 22 ms. Result :sat
Minimization took 11 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:[0] Max Struct:[1]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 84/84 transitions.
Applied a total of 0 rules in 4 ms. Remains 25 /25 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 25/25 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-24 03:14:28] [INFO ] Flow matrix only has 66 transitions (discarded 18 similar events)
[2024-05-24 03:14:28] [INFO ] Invariant cache hit.
[2024-05-24 03:14:28] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-24 03:14:28] [INFO ] Flow matrix only has 66 transitions (discarded 18 similar events)
[2024-05-24 03:14:28] [INFO ] Invariant cache hit.
[2024-05-24 03:14:28] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-24 03:14:28] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-24 03:14:28] [INFO ] Redundant transitions in 14 ms returned []
Running 68 sub problems to find dead transitions.
[2024-05-24 03:14:28] [INFO ] Flow matrix only has 66 transitions (discarded 18 similar events)
[2024-05-24 03:14:28] [INFO ] Invariant cache hit.
[2024-05-24 03:14:28] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 2/25 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (OVERLAPS) 66/91 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 52 constraints, problems are : Problem set: 0 solved, 68 unsolved in 631 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 25/25 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 2/25 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (OVERLAPS) 66/91 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 68/120 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 120 constraints, problems are : Problem set: 0 solved, 68 unsolved in 1077 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 25/25 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
After SMT, in 1759ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 1760ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1874 ms. Remains : 25/25 places, 84/84 transitions.
RANDOM walk for 34195 steps (8037 resets) in 796 ms. (42 steps per ms) remains 0/2 properties
[2024-05-24 03:14:30] [INFO ] Flatten gal took : 39 ms
[2024-05-24 03:14:30] [INFO ] Flatten gal took : 14 ms
[2024-05-24 03:14:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5965327322672410233.gal : 7 ms
[2024-05-24 03:14:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8696613006211051356.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5965327322672410233.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8696613006211051356.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read1(BufferedInputStream.java:281)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:343)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
FORMULA HealthRecord-PT-11-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 19139 ms.

BK_STOP 1716520470569

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-11"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
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 r180-tall-171640604200781"
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 ;