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-167813692800638.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 CANConstruction-PT-030, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692800638
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 13K Feb 25 21:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 21:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 21:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 21:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 17K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 21:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 25 21:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 25 21:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 25 21:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 1.4M 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 CANConstruction-PT-030-ReachabilityCardinality-00
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-01
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-02
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-03
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-04
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-05
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-06
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-07
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-08
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-09
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-10
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-11
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-12
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-13
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-14
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678504115205

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=CANConstruction-PT-030
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:08:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 03:08:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:08:36] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2023-03-11 03:08:36] [INFO ] Transformed 2162 places.
[2023-03-11 03:08:36] [INFO ] Transformed 3840 transitions.
[2023-03-11 03:08:36] [INFO ] Parsed PT model containing 2162 places and 3840 transitions and 11400 arcs in 215 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 17 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 16) seen :9
FORMULA CANConstruction-PT-030-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 3840 rows 2162 cols
[2023-03-11 03:08:37] [INFO ] Computed 61 place invariants in 51 ms
[2023-03-11 03:08:38] [INFO ] After 918ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 03:08:39] [INFO ] [Nat]Absence check using 31 positive place invariants in 38 ms returned sat
[2023-03-11 03:08:39] [INFO ] [Nat]Absence check using 31 positive and 30 generalized place invariants in 18 ms returned sat
[2023-03-11 03:08:41] [INFO ] After 1689ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2023-03-11 03:08:41] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:08:42] [INFO ] After 1279ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :2 sat :5
[2023-03-11 03:08:44] [INFO ] After 2960ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 1023 ms.
[2023-03-11 03:08:45] [INFO ] After 6369ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
FORMULA CANConstruction-PT-030-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANConstruction-PT-030-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 121 ms.
Support contains 124 out of 2162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2162/2162 places, 3840/3840 transitions.
Drop transitions removed 172 transitions
Trivial Post-agglo rules discarded 172 transitions
Performed 172 trivial Post agglomeration. Transition count delta: 172
Iterating post reduction 0 with 172 rules applied. Total rules applied 172 place count 2162 transition count 3668
Reduce places removed 172 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 186 rules applied. Total rules applied 358 place count 1990 transition count 3654
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 372 place count 1976 transition count 3654
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 372 place count 1976 transition count 3649
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 382 place count 1971 transition count 3649
Discarding 789 places :
Symmetric choice reduction at 3 with 789 rule applications. Total rules 1171 place count 1182 transition count 2071
Iterating global reduction 3 with 789 rules applied. Total rules applied 1960 place count 1182 transition count 2071
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 2000 place count 1162 transition count 2051
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 2008 place count 1162 transition count 2043
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 2016 place count 1154 transition count 2043
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 2023 place count 1154 transition count 2036
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 2030 place count 1147 transition count 2036
Partial Free-agglomeration rule applied 54 times.
Drop transitions removed 54 transitions
Iterating global reduction 5 with 54 rules applied. Total rules applied 2084 place count 1147 transition count 2036
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 2087 place count 1147 transition count 2036
Applied a total of 2087 rules in 933 ms. Remains 1147 /2162 variables (removed 1015) and now considering 2036/3840 (removed 1804) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 935 ms. Remains : 1147/2162 places, 2036/3840 transitions.
Incomplete random walk after 10000 steps, including 41 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 5) seen :1
FORMULA CANConstruction-PT-030-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :1
FORMULA CANConstruction-PT-030-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2036 rows 1147 cols
[2023-03-11 03:08:46] [INFO ] Computed 61 place invariants in 15 ms
[2023-03-11 03:08:46] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:08:46] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-11 03:08:46] [INFO ] [Nat]Absence check using 31 positive and 30 generalized place invariants in 7 ms returned sat
[2023-03-11 03:08:47] [INFO ] After 561ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:08:47] [INFO ] State equation strengthened by 1807 read => feed constraints.
[2023-03-11 03:08:47] [INFO ] After 502ms SMT Verify possible using 1807 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:08:48] [INFO ] After 961ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 297 ms.
[2023-03-11 03:08:48] [INFO ] After 2049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 25 ms.
Support contains 84 out of 1147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1147/1147 places, 2036/2036 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1147 transition count 2034
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 1145 transition count 2033
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 1144 transition count 2033
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 8 place count 1142 transition count 2029
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 1142 transition count 2029
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 40 place count 1127 transition count 2014
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 44 place count 1125 transition count 2014
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 1125 transition count 2013
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 46 place count 1124 transition count 2013
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 47 place count 1123 transition count 2011
Iterating global reduction 4 with 1 rules applied. Total rules applied 48 place count 1123 transition count 2011
Applied a total of 48 rules in 383 ms. Remains 1123 /1147 variables (removed 24) and now considering 2011/2036 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 384 ms. Remains : 1123/1147 places, 2011/2036 transitions.
Incomplete random walk after 10000 steps, including 41 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 189089 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 189089 steps, saw 63117 distinct states, run finished after 3004 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2011 rows 1123 cols
[2023-03-11 03:08:52] [INFO ] Computed 61 place invariants in 11 ms
[2023-03-11 03:08:52] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:08:52] [INFO ] [Nat]Absence check using 31 positive place invariants in 21 ms returned sat
[2023-03-11 03:08:52] [INFO ] [Nat]Absence check using 31 positive and 30 generalized place invariants in 10 ms returned sat
[2023-03-11 03:08:53] [INFO ] After 618ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:08:53] [INFO ] State equation strengthened by 1824 read => feed constraints.
[2023-03-11 03:08:54] [INFO ] After 582ms SMT Verify possible using 1824 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:08:54] [INFO ] After 1229ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 478 ms.
[2023-03-11 03:08:55] [INFO ] After 2602ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 17 ms.
Support contains 84 out of 1123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1123/1123 places, 2011/2011 transitions.
Applied a total of 0 rules in 69 ms. Remains 1123 /1123 variables (removed 0) and now considering 2011/2011 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 1123/1123 places, 2011/2011 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1123/1123 places, 2011/2011 transitions.
Applied a total of 0 rules in 59 ms. Remains 1123 /1123 variables (removed 0) and now considering 2011/2011 (removed 0) transitions.
[2023-03-11 03:08:55] [INFO ] Invariant cache hit.
[2023-03-11 03:08:56] [INFO ] Implicit Places using invariants in 724 ms returned [5, 13, 18, 25, 31, 39, 46, 52, 56, 60, 66, 72, 79, 85, 98, 105, 111, 117, 123, 130, 135, 149, 155, 161, 167, 174, 180, 186]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 731 ms to find 28 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1095/1123 places, 2011/2011 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 1095 transition count 1999
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 1083 transition count 1999
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 1082 transition count 1998
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 1082 transition count 1998
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 82 place count 1054 transition count 1970
Applied a total of 82 rules in 221 ms. Remains 1054 /1095 variables (removed 41) and now considering 1970/2011 (removed 41) transitions.
// Phase 1: matrix 1970 rows 1054 cols
[2023-03-11 03:08:56] [INFO ] Computed 33 place invariants in 25 ms
[2023-03-11 03:08:56] [INFO ] Implicit Places using invariants in 533 ms returned []
[2023-03-11 03:08:56] [INFO ] Invariant cache hit.
[2023-03-11 03:08:57] [INFO ] State equation strengthened by 1786 read => feed constraints.
[2023-03-11 03:09:02] [INFO ] Implicit Places using invariants and state equation in 6113 ms returned []
Implicit Place search using SMT with State Equation took 6648 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1054/1123 places, 1970/2011 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7660 ms. Remains : 1054/1123 places, 1970/2011 transitions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 3) 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 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 206290 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 206290 steps, saw 70215 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 03:09:06] [INFO ] Invariant cache hit.
[2023-03-11 03:09:06] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:09:06] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2023-03-11 03:09:06] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-11 03:09:07] [INFO ] After 658ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:09:07] [INFO ] State equation strengthened by 1786 read => feed constraints.
[2023-03-11 03:09:07] [INFO ] After 626ms SMT Verify possible using 1786 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:09:08] [INFO ] After 1035ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 335 ms.
[2023-03-11 03:09:08] [INFO ] After 2277ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 34 ms.
Support contains 84 out of 1054 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1054/1054 places, 1970/1970 transitions.
Applied a total of 0 rules in 118 ms. Remains 1054 /1054 variables (removed 0) and now considering 1970/1970 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 1054/1054 places, 1970/1970 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1054/1054 places, 1970/1970 transitions.
Applied a total of 0 rules in 82 ms. Remains 1054 /1054 variables (removed 0) and now considering 1970/1970 (removed 0) transitions.
[2023-03-11 03:09:08] [INFO ] Invariant cache hit.
[2023-03-11 03:09:09] [INFO ] Implicit Places using invariants in 572 ms returned []
[2023-03-11 03:09:09] [INFO ] Invariant cache hit.
[2023-03-11 03:09:09] [INFO ] State equation strengthened by 1786 read => feed constraints.
[2023-03-11 03:09:15] [INFO ] Implicit Places using invariants and state equation in 6352 ms returned []
Implicit Place search using SMT with State Equation took 6926 ms to find 0 implicit places.
[2023-03-11 03:09:15] [INFO ] Redundant transitions in 91 ms returned []
[2023-03-11 03:09:15] [INFO ] Invariant cache hit.
[2023-03-11 03:09:16] [INFO ] Dead Transitions using invariants and state equation in 697 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7800 ms. Remains : 1054/1054 places, 1970/1970 transitions.
Graph (trivial) has 1690 edges and 1054 vertex of which 577 / 1054 are part of one of the 20 SCC in 4 ms
Free SCC test removed 557 places
Drop transitions removed 1094 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 1104 transitions.
Graph (complete) has 1002 edges and 497 vertex of which 465 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Drop transitions removed 267 transitions
Trivial Post-agglo rules discarded 267 transitions
Performed 267 trivial Post agglomeration. Transition count delta: 267
Iterating post reduction 0 with 322 rules applied. Total rules applied 324 place count 465 transition count 543
Reduce places removed 267 places and 0 transitions.
Ensure Unique test removed 254 transitions
Reduce isomorphic transitions removed 254 transitions.
Iterating post reduction 1 with 521 rules applied. Total rules applied 845 place count 198 transition count 289
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 845 place count 198 transition count 286
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 851 place count 195 transition count 286
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 860 place count 186 transition count 276
Iterating global reduction 2 with 9 rules applied. Total rules applied 869 place count 186 transition count 276
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 873 place count 186 transition count 272
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 877 place count 184 transition count 270
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 885 place count 180 transition count 277
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 893 place count 180 transition count 269
Free-agglomeration rule applied 21 times.
Iterating global reduction 3 with 21 rules applied. Total rules applied 914 place count 180 transition count 248
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 935 place count 159 transition count 248
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 937 place count 159 transition count 246
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 952 place count 159 transition count 246
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 961 place count 150 transition count 237
Iterating global reduction 4 with 9 rules applied. Total rules applied 970 place count 150 transition count 237
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 971 place count 150 transition count 236
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 972 place count 149 transition count 235
Iterating global reduction 4 with 1 rules applied. Total rules applied 973 place count 149 transition count 235
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 4 with 9 rules applied. Total rules applied 982 place count 140 transition count 226
Applied a total of 982 rules in 53 ms. Remains 140 /1054 variables (removed 914) and now considering 226/1970 (removed 1744) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 226 rows 140 cols
[2023-03-11 03:09:16] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 03:09:16] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:09:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 03:09:16] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-11 03:09:16] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:09:16] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-11 03:09:16] [INFO ] After 242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:09:16] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-11 03:09:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1054 places, 1970 transitions and 7659 arcs took 11 ms.
[2023-03-11 03:09:17] [INFO ] Flatten gal took : 183 ms
Total runtime 40581 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CANConstruction-PT-030
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
ReachabilityCardinality

FORMULA CANConstruction-PT-030-ReachabilityCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CANConstruction-PT-030-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CANConstruction-PT-030-ReachabilityCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678504163782

--------------------
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/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: 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 # 14 (type EXCL) for 0 CANConstruction-PT-030-ReachabilityCardinality-05
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 10 (type FNDP) for 0 CANConstruction-PT-030-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 11 (type EQUN) for 0 CANConstruction-PT-030-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 13 (type SRCH) for 0 CANConstruction-PT-030-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/375/ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-030-ReachabilityCardinality-05: AG 0 1 4 0 1 0 0 0
CANConstruction-PT-030-ReachabilityCardinality-07: EF 0 5 0 0 1 0 0 0
CANConstruction-PT-030-ReachabilityCardinality-12: AG 0 5 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 EF FNDP 5/899 0/5 CANConstruction-PT-030-ReachabilityCardinality-05 318696 t fired, 3511 attempts, .
11 EF STEQ 5/899 0/5 CANConstruction-PT-030-ReachabilityCardinality-05 sara is running.
13 EF SRCH 5/899 3/5 CANConstruction-PT-030-ReachabilityCardinality-05 237703 m, 47540 m/sec, 737199 t fired, .
14 EF EXCL 5/1199 1/32 CANConstruction-PT-030-ReachabilityCardinality-05 51316 m, 10263 m/sec, 102760 t fired, .

Time elapsed: 6 secs. Pages in use: 4
# running tasks: 4 of 4 Visible: 3
lola: FINISHED task # 10 (type FNDP) for CANConstruction-PT-030-ReachabilityCardinality-05
lola: result : true
lola: fired transitions : 349621
lola: tried executions : 4235
lola: time used : 5.000000
lola: memory pages used : 0
lola: CANCELED task # 11 (type EQUN) for CANConstruction-PT-030-ReachabilityCardinality-05 (obsolete)
lola: CANCELED task # 13 (type SRCH) for CANConstruction-PT-030-ReachabilityCardinality-05 (obsolete)
lola: CANCELED task # 14 (type EXCL) for CANConstruction-PT-030-ReachabilityCardinality-05 (obsolete)
lola: LAUNCH task # 27 (type EXCL) for 3 CANConstruction-PT-030-ReachabilityCardinality-07
lola: time limit : 1797 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 17 (type FNDP) for 6 CANConstruction-PT-030-ReachabilityCardinality-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 18 (type EQUN) for 6 CANConstruction-PT-030-ReachabilityCardinality-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 20 (type SRCH) for 6 CANConstruction-PT-030-ReachabilityCardinality-12
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: FINISHED task # 11 (type EQUN) for CANConstruction-PT-030-ReachabilityCardinality-05
lola: result : unknown
lola: FINISHED task # 17 (type FNDP) for CANConstruction-PT-030-ReachabilityCardinality-12
lola: result : true
lola: fired transitions : 2249
lola: tried executions : 16
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 18 (type EQUN) for CANConstruction-PT-030-ReachabilityCardinality-12 (obsolete)
lola: CANCELED task # 20 (type SRCH) for CANConstruction-PT-030-ReachabilityCardinality-12 (obsolete)
lola: LAUNCH task # 23 (type FNDP) for 3 CANConstruction-PT-030-ReachabilityCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 24 (type EQUN) for 3 CANConstruction-PT-030-ReachabilityCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 26 (type SRCH) for 3 CANConstruction-PT-030-ReachabilityCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 26 (type SRCH) for CANConstruction-PT-030-ReachabilityCardinality-07
lola: result : true
lola: markings : 43
lola: fired transitions : 49
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 23 (type FNDP) for CANConstruction-PT-030-ReachabilityCardinality-07 (obsolete)
lola: CANCELED task # 24 (type EQUN) for CANConstruction-PT-030-ReachabilityCardinality-07 (obsolete)
lola: CANCELED task # 27 (type EXCL) for CANConstruction-PT-030-ReachabilityCardinality-07 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANConstruction-PT-030-ReachabilityCardinality-05: AG false findpath
CANConstruction-PT-030-ReachabilityCardinality-07: EF true tandem / insertion
CANConstruction-PT-030-ReachabilityCardinality-12: AG false findpath


Time elapsed: 6 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="CANConstruction-PT-030"
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 CANConstruction-PT-030, 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 r039-tajo-167813692800638"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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