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.r135-smll-167819413300030.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 Dekker-PT-050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819413300030
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.3K Feb 26 01:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 01:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 01:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 02:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 02:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 02:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:56 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 1.5M 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 Dekker-PT-050-ReachabilityCardinality-00
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-01
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-02
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-03
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-04
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-05
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-06
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-07
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-08
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-09
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-10
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-11
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-12
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-13
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-14
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678268242761

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=Dekker-PT-050
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 09:37:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 09:37:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 09:37:26] [INFO ] Load time of PNML (sax parser for PT used): 463 ms
[2023-03-08 09:37:26] [INFO ] Transformed 250 places.
[2023-03-08 09:37:26] [INFO ] Transformed 2600 transitions.
[2023-03-08 09:37:26] [INFO ] Found NUPN structural information;
[2023-03-08 09:37:26] [INFO ] Parsed PT model containing 250 places and 2600 transitions and 20100 arcs in 647 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Dekker-PT-050-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 787 ms. (steps per millisecond=12 ) properties (out of 8) seen :5
FORMULA Dekker-PT-050-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 09:37:27] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2023-03-08 09:37:27] [INFO ] Computed 150 place invariants in 27 ms
[2023-03-08 09:37:28] [INFO ] After 568ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 09:37:28] [INFO ] [Nat]Absence check using 100 positive place invariants in 37 ms returned sat
[2023-03-08 09:37:28] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 17 ms returned sat
[2023-03-08 09:37:29] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-08 09:37:29] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 09:37:29] [INFO ] After 113ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-08 09:37:29] [INFO ] Deduced a trap composed of 6 places in 346 ms of which 15 ms to minimize.
[2023-03-08 09:37:30] [INFO ] Deduced a trap composed of 4 places in 331 ms of which 1 ms to minimize.
[2023-03-08 09:37:30] [INFO ] Deduced a trap composed of 4 places in 258 ms of which 1 ms to minimize.
[2023-03-08 09:37:30] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 1 ms to minimize.
[2023-03-08 09:37:30] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 2 ms to minimize.
[2023-03-08 09:37:31] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 0 ms to minimize.
[2023-03-08 09:37:31] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2023-03-08 09:37:31] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 1 ms to minimize.
[2023-03-08 09:37:31] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 1 ms to minimize.
[2023-03-08 09:37:31] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
[2023-03-08 09:37:32] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 1 ms to minimize.
[2023-03-08 09:37:32] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
[2023-03-08 09:37:32] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3008 ms
[2023-03-08 09:37:32] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3008 ms
[2023-03-08 09:37:32] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 1 ms to minimize.
[2023-03-08 09:37:32] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 0 ms to minimize.
[2023-03-08 09:37:32] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2023-03-08 09:37:33] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2023-03-08 09:37:33] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2023-03-08 09:37:33] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2023-03-08 09:37:33] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 1 ms to minimize.
[2023-03-08 09:37:33] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 1 ms to minimize.
[2023-03-08 09:37:34] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2023-03-08 09:37:34] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 2 ms to minimize.
[2023-03-08 09:37:34] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2023-03-08 09:37:34] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2005 ms
[2023-03-08 09:37:34] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2005 ms
[2023-03-08 09:37:34] [INFO ] After 5218ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-03-08 09:37:34] [INFO ] After 5863ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
FORMULA Dekker-PT-050-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 30 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 423 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 426 ms. Remains : 250/250 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 151470 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 151470 steps, saw 126017 distinct states, run finished after 3002 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-08 09:37:38] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 09:37:38] [INFO ] Invariant cache hit.
[2023-03-08 09:37:38] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 09:37:38] [INFO ] [Nat]Absence check using 100 positive place invariants in 40 ms returned sat
[2023-03-08 09:37:38] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 18 ms returned sat
[2023-03-08 09:37:38] [INFO ] After 229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 09:37:39] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 09:37:39] [INFO ] After 120ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 09:37:39] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 1 ms to minimize.
[2023-03-08 09:37:39] [INFO ] Deduced a trap composed of 4 places in 340 ms of which 2 ms to minimize.
[2023-03-08 09:37:39] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 1 ms to minimize.
[2023-03-08 09:37:40] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 1 ms to minimize.
[2023-03-08 09:37:40] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 1 ms to minimize.
[2023-03-08 09:37:40] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2023-03-08 09:37:40] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 1 ms to minimize.
[2023-03-08 09:37:40] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 0 ms to minimize.
[2023-03-08 09:37:41] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 1 ms to minimize.
[2023-03-08 09:37:41] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 2 ms to minimize.
[2023-03-08 09:37:41] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 5 ms to minimize.
[2023-03-08 09:37:41] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 1 ms to minimize.
[2023-03-08 09:37:41] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2023-03-08 09:37:41] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 1 ms to minimize.
[2023-03-08 09:37:42] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2023-03-08 09:37:42] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2023-03-08 09:37:42] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2023-03-08 09:37:42] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2023-03-08 09:37:42] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2023-03-08 09:37:42] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 0 ms to minimize.
[2023-03-08 09:37:42] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3486 ms
[2023-03-08 09:37:42] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3487 ms
[2023-03-08 09:37:42] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
[2023-03-08 09:37:42] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 1 ms to minimize.
[2023-03-08 09:37:43] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2023-03-08 09:37:43] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2023-03-08 09:37:43] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2023-03-08 09:37:43] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
[2023-03-08 09:37:43] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 2 ms to minimize.
[2023-03-08 09:37:43] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
[2023-03-08 09:37:43] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2023-03-08 09:37:43] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2023-03-08 09:37:44] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2023-03-08 09:37:44] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 2 ms to minimize.
[2023-03-08 09:37:44] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2023-03-08 09:37:44] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 2 ms to minimize.
[2023-03-08 09:37:44] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1674 ms
[2023-03-08 09:37:44] [INFO ] After 5376ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 140 ms.
[2023-03-08 09:37:44] [INFO ] After 5941ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 30 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 355 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 357 ms. Remains : 250/250 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 250 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 09:37:45] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 09:37:45] [INFO ] Invariant cache hit.
[2023-03-08 09:37:47] [INFO ] Implicit Places using invariants in 2265 ms returned [100, 103, 106, 109, 115, 118, 121, 124, 127, 130, 133, 136, 139, 142, 145, 148, 151, 154, 157, 160, 163, 166, 169, 172, 175, 178, 181, 184, 187, 190, 193, 196, 205, 208, 211, 214, 217, 220, 223, 226, 235, 238]
Discarding 42 places :
Implicit Place search using SMT only with invariants took 2276 ms to find 42 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 208/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 125 ms. Remains 208 /208 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2658 ms. Remains : 208/250 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 194310 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 194310 steps, saw 161071 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-08 09:37:51] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 208 cols
[2023-03-08 09:37:51] [INFO ] Computed 108 place invariants in 3 ms
[2023-03-08 09:37:51] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 09:37:51] [INFO ] [Nat]Absence check using 100 positive place invariants in 34 ms returned sat
[2023-03-08 09:37:51] [INFO ] [Nat]Absence check using 100 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-08 09:37:51] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 09:37:51] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 09:37:51] [INFO ] After 76ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 09:37:51] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2023-03-08 09:37:51] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 1 ms to minimize.
[2023-03-08 09:37:52] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 1 ms to minimize.
[2023-03-08 09:37:52] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 1 ms to minimize.
[2023-03-08 09:37:52] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2023-03-08 09:37:52] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 1 ms to minimize.
[2023-03-08 09:37:52] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2023-03-08 09:37:53] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2023-03-08 09:37:53] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 2 ms to minimize.
[2023-03-08 09:37:53] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2023-03-08 09:37:53] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 2 ms to minimize.
[2023-03-08 09:37:53] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1900 ms
[2023-03-08 09:37:53] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1900 ms
[2023-03-08 09:37:53] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2023-03-08 09:37:53] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
[2023-03-08 09:37:54] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 1 ms to minimize.
[2023-03-08 09:37:54] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 1 ms to minimize.
[2023-03-08 09:37:54] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
[2023-03-08 09:37:54] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2023-03-08 09:37:54] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
[2023-03-08 09:37:54] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2023-03-08 09:37:54] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2023-03-08 09:37:54] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2023-03-08 09:37:55] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2023-03-08 09:37:55] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2023-03-08 09:37:55] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2023-03-08 09:37:55] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2023-03-08 09:37:55] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2023-03-08 09:37:55] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1907 ms
[2023-03-08 09:37:55] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1910 ms
[2023-03-08 09:37:55] [INFO ] After 3957ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 89 ms.
[2023-03-08 09:37:55] [INFO ] After 4419ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 30 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 2600/2600 transitions.
Applied a total of 0 rules in 112 ms. Remains 208 /208 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 208/208 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 2600/2600 transitions.
Applied a total of 0 rules in 119 ms. Remains 208 /208 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 09:37:55] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 09:37:55] [INFO ] Invariant cache hit.
[2023-03-08 09:37:56] [INFO ] Implicit Places using invariants in 1058 ms returned []
[2023-03-08 09:37:56] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 09:37:56] [INFO ] Invariant cache hit.
[2023-03-08 09:37:57] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 09:37:58] [INFO ] Implicit Places using invariants and state equation in 1322 ms returned []
Implicit Place search using SMT with State Equation took 2384 ms to find 0 implicit places.
[2023-03-08 09:37:58] [INFO ] Redundant transitions in 343 ms returned []
[2023-03-08 09:37:58] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 09:37:58] [INFO ] Invariant cache hit.
[2023-03-08 09:38:00] [INFO ] Dead Transitions using invariants and state equation in 1482 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4339 ms. Remains : 208/208 places, 2600/2600 transitions.
Graph (complete) has 340 edges and 208 vertex of which 104 are kept as prefixes of interest. Removing 104 places using SCC suffix rule.2 ms
Discarding 104 places :
Also discarding 1352 output transitions
Drop transitions removed 1352 transitions
Ensure Unique test removed 8 places
Ensure Unique test removed 1152 transitions
Reduce isomorphic transitions removed 1152 transitions.
Iterating post reduction 0 with 1160 rules applied. Total rules applied 1161 place count 96 transition count 96
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1173 place count 88 transition count 92
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 1177 place count 88 transition count 88
Free-agglomeration rule applied 13 times.
Iterating global reduction 2 with 13 rules applied. Total rules applied 1190 place count 88 transition count 75
Ensure Unique test removed 13 places
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 1229 place count 62 transition count 62
Applied a total of 1229 rules in 115 ms. Remains 62 /208 variables (removed 146) and now considering 62/2600 (removed 2538) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 62 rows 62 cols
[2023-03-08 09:38:00] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-08 09:38:00] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 09:38:00] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2023-03-08 09:38:00] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 09:38:00] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-08 09:38:00] [INFO ] After 180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-08 09:38:00] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-08 09:38:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 208 places, 2600 transitions and 17958 arcs took 37 ms.
[2023-03-08 09:38:01] [INFO ] Flatten gal took : 544 ms
Total runtime 35249 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Dekker-PT-050
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
ReachabilityCardinality

FORMULA Dekker-PT-050-ReachabilityCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-050-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678268286530

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/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: 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 # 8 (type SKEL/FNDP) for 3 Dekker-PT-050-ReachabilityCardinality-11
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 # 9 (type SKEL/EQUN) for 3 Dekker-PT-050-ReachabilityCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 11 (type SKEL/SRCH) for 3 Dekker-PT-050-ReachabilityCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 12 (type SKEL/SRCH) for 3 Dekker-PT-050-ReachabilityCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 8 (type SKEL/FNDP) for Dekker-PT-050-ReachabilityCardinality-11
lola: result : true
lola: fired transitions : 11
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 9 (type EQUN) for Dekker-PT-050-ReachabilityCardinality-11 (obsolete)
lola: CANCELED task # 11 (type SRCH) for Dekker-PT-050-ReachabilityCardinality-11 (obsolete)
lola: CANCELED task # 12 (type SRCH) for Dekker-PT-050-ReachabilityCardinality-11 (obsolete)
sara: try reading problem file /home/mcc/execution/373/ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic
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 # 18 (type EXCL) for 0 Dekker-PT-050-ReachabilityCardinality-02
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 14 (type FNDP) for 0 Dekker-PT-050-ReachabilityCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type EQUN) for 0 Dekker-PT-050-ReachabilityCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 17 (type SRCH) for 0 Dekker-PT-050-ReachabilityCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: 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 # 9 (type SKEL/EQUN) for Dekker-PT-050-ReachabilityCardinality-11
lola: result : true
sara: try reading problem file /home/mcc/execution/373/ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic

lola: FINISHED task # 15 (type EQUN) for Dekker-PT-050-ReachabilityCardinality-02
lola: result : true
lola: CANCELED task # 14 (type FNDP) for Dekker-PT-050-ReachabilityCardinality-02 (obsolete)
lola: CANCELED task # 17 (type SRCH) for Dekker-PT-050-ReachabilityCardinality-02 (obsolete)
lola: CANCELED task # 18 (type EXCL) for Dekker-PT-050-ReachabilityCardinality-02 (obsolete)
lola: LAUNCH task # 25 (type EXCL) for 3 Dekker-PT-050-ReachabilityCardinality-11
lola: time limit : 3596 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 21 (type FNDP) for 3 Dekker-PT-050-ReachabilityCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 22 (type EQUN) for 3 Dekker-PT-050-ReachabilityCardinality-11
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 # 24 (type SRCH) for 3 Dekker-PT-050-ReachabilityCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 14 (type FNDP) for Dekker-PT-050-ReachabilityCardinality-02
lola: result : unknown
lola: fired transitions : 64844
lola: tried executions : 2
lola: time used : 2.000000
lola: memory pages used : 0
lola: FINISHED task # 21 (type FNDP) for Dekker-PT-050-ReachabilityCardinality-11
lola: result : true
lola: fired transitions : 406
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 22 (type EQUN) for Dekker-PT-050-ReachabilityCardinality-11 (obsolete)
lola: CANCELED task # 24 (type SRCH) for Dekker-PT-050-ReachabilityCardinality-11 (obsolete)
lola: CANCELED task # 25 (type EXCL) for Dekker-PT-050-ReachabilityCardinality-11 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Dekker-PT-050-ReachabilityCardinality-02: EF true state equation
Dekker-PT-050-ReachabilityCardinality-11: AG false findpath


Time elapsed: 4 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="Dekker-PT-050"
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 Dekker-PT-050, 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 r135-smll-167819413300030"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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