Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r199-smll-167840345800319.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is HealthRecord-PT-11, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r199-smll-167840345800319
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.3K Feb 26 18:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 18:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 18:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 18:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 18:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 26 18:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 18:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 26 18:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 70K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-00
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-01
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-02
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-03
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-04
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-05
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-06
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-07
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-08
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-09
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-10
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-11
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-12
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-13
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-14
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678518122278

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-11
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 07:02:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 07:02:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 07:02:05] [INFO ] Load time of PNML (sax parser for PT used): 276 ms
[2023-03-11 07:02:05] [INFO ] Transformed 159 places.
[2023-03-11 07:02:05] [INFO ] Transformed 334 transitions.
[2023-03-11 07:02:05] [INFO ] Found NUPN structural information;
[2023-03-11 07:02:05] [INFO ] Parsed PT model containing 159 places and 334 transitions and 879 arcs in 497 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 53 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
Incomplete random walk after 10000 steps, including 675 resets, run finished after 956 ms. (steps per millisecond=10 ) properties (out of 16) seen :4
FORMULA HealthRecord-PT-11-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 12) seen :1
FORMULA HealthRecord-PT-11-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 123 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 99 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 101 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 97 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :1
FORMULA HealthRecord-PT-11-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-11 07:02:08] [INFO ] Flow matrix only has 295 transitions (discarded 12 similar events)
// Phase 1: matrix 295 rows 159 cols
[2023-03-11 07:02:08] [INFO ] Computed 18 place invariants in 12 ms
[2023-03-11 07:02:09] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-11 07:02:09] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 14 ms returned sat
[2023-03-11 07:02:09] [INFO ] After 643ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-11 07:02:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-11 07:02:09] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 24 ms returned sat
[2023-03-11 07:02:10] [INFO ] After 780ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :6
[2023-03-11 07:02:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:02:10] [INFO ] After 282ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :4 sat :6
[2023-03-11 07:02:10] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 10 ms to minimize.
[2023-03-11 07:02:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 142 ms
[2023-03-11 07:02:10] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 1 ms to minimize.
[2023-03-11 07:02:10] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 1 ms to minimize.
[2023-03-11 07:02:10] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 2 ms to minimize.
[2023-03-11 07:02:11] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 1 ms to minimize.
[2023-03-11 07:02:11] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2023-03-11 07:02:11] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 0 ms to minimize.
[2023-03-11 07:02:11] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 1 ms to minimize.
[2023-03-11 07:02:11] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 0 ms to minimize.
[2023-03-11 07:02:11] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 0 ms to minimize.
[2023-03-11 07:02:11] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 973 ms
[2023-03-11 07:02:11] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 0 ms to minimize.
[2023-03-11 07:02:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-03-11 07:02:11] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2023-03-11 07:02:12] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2023-03-11 07:02:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 200 ms
[2023-03-11 07:02:12] [INFO ] After 1992ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :5
Attempting to minimize the solution found.
Minimization took 258 ms.
[2023-03-11 07:02:12] [INFO ] After 3272ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :5
FORMULA HealthRecord-PT-11-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-11-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-11-ReachabilityFireability-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-11-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-11-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 23 ms.
Support contains 95 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 307/307 transitions.
Graph (trivial) has 22 edges and 159 vertex of which 4 / 159 are part of one of the 2 SCC in 11 ms
Free SCC test removed 2 places
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 673 edges and 157 vertex of which 151 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 151 transition count 289
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 150 transition count 288
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 30 place count 125 transition count 238
Iterating global reduction 2 with 25 rules applied. Total rules applied 55 place count 125 transition count 238
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 125 transition count 237
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 56 place count 125 transition count 236
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 124 transition count 236
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 124 transition count 236
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 124 transition count 235
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 123 transition count 234
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 123 transition count 234
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 123 transition count 234
Applied a total of 64 rules in 84 ms. Remains 123 /159 variables (removed 36) and now considering 234/307 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 123/159 places, 234/307 transitions.
Incomplete random walk after 10000 steps, including 721 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :1
FORMULA HealthRecord-PT-11-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 234 rows 123 cols
[2023-03-11 07:02:13] [INFO ] Computed 12 place invariants in 17 ms
[2023-03-11 07:02:13] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 07:02:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2023-03-11 07:02:13] [INFO ] [Nat]Absence check using 4 positive and 8 generalized place invariants in 12 ms returned sat
[2023-03-11 07:02:14] [INFO ] After 862ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 07:02:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:02:14] [INFO ] After 159ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 07:02:14] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2023-03-11 07:02:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-11 07:02:15] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2023-03-11 07:02:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-03-11 07:02:15] [INFO ] After 841ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 194 ms.
[2023-03-11 07:02:15] [INFO ] After 2238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA HealthRecord-PT-11-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 5 ms.
Support contains 45 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 234/234 transitions.
Graph (trivial) has 22 edges and 123 vertex of which 2 / 123 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 520 edges and 122 vertex of which 120 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 120 transition count 231
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 119 transition count 230
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 37 place count 87 transition count 167
Iterating global reduction 2 with 32 rules applied. Total rules applied 69 place count 87 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 87 transition count 166
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 74 place count 83 transition count 158
Iterating global reduction 3 with 4 rules applied. Total rules applied 78 place count 83 transition count 158
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 83 place count 83 transition count 153
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 4 with 2 rules applied. Total rules applied 85 place count 82 transition count 152
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 87 place count 82 transition count 152
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 88 place count 81 transition count 150
Iterating global reduction 4 with 1 rules applied. Total rules applied 89 place count 81 transition count 150
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 90 place count 80 transition count 148
Iterating global reduction 4 with 1 rules applied. Total rules applied 91 place count 80 transition count 148
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 80 transition count 147
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 93 place count 79 transition count 146
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 79 transition count 146
Applied a total of 94 rules in 58 ms. Remains 79 /123 variables (removed 44) and now considering 146/234 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 79/123 places, 146/234 transitions.
Incomplete random walk after 10000 steps, including 714 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 997462 steps, run timeout after 3001 ms. (steps per millisecond=332 ) properties seen :{1=1}
Probabilistic random walk after 997462 steps, saw 134435 distinct states, run finished after 3002 ms. (steps per millisecond=332 ) properties seen :1
FORMULA HealthRecord-PT-11-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 146 rows 79 cols
[2023-03-11 07:02:18] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-11 07:02:18] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:02:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-11 07:02:18] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 07:02:18] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 07:02:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:02:18] [INFO ] After 44ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 07:02:19] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2023-03-11 07:02:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-11 07:02:19] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-11 07:02:19] [INFO ] After 330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 45 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 146/146 transitions.
Applied a total of 0 rules in 7 ms. Remains 79 /79 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 79/79 places, 146/146 transitions.
Incomplete random walk after 10000 steps, including 710 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2499325 steps, run timeout after 3001 ms. (steps per millisecond=832 ) properties seen :{}
Probabilistic random walk after 2499325 steps, saw 297541 distinct states, run finished after 3003 ms. (steps per millisecond=832 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 07:02:22] [INFO ] Invariant cache hit.
[2023-03-11 07:02:22] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:02:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-11 07:02:22] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 07:02:22] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 07:02:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:02:22] [INFO ] After 39ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 07:02:22] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-11 07:02:22] [INFO ] After 269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 45 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 146/146 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 79/79 places, 146/146 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 146/146 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 146/146 (removed 0) transitions.
[2023-03-11 07:02:22] [INFO ] Invariant cache hit.
[2023-03-11 07:02:22] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-11 07:02:22] [INFO ] Invariant cache hit.
[2023-03-11 07:02:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:02:22] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2023-03-11 07:02:22] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-11 07:02:22] [INFO ] Invariant cache hit.
[2023-03-11 07:02:22] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 264 ms. Remains : 79/79 places, 146/146 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 79 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 78 transition count 145
Applied a total of 2 rules in 13 ms. Remains 78 /79 variables (removed 1) and now considering 145/146 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 145 rows 78 cols
[2023-03-11 07:02:22] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-11 07:02:22] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:02:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-11 07:02:22] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 07:02:23] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 07:02:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 07:02:23] [INFO ] After 64ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 07:02:23] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2023-03-11 07:02:23] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2023-03-11 07:02:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
[2023-03-11 07:02:23] [INFO ] After 254ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-11 07:02:23] [INFO ] After 473ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-11 07:02:23] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-11 07:02:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 79 places, 146 transitions and 464 arcs took 2 ms.
[2023-03-11 07:02:23] [INFO ] Flatten gal took : 55 ms
Total runtime 18370 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT HealthRecord-PT-11
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
ReachabilityFireability

FORMULA HealthRecord-PT-11-ReachabilityFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678518145171

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/ReachabilityFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 7 (type EXCL) for 0 HealthRecord-PT-11-ReachabilityFireability-04
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 HealthRecord-PT-11-ReachabilityFireability-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 HealthRecord-PT-11-ReachabilityFireability-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 6 (type SRCH) for 0 HealthRecord-PT-11-ReachabilityFireability-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/374/ReachabilityFireability-4.sara.
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 7 (type EXCL) for HealthRecord-PT-11-ReachabilityFireability-04
lola: result : true
lola: markings : 14027
lola: fired transitions : 30062
lola: time used : 1.000000
lola: memory pages used : 1
lola: CANCELED task # 3 (type FNDP) for HealthRecord-PT-11-ReachabilityFireability-04 (obsolete)
lola: CANCELED task # 4 (type EQUN) for HealthRecord-PT-11-ReachabilityFireability-04 (obsolete)
lola: CANCELED task # 6 (type SRCH) for HealthRecord-PT-11-ReachabilityFireability-04 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
HealthRecord-PT-11-ReachabilityFireability-04: EF true tandem / relaxed


Time elapsed: 1 secs. Pages in use: 2

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="ReachabilityFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is HealthRecord-PT-11, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r199-smll-167840345800319"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;