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.r489-tall-167912707500951.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 ltsminxred
Input is UtahNoC-PT-none, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912707500951
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 5.9K Feb 26 04:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 04:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 04:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 04:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 04:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 04:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 205K Mar 5 18:23 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 UtahNoC-PT-none-ReachabilityFireability-00
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-01
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-02
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-03
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-04
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-05
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-06
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-07
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-08
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-09
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-10
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-11
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-12
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-13
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-14
FORMULA_NAME UtahNoC-PT-none-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679335312077

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtahNoC-PT-none
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 18:01:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 18:01:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 18:01:53] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2023-03-20 18:01:53] [INFO ] Transformed 216 places.
[2023-03-20 18:01:53] [INFO ] Transformed 977 transitions.
[2023-03-20 18:01:53] [INFO ] Found NUPN structural information;
[2023-03-20 18:01:53] [INFO ] Parsed PT model containing 216 places and 977 transitions and 2905 arcs in 147 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 148 transitions
Reduce redundant transitions removed 148 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 536 ms. (steps per millisecond=18 ) properties (out of 16) seen :4
FORMULA UtahNoC-PT-none-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :2
FORMULA UtahNoC-PT-none-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA UtahNoC-PT-none-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :1
FORMULA UtahNoC-PT-none-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) 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 9) 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 9) seen :0
Running SMT prover for 9 properties.
[2023-03-20 18:01:54] [INFO ] Flow matrix only has 427 transitions (discarded 402 similar events)
// Phase 1: matrix 427 rows 216 cols
[2023-03-20 18:01:54] [INFO ] Computed 8 place invariants in 18 ms
[2023-03-20 18:01:55] [INFO ] After 291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 18:01:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-20 18:01:55] [INFO ] After 298ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :6
[2023-03-20 18:01:55] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-20 18:01:55] [INFO ] After 221ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :3 sat :6
[2023-03-20 18:01:56] [INFO ] After 558ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :6
Attempting to minimize the solution found.
Minimization took 229 ms.
[2023-03-20 18:01:56] [INFO ] After 1274ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :6
FORMULA UtahNoC-PT-none-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA UtahNoC-PT-none-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA UtahNoC-PT-none-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 87 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 829/829 transitions.
Graph (trivial) has 152 edges and 216 vertex of which 29 / 216 are part of one of the 8 SCC in 2 ms
Free SCC test removed 21 places
Drop transitions removed 157 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 175 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 3 place count 195 transition count 652
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 193 transition count 650
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 191 transition count 650
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 29 place count 171 transition count 585
Iterating global reduction 3 with 20 rules applied. Total rules applied 49 place count 171 transition count 585
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 73 place count 171 transition count 561
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 74 place count 170 transition count 558
Iterating global reduction 4 with 1 rules applied. Total rules applied 75 place count 170 transition count 558
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 76 place count 170 transition count 557
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 78 place count 169 transition count 556
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 80 place count 169 transition count 554
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 82 place count 168 transition count 558
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 93 place count 168 transition count 547
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 98 place count 168 transition count 542
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 107 place count 163 transition count 538
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 108 place count 163 transition count 542
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 110 place count 162 transition count 541
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 113 place count 162 transition count 538
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 116 place count 162 transition count 538
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 117 place count 162 transition count 538
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 118 place count 161 transition count 537
Iterating global reduction 8 with 1 rules applied. Total rules applied 119 place count 161 transition count 537
Applied a total of 119 rules in 214 ms. Remains 161 /216 variables (removed 55) and now considering 537/829 (removed 292) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 161/216 places, 537/829 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 6) seen :3
FORMULA UtahNoC-PT-none-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 18:01:56] [INFO ] Flow matrix only has 307 transitions (discarded 230 similar events)
// Phase 1: matrix 307 rows 161 cols
[2023-03-20 18:01:56] [INFO ] Computed 8 place invariants in 4 ms
[2023-03-20 18:01:56] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 18:01:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-20 18:01:57] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 18:01:57] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 18:01:57] [INFO ] After 84ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 18:01:57] [INFO ] After 202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-20 18:01:57] [INFO ] After 483ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6 ms.
Support contains 46 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 537/537 transitions.
Graph (trivial) has 72 edges and 161 vertex of which 17 / 161 are part of one of the 7 SCC in 1 ms
Free SCC test removed 10 places
Drop transitions removed 17 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 20 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 140 transition count 479
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 140 transition count 479
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 39 place count 140 transition count 463
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 138 transition count 458
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 138 transition count 458
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 138 transition count 456
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 2 with 4 rules applied. Total rules applied 49 place count 136 transition count 454
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 136 transition count 453
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 135 transition count 451
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 135 transition count 451
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 55 place count 135 transition count 448
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 134 transition count 447
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 134 transition count 447
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 58 place count 134 transition count 446
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 61 place count 134 transition count 443
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 69 place count 131 transition count 438
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 70 place count 131 transition count 441
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 72 place count 130 transition count 440
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 75 place count 130 transition count 440
Applied a total of 75 rules in 64 ms. Remains 130 /161 variables (removed 31) and now considering 440/537 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 130/161 places, 440/537 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 3) seen :1
FORMULA UtahNoC-PT-none-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 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 6 ms. (steps per millisecond=1666 ) properties (out of 2) seen :1
FORMULA UtahNoC-PT-none-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
[2023-03-20 18:01:57] [INFO ] Flow matrix only has 238 transitions (discarded 202 similar events)
// Phase 1: matrix 238 rows 130 cols
[2023-03-20 18:01:57] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-20 18:01:57] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 18:01:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-20 18:01:57] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 18:01:57] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 18:01:57] [INFO ] After 63ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 18:01:57] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-20 18:01:57] [INFO ] After 298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 43 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 440/440 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 128 transition count 433
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 128 transition count 433
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 7 place count 128 transition count 430
Applied a total of 7 rules in 12 ms. Remains 128 /130 variables (removed 2) and now considering 430/440 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 128/130 places, 430/440 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1598456 steps, run timeout after 3001 ms. (steps per millisecond=532 ) properties seen :{}
Probabilistic random walk after 1598456 steps, saw 909805 distinct states, run finished after 3003 ms. (steps per millisecond=532 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 18:02:00] [INFO ] Flow matrix only has 231 transitions (discarded 199 similar events)
// Phase 1: matrix 231 rows 128 cols
[2023-03-20 18:02:00] [INFO ] Computed 8 place invariants in 5 ms
[2023-03-20 18:02:01] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 18:02:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-20 18:02:01] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 18:02:01] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-20 18:02:01] [INFO ] After 48ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 18:02:01] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-20 18:02:01] [INFO ] After 288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 43 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 430/430 transitions.
Applied a total of 0 rules in 7 ms. Remains 128 /128 variables (removed 0) and now considering 430/430 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 128/128 places, 430/430 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 430/430 transitions.
Applied a total of 0 rules in 7 ms. Remains 128 /128 variables (removed 0) and now considering 430/430 (removed 0) transitions.
[2023-03-20 18:02:01] [INFO ] Flow matrix only has 231 transitions (discarded 199 similar events)
[2023-03-20 18:02:01] [INFO ] Invariant cache hit.
[2023-03-20 18:02:01] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-20 18:02:01] [INFO ] Flow matrix only has 231 transitions (discarded 199 similar events)
[2023-03-20 18:02:01] [INFO ] Invariant cache hit.
[2023-03-20 18:02:01] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-20 18:02:01] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2023-03-20 18:02:01] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-20 18:02:01] [INFO ] Flow matrix only has 231 transitions (discarded 199 similar events)
[2023-03-20 18:02:01] [INFO ] Invariant cache hit.
[2023-03-20 18:02:01] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 390 ms. Remains : 128/128 places, 430/430 transitions.
Graph (trivial) has 54 edges and 128 vertex of which 13 / 128 are part of one of the 5 SCC in 0 ms
Free SCC test removed 8 places
Drop transitions removed 15 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 215 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 120 transition count 212
Reduce places removed 3 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 12 rules applied. Total rules applied 16 place count 117 transition count 203
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 25 place count 108 transition count 203
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 25 place count 108 transition count 200
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 31 place count 105 transition count 200
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 35 place count 101 transition count 196
Iterating global reduction 3 with 4 rules applied. Total rules applied 39 place count 101 transition count 196
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 53 place count 94 transition count 189
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 64 place count 94 transition count 178
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 93 transition count 177
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 93 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 67 place count 93 transition count 176
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 69 place count 92 transition count 175
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 70 place count 92 transition count 174
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 71 place count 92 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 72 place count 91 transition count 173
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 81 place count 91 transition count 173
Applied a total of 81 rules in 40 ms. Remains 91 /128 variables (removed 37) and now considering 173/430 (removed 257) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 173 rows 91 cols
[2023-03-20 18:02:01] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-20 18:02:01] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 18:02:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-20 18:02:01] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 18:02:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-20 18:02:01] [INFO ] After 45ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 18:02:02] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-20 18:02:02] [INFO ] After 232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-20 18:02:02] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-20 18:02:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 128 places, 430 transitions and 1459 arcs took 4 ms.
[2023-03-20 18:02:02] [INFO ] Flatten gal took : 56 ms
Total runtime 8762 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 --inv-bin-par --invariant=/tmp/502/inv_0_ --inv-par
FORMULA UtahNoC-PT-none-ReachabilityFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679335329625

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name UtahNoC-PT-none-ReachabilityFireability-02
rfs formula type AG
rfs formula formula --invariant=/tmp/502/inv_0_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 128 places, 430 transitions and 1459 arcs
pnml2lts-sym: Petri net UtahNoC_PT_none analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 430->366 groups
pnml2lts-sym: Regrouping took 0.090 real 0.090 user 0.000 sys
pnml2lts-sym: state vector length is 128; there are 366 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/502/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 3.900 real 15.580 user 0.000 sys
pnml2lts-sym: max token count: 1

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="UtahNoC-PT-none"
export BK_EXAMINATION="ReachabilityFireability"
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 UtahNoC-PT-none, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r489-tall-167912707500951"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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