fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r263-tall-171654372600364
Last Updated
July 7, 2024

About the Execution of 2023-gold for NoC3x3-PT-2B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
413.396 19958.00 37489.00 298.70 TTTTFFFTTTTTTFFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r263-tall-171654372600364.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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-tall-171654372600364
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1008K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 06:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 12 06:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 06:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 12 06:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 548K May 18 16:43 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-2024-00
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-2024-01
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-2024-02
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-2024-03
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-2024-04
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-2024-05
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-2024-06
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-2024-07
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-2024-08
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-2024-09
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-2024-10
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-2024-11
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-2024-12
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-2024-13
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-2024-14
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716689780958

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=gold2023
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 202304061127
[2024-05-26 02:16:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-26 02:16:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 02:16:22] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2024-05-26 02:16:22] [INFO ] Transformed 2003 places.
[2024-05-26 02:16:22] [INFO ] Transformed 2292 transitions.
[2024-05-26 02:16:22] [INFO ] Found NUPN structural information;
[2024-05-26 02:16:22] [INFO ] Parsed PT model containing 2003 places and 2292 transitions and 5835 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 16 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 13) seen :10
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2292 rows 2003 cols
[2024-05-26 02:16:23] [INFO ] Computed 66 invariants in 34 ms
[2024-05-26 02:16:23] [INFO ] After 650ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-26 02:16:24] [INFO ] [Nat]Absence check using 66 positive place invariants in 46 ms returned sat
[2024-05-26 02:16:25] [INFO ] After 1065ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-26 02:16:25] [INFO ] Deduced a trap composed of 44 places in 315 ms of which 5 ms to minimize.
[2024-05-26 02:16:26] [INFO ] Deduced a trap composed of 28 places in 273 ms of which 2 ms to minimize.
[2024-05-26 02:16:26] [INFO ] Deduced a trap composed of 37 places in 277 ms of which 4 ms to minimize.
[2024-05-26 02:16:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1155 ms
[2024-05-26 02:16:27] [INFO ] After 2620ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 251 ms.
[2024-05-26 02:16:27] [INFO ] After 3425ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 49 ms.
Support contains 21 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2292/2292 transitions.
Graph (trivial) has 1599 edges and 2003 vertex of which 72 / 2003 are part of one of the 9 SCC in 6 ms
Free SCC test removed 63 places
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 393 transitions
Trivial Post-agglo rules discarded 393 transitions
Performed 393 trivial Post agglomeration. Transition count delta: 393
Iterating post reduction 0 with 402 rules applied. Total rules applied 403 place count 1931 transition count 1827
Reduce places removed 393 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 397 rules applied. Total rules applied 800 place count 1538 transition count 1823
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 804 place count 1534 transition count 1823
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 804 place count 1534 transition count 1799
Deduced a syphon composed of 24 places in 16 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 852 place count 1510 transition count 1799
Discarding 344 places :
Symmetric choice reduction at 3 with 344 rule applications. Total rules 1196 place count 1166 transition count 1455
Iterating global reduction 3 with 344 rules applied. Total rules applied 1540 place count 1166 transition count 1455
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 1540 place count 1166 transition count 1415
Deduced a syphon composed of 40 places in 8 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 1620 place count 1126 transition count 1415
Discarding 129 places :
Symmetric choice reduction at 3 with 129 rule applications. Total rules 1749 place count 997 transition count 1249
Iterating global reduction 3 with 129 rules applied. Total rules applied 1878 place count 997 transition count 1249
Discarding 121 places :
Symmetric choice reduction at 3 with 121 rule applications. Total rules 1999 place count 876 transition count 1115
Iterating global reduction 3 with 121 rules applied. Total rules applied 2120 place count 876 transition count 1115
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 2165 place count 831 transition count 1036
Iterating global reduction 3 with 45 rules applied. Total rules applied 2210 place count 831 transition count 1036
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 17 rules applied. Total rules applied 2227 place count 829 transition count 1021
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2229 place count 827 transition count 1021
Discarding 32 places :
Symmetric choice reduction at 5 with 32 rule applications. Total rules 2261 place count 795 transition count 989
Iterating global reduction 5 with 32 rules applied. Total rules applied 2293 place count 795 transition count 989
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 2295 place count 794 transition count 988
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2296 place count 793 transition count 988
Discarding 20 places :
Symmetric choice reduction at 7 with 20 rule applications. Total rules 2316 place count 773 transition count 948
Iterating global reduction 7 with 20 rules applied. Total rules applied 2336 place count 773 transition count 948
Discarding 20 places :
Symmetric choice reduction at 7 with 20 rule applications. Total rules 2356 place count 753 transition count 928
Iterating global reduction 7 with 20 rules applied. Total rules applied 2376 place count 753 transition count 928
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 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 7 with 24 rules applied. Total rules applied 2400 place count 751 transition count 906
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 2402 place count 749 transition count 906
Performed 296 Post agglomeration using F-continuation condition.Transition count delta: 296
Deduced a syphon composed of 296 places in 1 ms
Reduce places removed 296 places and 0 transitions.
Iterating global reduction 9 with 592 rules applied. Total rules applied 2994 place count 453 transition count 610
Discarding 12 places :
Symmetric choice reduction at 9 with 12 rule applications. Total rules 3006 place count 441 transition count 598
Iterating global reduction 9 with 12 rules applied. Total rules applied 3018 place count 441 transition count 598
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 3024 place count 435 transition count 586
Iterating global reduction 9 with 6 rules applied. Total rules applied 3030 place count 435 transition count 586
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 3032 place count 433 transition count 581
Iterating global reduction 9 with 2 rules applied. Total rules applied 3034 place count 433 transition count 581
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 9 with 34 rules applied. Total rules applied 3068 place count 416 transition count 613
Free-agglomeration rule applied 23 times.
Iterating global reduction 9 with 23 rules applied. Total rules applied 3091 place count 416 transition count 590
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 29 rules applied. Total rules applied 3120 place count 393 transition count 584
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 3121 place count 393 transition count 583
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 3122 place count 393 transition count 582
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 3123 place count 392 transition count 582
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 3127 place count 392 transition count 582
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 3128 place count 392 transition count 582
Applied a total of 3128 rules in 1166 ms. Remains 392 /2003 variables (removed 1611) and now considering 582/2292 (removed 1710) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1166 ms. Remains : 392/2003 places, 582/2292 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 3) seen :1
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-26 02:16:28] [INFO ] Flow matrix only has 580 transitions (discarded 2 similar events)
// Phase 1: matrix 580 rows 392 cols
[2024-05-26 02:16:28] [INFO ] Computed 55 invariants in 5 ms
[2024-05-26 02:16:28] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-26 02:16:28] [INFO ] [Nat]Absence check using 55 positive place invariants in 9 ms returned sat
[2024-05-26 02:16:29] [INFO ] After 207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-26 02:16:29] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-26 02:16:29] [INFO ] After 76ms SMT Verify possible using 65 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-26 02:16:29] [INFO ] After 146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 43 ms.
[2024-05-26 02:16:29] [INFO ] After 491ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 19 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 582/582 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 392 transition count 581
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 391 transition count 581
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 4 place count 390 transition count 581
Applied a total of 4 rules in 21 ms. Remains 390 /392 variables (removed 2) and now considering 581/582 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 390/392 places, 581/582 transitions.
Incomplete random walk after 10000 steps, including 128 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :1
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-26 02:16:29] [INFO ] Flow matrix only has 579 transitions (discarded 2 similar events)
// Phase 1: matrix 579 rows 390 cols
[2024-05-26 02:16:29] [INFO ] Computed 55 invariants in 3 ms
[2024-05-26 02:16:29] [INFO ] [Real]Absence check using 55 positive place invariants in 13 ms returned sat
[2024-05-26 02:16:29] [INFO ] After 210ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-26 02:16:29] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-26 02:16:29] [INFO ] After 42ms SMT Verify possible using 66 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:16:29] [INFO ] After 356ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:16:29] [INFO ] [Nat]Absence check using 55 positive place invariants in 9 ms returned sat
[2024-05-26 02:16:30] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 02:16:30] [INFO ] After 35ms SMT Verify possible using 66 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-26 02:16:30] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-26 02:16:30] [INFO ] After 303ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 390 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 390/390 places, 581/581 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 390 transition count 577
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 386 transition count 577
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 386 transition count 575
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 384 transition count 575
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 16 place count 380 transition count 569
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 380 transition count 569
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 380 transition count 568
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 41 place count 370 transition count 558
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 48 place count 363 transition count 538
Iterating global reduction 3 with 7 rules applied. Total rules applied 55 place count 363 transition count 538
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 57 place count 363 transition count 536
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 59 place count 361 transition count 532
Iterating global reduction 4 with 2 rules applied. Total rules applied 61 place count 361 transition count 532
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 62 place count 361 transition count 531
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 63 place count 360 transition count 529
Iterating global reduction 5 with 1 rules applied. Total rules applied 64 place count 360 transition count 529
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 65 place count 360 transition count 528
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 67 place count 359 transition count 529
Applied a total of 67 rules in 50 ms. Remains 359 /390 variables (removed 31) and now considering 529/581 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 359/390 places, 529/581 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 800674 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :{}
Probabilistic random walk after 800674 steps, saw 167520 distinct states, run finished after 3002 ms. (steps per millisecond=266 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 529 rows 359 cols
[2024-05-26 02:16:33] [INFO ] Computed 55 invariants in 10 ms
[2024-05-26 02:16:33] [INFO ] [Real]Absence check using 55 positive place invariants in 9 ms returned sat
[2024-05-26 02:16:33] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:16:33] [INFO ] [Nat]Absence check using 55 positive place invariants in 8 ms returned sat
[2024-05-26 02:16:33] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 02:16:33] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-26 02:16:33] [INFO ] After 35ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-26 02:16:33] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-26 02:16:33] [INFO ] After 312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 529/529 transitions.
Applied a total of 0 rules in 9 ms. Remains 359 /359 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 359/359 places, 529/529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 529/529 transitions.
Applied a total of 0 rules in 8 ms. Remains 359 /359 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2024-05-26 02:16:33] [INFO ] Invariant cache hit.
[2024-05-26 02:16:34] [INFO ] Implicit Places using invariants in 329 ms returned [10, 40, 81, 111, 160, 232, 270, 338]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 332 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 351/359 places, 529/529 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 331 transition count 509
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 56 place count 331 transition count 493
Applied a total of 56 rules in 13 ms. Remains 331 /351 variables (removed 20) and now considering 493/529 (removed 36) transitions.
// Phase 1: matrix 493 rows 331 cols
[2024-05-26 02:16:34] [INFO ] Computed 47 invariants in 4 ms
[2024-05-26 02:16:34] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-26 02:16:34] [INFO ] Invariant cache hit.
[2024-05-26 02:16:34] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-26 02:16:34] [INFO ] Implicit Places using invariants and state equation in 420 ms returned [5, 9, 26, 27, 30, 31, 35, 36, 69, 72, 73, 90, 91, 96, 97, 100, 125, 126, 127, 128, 131, 132, 133, 137, 138, 139, 143, 144, 145, 199, 200, 201, 204, 205, 206, 207, 210, 211, 212, 243, 247, 262, 263, 264, 267, 271, 272, 307, 308, 311, 312]
Discarding 51 places :
Implicit Place search using SMT with State Equation took 700 ms to find 51 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 280/359 places, 493/529 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 280 transition count 489
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 276 transition count 489
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 90 place count 235 transition count 448
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 92 place count 233 transition count 444
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 233 transition count 444
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 233 transition count 443
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 96 place count 232 transition count 441
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 232 transition count 441
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 98 place count 232 transition count 440
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 116 place count 223 transition count 442
Free-agglomeration rule (complex) applied 45 times.
Iterating global reduction 4 with 45 rules applied. Total rules applied 161 place count 223 transition count 413
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 218 place count 178 transition count 401
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 220 place count 178 transition count 401
Applied a total of 220 rules in 51 ms. Remains 178 /280 variables (removed 102) and now considering 401/493 (removed 92) transitions.
[2024-05-26 02:16:34] [INFO ] Flow matrix only has 396 transitions (discarded 5 similar events)
// Phase 1: matrix 396 rows 178 cols
[2024-05-26 02:16:34] [INFO ] Computed 34 invariants in 1 ms
[2024-05-26 02:16:35] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-26 02:16:35] [INFO ] Flow matrix only has 396 transitions (discarded 5 similar events)
[2024-05-26 02:16:35] [INFO ] Invariant cache hit.
[2024-05-26 02:16:35] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-05-26 02:16:35] [INFO ] Implicit Places using invariants and state equation in 353 ms returned [38, 72, 107, 123]
Discarding 4 places :
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Implicit Place search using SMT with State Equation took 456 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 174/359 places, 391/529 transitions.
Applied a total of 0 rules in 7 ms. Remains 174 /174 variables (removed 0) and now considering 391/391 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 1568 ms. Remains : 174/359 places, 391/529 transitions.
Incomplete random walk after 10000 steps, including 153 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1213032 steps, run timeout after 3001 ms. (steps per millisecond=404 ) properties seen :{}
Probabilistic random walk after 1213032 steps, saw 182688 distinct states, run finished after 3001 ms. (steps per millisecond=404 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-26 02:16:38] [INFO ] Flow matrix only has 386 transitions (discarded 5 similar events)
// Phase 1: matrix 386 rows 174 cols
[2024-05-26 02:16:38] [INFO ] Computed 30 invariants in 4 ms
[2024-05-26 02:16:38] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2024-05-26 02:16:38] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:16:38] [INFO ] [Nat]Absence check using 30 positive place invariants in 4 ms returned sat
[2024-05-26 02:16:38] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 02:16:38] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-26 02:16:38] [INFO ] After 36ms SMT Verify possible using 80 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-26 02:16:38] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-26 02:16:38] [INFO ] After 195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 391/391 transitions.
Applied a total of 0 rules in 12 ms. Remains 174 /174 variables (removed 0) and now considering 391/391 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 174/174 places, 391/391 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 391/391 transitions.
Applied a total of 0 rules in 7 ms. Remains 174 /174 variables (removed 0) and now considering 391/391 (removed 0) transitions.
[2024-05-26 02:16:38] [INFO ] Flow matrix only has 386 transitions (discarded 5 similar events)
[2024-05-26 02:16:38] [INFO ] Invariant cache hit.
[2024-05-26 02:16:38] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-26 02:16:38] [INFO ] Flow matrix only has 386 transitions (discarded 5 similar events)
[2024-05-26 02:16:38] [INFO ] Invariant cache hit.
[2024-05-26 02:16:39] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-26 02:16:39] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2024-05-26 02:16:39] [INFO ] Redundant transitions in 147 ms returned []
[2024-05-26 02:16:39] [INFO ] Flow matrix only has 386 transitions (discarded 5 similar events)
[2024-05-26 02:16:39] [INFO ] Invariant cache hit.
[2024-05-26 02:16:39] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 674 ms. Remains : 174/174 places, 391/391 transitions.
Graph (trivial) has 67 edges and 174 vertex of which 46 / 174 are part of one of the 23 SCC in 1 ms
Free SCC test removed 23 places
Drop transitions removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Graph (complete) has 468 edges and 151 vertex of which 41 are kept as prefixes of interest. Removing 110 places using SCC suffix rule.1 ms
Discarding 110 places :
Also discarding 149 output transitions
Drop transitions removed 149 transitions
Drop transitions removed 80 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 105 transitions.
Iterating post reduction 0 with 105 rules applied. Total rules applied 107 place count 41 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 109 place count 40 transition count 79
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 40 transition count 78
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 112 place count 40 transition count 78
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 39 transition count 77
Applied a total of 113 rules in 11 ms. Remains 39 /174 variables (removed 135) and now considering 77/391 (removed 314) transitions.
Running SMT prover for 1 properties.
[2024-05-26 02:16:39] [INFO ] Flow matrix only has 75 transitions (discarded 2 similar events)
// Phase 1: matrix 75 rows 39 cols
[2024-05-26 02:16:39] [INFO ] Computed 5 invariants in 1 ms
[2024-05-26 02:16:39] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-26 02:16:39] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:16:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-26 02:16:39] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 02:16:39] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-26 02:16:39] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-26 02:16:39] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-05-26 02:16:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 174 places, 391 transitions and 1923 arcs took 3 ms.
[2024-05-26 02:16:39] [INFO ] Flatten gal took : 69 ms
Total runtime 17413 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/371
ReachabilityCardinality

FORMULA NoC3x3-PT-2B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716689800916

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/ReachabilityCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
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: LAUNCH task # 7 (type EXCL) for 0 NoC3x3-PT-2B-ReachabilityCardinality-2024-15
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 NoC3x3-PT-2B-ReachabilityCardinality-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 NoC3x3-PT-2B-ReachabilityCardinality-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 6 (type SRCH) for 0 NoC3x3-PT-2B-ReachabilityCardinality-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 3 (type FNDP) for NoC3x3-PT-2B-ReachabilityCardinality-2024-15
lola: result : true
lola: fired transitions : 37
lola: tried executions : 6
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 4 (type EQUN) for NoC3x3-PT-2B-ReachabilityCardinality-2024-15 (obsolete)
lola: CANCELED task # 6 (type SRCH) for NoC3x3-PT-2B-ReachabilityCardinality-2024-15 (obsolete)
lola: CANCELED task # 7 (type EXCL) for NoC3x3-PT-2B-ReachabilityCardinality-2024-15 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
NoC3x3-PT-2B-ReachabilityCardinality-2024-15: EF true findpath


Time elapsed: 0 secs. Pages in use: 2
sara: try reading problem file /home/mcc/execution/371/ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic

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="gold2023"
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-5568"
echo " Executing tool gold2023"
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-tall-171654372600364"
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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;