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.r103-tall-167814478300438.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 DES-PT-20b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478300438
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.6K Feb 26 15:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 15:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 15:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 91K 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 DES-PT-20b-ReachabilityCardinality-00
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-01
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-02
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-03
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-04
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-05
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-06
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-07
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-08
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-09
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678251849884

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-20b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 05:04:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 05:04:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 05:04:11] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2023-03-08 05:04:11] [INFO ] Transformed 360 places.
[2023-03-08 05:04:11] [INFO ] Transformed 311 transitions.
[2023-03-08 05:04:11] [INFO ] Found NUPN structural information;
[2023-03-08 05:04:11] [INFO ] Parsed PT model containing 360 places and 311 transitions and 987 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-20b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 89 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 14) seen :10
FORMULA DES-PT-20b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 311 rows 360 cols
[2023-03-08 05:04:12] [INFO ] Computed 65 place invariants in 25 ms
[2023-03-08 05:04:12] [INFO ] After 250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 05:04:12] [INFO ] [Nat]Absence check using 39 positive place invariants in 11 ms returned sat
[2023-03-08 05:04:12] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 17 ms returned sat
[2023-03-08 05:04:13] [INFO ] After 769ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 05:04:13] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 4 ms to minimize.
[2023-03-08 05:04:13] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 1 ms to minimize.
[2023-03-08 05:04:14] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2023-03-08 05:04:14] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2023-03-08 05:04:14] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2023-03-08 05:04:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 682 ms
[2023-03-08 05:04:14] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 0 ms to minimize.
[2023-03-08 05:04:14] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2023-03-08 05:04:14] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2023-03-08 05:04:14] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2023-03-08 05:04:14] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2023-03-08 05:04:14] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2023-03-08 05:04:15] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2023-03-08 05:04:15] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2023-03-08 05:04:15] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2023-03-08 05:04:15] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 579 ms
[2023-03-08 05:04:15] [INFO ] After 2625ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 696 ms.
[2023-03-08 05:04:16] [INFO ] After 3718ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 193 ms.
Support contains 30 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 311/311 transitions.
Graph (complete) has 741 edges and 360 vertex of which 349 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 349 transition count 289
Reduce places removed 15 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 20 rules applied. Total rules applied 38 place count 334 transition count 284
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 43 place count 329 transition count 284
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 43 place count 329 transition count 278
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 55 place count 323 transition count 278
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 72 place count 306 transition count 261
Iterating global reduction 3 with 17 rules applied. Total rules applied 89 place count 306 transition count 261
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 89 place count 306 transition count 260
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 305 transition count 260
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 100 place count 296 transition count 251
Iterating global reduction 3 with 9 rules applied. Total rules applied 109 place count 296 transition count 251
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 116 place count 296 transition count 244
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 4 with 138 rules applied. Total rules applied 254 place count 227 transition count 175
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 262 place count 223 transition count 182
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 263 place count 223 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 264 place count 222 transition count 181
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 266 place count 222 transition count 179
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 268 place count 220 transition count 179
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 269 place count 220 transition count 179
Applied a total of 269 rules in 153 ms. Remains 220 /360 variables (removed 140) and now considering 179/311 (removed 132) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 220/360 places, 179/311 transitions.
Incomplete random walk after 10000 steps, including 310 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 52 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 878219 steps, run timeout after 3001 ms. (steps per millisecond=292 ) properties seen :{}
Probabilistic random walk after 878219 steps, saw 139558 distinct states, run finished after 3004 ms. (steps per millisecond=292 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 179 rows 220 cols
[2023-03-08 05:04:19] [INFO ] Computed 61 place invariants in 3 ms
[2023-03-08 05:04:19] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 05:04:20] [INFO ] [Nat]Absence check using 36 positive place invariants in 8 ms returned sat
[2023-03-08 05:04:20] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 21 ms returned sat
[2023-03-08 05:04:20] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 05:04:20] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-08 05:04:20] [INFO ] After 73ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 05:04:20] [INFO ] After 183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-08 05:04:20] [INFO ] After 542ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 69 ms.
Support contains 30 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 179/179 transitions.
Applied a total of 0 rules in 8 ms. Remains 220 /220 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 220/220 places, 179/179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 179/179 transitions.
Applied a total of 0 rules in 8 ms. Remains 220 /220 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2023-03-08 05:04:20] [INFO ] Invariant cache hit.
[2023-03-08 05:04:20] [INFO ] Implicit Places using invariants in 176 ms returned [101]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 179 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 219/220 places, 179/179 transitions.
Applied a total of 0 rules in 7 ms. Remains 219 /219 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 195 ms. Remains : 219/220 places, 179/179 transitions.
Incomplete random walk after 10000 steps, including 325 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 930323 steps, run timeout after 3001 ms. (steps per millisecond=310 ) properties seen :{}
Probabilistic random walk after 930323 steps, saw 146352 distinct states, run finished after 3001 ms. (steps per millisecond=310 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 179 rows 219 cols
[2023-03-08 05:04:24] [INFO ] Computed 60 place invariants in 17 ms
[2023-03-08 05:04:24] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 05:04:24] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:04:24] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 43 ms returned sat
[2023-03-08 05:04:24] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 05:04:24] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-08 05:04:24] [INFO ] After 72ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 05:04:24] [INFO ] After 208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-08 05:04:24] [INFO ] After 591ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 57 ms.
Support contains 30 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 179/179 transitions.
Applied a total of 0 rules in 8 ms. Remains 219 /219 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 219/219 places, 179/179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 179/179 transitions.
Applied a total of 0 rules in 6 ms. Remains 219 /219 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2023-03-08 05:04:24] [INFO ] Invariant cache hit.
[2023-03-08 05:04:24] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-08 05:04:24] [INFO ] Invariant cache hit.
[2023-03-08 05:04:24] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-08 05:04:25] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2023-03-08 05:04:25] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 05:04:25] [INFO ] Invariant cache hit.
[2023-03-08 05:04:25] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 493 ms. Remains : 219/219 places, 179/179 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 219 transition count 179
Applied a total of 1 rules in 16 ms. Remains 219 /219 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 179 rows 219 cols
[2023-03-08 05:04:25] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 05:04:25] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 05:04:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:04:25] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 43 ms returned sat
[2023-03-08 05:04:25] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 05:04:25] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2023-03-08 05:04:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-08 05:04:25] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2023-03-08 05:04:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-08 05:04:25] [INFO ] After 345ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-08 05:04:25] [INFO ] After 547ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-08 05:04:25] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-08 05:04:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 219 places, 179 transitions and 881 arcs took 2 ms.
[2023-03-08 05:04:26] [INFO ] Flatten gal took : 53 ms
Total runtime 14848 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DES-PT-20b
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
ReachabilityCardinality

FORMULA DES-PT-20b-ReachabilityCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-20b-ReachabilityCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-20b-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-20b-ReachabilityCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678251870407

--------------------
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 ReachabilityCardinality -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/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 23 (type EXCL) for 3 DES-PT-20b-ReachabilityCardinality-01
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 15 (type FNDP) for 3 DES-PT-20b-ReachabilityCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 17 (type EQUN) for 3 DES-PT-20b-ReachabilityCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 22 (type SRCH) for 3 DES-PT-20b-ReachabilityCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
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:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 22 (type SRCH) for DES-PT-20b-ReachabilityCardinality-01
lola: result : true
lola: markings : 3055
lola: fired transitions : 5563
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 15 (type FNDP) for DES-PT-20b-ReachabilityCardinality-01 (obsolete)
lola: CANCELED task # 17 (type EQUN) for DES-PT-20b-ReachabilityCardinality-01 (obsolete)
lola: CANCELED task # 23 (type EXCL) for DES-PT-20b-ReachabilityCardinality-01 (obsolete)
lola: LAUNCH task # 35 (type EXCL) for 9 DES-PT-20b-ReachabilityCardinality-13
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 18 (type FNDP) for 0 DES-PT-20b-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 19 (type EQUN) for 0 DES-PT-20b-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 30 (type SRCH) for 0 DES-PT-20b-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 15 (type FNDP) for DES-PT-20b-ReachabilityCardinality-01
lola: result : unknown
lola: fired transitions : 31219
lola: tried executions : 1506
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 17 (type EQUN) for DES-PT-20b-ReachabilityCardinality-01
lola: result : unknown
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 18 (type FNDP) for DES-PT-20b-ReachabilityCardinality-00
lola: result : true
lola: fired transitions : 15152
lola: tried executions : 444
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 19 (type EQUN) for DES-PT-20b-ReachabilityCardinality-00 (obsolete)
lola: CANCELED task # 30 (type SRCH) for DES-PT-20b-ReachabilityCardinality-00 (obsolete)
lola: LAUNCH task # 13 (type FNDP) for 6 DES-PT-20b-ReachabilityCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 16 (type EQUN) for 6 DES-PT-20b-ReachabilityCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 27 (type SRCH) for 6 DES-PT-20b-ReachabilityCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 19 (type EQUN) for DES-PT-20b-ReachabilityCardinality-00
lola: result : unknown
sara: try reading problem file /home/mcc/execution/376/ReachabilityCardinality-16.sara.
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 35 (type EXCL) for DES-PT-20b-ReachabilityCardinality-13
lola: result : true
lola: markings : 163092
lola: fired transitions : 184239
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 28 (type EXCL) for 6 DES-PT-20b-ReachabilityCardinality-02
lola: time limit : 3600 sec
lola: memory limit: 32 pages

lola: FINISHED task # 16 (type EQUN) for DES-PT-20b-ReachabilityCardinality-02
lola: result : true
lola: CANCELED task # 13 (type FNDP) for DES-PT-20b-ReachabilityCardinality-02 (obsolete)
lola: CANCELED task # 27 (type SRCH) for DES-PT-20b-ReachabilityCardinality-02 (obsolete)
lola: CANCELED task # 28 (type EXCL) for DES-PT-20b-ReachabilityCardinality-02 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20b-ReachabilityCardinality-00: EF true findpath
DES-PT-20b-ReachabilityCardinality-01: AG false tandem / insertion
DES-PT-20b-ReachabilityCardinality-02: AG false state equation
DES-PT-20b-ReachabilityCardinality-13: AG false tandem / relaxed


Time elapsed: 3 secs. Pages in use: 6

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="DES-PT-20b"
export BK_EXAMINATION="ReachabilityCardinality"
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 DES-PT-20b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r103-tall-167814478300438"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20b.tgz
mv DES-PT-20b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;