About the Execution of LoLa+red for NoC3x3-PT-2B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
372.632 | 47088.00 | 87513.00 | 489.80 | TFFTTTFTTTFTTFTF | normal |
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-167863537900254.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-2B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863537900254
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 972K
-rw-r--r-- 1 mcc users 5.8K Feb 26 10:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 26 10:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 10:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 10:05 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.5K Feb 25 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 26 10:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 10:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:28 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 548K 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-2B-ReachabilityCardinality-00
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-01
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-02
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-03
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-04
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-05
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-06
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-07
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-08
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-09
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-10
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-11
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-12
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-13
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-14
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678754247931
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-2B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 00:37:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 00:37:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 00:37:31] [INFO ] Load time of PNML (sax parser for PT used): 267 ms
[2023-03-14 00:37:31] [INFO ] Transformed 2003 places.
[2023-03-14 00:37:31] [INFO ] Transformed 2292 transitions.
[2023-03-14 00:37:31] [INFO ] Found NUPN structural information;
[2023-03-14 00:37:31] [INFO ] Parsed PT model containing 2003 places and 2292 transitions and 5835 arcs in 440 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 16 resets, run finished after 998 ms. (steps per millisecond=10 ) properties (out of 15) seen :5
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :1
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 9) seen :1
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2292 rows 2003 cols
[2023-03-14 00:37:33] [INFO ] Computed 66 place invariants in 55 ms
[2023-03-14 00:37:35] [INFO ] After 1503ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-14 00:37:36] [INFO ] [Nat]Absence check using 66 positive place invariants in 64 ms returned sat
[2023-03-14 00:37:39] [INFO ] After 3220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-14 00:37:40] [INFO ] Deduced a trap composed of 102 places in 441 ms of which 11 ms to minimize.
[2023-03-14 00:37:40] [INFO ] Deduced a trap composed of 129 places in 321 ms of which 3 ms to minimize.
[2023-03-14 00:37:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1200 ms
[2023-03-14 00:37:42] [INFO ] Deduced a trap composed of 82 places in 324 ms of which 2 ms to minimize.
[2023-03-14 00:37:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 636 ms
[2023-03-14 00:37:43] [INFO ] Deduced a trap composed of 65 places in 496 ms of which 3 ms to minimize.
[2023-03-14 00:37:44] [INFO ] Deduced a trap composed of 60 places in 706 ms of which 2 ms to minimize.
[2023-03-14 00:37:44] [INFO ] Deduced a trap composed of 108 places in 543 ms of which 9 ms to minimize.
[2023-03-14 00:37:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2322 ms
[2023-03-14 00:37:45] [INFO ] After 9063ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1051 ms.
[2023-03-14 00:37:46] [INFO ] After 11582ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 486 ms.
Support contains 48 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2292/2292 transitions.
Graph (trivial) has 1546 edges and 2003 vertex of which 64 / 2003 are part of one of the 8 SCC in 22 ms
Free SCC test removed 56 places
Drop transitions removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 374 transitions
Trivial Post-agglo rules discarded 374 transitions
Performed 374 trivial Post agglomeration. Transition count delta: 374
Iterating post reduction 0 with 383 rules applied. Total rules applied 384 place count 1938 transition count 1854
Reduce places removed 374 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 388 rules applied. Total rules applied 772 place count 1564 transition count 1840
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 786 place count 1550 transition count 1840
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 786 place count 1550 transition count 1814
Deduced a syphon composed of 26 places in 11 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 838 place count 1524 transition count 1814
Discarding 347 places :
Symmetric choice reduction at 3 with 347 rule applications. Total rules 1185 place count 1177 transition count 1467
Iterating global reduction 3 with 347 rules applied. Total rules applied 1532 place count 1177 transition count 1467
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 1532 place count 1177 transition count 1428
Deduced a syphon composed of 39 places in 61 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 1610 place count 1138 transition count 1428
Discarding 125 places :
Symmetric choice reduction at 3 with 125 rule applications. Total rules 1735 place count 1013 transition count 1266
Iterating global reduction 3 with 125 rules applied. Total rules applied 1860 place count 1013 transition count 1266
Discarding 111 places :
Symmetric choice reduction at 3 with 111 rule applications. Total rules 1971 place count 902 transition count 1146
Iterating global reduction 3 with 111 rules applied. Total rules applied 2082 place count 902 transition count 1146
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 2119 place count 865 transition count 1079
Iterating global reduction 3 with 37 rules applied. Total rules applied 2156 place count 865 transition count 1079
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 13 rules applied. Total rules applied 2169 place count 863 transition count 1068
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2171 place count 861 transition count 1068
Discarding 26 places :
Symmetric choice reduction at 5 with 26 rule applications. Total rules 2197 place count 835 transition count 1042
Iterating global reduction 5 with 26 rules applied. Total rules applied 2223 place count 835 transition count 1042
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 2227 place count 833 transition count 1040
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2229 place count 831 transition count 1040
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 2244 place count 816 transition count 1010
Iterating global reduction 7 with 15 rules applied. Total rules applied 2259 place count 816 transition count 1010
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 2274 place count 801 transition count 995
Iterating global reduction 7 with 15 rules applied. Total rules applied 2289 place count 801 transition count 995
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 2304 place count 801 transition count 980
Performed 295 Post agglomeration using F-continuation condition.Transition count delta: 295
Deduced a syphon composed of 295 places in 1 ms
Reduce places removed 295 places and 0 transitions.
Iterating global reduction 8 with 590 rules applied. Total rules applied 2894 place count 506 transition count 685
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 2905 place count 495 transition count 674
Iterating global reduction 8 with 11 rules applied. Total rules applied 2916 place count 495 transition count 674
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 2924 place count 487 transition count 658
Iterating global reduction 8 with 8 rules applied. Total rules applied 2932 place count 487 transition count 658
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2933 place count 486 transition count 656
Iterating global reduction 8 with 1 rules applied. Total rules applied 2934 place count 486 transition count 656
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 8 with 38 rules applied. Total rules applied 2972 place count 467 transition count 696
Free-agglomeration rule applied 22 times.
Iterating global reduction 8 with 22 rules applied. Total rules applied 2994 place count 467 transition count 674
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 25 rules applied. Total rules applied 3019 place count 445 transition count 671
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 3020 place count 445 transition count 670
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 3021 place count 445 transition count 669
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3022 place count 444 transition count 669
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 3027 place count 444 transition count 669
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 3033 place count 444 transition count 669
Applied a total of 3033 rules in 1359 ms. Remains 444 /2003 variables (removed 1559) and now considering 669/2292 (removed 1623) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1360 ms. Remains : 444/2003 places, 669/2292 transitions.
Incomplete random walk after 10000 steps, including 110 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 245442 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 245442 steps, saw 61870 distinct states, run finished after 3004 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-14 00:37:52] [INFO ] Flow matrix only has 667 transitions (discarded 2 similar events)
// Phase 1: matrix 667 rows 444 cols
[2023-03-14 00:37:52] [INFO ] Computed 55 place invariants in 10 ms
[2023-03-14 00:37:52] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 00:37:52] [INFO ] [Nat]Absence check using 55 positive place invariants in 17 ms returned sat
[2023-03-14 00:37:53] [INFO ] After 599ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 00:37:53] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 00:37:53] [INFO ] After 233ms SMT Verify possible using 67 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-14 00:37:53] [INFO ] After 547ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 234 ms.
[2023-03-14 00:37:53] [INFO ] After 1565ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 64 ms.
Support contains 48 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 669/669 transitions.
Applied a total of 0 rules in 26 ms. Remains 444 /444 variables (removed 0) and now considering 669/669 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 444/444 places, 669/669 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 669/669 transitions.
Applied a total of 0 rules in 29 ms. Remains 444 /444 variables (removed 0) and now considering 669/669 (removed 0) transitions.
[2023-03-14 00:37:54] [INFO ] Flow matrix only has 667 transitions (discarded 2 similar events)
[2023-03-14 00:37:54] [INFO ] Invariant cache hit.
[2023-03-14 00:37:54] [INFO ] Implicit Places using invariants in 531 ms returned [11, 45, 125, 276, 334, 365, 420]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 538 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 437/444 places, 669/669 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 437 transition count 668
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 436 transition count 667
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 35 place count 420 transition count 651
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 49 place count 420 transition count 637
Applied a total of 49 rules in 38 ms. Remains 420 /437 variables (removed 17) and now considering 637/669 (removed 32) transitions.
[2023-03-14 00:37:54] [INFO ] Flow matrix only has 635 transitions (discarded 2 similar events)
// Phase 1: matrix 635 rows 420 cols
[2023-03-14 00:37:54] [INFO ] Computed 48 place invariants in 5 ms
[2023-03-14 00:37:54] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-14 00:37:54] [INFO ] Flow matrix only has 635 transitions (discarded 2 similar events)
[2023-03-14 00:37:54] [INFO ] Invariant cache hit.
[2023-03-14 00:37:55] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-14 00:37:56] [INFO ] Implicit Places using invariants and state equation in 1151 ms returned [6, 10, 31, 32, 35, 36, 40, 41, 77, 80, 106, 107, 112, 113, 117, 148, 149, 150, 151, 154, 155, 156, 161, 162, 166, 167, 168, 251, 252, 253, 257, 259, 260, 263, 264, 265, 315, 319, 335, 336, 337, 340, 341, 346, 347, 393, 394, 397, 398]
Discarding 49 places :
Implicit Place search using SMT with State Equation took 1452 ms to find 49 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 371/444 places, 637/669 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 371 transition count 630
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 364 transition count 630
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 84 place count 329 transition count 595
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 98 place count 322 transition count 597
Free-agglomeration rule (complex) applied 61 times.
Iterating global reduction 2 with 61 rules applied. Total rules applied 159 place count 322 transition count 544
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 66 rules applied. Total rules applied 225 place count 261 transition count 539
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 227 place count 261 transition count 537
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 233 place count 261 transition count 537
Applied a total of 233 rules in 118 ms. Remains 261 /371 variables (removed 110) and now considering 537/637 (removed 100) transitions.
[2023-03-14 00:37:56] [INFO ] Flow matrix only has 534 transitions (discarded 3 similar events)
// Phase 1: matrix 534 rows 261 cols
[2023-03-14 00:37:56] [INFO ] Computed 35 place invariants in 9 ms
[2023-03-14 00:37:56] [INFO ] Implicit Places using invariants in 295 ms returned []
[2023-03-14 00:37:56] [INFO ] Flow matrix only has 534 transitions (discarded 3 similar events)
[2023-03-14 00:37:56] [INFO ] Invariant cache hit.
[2023-03-14 00:37:56] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-14 00:37:57] [INFO ] Implicit Places using invariants and state equation in 817 ms returned []
Implicit Place search using SMT with State Equation took 1115 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 261/444 places, 537/669 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3294 ms. Remains : 261/444 places, 537/669 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :1
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :1
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
[2023-03-14 00:37:57] [INFO ] Flow matrix only has 534 transitions (discarded 3 similar events)
[2023-03-14 00:37:57] [INFO ] Invariant cache hit.
[2023-03-14 00:37:57] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 00:37:58] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2023-03-14 00:37:58] [INFO ] After 322ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 00:37:58] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-14 00:37:58] [INFO ] After 200ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 00:37:58] [INFO ] After 376ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 122 ms.
[2023-03-14 00:37:58] [INFO ] After 937ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 40 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 537/537 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 3 place count 261 transition count 534
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 258 transition count 534
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 258 transition count 533
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 257 transition count 533
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 255 transition count 531
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 254 transition count 544
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 254 transition count 543
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 253 transition count 543
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 253 transition count 543
Applied a total of 17 rules in 74 ms. Remains 253 /261 variables (removed 8) and now considering 543/537 (removed -6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 253/261 places, 543/537 transitions.
Incomplete random walk after 10000 steps, including 139 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 294139 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 294139 steps, saw 69360 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-14 00:38:02] [INFO ] Flow matrix only has 540 transitions (discarded 3 similar events)
// Phase 1: matrix 540 rows 253 cols
[2023-03-14 00:38:02] [INFO ] Computed 35 place invariants in 7 ms
[2023-03-14 00:38:02] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 00:38:02] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2023-03-14 00:38:02] [INFO ] After 314ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 00:38:02] [INFO ] State equation strengthened by 106 read => feed constraints.
[2023-03-14 00:38:02] [INFO ] After 180ms SMT Verify possible using 106 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 00:38:03] [INFO ] After 339ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 136 ms.
[2023-03-14 00:38:03] [INFO ] After 879ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 26 ms.
Support contains 40 out of 253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 543/543 transitions.
Applied a total of 0 rules in 15 ms. Remains 253 /253 variables (removed 0) and now considering 543/543 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 253/253 places, 543/543 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 543/543 transitions.
Applied a total of 0 rules in 18 ms. Remains 253 /253 variables (removed 0) and now considering 543/543 (removed 0) transitions.
[2023-03-14 00:38:03] [INFO ] Flow matrix only has 540 transitions (discarded 3 similar events)
[2023-03-14 00:38:03] [INFO ] Invariant cache hit.
[2023-03-14 00:38:03] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-03-14 00:38:03] [INFO ] Flow matrix only has 540 transitions (discarded 3 similar events)
[2023-03-14 00:38:03] [INFO ] Invariant cache hit.
[2023-03-14 00:38:03] [INFO ] State equation strengthened by 106 read => feed constraints.
[2023-03-14 00:38:04] [INFO ] Implicit Places using invariants and state equation in 856 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1174 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 252/253 places, 543/543 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 251 transition count 543
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 251 transition count 542
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 250 transition count 542
Applied a total of 4 rules in 34 ms. Remains 250 /252 variables (removed 2) and now considering 542/543 (removed 1) transitions.
[2023-03-14 00:38:04] [INFO ] Flow matrix only has 538 transitions (discarded 4 similar events)
// Phase 1: matrix 538 rows 250 cols
[2023-03-14 00:38:04] [INFO ] Computed 35 place invariants in 4 ms
[2023-03-14 00:38:04] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-14 00:38:04] [INFO ] Flow matrix only has 538 transitions (discarded 4 similar events)
[2023-03-14 00:38:04] [INFO ] Invariant cache hit.
[2023-03-14 00:38:05] [INFO ] State equation strengthened by 109 read => feed constraints.
[2023-03-14 00:38:05] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 1135 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 250/253 places, 542/543 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2366 ms. Remains : 250/253 places, 542/543 transitions.
Incomplete random walk after 10000 steps, including 140 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 312367 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 312367 steps, saw 71599 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-14 00:38:08] [INFO ] Flow matrix only has 538 transitions (discarded 4 similar events)
[2023-03-14 00:38:08] [INFO ] Invariant cache hit.
[2023-03-14 00:38:09] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 00:38:09] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2023-03-14 00:38:09] [INFO ] After 324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 00:38:09] [INFO ] State equation strengthened by 109 read => feed constraints.
[2023-03-14 00:38:09] [INFO ] After 252ms SMT Verify possible using 109 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 00:38:09] [INFO ] After 431ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 170 ms.
[2023-03-14 00:38:10] [INFO ] After 1036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 20 ms.
Support contains 40 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 542/542 transitions.
Applied a total of 0 rules in 8 ms. Remains 250 /250 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 250/250 places, 542/542 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 542/542 transitions.
Applied a total of 0 rules in 8 ms. Remains 250 /250 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2023-03-14 00:38:10] [INFO ] Flow matrix only has 538 transitions (discarded 4 similar events)
[2023-03-14 00:38:10] [INFO ] Invariant cache hit.
[2023-03-14 00:38:10] [INFO ] Implicit Places using invariants in 330 ms returned []
[2023-03-14 00:38:10] [INFO ] Flow matrix only has 538 transitions (discarded 4 similar events)
[2023-03-14 00:38:10] [INFO ] Invariant cache hit.
[2023-03-14 00:38:10] [INFO ] State equation strengthened by 109 read => feed constraints.
[2023-03-14 00:38:11] [INFO ] Implicit Places using invariants and state equation in 820 ms returned []
Implicit Place search using SMT with State Equation took 1152 ms to find 0 implicit places.
[2023-03-14 00:38:11] [INFO ] Redundant transitions in 68 ms returned []
[2023-03-14 00:38:11] [INFO ] Flow matrix only has 538 transitions (discarded 4 similar events)
[2023-03-14 00:38:11] [INFO ] Invariant cache hit.
[2023-03-14 00:38:11] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1703 ms. Remains : 250/250 places, 542/542 transitions.
Graph (trivial) has 66 edges and 250 vertex of which 32 / 250 are part of one of the 16 SCC in 1 ms
Free SCC test removed 16 places
Drop transitions removed 46 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (complete) has 808 edges and 234 vertex of which 223 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Discarding 11 places :
Also discarding 0 output transitions
Drop transitions removed 20 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 223 transition count 461
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 45 place count 218 transition count 456
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 50 place count 218 transition count 451
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 2 with 11 rules applied. Total rules applied 61 place count 218 transition count 440
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 75 place count 218 transition count 440
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 218 transition count 439
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 218 transition count 438
Applied a total of 77 rules in 73 ms. Remains 218 /250 variables (removed 32) and now considering 438/542 (removed 104) transitions.
Running SMT prover for 2 properties.
[2023-03-14 00:38:11] [INFO ] Flow matrix only has 435 transitions (discarded 3 similar events)
// Phase 1: matrix 435 rows 218 cols
[2023-03-14 00:38:11] [INFO ] Computed 30 place invariants in 3 ms
[2023-03-14 00:38:12] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 00:38:12] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2023-03-14 00:38:12] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 00:38:12] [INFO ] State equation strengthened by 153 read => feed constraints.
[2023-03-14 00:38:12] [INFO ] After 83ms SMT Verify possible using 153 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 00:38:12] [INFO ] After 161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-14 00:38:12] [INFO ] After 517ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-14 00:38:12] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-14 00:38:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 250 places, 542 transitions and 2486 arcs took 4 ms.
[2023-03-14 00:38:12] [INFO ] Flatten gal took : 123 ms
Total runtime 41605 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT NoC3x3-PT-2B
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
ReachabilityCardinality
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678754295019
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/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/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k: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: 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 # 16 (type EXCL) for 0 NoC3x3-PT-2B-ReachabilityCardinality-04
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 9 (type FNDP) for 0 NoC3x3-PT-2B-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 10 (type EQUN) for 0 NoC3x3-PT-2B-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 15 (type SRCH) for 0 NoC3x3-PT-2B-ReachabilityCardinality-04
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
sara: try reading problem file /home/mcc/execution/374/ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 10 (type EQUN) for NoC3x3-PT-2B-ReachabilityCardinality-04
lola: result : true
lola: CANCELED task # 9 (type FNDP) for NoC3x3-PT-2B-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 15 (type SRCH) for NoC3x3-PT-2B-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 16 (type EXCL) for NoC3x3-PT-2B-ReachabilityCardinality-04 (obsolete)
lola: LAUNCH task # 14 (type EXCL) for 3 NoC3x3-PT-2B-ReachabilityCardinality-06
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 7 (type FNDP) for 3 NoC3x3-PT-2B-ReachabilityCardinality-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 8 (type EQUN) for 3 NoC3x3-PT-2B-ReachabilityCardinality-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: LAUNCH task # 13 (type SRCH) for 3 NoC3x3-PT-2B-ReachabilityCardinality-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 9 (type FNDP) for NoC3x3-PT-2B-ReachabilityCardinality-04
lola: result : unknown
lola: fired transitions : 37970
lola: tried executions : 2340
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 13 (type SRCH) for NoC3x3-PT-2B-ReachabilityCardinality-06
lola: result : true
lola: markings : 14
lola: fired transitions : 13
lola: time used : 1.000000
lola: memory pages used : 1
lola: CANCELED task # 7 (type FNDP) for NoC3x3-PT-2B-ReachabilityCardinality-06 (obsolete)
lola: CANCELED task # 8 (type EQUN) for NoC3x3-PT-2B-ReachabilityCardinality-06 (obsolete)
lola: CANCELED task # 14 (type EXCL) for NoC3x3-PT-2B-ReachabilityCardinality-06 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
NoC3x3-PT-2B-ReachabilityCardinality-04: EF true state equation
NoC3x3-PT-2B-ReachabilityCardinality-06: AG false tandem / insertion
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-2B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is NoC3x3-PT-2B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-smll-167863537900254"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-2B.tgz
mv NoC3x3-PT-2B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;