fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r103-tall-167814478400487
Last Updated
May 14, 2023

About the Execution of LoLa+red for DES-PT-50b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
446.823 41896.00 64168.00 459.60 TTFTFFTFFFFTFTTF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.3K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:44 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.5K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 19K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Feb 26 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 15:44 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 127K 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-50b-ReachabilityFireability-00
FORMULA_NAME DES-PT-50b-ReachabilityFireability-01
FORMULA_NAME DES-PT-50b-ReachabilityFireability-02
FORMULA_NAME DES-PT-50b-ReachabilityFireability-03
FORMULA_NAME DES-PT-50b-ReachabilityFireability-04
FORMULA_NAME DES-PT-50b-ReachabilityFireability-05
FORMULA_NAME DES-PT-50b-ReachabilityFireability-06
FORMULA_NAME DES-PT-50b-ReachabilityFireability-07
FORMULA_NAME DES-PT-50b-ReachabilityFireability-08
FORMULA_NAME DES-PT-50b-ReachabilityFireability-09
FORMULA_NAME DES-PT-50b-ReachabilityFireability-10
FORMULA_NAME DES-PT-50b-ReachabilityFireability-11
FORMULA_NAME DES-PT-50b-ReachabilityFireability-12
FORMULA_NAME DES-PT-50b-ReachabilityFireability-13
FORMULA_NAME DES-PT-50b-ReachabilityFireability-14
FORMULA_NAME DES-PT-50b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678254876773

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 05:54:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 05:54:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 05:54:38] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2023-03-08 05:54:38] [INFO ] Transformed 479 places.
[2023-03-08 05:54:38] [INFO ] Transformed 430 transitions.
[2023-03-08 05:54:38] [INFO ] Found NUPN structural information;
[2023-03-08 05:54:38] [INFO ] Parsed PT model containing 479 places and 430 transitions and 1463 arcs in 133 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 87 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 16) seen :7
FORMULA DES-PT-50b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :1
FORMULA DES-PT-50b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 430 rows 479 cols
[2023-03-08 05:54:39] [INFO ] Computed 65 place invariants in 37 ms
[2023-03-08 05:54:39] [INFO ] After 555ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-08 05:54:40] [INFO ] [Nat]Absence check using 40 positive place invariants in 15 ms returned sat
[2023-03-08 05:54:40] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 25 ms returned sat
[2023-03-08 05:54:46] [INFO ] After 2658ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2023-03-08 05:54:46] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 3 ms to minimize.
[2023-03-08 05:54:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 314 ms
[2023-03-08 05:54:47] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 1 ms to minimize.
[2023-03-08 05:54:47] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 1 ms to minimize.
[2023-03-08 05:54:48] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 0 ms to minimize.
[2023-03-08 05:54:48] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2023-03-08 05:54:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 750 ms
[2023-03-08 05:54:48] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 0 ms to minimize.
[2023-03-08 05:54:48] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 1 ms to minimize.
[2023-03-08 05:54:48] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2023-03-08 05:54:48] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 0 ms to minimize.
[2023-03-08 05:54:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 489 ms
[2023-03-08 05:54:49] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 1 ms to minimize.
[2023-03-08 05:54:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2023-03-08 05:54:50] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 1 ms to minimize.
[2023-03-08 05:54:50] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 0 ms to minimize.
[2023-03-08 05:54:50] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 1 ms to minimize.
[2023-03-08 05:54:51] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2023-03-08 05:54:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 764 ms
[2023-03-08 05:54:51] [INFO ] After 7621ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :6
Attempting to minimize the solution found.
Minimization took 3714 ms.
[2023-03-08 05:54:54] [INFO ] After 15018ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :6
FORMULA DES-PT-50b-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-50b-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 1354 ms.
Support contains 112 out of 479 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 479/479 places, 430/430 transitions.
Graph (complete) has 1098 edges and 479 vertex of which 474 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 474 transition count 418
Reduce places removed 9 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 14 rules applied. Total rules applied 25 place count 465 transition count 413
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 30 place count 460 transition count 413
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 30 place count 460 transition count 408
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 40 place count 455 transition count 408
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 51 place count 444 transition count 397
Iterating global reduction 3 with 11 rules applied. Total rules applied 62 place count 444 transition count 397
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 68 place count 438 transition count 391
Iterating global reduction 3 with 6 rules applied. Total rules applied 74 place count 438 transition count 391
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 80 place count 438 transition count 385
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 81 place count 437 transition count 385
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 76 rules applied. Total rules applied 157 place count 399 transition count 347
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 159 place count 398 transition count 350
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 160 place count 398 transition count 349
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 162 place count 398 transition count 347
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 164 place count 396 transition count 347
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 165 place count 396 transition count 346
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 166 place count 396 transition count 346
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 167 place count 395 transition count 345
Applied a total of 167 rules in 234 ms. Remains 395 /479 variables (removed 84) and now considering 345/430 (removed 85) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 235 ms. Remains : 395/479 places, 345/430 transitions.
Incomplete random walk after 10000 steps, including 141 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 704841 steps, run timeout after 3001 ms. (steps per millisecond=234 ) properties seen :{}
Probabilistic random walk after 704841 steps, saw 111840 distinct states, run finished after 3009 ms. (steps per millisecond=234 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 345 rows 395 cols
[2023-03-08 05:54:59] [INFO ] Computed 63 place invariants in 13 ms
[2023-03-08 05:55:00] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-08 05:55:00] [INFO ] [Nat]Absence check using 34 positive place invariants in 12 ms returned sat
[2023-03-08 05:55:00] [INFO ] [Nat]Absence check using 34 positive and 29 generalized place invariants in 28 ms returned sat
[2023-03-08 05:55:01] [INFO ] After 1517ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-08 05:55:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 05:55:02] [INFO ] After 1152ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-08 05:55:03] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2023-03-08 05:55:03] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2023-03-08 05:55:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 216 ms
[2023-03-08 05:55:03] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2023-03-08 05:55:03] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2023-03-08 05:55:03] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 1 ms to minimize.
[2023-03-08 05:55:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 396 ms
[2023-03-08 05:55:04] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2023-03-08 05:55:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-08 05:55:05] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2023-03-08 05:55:05] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2023-03-08 05:55:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 192 ms
[2023-03-08 05:55:05] [INFO ] After 3964ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1414 ms.
[2023-03-08 05:55:07] [INFO ] After 7120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 833 ms.
Support contains 112 out of 395 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 395/395 places, 345/345 transitions.
Applied a total of 0 rules in 15 ms. Remains 395 /395 variables (removed 0) and now considering 345/345 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 395/395 places, 345/345 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 395/395 places, 345/345 transitions.
Applied a total of 0 rules in 14 ms. Remains 395 /395 variables (removed 0) and now considering 345/345 (removed 0) transitions.
[2023-03-08 05:55:08] [INFO ] Invariant cache hit.
[2023-03-08 05:55:08] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-08 05:55:08] [INFO ] Invariant cache hit.
[2023-03-08 05:55:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 05:55:08] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2023-03-08 05:55:08] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-08 05:55:08] [INFO ] Invariant cache hit.
[2023-03-08 05:55:08] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 668 ms. Remains : 395/395 places, 345/345 transitions.
Graph (complete) has 1117 edges and 395 vertex of which 394 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 394 /395 variables (removed 1) and now considering 345/345 (removed 0) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 345 rows 394 cols
[2023-03-08 05:55:08] [INFO ] Computed 62 place invariants in 11 ms
[2023-03-08 05:55:08] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-08 05:55:08] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-08 05:55:08] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 43 ms returned sat
[2023-03-08 05:55:10] [INFO ] After 1656ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-08 05:55:11] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2023-03-08 05:55:11] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2023-03-08 05:55:11] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2023-03-08 05:55:11] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 0 ms to minimize.
[2023-03-08 05:55:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 469 ms
[2023-03-08 05:55:11] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2023-03-08 05:55:12] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2023-03-08 05:55:12] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-08 05:55:12] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 0 ms to minimize.
[2023-03-08 05:55:12] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 0 ms to minimize.
[2023-03-08 05:55:12] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 0 ms to minimize.
[2023-03-08 05:55:12] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 3 ms to minimize.
[2023-03-08 05:55:12] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2023-03-08 05:55:12] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2023-03-08 05:55:12] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2023-03-08 05:55:12] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2023-03-08 05:55:12] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 946 ms
[2023-03-08 05:55:13] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2023-03-08 05:55:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2023-03-08 05:55:13] [INFO ] After 4718ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1438 ms.
[2023-03-08 05:55:15] [INFO ] After 6375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-08 05:55:15] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 13 ms.
[2023-03-08 05:55:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 395 places, 345 transitions and 1406 arcs took 4 ms.
[2023-03-08 05:55:15] [INFO ] Flatten gal took : 54 ms
Total runtime 37225 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DES-PT-50b
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
ReachabilityFireability

FORMULA DES-PT-50b-ReachabilityFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50b-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50b-ReachabilityFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50b-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50b-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50b-ReachabilityFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678254918669

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/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/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
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: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 22 (type EXCL) for 6 DES-PT-50b-ReachabilityFireability-06
lola: time limit : 720 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 18 (type FNDP) for 6 DES-PT-50b-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 19 (type EQUN) for 6 DES-PT-50b-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 21 (type SRCH) for 6 DES-PT-50b-ReachabilityFireability-06
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: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: FINISHED task # 18 (type FNDP) for DES-PT-50b-ReachabilityFireability-06
lola: result : true
lola: fired transitions : 1801
lola: tried executions : 15
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 19 (type EQUN) for DES-PT-50b-ReachabilityFireability-06 (obsolete)
lola: CANCELED task # 21 (type SRCH) for DES-PT-50b-ReachabilityFireability-06 (obsolete)
lola: CANCELED task # 22 (type EXCL) for DES-PT-50b-ReachabilityFireability-06 (obsolete)
lola: LAUNCH task # 42 (type EXCL) for 9 DES-PT-50b-ReachabilityFireability-10
lola: time limit : 720 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 35 (type FNDP) for 15 DES-PT-50b-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 36 (type EQUN) for 15 DES-PT-50b-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 38 (type SRCH) for 15 DES-PT-50b-ReachabilityFireability-15
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: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:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/373/ReachabilityFireability-19.sara.
sara: place or transition ordering is non-deterministic
sara: try reading problem file /home/mcc/execution/373/ReachabilityFireability-36.sara.
lola: FINISHED task # 38 (type SRCH) for DES-PT-50b-ReachabilityFireability-15
lola: result : true
lola: markings : 65059
lola: fired transitions : 88664
lola: time used : 1.000000
lola: memory pages used : 1
lola: CANCELED task # 35 (type FNDP) for DES-PT-50b-ReachabilityFireability-15 (obsolete)
lola: CANCELED task # 36 (type EQUN) for DES-PT-50b-ReachabilityFireability-15 (obsolete)
lola: LAUNCH task # 47 (type FNDP) for 0 DES-PT-50b-ReachabilityFireability-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 48 (type EQUN) for 0 DES-PT-50b-ReachabilityFireability-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 50 (type SRCH) for 0 DES-PT-50b-ReachabilityFireability-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 35 (type FNDP) for DES-PT-50b-ReachabilityFireability-15
lola: result : unknown
lola: fired transitions : 231046
lola: tried executions : 5656
lola: time used : 1.000000
lola: memory pages used : 0
lola: FINISHED task # 36 (type EQUN) for DES-PT-50b-ReachabilityFireability-15
lola: result : unknown
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 50 (type SRCH) for DES-PT-50b-ReachabilityFireability-00
lola: result : true
lola: markings : 5033
lola: fired transitions : 6952
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 47 (type FNDP) for DES-PT-50b-ReachabilityFireability-00 (obsolete)
lola: CANCELED task # 48 (type EQUN) for DES-PT-50b-ReachabilityFireability-00 (obsolete)
lola: LAUNCH task # 44 (type FNDP) for 12 DES-PT-50b-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 45 (type EQUN) for 12 DES-PT-50b-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 53 (type SRCH) for 12 DES-PT-50b-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 47 (type FNDP) for DES-PT-50b-ReachabilityFireability-00
lola: result : unknown
lola: fired transitions : 16408
lola: tried executions : 333
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/373/ReachabilityFireability-45.sara.
sara: place or transition ordering is non-deterministic

lola: FINISHED task # 19 (type EQUN) for DES-PT-50b-ReachabilityFireability-06
lola: result : true
lola: FINISHED task # 42 (type EXCL) for DES-PT-50b-ReachabilityFireability-10
lola: result : true
lola: markings : 144196
lola: fired transitions : 162101
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 28 (type EXCL) for 3 DES-PT-50b-ReachabilityFireability-01
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: FINISHED task # 53 (type SRCH) for DES-PT-50b-ReachabilityFireability-14
lola: result : true
lola: markings : 112297
lola: fired transitions : 192194
lola: time used : 1.000000
lola: memory pages used : 1
lola: CANCELED task # 44 (type FNDP) for DES-PT-50b-ReachabilityFireability-14 (obsolete)
lola: CANCELED task # 45 (type EQUN) for DES-PT-50b-ReachabilityFireability-14 (obsolete)
lola: LAUNCH task # 24 (type FNDP) for 3 DES-PT-50b-ReachabilityFireability-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 25 (type EQUN) for 3 DES-PT-50b-ReachabilityFireability-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 27 (type SRCH) for 3 DES-PT-50b-ReachabilityFireability-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 44 (type FNDP) for DES-PT-50b-ReachabilityFireability-14
lola: result : unknown
lola: fired transitions : 496137
lola: tried executions : 11492
lola: time used : 1.000000
lola: memory pages used : 0
lola: FINISHED task # 45 (type EQUN) for DES-PT-50b-ReachabilityFireability-14
lola: result : unknown
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/373/ReachabilityFireability-25.sara.
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 28 (type EXCL) for DES-PT-50b-ReachabilityFireability-01
lola: result : true
lola: markings : 48557
lola: fired transitions : 52226
lola: time used : 1.000000
lola: memory pages used : 1
lola: CANCELED task # 24 (type FNDP) for DES-PT-50b-ReachabilityFireability-01 (obsolete)
lola: CANCELED task # 25 (type EQUN) for DES-PT-50b-ReachabilityFireability-01 (obsolete)
lola: CANCELED task # 27 (type SRCH) for DES-PT-50b-ReachabilityFireability-01 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-50b-ReachabilityFireability-00: EF true tandem / insertion
DES-PT-50b-ReachabilityFireability-01: EF true tandem / relaxed
DES-PT-50b-ReachabilityFireability-06: EF true findpath
DES-PT-50b-ReachabilityFireability-10: AG false tandem / relaxed
DES-PT-50b-ReachabilityFireability-14: EF true tandem / insertion
DES-PT-50b-ReachabilityFireability-15: AG false tandem / insertion


Time elapsed: 2 secs. Pages in use: 3

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is DES-PT-50b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r103-tall-167814478400487"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50b.tgz
mv DES-PT-50b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;