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.r263-smll-167863538100335.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is NoC3x3-PT-7B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538100335
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 8.0K Feb 26 09:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 09:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 09:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 09:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 09:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 09:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 130K Feb 26 09:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 2.0M 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 NoC3x3-PT-7B-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678769224113

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-7B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 04:47:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 04:47:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 04:47:08] [INFO ] Load time of PNML (sax parser for PT used): 630 ms
[2023-03-14 04:47:08] [INFO ] Transformed 7014 places.
[2023-03-14 04:47:08] [INFO ] Transformed 8833 transitions.
[2023-03-14 04:47:08] [INFO ] Found NUPN structural information;
[2023-03-14 04:47:08] [INFO ] Parsed PT model containing 7014 places and 8833 transitions and 19619 arcs in 888 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 4 resets, run finished after 859 ms. (steps per millisecond=11 ) properties (out of 16) seen :2
FORMULA NoC3x3-PT-7B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 8833 rows 7014 cols
[2023-03-14 04:47:10] [INFO ] Computed 66 place invariants in 101 ms
[2023-03-14 04:47:15] [INFO ] After 5025ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-14 04:47:20] [INFO ] [Nat]Absence check using 66 positive place invariants in 170 ms returned sat
[2023-03-14 04:47:41] [INFO ] After 17901ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-14 04:47:41] [INFO ] After 17916ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-14 04:47:41] [INFO ] After 25117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 12 different solutions.
FORMULA NoC3x3-PT-7B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 10 properties in 1519 ms.
Support contains 152 out of 7014 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7014/7014 places, 8833/8833 transitions.
Graph (trivial) has 7484 edges and 7014 vertex of which 2277 / 7014 are part of one of the 22 SCC in 30 ms
Free SCC test removed 2255 places
Drop transitions removed 2712 transitions
Reduce isomorphic transitions removed 2712 transitions.
Drop transitions removed 1853 transitions
Trivial Post-agglo rules discarded 1853 transitions
Performed 1853 trivial Post agglomeration. Transition count delta: 1853
Iterating post reduction 0 with 1853 rules applied. Total rules applied 1854 place count 4759 transition count 4268
Reduce places removed 1853 places and 0 transitions.
Ensure Unique test removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 1 with 2097 rules applied. Total rules applied 3951 place count 2906 transition count 4024
Reduce places removed 119 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 with 123 rules applied. Total rules applied 4074 place count 2787 transition count 4020
Reduce places removed 2 places and 0 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 3 with 81 rules applied. Total rules applied 4155 place count 2785 transition count 3941
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 88 rules applied. Total rules applied 4243 place count 2706 transition count 3932
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 4245 place count 2704 transition count 3932
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 23 Pre rules applied. Total rules applied 4245 place count 2704 transition count 3909
Deduced a syphon composed of 23 places in 11 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 4291 place count 2681 transition count 3909
Discarding 641 places :
Symmetric choice reduction at 6 with 641 rule applications. Total rules 4932 place count 2040 transition count 3245
Iterating global reduction 6 with 641 rules applied. Total rules applied 5573 place count 2040 transition count 3245
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 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 6 with 22 rules applied. Total rules applied 5595 place count 2040 transition count 3223
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 5597 place count 2038 transition count 3223
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 44 Pre rules applied. Total rules applied 5597 place count 2038 transition count 3179
Deduced a syphon composed of 44 places in 8 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 8 with 88 rules applied. Total rules applied 5685 place count 1994 transition count 3179
Discarding 323 places :
Symmetric choice reduction at 8 with 323 rule applications. Total rules 6008 place count 1671 transition count 2688
Iterating global reduction 8 with 323 rules applied. Total rules applied 6331 place count 1671 transition count 2688
Ensure Unique test removed 158 transitions
Reduce isomorphic transitions removed 158 transitions.
Iterating post reduction 8 with 158 rules applied. Total rules applied 6489 place count 1671 transition count 2530
Discarding 17 places :
Symmetric choice reduction at 9 with 17 rule applications. Total rules 6506 place count 1654 transition count 2496
Iterating global reduction 9 with 17 rules applied. Total rules applied 6523 place count 1654 transition count 2496
Discarding 14 places :
Symmetric choice reduction at 9 with 14 rule applications. Total rules 6537 place count 1640 transition count 2482
Iterating global reduction 9 with 14 rules applied. Total rules applied 6551 place count 1640 transition count 2482
Discarding 14 places :
Symmetric choice reduction at 9 with 14 rule applications. Total rules 6565 place count 1626 transition count 2461
Iterating global reduction 9 with 14 rules applied. Total rules applied 6579 place count 1626 transition count 2461
Discarding 12 places :
Symmetric choice reduction at 9 with 12 rule applications. Total rules 6591 place count 1614 transition count 2437
Iterating global reduction 9 with 12 rules applied. Total rules applied 6603 place count 1614 transition count 2437
Performed 558 Post agglomeration using F-continuation condition with reduction of 56 identical transitions.
Deduced a syphon composed of 558 places in 2 ms
Reduce places removed 558 places and 0 transitions.
Iterating global reduction 9 with 1116 rules applied. Total rules applied 7719 place count 1056 transition count 1823
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 9 with 70 rules applied. Total rules applied 7789 place count 1056 transition count 1753
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 10 with 66 rules applied. Total rules applied 7855 place count 1023 transition count 1720
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 7861 place count 1023 transition count 1714
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 11 with 2 rules applied. Total rules applied 7863 place count 1022 transition count 1713
Performed 101 Post agglomeration using F-continuation condition with reduction of 179 identical transitions.
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 11 with 202 rules applied. Total rules applied 8065 place count 921 transition count 1924
Ensure Unique test removed 114 transitions
Reduce isomorphic transitions removed 114 transitions.
Iterating post reduction 11 with 114 rules applied. Total rules applied 8179 place count 921 transition count 1810
Performed 101 Post agglomeration using F-continuation condition with reduction of 168 identical transitions.
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 12 with 202 rules applied. Total rules applied 8381 place count 820 transition count 2073
Ensure Unique test removed 134 transitions
Reduce isomorphic transitions removed 134 transitions.
Iterating post reduction 12 with 134 rules applied. Total rules applied 8515 place count 820 transition count 1939
Performed 47 Post agglomeration using F-continuation condition with reduction of 110 identical transitions.
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 13 with 94 rules applied. Total rules applied 8609 place count 773 transition count 2169
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Iterating post reduction 13 with 94 rules applied. Total rules applied 8703 place count 773 transition count 2075
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 8705 place count 772 transition count 2085
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 8707 place count 772 transition count 2083
Drop transitions removed 446 transitions
Redundant transition composition rules discarded 446 transitions
Iterating global reduction 15 with 446 rules applied. Total rules applied 9153 place count 772 transition count 1637
Discarding 12 places :
Symmetric choice reduction at 15 with 12 rule applications. Total rules 9165 place count 760 transition count 1619
Iterating global reduction 15 with 12 rules applied. Total rules applied 9177 place count 760 transition count 1619
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -113
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 15 with 24 rules applied. Total rules applied 9201 place count 748 transition count 1732
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 15 with 34 rules applied. Total rules applied 9235 place count 748 transition count 1698
Free-agglomeration rule applied 148 times.
Iterating global reduction 15 with 148 rules applied. Total rules applied 9383 place count 748 transition count 1550
Reduce places removed 148 places and 0 transitions.
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 2440 edges and 600 vertex of which 597 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Iterating post reduction 15 with 170 rules applied. Total rules applied 9553 place count 597 transition count 1529
Drop transitions removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 16 with 33 rules applied. Total rules applied 9586 place count 597 transition count 1496
Free-agglomeration rule applied 6 times.
Iterating global reduction 16 with 6 rules applied. Total rules applied 9592 place count 597 transition count 1490
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 9598 place count 591 transition count 1490
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 9599 place count 591 transition count 1489
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 17 with 2 rules applied. Total rules applied 9601 place count 591 transition count 1489
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 9605 place count 589 transition count 1487
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 18 with 2 rules applied. Total rules applied 9607 place count 589 transition count 1485
Partial Free-agglomeration rule applied 48 times.
Drop transitions removed 48 transitions
Iterating global reduction 18 with 48 rules applied. Total rules applied 9655 place count 589 transition count 1485
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 18 with 7 rules applied. Total rules applied 9662 place count 589 transition count 1478
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 9663 place count 589 transition count 1478
Applied a total of 9663 rules in 2435 ms. Remains 589 /7014 variables (removed 6425) and now considering 1478/8833 (removed 7355) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2438 ms. Remains : 589/7014 places, 1478/8833 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :1
FORMULA NoC3x3-PT-7B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-14 04:47:45] [INFO ] Flow matrix only has 1472 transitions (discarded 6 similar events)
// Phase 1: matrix 1472 rows 589 cols
[2023-03-14 04:47:45] [INFO ] Computed 63 place invariants in 6 ms
[2023-03-14 04:47:45] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 04:47:45] [INFO ] [Nat]Absence check using 63 positive place invariants in 37 ms returned sat
[2023-03-14 04:47:47] [INFO ] After 1026ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 04:47:47] [INFO ] State equation strengthened by 186 read => feed constraints.
[2023-03-14 04:47:47] [INFO ] After 629ms SMT Verify possible using 186 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-14 04:47:48] [INFO ] After 1455ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 638 ms.
[2023-03-14 04:47:49] [INFO ] After 3417ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 116 out of 589 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 589/589 places, 1478/1478 transitions.
Graph (trivial) has 184 edges and 589 vertex of which 25 / 589 are part of one of the 9 SCC in 1 ms
Free SCC test removed 16 places
Drop transitions removed 28 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 36 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 573 transition count 1439
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 570 transition count 1437
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 12 place count 568 transition count 1436
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 12 place count 568 transition count 1429
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 26 place count 561 transition count 1429
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 28 place count 561 transition count 1427
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 31 place count 558 transition count 1416
Iterating global reduction 4 with 3 rules applied. Total rules applied 34 place count 558 transition count 1416
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 5 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 62 place count 544 transition count 1402
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 63 place count 544 transition count 1401
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 67 place count 540 transition count 1394
Iterating global reduction 5 with 4 rules applied. Total rules applied 71 place count 540 transition count 1394
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 78 place count 540 transition count 1387
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 79 place count 539 transition count 1385
Iterating global reduction 6 with 1 rules applied. Total rules applied 80 place count 539 transition count 1385
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 83 place count 539 transition count 1382
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 89 place count 536 transition count 1388
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 96 place count 536 transition count 1381
Drop transitions removed 129 transitions
Redundant transition composition rules discarded 129 transitions
Iterating global reduction 8 with 129 rules applied. Total rules applied 225 place count 536 transition count 1252
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 233 place count 528 transition count 1244
Iterating global reduction 8 with 8 rules applied. Total rules applied 241 place count 528 transition count 1244
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 247 place count 528 transition count 1238
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 256 place count 528 transition count 1229
Free-agglomeration rule applied 28 times.
Iterating global reduction 9 with 28 rules applied. Total rules applied 284 place count 528 transition count 1201
Reduce places removed 28 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 2000 edges and 500 vertex of which 494 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 44 rules applied. Total rules applied 328 place count 494 transition count 1186
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 337 place count 494 transition count 1177
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 340 place count 494 transition count 1174
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 341 place count 494 transition count 1173
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 343 place count 493 transition count 1172
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 348 place count 493 transition count 1172
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 12 with 4 rules applied. Total rules applied 352 place count 493 transition count 1168
Applied a total of 352 rules in 418 ms. Remains 493 /589 variables (removed 96) and now considering 1168/1478 (removed 310) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 419 ms. Remains : 493/589 places, 1168/1478 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) 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 206650 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 206650 steps, saw 179497 distinct states, run finished after 3002 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-14 04:47:52] [INFO ] Flow matrix only has 1162 transitions (discarded 6 similar events)
// Phase 1: matrix 1162 rows 493 cols
[2023-03-14 04:47:52] [INFO ] Computed 62 place invariants in 12 ms
[2023-03-14 04:47:53] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 04:47:53] [INFO ] [Nat]Absence check using 62 positive place invariants in 22 ms returned sat
[2023-03-14 04:47:54] [INFO ] After 1006ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 04:47:54] [INFO ] State equation strengthened by 179 read => feed constraints.
[2023-03-14 04:47:54] [INFO ] After 560ms SMT Verify possible using 179 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-14 04:47:54] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2023-03-14 04:47:55] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 2 ms to minimize.
[2023-03-14 04:47:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 345 ms
[2023-03-14 04:47:55] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 2 ms to minimize.
[2023-03-14 04:47:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-03-14 04:47:55] [INFO ] After 1624ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 562 ms.
[2023-03-14 04:47:56] [INFO ] After 3400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 4 ms.
Support contains 116 out of 493 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 493/493 places, 1168/1168 transitions.
Applied a total of 0 rules in 28 ms. Remains 493 /493 variables (removed 0) and now considering 1168/1168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 493/493 places, 1168/1168 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 493/493 places, 1168/1168 transitions.
Applied a total of 0 rules in 29 ms. Remains 493 /493 variables (removed 0) and now considering 1168/1168 (removed 0) transitions.
[2023-03-14 04:47:56] [INFO ] Flow matrix only has 1162 transitions (discarded 6 similar events)
[2023-03-14 04:47:56] [INFO ] Invariant cache hit.
[2023-03-14 04:47:56] [INFO ] Implicit Places using invariants in 458 ms returned [69, 127, 285, 334, 402, 453]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 465 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 487/493 places, 1168/1168 transitions.
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 0 with 6 rules applied. Total rules applied 6 place count 484 transition count 1165
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 481 transition count 1166
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 18 place count 481 transition count 1160
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 481 transition count 1156
Applied a total of 22 rules in 95 ms. Remains 481 /487 variables (removed 6) and now considering 1156/1168 (removed 12) transitions.
[2023-03-14 04:47:57] [INFO ] Flow matrix only has 1150 transitions (discarded 6 similar events)
// Phase 1: matrix 1150 rows 481 cols
[2023-03-14 04:47:57] [INFO ] Computed 56 place invariants in 6 ms
[2023-03-14 04:47:57] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-14 04:47:57] [INFO ] Flow matrix only has 1150 transitions (discarded 6 similar events)
[2023-03-14 04:47:57] [INFO ] Invariant cache hit.
[2023-03-14 04:47:57] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-03-14 04:47:58] [INFO ] Implicit Places using invariants and state equation in 922 ms returned []
Implicit Place search using SMT with State Equation took 1233 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 481/493 places, 1156/1168 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1823 ms. Remains : 481/493 places, 1156/1168 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 206781 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 206781 steps, saw 178639 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-14 04:48:01] [INFO ] Flow matrix only has 1150 transitions (discarded 6 similar events)
[2023-03-14 04:48:01] [INFO ] Invariant cache hit.
[2023-03-14 04:48:01] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 04:48:01] [INFO ] [Nat]Absence check using 56 positive place invariants in 19 ms returned sat
[2023-03-14 04:48:02] [INFO ] After 792ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 04:48:02] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-03-14 04:48:03] [INFO ] After 494ms SMT Verify possible using 169 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-14 04:48:03] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2023-03-14 04:48:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2023-03-14 04:48:04] [INFO ] After 1276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 542 ms.
[2023-03-14 04:48:04] [INFO ] After 2773ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 116 out of 481 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 481/481 places, 1156/1156 transitions.
Applied a total of 0 rules in 27 ms. Remains 481 /481 variables (removed 0) and now considering 1156/1156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 481/481 places, 1156/1156 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 481/481 places, 1156/1156 transitions.
Applied a total of 0 rules in 23 ms. Remains 481 /481 variables (removed 0) and now considering 1156/1156 (removed 0) transitions.
[2023-03-14 04:48:04] [INFO ] Flow matrix only has 1150 transitions (discarded 6 similar events)
[2023-03-14 04:48:04] [INFO ] Invariant cache hit.
[2023-03-14 04:48:05] [INFO ] Implicit Places using invariants in 408 ms returned []
[2023-03-14 04:48:05] [INFO ] Flow matrix only has 1150 transitions (discarded 6 similar events)
[2023-03-14 04:48:05] [INFO ] Invariant cache hit.
[2023-03-14 04:48:05] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-03-14 04:48:06] [INFO ] Implicit Places using invariants and state equation in 1164 ms returned []
Implicit Place search using SMT with State Equation took 1578 ms to find 0 implicit places.
[2023-03-14 04:48:06] [INFO ] Redundant transitions in 147 ms returned []
[2023-03-14 04:48:06] [INFO ] Flow matrix only has 1150 transitions (discarded 6 similar events)
[2023-03-14 04:48:06] [INFO ] Invariant cache hit.
[2023-03-14 04:48:07] [INFO ] Dead Transitions using invariants and state equation in 1302 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3062 ms. Remains : 481/481 places, 1156/1156 transitions.
Graph (trivial) has 219 edges and 481 vertex of which 51 / 481 are part of one of the 14 SCC in 1 ms
Free SCC test removed 37 places
Drop transitions removed 61 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 68 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 444 transition count 1082
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 16 place count 438 transition count 1079
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 16 place count 438 transition count 1075
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 434 transition count 1075
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 433 transition count 1074
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 433 transition count 1074
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 433 transition count 1073
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 43 place count 425 transition count 1065
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 44 place count 425 transition count 1064
Drop transitions removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 152 place count 425 transition count 956
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 152 place count 425 transition count 954
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 156 place count 423 transition count 954
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 160 place count 421 transition count 957
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 167 place count 421 transition count 950
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 171 place count 421 transition count 946
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 189 place count 421 transition count 946
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 190 place count 421 transition count 945
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 194 place count 421 transition count 941
Applied a total of 194 rules in 143 ms. Remains 421 /481 variables (removed 60) and now considering 941/1156 (removed 215) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 941 rows 421 cols
[2023-03-14 04:48:07] [INFO ] Computed 56 place invariants in 4 ms
[2023-03-14 04:48:07] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 04:48:08] [INFO ] [Nat]Absence check using 56 positive place invariants in 27 ms returned sat
[2023-03-14 04:48:08] [INFO ] After 582ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 04:48:08] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-14 04:48:09] [INFO ] After 278ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-14 04:48:09] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2023-03-14 04:48:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-14 04:48:09] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
[2023-03-14 04:48:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-03-14 04:48:09] [INFO ] After 924ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 289 ms.
[2023-03-14 04:48:09] [INFO ] After 2001ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-14 04:48:09] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-14 04:48:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 481 places, 1156 transitions and 3933 arcs took 7 ms.
[2023-03-14 04:48:10] [INFO ] Flatten gal took : 265 ms
Total runtime 63037 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT NoC3x3-PT-7B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
ReachabilityFireability

FORMULA NoC3x3-PT-7B-ReachabilityFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-7B-ReachabilityFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-7B-ReachabilityFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678769293359

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 14 (type EXCL) for 6 NoC3x3-PT-7B-ReachabilityFireability-07
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 10 (type FNDP) for 6 NoC3x3-PT-7B-ReachabilityFireability-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 11 (type EQUN) for 6 NoC3x3-PT-7B-ReachabilityFireability-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 13 (type SRCH) for 6 NoC3x3-PT-7B-ReachabilityFireability-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 10 (type FNDP) for NoC3x3-PT-7B-ReachabilityFireability-07
lola: result : true
lola: fired transitions : 5
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 11 (type EQUN) for NoC3x3-PT-7B-ReachabilityFireability-07 (obsolete)
lola: CANCELED task # 13 (type SRCH) for NoC3x3-PT-7B-ReachabilityFireability-07 (obsolete)
lola: CANCELED task # 14 (type EXCL) for NoC3x3-PT-7B-ReachabilityFireability-07 (obsolete)
lola: LAUNCH task # 20 (type EXCL) for 0 NoC3x3-PT-7B-ReachabilityFireability-00
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 16 (type FNDP) for 0 NoC3x3-PT-7B-ReachabilityFireability-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 17 (type EQUN) for 0 NoC3x3-PT-7B-ReachabilityFireability-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 19 (type SRCH) for 0 NoC3x3-PT-7B-ReachabilityFireability-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 19 (type SRCH) for NoC3x3-PT-7B-ReachabilityFireability-00
lola: result : true
lola: markings : 13
lola: fired transitions : 12
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 16 (type FNDP) for NoC3x3-PT-7B-ReachabilityFireability-00 (obsolete)
lola: CANCELED task # 17 (type EQUN) for NoC3x3-PT-7B-ReachabilityFireability-00 (obsolete)
lola: CANCELED task # 20 (type EXCL) for NoC3x3-PT-7B-ReachabilityFireability-00 (obsolete)
lola: FINISHED task # 16 (type FNDP) for NoC3x3-PT-7B-ReachabilityFireability-00
lola: result : unknown
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/374/ReachabilityFireability-11.sara.
sara: try reading problem file /home/mcc/execution/374/ReachabilityFireability-17.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 26 (type EXCL) for 3 NoC3x3-PT-7B-ReachabilityFireability-04
lola: time limit : 3598 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 22 (type FNDP) for 3 NoC3x3-PT-7B-ReachabilityFireability-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 23 (type EQUN) for 3 NoC3x3-PT-7B-ReachabilityFireability-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 25 (type SRCH) for 3 NoC3x3-PT-7B-ReachabilityFireability-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 25 (type SRCH) for NoC3x3-PT-7B-ReachabilityFireability-04
lola: result : true
lola: markings : 17
lola: fired transitions : 16
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 22 (type FNDP) for NoC3x3-PT-7B-ReachabilityFireability-04 (obsolete)
lola: CANCELED task # 23 (type EQUN) for NoC3x3-PT-7B-ReachabilityFireability-04 (obsolete)
lola: CANCELED task # 26 (type EXCL) for NoC3x3-PT-7B-ReachabilityFireability-04 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
NoC3x3-PT-7B-ReachabilityFireability-00: EF true tandem / insertion
NoC3x3-PT-7B-ReachabilityFireability-04: EF true tandem / insertion
NoC3x3-PT-7B-ReachabilityFireability-07: AG false findpath


Time elapsed: 2 secs. Pages in use: 3

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="NoC3x3-PT-7B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is NoC3x3-PT-7B, 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 r263-smll-167863538100335"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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