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

About the Execution of LoLa+red for CANInsertWithFailure-PT-020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
752.287 38050.00 56964.00 110.30 FTFTFFTTTTTTTTTF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r039-tajo-167813692900719.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is CANInsertWithFailure-PT-020, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692900719
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 9.6K Feb 26 00:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 00:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 00:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 00:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 26 01:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K Feb 26 01:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 00:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 00:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 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 2.6M 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 CANInsertWithFailure-PT-020-ReachabilityFireability-00
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-01
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-02
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-03
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-04
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-05
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-06
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-07
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-08
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-09
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-10
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-11
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-12
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-13
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-14
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678505929056

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=CANInsertWithFailure-PT-020
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:38:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 03:38:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:38:51] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2023-03-11 03:38:51] [INFO ] Transformed 1044 places.
[2023-03-11 03:38:51] [INFO ] Transformed 2520 transitions.
[2023-03-11 03:38:51] [INFO ] Parsed PT model containing 1044 places and 2520 transitions and 6800 arcs in 268 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 23 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 16) seen :10
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2520 rows 1044 cols
[2023-03-11 03:38:51] [INFO ] Computed 23 place invariants in 69 ms
[2023-03-11 03:38:52] [INFO ] [Real]Absence check using 21 positive place invariants in 17 ms returned sat
[2023-03-11 03:38:52] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 8 ms returned sat
[2023-03-11 03:38:54] [INFO ] After 2128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 03:38:54] [INFO ] [Nat]Absence check using 21 positive place invariants in 26 ms returned sat
[2023-03-11 03:38:54] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 12 ms returned sat
[2023-03-11 03:38:56] [INFO ] After 2252ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-11 03:38:57] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-11 03:38:59] [INFO ] After 2380ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2023-03-11 03:39:01] [INFO ] After 4524ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 1910 ms.
[2023-03-11 03:39:03] [INFO ] After 9355ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 23 ms.
Support contains 121 out of 1044 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1044/1044 places, 2520/2520 transitions.
Graph (complete) has 3501 edges and 1044 vertex of which 1043 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 1043 transition count 2449
Reduce places removed 71 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 93 rules applied. Total rules applied 165 place count 972 transition count 2427
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 187 place count 950 transition count 2427
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 187 place count 950 transition count 2412
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 217 place count 935 transition count 2412
Performed 302 Post agglomeration using F-continuation condition.Transition count delta: 302
Deduced a syphon composed of 302 places in 1 ms
Reduce places removed 302 places and 0 transitions.
Iterating global reduction 3 with 604 rules applied. Total rules applied 821 place count 633 transition count 2110
Drop transitions removed 284 transitions
Redundant transition composition rules discarded 284 transitions
Iterating global reduction 3 with 284 rules applied. Total rules applied 1105 place count 633 transition count 1826
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1106 place count 633 transition count 1825
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1107 place count 632 transition count 1825
Partial Free-agglomeration rule applied 448 times.
Drop transitions removed 448 transitions
Iterating global reduction 4 with 448 rules applied. Total rules applied 1555 place count 632 transition count 1825
Partial Free-agglomeration rule applied 272 times.
Drop transitions removed 272 transitions
Iterating global reduction 4 with 272 rules applied. Total rules applied 1827 place count 632 transition count 1825
Applied a total of 1827 rules in 464 ms. Remains 632 /1044 variables (removed 412) and now considering 1825/2520 (removed 695) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 465 ms. Remains : 632/1044 places, 1825/2520 transitions.
Incomplete random walk after 10000 steps, including 66 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 4) seen :1
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1825 rows 632 cols
[2023-03-11 03:39:04] [INFO ] Computed 22 place invariants in 53 ms
[2023-03-11 03:39:04] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-11 03:39:04] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 7 ms returned sat
[2023-03-11 03:39:05] [INFO ] After 682ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:39:05] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2023-03-11 03:39:05] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-11 03:39:06] [INFO ] After 1100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:39:06] [INFO ] State equation strengthened by 1358 read => feed constraints.
[2023-03-11 03:39:07] [INFO ] After 1123ms SMT Verify possible using 1358 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:39:08] [INFO ] After 1968ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 627 ms.
[2023-03-11 03:39:09] [INFO ] After 3945ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 10 ms.
Support contains 101 out of 632 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 632/632 places, 1825/1825 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 632 transition count 1824
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 631 transition count 1824
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 631 transition count 1823
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 630 transition count 1823
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 24 place count 620 transition count 1813
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 2 with 21 rules applied. Total rules applied 45 place count 620 transition count 1792
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 66 place count 599 transition count 1792
Partial Free-agglomeration rule applied 48 times.
Drop transitions removed 48 transitions
Iterating global reduction 3 with 48 rules applied. Total rules applied 114 place count 599 transition count 1792
Applied a total of 114 rules in 172 ms. Remains 599 /632 variables (removed 33) and now considering 1792/1825 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 599/632 places, 1792/1825 transitions.
Incomplete random walk after 10000 steps, including 73 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 278953 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 278953 steps, saw 49619 distinct states, run finished after 3003 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1792 rows 599 cols
[2023-03-11 03:39:12] [INFO ] Computed 22 place invariants in 58 ms
[2023-03-11 03:39:12] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-11 03:39:12] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-11 03:39:13] [INFO ] After 799ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:39:13] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-11 03:39:13] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-11 03:39:14] [INFO ] After 749ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:39:14] [INFO ] State equation strengthened by 1434 read => feed constraints.
[2023-03-11 03:39:15] [INFO ] After 727ms SMT Verify possible using 1434 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:39:16] [INFO ] After 1652ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 554 ms.
[2023-03-11 03:39:16] [INFO ] After 3104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 26 ms.
Support contains 101 out of 599 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 599/599 places, 1792/1792 transitions.
Applied a total of 0 rules in 34 ms. Remains 599 /599 variables (removed 0) and now considering 1792/1792 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 599/599 places, 1792/1792 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 599/599 places, 1792/1792 transitions.
Applied a total of 0 rules in 30 ms. Remains 599 /599 variables (removed 0) and now considering 1792/1792 (removed 0) transitions.
[2023-03-11 03:39:16] [INFO ] Invariant cache hit.
[2023-03-11 03:39:17] [INFO ] Implicit Places using invariants in 411 ms returned []
[2023-03-11 03:39:17] [INFO ] Invariant cache hit.
[2023-03-11 03:39:17] [INFO ] State equation strengthened by 1434 read => feed constraints.
[2023-03-11 03:39:20] [INFO ] Implicit Places using invariants and state equation in 3464 ms returned []
Implicit Place search using SMT with State Equation took 3882 ms to find 0 implicit places.
[2023-03-11 03:39:20] [INFO ] Redundant transitions in 126 ms returned []
[2023-03-11 03:39:20] [INFO ] Invariant cache hit.
[2023-03-11 03:39:21] [INFO ] Dead Transitions using invariants and state equation in 795 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4842 ms. Remains : 599/599 places, 1792/1792 transitions.
Graph (trivial) has 827 edges and 599 vertex of which 78 / 599 are part of one of the 1 SCC in 5 ms
Free SCC test removed 77 places
Drop transitions removed 157 transitions
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 254 transitions.
Graph (complete) has 1716 edges and 522 vertex of which 516 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 39 place count 479 transition count 1427
Iterating global reduction 0 with 37 rules applied. Total rules applied 76 place count 479 transition count 1427
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 107 place count 479 transition count 1396
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 112 place count 474 transition count 1386
Iterating global reduction 1 with 5 rules applied. Total rules applied 117 place count 474 transition count 1386
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 122 place count 474 transition count 1381
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 2 with 25 rules applied. Total rules applied 147 place count 474 transition count 1356
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 153 place count 471 transition count 1353
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 155 place count 471 transition count 1351
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 160 place count 471 transition count 1346
Free-agglomeration rule applied 85 times with reduction of 11 identical transitions.
Iterating global reduction 3 with 85 rules applied. Total rules applied 245 place count 471 transition count 1250
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 3 with 175 rules applied. Total rules applied 420 place count 386 transition count 1160
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 431 place count 386 transition count 1149
Partial Free-agglomeration rule applied 343 times.
Drop transitions removed 343 transitions
Iterating global reduction 4 with 343 rules applied. Total rules applied 774 place count 386 transition count 1149
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 779 place count 386 transition count 1144
Applied a total of 779 rules in 987 ms. Remains 386 /599 variables (removed 213) and now considering 1144/1792 (removed 648) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1144 rows 386 cols
[2023-03-11 03:39:22] [INFO ] Computed 16 place invariants in 33 ms
[2023-03-11 03:39:22] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2023-03-11 03:39:22] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:39:22] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2023-03-11 03:39:23] [INFO ] After 680ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:39:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 03:39:24] [INFO ] After 546ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:39:24] [INFO ] After 1113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 537 ms.
[2023-03-11 03:39:25] [INFO ] After 2423ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:39:25] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-11 03:39:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 599 places, 1792 transitions and 6778 arcs took 20 ms.
[2023-03-11 03:39:25] [INFO ] Flatten gal took : 179 ms
Total runtime 34854 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CANInsertWithFailure-PT-020
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/378
ReachabilityFireability

FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678505967106

--------------------
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 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/378/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/378/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/378/ReachabilityFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k: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 # 13 (type EXCL) for 0 CANInsertWithFailure-PT-020-ReachabilityFireability-03
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 9 (type FNDP) for 0 CANInsertWithFailure-PT-020-ReachabilityFireability-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 10 (type EQUN) for 0 CANInsertWithFailure-PT-020-ReachabilityFireability-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 12 (type SRCH) for 0 CANInsertWithFailure-PT-020-ReachabilityFireability-03
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: FINISHED task # 9 (type FNDP) for CANInsertWithFailure-PT-020-ReachabilityFireability-03
lola: result : true
lola: fired transitions : 29
lola: tried executions : 2
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 10 (type EQUN) for CANInsertWithFailure-PT-020-ReachabilityFireability-03 (obsolete)
lola: CANCELED task # 12 (type SRCH) for CANInsertWithFailure-PT-020-ReachabilityFireability-03 (obsolete)
lola: CANCELED task # 13 (type EXCL) for CANInsertWithFailure-PT-020-ReachabilityFireability-03 (obsolete)
lola: LAUNCH task # 19 (type EXCL) for 6 CANInsertWithFailure-PT-020-ReachabilityFireability-11
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 15 (type FNDP) for 6 CANInsertWithFailure-PT-020-ReachabilityFireability-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 16 (type EQUN) for 6 CANInsertWithFailure-PT-020-ReachabilityFireability-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 18 (type SRCH) for 6 CANInsertWithFailure-PT-020-ReachabilityFireability-11
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
sara: try reading problem file /home/mcc/execution/378/ReachabilityFireability-16.sara.
lola: FINISHED task # 15 (type FNDP) for CANInsertWithFailure-PT-020-ReachabilityFireability-11
lola: result : true
lola: fired transitions : 1914
lola: tried executions : 70
lola: time used : 1.000000
lola: memory pages used : 0
lola: CANCELED task # 16 (type EQUN) for CANInsertWithFailure-PT-020-ReachabilityFireability-11 (obsolete)
lola: CANCELED task # 18 (type SRCH) for CANInsertWithFailure-PT-020-ReachabilityFireability-11 (obsolete)
lola: CANCELED task # 19 (type EXCL) for CANInsertWithFailure-PT-020-ReachabilityFireability-11 (obsolete)
lola: LAUNCH task # 25 (type EXCL) for 3 CANInsertWithFailure-PT-020-ReachabilityFireability-06
lola: time limit : 3598 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 21 (type FNDP) for 3 CANInsertWithFailure-PT-020-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 22 (type EQUN) for 3 CANInsertWithFailure-PT-020-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 24 (type SRCH) for 3 CANInsertWithFailure-PT-020-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 16 (type EQUN) for CANInsertWithFailure-PT-020-ReachabilityFireability-11
lola: result : unknown
lola: FINISHED task # 21 (type FNDP) for CANInsertWithFailure-PT-020-ReachabilityFireability-06
lola: result : true
lola: fired transitions : 131
lola: tried executions : 7
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 22 (type EQUN) for CANInsertWithFailure-PT-020-ReachabilityFireability-06 (obsolete)
lola: CANCELED task # 24 (type SRCH) for CANInsertWithFailure-PT-020-ReachabilityFireability-06 (obsolete)
lola: CANCELED task # 25 (type EXCL) for CANInsertWithFailure-PT-020-ReachabilityFireability-06 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-020-ReachabilityFireability-03: EF true findpath
CANInsertWithFailure-PT-020-ReachabilityFireability-06: EF true findpath
CANInsertWithFailure-PT-020-ReachabilityFireability-11: EF true findpath


Time elapsed: 2 secs. Pages in use: 4

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="CANInsertWithFailure-PT-020"
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 CANInsertWithFailure-PT-020, 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 r039-tajo-167813692900719"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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