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.r041-tajo-167813695000638.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 ltsminxred
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 r041-tajo-167813695000638
=====================================================================

--------------------
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 1678651736077

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-030
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 20:09:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 20:09:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 20:09:02] [INFO ] Load time of PNML (sax parser for PT used): 504 ms
[2023-03-12 20:09:02] [INFO ] Transformed 2162 places.
[2023-03-12 20:09:02] [INFO ] Transformed 3840 transitions.
[2023-03-12 20:09:02] [INFO ] Parsed PT model containing 2162 places and 3840 transitions and 11400 arcs in 911 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 61 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 19 resets, run finished after 809 ms. (steps per millisecond=12 ) properties (out of 16) seen :8
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-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 3840 rows 2162 cols
[2023-03-12 20:09:05] [INFO ] Computed 61 place invariants in 211 ms
[2023-03-12 20:09:08] [INFO ] After 2980ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 20:09:10] [INFO ] [Nat]Absence check using 31 positive place invariants in 83 ms returned sat
[2023-03-12 20:09:10] [INFO ] [Nat]Absence check using 31 positive and 30 generalized place invariants in 40 ms returned sat
[2023-03-12 20:09:21] [INFO ] After 10561ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2023-03-12 20:09:21] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 20:09:23] [INFO ] After 1600ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :2 sat :6
[2023-03-12 20:09:25] [INFO ] After 3584ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :6
Attempting to minimize the solution found.
Minimization took 1389 ms.
[2023-03-12 20:09:26] [INFO ] After 18019ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :6
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 8 Parikh solutions to 6 different solutions.
FORMULA CANConstruction-PT-030-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 130 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 1526 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 1527 ms. Remains : 1147/2162 places, 2036/3840 transitions.
Incomplete random walk after 10000 steps, including 41 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) 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 5) seen :0
Interrupted probabilistic random walk after 142433 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 142433 steps, saw 48620 distinct states, run finished after 3018 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2036 rows 1147 cols
[2023-03-12 20:09:31] [INFO ] Computed 61 place invariants in 23 ms
[2023-03-12 20:09:31] [INFO ] After 240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 20:09:32] [INFO ] [Nat]Absence check using 31 positive place invariants in 42 ms returned sat
[2023-03-12 20:09:32] [INFO ] [Nat]Absence check using 31 positive and 30 generalized place invariants in 13 ms returned sat
[2023-03-12 20:09:33] [INFO ] After 1314ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 20:09:33] [INFO ] State equation strengthened by 1807 read => feed constraints.
[2023-03-12 20:09:34] [INFO ] After 935ms SMT Verify possible using 1807 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 20:09:35] [INFO ] After 1911ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 585 ms.
[2023-03-12 20:09:36] [INFO ] After 4290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA CANConstruction-PT-030-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 32 ms.
Support contains 88 out of 1147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1147/1147 places, 2036/2036 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1147 transition count 2035
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1146 transition count 2035
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4 place count 1144 transition count 2031
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 1144 transition count 2031
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 34 place count 1130 transition count 2017
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 2 with 4 rules applied. Total rules applied 38 place count 1128 transition count 2017
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 1128 transition count 2016
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 1127 transition count 2016
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 1126 transition count 2014
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 1126 transition count 2014
Applied a total of 42 rules in 735 ms. Remains 1126 /1147 variables (removed 21) and now considering 2014/2036 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 735 ms. Remains : 1126/1147 places, 2014/2036 transitions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 129994 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 129994 steps, saw 47868 distinct states, run finished after 3013 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2014 rows 1126 cols
[2023-03-12 20:09:40] [INFO ] Computed 61 place invariants in 13 ms
[2023-03-12 20:09:40] [INFO ] After 464ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 20:09:41] [INFO ] [Nat]Absence check using 31 positive place invariants in 38 ms returned sat
[2023-03-12 20:09:41] [INFO ] [Nat]Absence check using 31 positive and 30 generalized place invariants in 13 ms returned sat
[2023-03-12 20:09:42] [INFO ] After 835ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 20:09:42] [INFO ] State equation strengthened by 1823 read => feed constraints.
[2023-03-12 20:09:43] [INFO ] After 734ms SMT Verify possible using 1823 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 20:09:43] [INFO ] After 1629ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 431 ms.
[2023-03-12 20:09:44] [INFO ] After 3441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA CANConstruction-PT-030-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 29 ms.
Support contains 60 out of 1126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1126/1126 places, 2014/2014 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 1126 transition count 2012
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 1124 transition count 2011
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 1123 transition count 2011
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 8 place count 1121 transition count 2007
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 1121 transition count 2007
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 26 place count 1113 transition count 1999
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 30 place count 1111 transition count 1999
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 1111 transition count 1998
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 32 place count 1110 transition count 1998
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 33 place count 1109 transition count 1996
Iterating global reduction 4 with 1 rules applied. Total rules applied 34 place count 1109 transition count 1996
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 36 place count 1109 transition count 1996
Applied a total of 36 rules in 304 ms. Remains 1109 /1126 variables (removed 17) and now considering 1996/2014 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 304 ms. Remains : 1109/1126 places, 1996/2014 transitions.
Incomplete random walk after 10000 steps, including 44 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 166663 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 166663 steps, saw 47406 distinct states, run finished after 3002 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1996 rows 1109 cols
[2023-03-12 20:09:47] [INFO ] Computed 61 place invariants in 32 ms
[2023-03-12 20:09:48] [INFO ] After 312ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 20:09:48] [INFO ] [Nat]Absence check using 31 positive place invariants in 60 ms returned sat
[2023-03-12 20:09:48] [INFO ] [Nat]Absence check using 31 positive and 30 generalized place invariants in 17 ms returned sat
[2023-03-12 20:09:49] [INFO ] After 1055ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 20:09:49] [INFO ] State equation strengthened by 1836 read => feed constraints.
[2023-03-12 20:09:50] [INFO ] After 502ms SMT Verify possible using 1836 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 20:09:50] [INFO ] After 781ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 198 ms.
[2023-03-12 20:09:50] [INFO ] After 2561ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 60 out of 1109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1109/1109 places, 1996/1996 transitions.
Applied a total of 0 rules in 82 ms. Remains 1109 /1109 variables (removed 0) and now considering 1996/1996 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 1109/1109 places, 1996/1996 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1109/1109 places, 1996/1996 transitions.
Applied a total of 0 rules in 121 ms. Remains 1109 /1109 variables (removed 0) and now considering 1996/1996 (removed 0) transitions.
[2023-03-12 20:09:51] [INFO ] Invariant cache hit.
[2023-03-12 20:09:51] [INFO ] Implicit Places using invariants in 966 ms returned [5, 13, 18, 24, 30, 38, 45, 51, 55, 59, 65, 71, 78, 84, 90, 96, 103, 109, 114, 120, 127, 132, 140, 146, 152, 158, 164, 170, 176, 182]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 973 ms to find 30 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1079/1109 places, 1996/1996 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 1079 transition count 1989
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 1072 transition count 1989
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 1070 transition count 1987
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 1070 transition count 1987
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 88 place count 1035 transition count 1952
Applied a total of 88 rules in 237 ms. Remains 1035 /1079 variables (removed 44) and now considering 1952/1996 (removed 44) transitions.
// Phase 1: matrix 1952 rows 1035 cols
[2023-03-12 20:09:52] [INFO ] Computed 31 place invariants in 13 ms
[2023-03-12 20:09:53] [INFO ] Implicit Places using invariants in 1072 ms returned []
[2023-03-12 20:09:53] [INFO ] Invariant cache hit.
[2023-03-12 20:09:54] [INFO ] State equation strengthened by 1795 read => feed constraints.
[2023-03-12 20:10:03] [INFO ] Implicit Places using invariants and state equation in 9890 ms returned []
Implicit Place search using SMT with State Equation took 10992 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1035/1109 places, 1952/1996 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 12326 ms. Remains : 1035/1109 places, 1952/1996 transitions.
Incomplete random walk after 10000 steps, including 44 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 153989 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 153989 steps, saw 50472 distinct states, run finished after 3013 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 20:10:06] [INFO ] Invariant cache hit.
[2023-03-12 20:10:06] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 20:10:06] [INFO ] [Nat]Absence check using 31 positive place invariants in 19 ms returned sat
[2023-03-12 20:10:07] [INFO ] After 584ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 20:10:07] [INFO ] State equation strengthened by 1795 read => feed constraints.
[2023-03-12 20:10:08] [INFO ] After 472ms SMT Verify possible using 1795 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 20:10:08] [INFO ] After 831ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 293 ms.
[2023-03-12 20:10:08] [INFO ] After 2002ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 60 out of 1035 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1035/1035 places, 1952/1952 transitions.
Applied a total of 0 rules in 136 ms. Remains 1035 /1035 variables (removed 0) and now considering 1952/1952 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 1035/1035 places, 1952/1952 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1035/1035 places, 1952/1952 transitions.
Applied a total of 0 rules in 146 ms. Remains 1035 /1035 variables (removed 0) and now considering 1952/1952 (removed 0) transitions.
[2023-03-12 20:10:09] [INFO ] Invariant cache hit.
[2023-03-12 20:10:09] [INFO ] Implicit Places using invariants in 669 ms returned []
[2023-03-12 20:10:09] [INFO ] Invariant cache hit.
[2023-03-12 20:10:10] [INFO ] State equation strengthened by 1795 read => feed constraints.
[2023-03-12 20:10:17] [INFO ] Implicit Places using invariants and state equation in 7536 ms returned []
Implicit Place search using SMT with State Equation took 8210 ms to find 0 implicit places.
[2023-03-12 20:10:17] [INFO ] Redundant transitions in 127 ms returned []
[2023-03-12 20:10:17] [INFO ] Invariant cache hit.
[2023-03-12 20:10:18] [INFO ] Dead Transitions using invariants and state equation in 1468 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10003 ms. Remains : 1035/1035 places, 1952/1952 transitions.
Graph (trivial) has 1719 edges and 1035 vertex of which 650 / 1035 are part of one of the 22 SCC in 6 ms
Free SCC test removed 628 places
Drop transitions removed 1234 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 1251 transitions.
Graph (complete) has 824 edges and 407 vertex of which 372 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.2 ms
Discarding 35 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Drop transitions removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 278 rules applied. Total rules applied 280 place count 372 transition count 419
Reduce places removed 218 places and 0 transitions.
Ensure Unique test removed 206 transitions
Reduce isomorphic transitions removed 206 transitions.
Iterating post reduction 1 with 424 rules applied. Total rules applied 704 place count 154 transition count 213
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 704 place count 154 transition count 207
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 716 place count 148 transition count 207
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 724 place count 140 transition count 199
Iterating global reduction 2 with 8 rules applied. Total rules applied 732 place count 140 transition count 199
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 737 place count 140 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 738 place count 139 transition count 194
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 740 place count 138 transition count 193
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 746 place count 135 transition count 196
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 751 place count 135 transition count 191
Free-agglomeration rule applied 12 times.
Iterating global reduction 4 with 12 rules applied. Total rules applied 763 place count 135 transition count 179
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 775 place count 123 transition count 179
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 795 place count 123 transition count 179
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 809 place count 109 transition count 165
Iterating global reduction 5 with 14 rules applied. Total rules applied 823 place count 109 transition count 165
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 829 place count 103 transition count 159
Applied a total of 829 rules in 166 ms. Remains 103 /1035 variables (removed 932) and now considering 159/1952 (removed 1793) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 159 rows 103 cols
[2023-03-12 20:10:19] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-12 20:10:19] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 20:10:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-12 20:10:19] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 20:10:19] [INFO ] After 165ms 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-12 20:10:19] [INFO ] After 381ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-12 20:10:19] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 15 ms.
[2023-03-12 20:10:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1035 places, 1952 transitions and 7633 arcs took 35 ms.
[2023-03-12 20:10:20] [INFO ] Flatten gal took : 306 ms
Total runtime 78408 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/555/inv_0_ --invariant=/tmp/555/inv_1_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 15230600 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16098596 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
mcc2023

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="ltsminxred"
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 ltsminxred"
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 r041-tajo-167813695000638"
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 ;