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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K 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.7K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 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 115K 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-40b-ReachabilityCardinality-00
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-01
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-02
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-03
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-04
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-05
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-06
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-07
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-08
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-09
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678253557983

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-40b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 05:32:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 05:32:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 05:32:39] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2023-03-08 05:32:39] [INFO ] Transformed 439 places.
[2023-03-08 05:32:39] [INFO ] Transformed 390 transitions.
[2023-03-08 05:32:39] [INFO ] Found NUPN structural information;
[2023-03-08 05:32:39] [INFO ] Parsed PT model containing 439 places and 390 transitions and 1303 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-40b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 84 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 10) seen :6
FORMULA DES-PT-40b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 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 11 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 390 rows 439 cols
[2023-03-08 05:32:40] [INFO ] Computed 65 place invariants in 26 ms
[2023-03-08 05:32:40] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 05:32:40] [INFO ] [Nat]Absence check using 39 positive place invariants in 18 ms returned sat
[2023-03-08 05:32:40] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 33 ms returned sat
[2023-03-08 05:32:42] [INFO ] After 999ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 05:32:42] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 4 ms to minimize.
[2023-03-08 05:32:43] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 1 ms to minimize.
[2023-03-08 05:32:43] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 2 ms to minimize.
[2023-03-08 05:32:43] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2023-03-08 05:32:43] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2023-03-08 05:32:43] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 1 ms to minimize.
[2023-03-08 05:32:43] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 0 ms to minimize.
[2023-03-08 05:32:43] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 1 ms to minimize.
[2023-03-08 05:32:43] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2023-03-08 05:32:44] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1219 ms
[2023-03-08 05:32:44] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 0 ms to minimize.
[2023-03-08 05:32:44] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 1 ms to minimize.
[2023-03-08 05:32:44] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2023-03-08 05:32:44] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 1 ms to minimize.
[2023-03-08 05:32:44] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2023-03-08 05:32:44] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 0 ms to minimize.
[2023-03-08 05:32:44] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 690 ms
[2023-03-08 05:32:45] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 0 ms to minimize.
[2023-03-08 05:32:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-03-08 05:32:45] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 0 ms to minimize.
[2023-03-08 05:32:45] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2023-03-08 05:32:45] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2023-03-08 05:32:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 303 ms
[2023-03-08 05:32:45] [INFO ] After 4004ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 294 ms.
[2023-03-08 05:32:45] [INFO ] After 5352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 532 ms.
Support contains 18 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 390/390 transitions.
Graph (complete) has 978 edges and 439 vertex of which 433 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 433 transition count 367
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 414 transition count 366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 413 transition count 366
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 42 place count 413 transition count 358
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 58 place count 405 transition count 358
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 77 place count 386 transition count 339
Iterating global reduction 3 with 19 rules applied. Total rules applied 96 place count 386 transition count 339
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 96 place count 386 transition count 338
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 98 place count 385 transition count 338
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 113 place count 370 transition count 323
Iterating global reduction 3 with 15 rules applied. Total rules applied 128 place count 370 transition count 323
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 15 rules applied. Total rules applied 143 place count 370 transition count 308
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 146 place count 368 transition count 307
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 146 place count 368 transition count 304
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 152 place count 365 transition count 304
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 5 with 138 rules applied. Total rules applied 290 place count 296 transition count 235
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 294 place count 294 transition count 237
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 296 place count 294 transition count 235
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 298 place count 292 transition count 235
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 300 place count 292 transition count 233
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 302 place count 290 transition count 233
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 303 place count 289 transition count 232
Applied a total of 303 rules in 181 ms. Remains 289 /439 variables (removed 150) and now considering 232/390 (removed 158) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 289/439 places, 232/390 transitions.
Incomplete random walk after 10000 steps, including 341 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 60 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 865912 steps, run timeout after 3001 ms. (steps per millisecond=288 ) properties seen :{}
Probabilistic random walk after 865912 steps, saw 122629 distinct states, run finished after 3002 ms. (steps per millisecond=288 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 232 rows 289 cols
[2023-03-08 05:32:49] [INFO ] Computed 63 place invariants in 25 ms
[2023-03-08 05:32:49] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 05:32:50] [INFO ] [Nat]Absence check using 34 positive place invariants in 11 ms returned sat
[2023-03-08 05:32:50] [INFO ] [Nat]Absence check using 34 positive and 29 generalized place invariants in 33 ms returned sat
[2023-03-08 05:32:50] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 05:32:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 05:32:50] [INFO ] After 128ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 05:32:50] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2023-03-08 05:32:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-08 05:32:50] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2023-03-08 05:32:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-08 05:32:50] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2023-03-08 05:32:50] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2023-03-08 05:32:50] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2023-03-08 05:32:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 195 ms
[2023-03-08 05:32:50] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 0 ms to minimize.
[2023-03-08 05:32:51] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2023-03-08 05:32:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
[2023-03-08 05:32:51] [INFO ] After 749ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 135 ms.
[2023-03-08 05:32:51] [INFO ] After 1217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 223 ms.
Support contains 18 out of 289 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 232/232 transitions.
Applied a total of 0 rules in 12 ms. Remains 289 /289 variables (removed 0) and now considering 232/232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 289/289 places, 232/232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 232/232 transitions.
Applied a total of 0 rules in 12 ms. Remains 289 /289 variables (removed 0) and now considering 232/232 (removed 0) transitions.
[2023-03-08 05:32:51] [INFO ] Invariant cache hit.
[2023-03-08 05:32:51] [INFO ] Implicit Places using invariants in 168 ms returned [175]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 171 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 288/289 places, 232/232 transitions.
Applied a total of 0 rules in 12 ms. Remains 288 /288 variables (removed 0) and now considering 232/232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 196 ms. Remains : 288/289 places, 232/232 transitions.
Incomplete random walk after 10000 steps, including 331 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 55 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 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 63 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 796235 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :{}
Probabilistic random walk after 796235 steps, saw 114437 distinct states, run finished after 3001 ms. (steps per millisecond=265 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 232 rows 288 cols
[2023-03-08 05:32:54] [INFO ] Computed 62 place invariants in 7 ms
[2023-03-08 05:32:55] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 05:32:55] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 05:32:55] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 20 ms returned sat
[2023-03-08 05:32:55] [INFO ] After 267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 05:32:55] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 05:32:55] [INFO ] After 171ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 05:32:55] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2023-03-08 05:32:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-03-08 05:32:55] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2023-03-08 05:32:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-08 05:32:56] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2023-03-08 05:32:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-08 05:32:56] [INFO ] After 524ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 155 ms.
[2023-03-08 05:32:56] [INFO ] After 1137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 246 ms.
Support contains 18 out of 288 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 288/288 places, 232/232 transitions.
Applied a total of 0 rules in 7 ms. Remains 288 /288 variables (removed 0) and now considering 232/232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 288/288 places, 232/232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 288/288 places, 232/232 transitions.
Applied a total of 0 rules in 8 ms. Remains 288 /288 variables (removed 0) and now considering 232/232 (removed 0) transitions.
[2023-03-08 05:32:56] [INFO ] Invariant cache hit.
[2023-03-08 05:32:56] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-08 05:32:56] [INFO ] Invariant cache hit.
[2023-03-08 05:32:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 05:32:56] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2023-03-08 05:32:56] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-08 05:32:56] [INFO ] Invariant cache hit.
[2023-03-08 05:32:57] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 686 ms. Remains : 288/288 places, 232/232 transitions.
Applied a total of 0 rules in 8 ms. Remains 288 /288 variables (removed 0) and now considering 232/232 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-08 05:32:57] [INFO ] Invariant cache hit.
[2023-03-08 05:32:57] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 05:32:57] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 05:32:57] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 19 ms returned sat
[2023-03-08 05:32:57] [INFO ] After 241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 05:32:57] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2023-03-08 05:32:57] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2023-03-08 05:32:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 103 ms
[2023-03-08 05:32:57] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 4 ms to minimize.
[2023-03-08 05:32:57] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2023-03-08 05:32:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 131 ms
[2023-03-08 05:32:57] [INFO ] After 593ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 145 ms.
[2023-03-08 05:32:58] [INFO ] After 844ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-08 05:32:58] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-08 05:32:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 288 places, 232 transitions and 1138 arcs took 4 ms.
[2023-03-08 05:32:58] [INFO ] Flatten gal took : 51 ms
Total runtime 18907 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DES-PT-40b
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
ReachabilityCardinality

FORMULA DES-PT-40b-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40b-ReachabilityCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40b-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40b-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678253579381

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
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: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 # 17 (type EXCL) for 6 DES-PT-40b-ReachabilityCardinality-14
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 13 (type FNDP) for 6 DES-PT-40b-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 14 (type EQUN) for 6 DES-PT-40b-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 16 (type SRCH) for 6 DES-PT-40b-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
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: 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: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
sara: try reading problem file /home/mcc/execution/373/ReachabilityCardinality-14.sara.
lola: FINISHED task # 17 (type EXCL) for DES-PT-40b-ReachabilityCardinality-14
lola: result : true
lola: markings : 4607
lola: fired transitions : 4608
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 13 (type FNDP) for DES-PT-40b-ReachabilityCardinality-14 (obsolete)
lola: CANCELED task # 14 (type EQUN) for DES-PT-40b-ReachabilityCardinality-14 (obsolete)
lola: CANCELED task # 16 (type SRCH) for DES-PT-40b-ReachabilityCardinality-14 (obsolete)
lola: LAUNCH task # 23 (type EXCL) for 3 DES-PT-40b-ReachabilityCardinality-06
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 33 (type FNDP) for 0 DES-PT-40b-ReachabilityCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 34 (type EQUN) for 0 DES-PT-40b-ReachabilityCardinality-03
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 # 36 (type SRCH) for 0 DES-PT-40b-ReachabilityCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 14 (type EQUN) for DES-PT-40b-ReachabilityCardinality-14
lola: result : unknown
lola: FINISHED task # 13 (type FNDP) for DES-PT-40b-ReachabilityCardinality-14
lola: result : unknown
lola: fired transitions : 31554
lola: tried executions : 1916
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 36 (type SRCH) for DES-PT-40b-ReachabilityCardinality-03
lola: result : true
lola: markings : 1868
lola: fired transitions : 1995
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 33 (type FNDP) for DES-PT-40b-ReachabilityCardinality-03 (obsolete)
lola: CANCELED task # 34 (type EQUN) for DES-PT-40b-ReachabilityCardinality-03 (obsolete)
lola: LAUNCH task # 26 (type FNDP) for 9 DES-PT-40b-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 27 (type EQUN) for 9 DES-PT-40b-ReachabilityCardinality-15
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 # 29 (type SRCH) for 9 DES-PT-40b-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 29 (type SRCH) for DES-PT-40b-ReachabilityCardinality-15
lola: result : true
lola: markings : 6613
lola: fired transitions : 6982
lola: sara: try reading problem file /home/mcc/execution/373/ReachabilityCardinality-34.sara.
time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 26 (type FNDP) for DES-PT-40b-ReachabilityCardinality-15 (obsolete)
lola: CANCELED task # 27 (type EQUN) for DES-PT-40b-ReachabilityCardinality-15 (obsolete)
lola: LAUNCH task # 19 (type FNDP) for 3 DES-PT-40b-ReachabilityCardinality-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 20 (type EQUN) for 3 DES-PT-40b-ReachabilityCardinality-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 22 (type SRCH) for 3 DES-PT-40b-ReachabilityCardinality-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 27 (type EQUN) for DES-PT-40b-ReachabilityCardinality-15
lola: result : unknown
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 26 (type FNDP) for DES-PT-40b-ReachabilityCardinality-15
lola: result : unknown
lola: fired transitions : 19216
lola: tried executions : 1033
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 23 (type EXCL) for DES-PT-40b-ReachabilityCardinality-06
lola: result : true
lola: markings : 9719
lola: fired transitions : 9724
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 19 (type FNDP) for DES-PT-40b-ReachabilityCardinality-06 (obsolete)
lola: CANCELED task # 20 (type EQUN) for DES-PT-40b-ReachabilityCardinality-06 (obsolete)
lola: CANCELED task # 22 (type SRCH) for DES-PT-40b-ReachabilityCardinality-06 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-40b-ReachabilityCardinality-03: AG false tandem / insertion
DES-PT-40b-ReachabilityCardinality-06: EF true tandem / relaxed
DES-PT-40b-ReachabilityCardinality-14: AG false tandem / relaxed
DES-PT-40b-ReachabilityCardinality-15: AG false tandem / insertion


Time elapsed: 0 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="DES-PT-40b"
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-40b, 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-167814478300470"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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