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-171654372700395.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-5B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372700395
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 988K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.6K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:28 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 525K 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-5B-ReachabilityFireability-2024-00
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-2024-01
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-2024-02
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-2024-03
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-2024-04
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-2024-05
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-2024-06
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-2024-07
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-2024-08
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-2024-09
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-2024-10
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-2024-11
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-2024-12
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-2023-13
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-2024-14
FORMULA_NAME NoC3x3-PT-5B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716692110532

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-5B
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-26 02:55:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-26 02:55:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 02:55:15] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2024-05-26 02:55:15] [INFO ] Transformed 1571 places.
[2024-05-26 02:55:15] [INFO ] Transformed 2173 transitions.
[2024-05-26 02:55:15] [INFO ] Found NUPN structural information;
[2024-05-26 02:55:15] [INFO ] Parsed PT model containing 1571 places and 2173 transitions and 6109 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 16 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 16) seen :9
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :1
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2173 rows 1571 cols
[2024-05-26 02:55:18] [INFO ] Computed 66 invariants in 38 ms
[2024-05-26 02:55:19] [INFO ] After 634ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-26 02:55:19] [INFO ] [Nat]Absence check using 66 positive place invariants in 39 ms returned sat
[2024-05-26 02:55:44] [INFO ] After 24384ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-26 02:55:44] [INFO ] After 24396ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-26 02:55:44] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 46 ms.
Support contains 254 out of 1571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1571/1571 places, 2173/2173 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 1571 transition count 1976
Reduce places removed 197 places and 0 transitions.
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Iterating post reduction 1 with 250 rules applied. Total rules applied 447 place count 1374 transition count 1923
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 2 with 53 rules applied. Total rules applied 500 place count 1321 transition count 1923
Discarding 264 places :
Symmetric choice reduction at 3 with 264 rule applications. Total rules 764 place count 1057 transition count 1659
Iterating global reduction 3 with 264 rules applied. Total rules applied 1028 place count 1057 transition count 1659
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 1028 place count 1057 transition count 1644
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 1058 place count 1042 transition count 1644
Discarding 71 places :
Symmetric choice reduction at 3 with 71 rule applications. Total rules 1129 place count 971 transition count 1555
Iterating global reduction 3 with 71 rules applied. Total rules applied 1200 place count 971 transition count 1555
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1220 place count 951 transition count 1515
Iterating global reduction 3 with 20 rules applied. Total rules applied 1240 place count 951 transition count 1515
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1244 place count 947 transition count 1507
Iterating global reduction 3 with 4 rules applied. Total rules applied 1248 place count 947 transition count 1507
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1249 place count 946 transition count 1505
Iterating global reduction 3 with 1 rules applied. Total rules applied 1250 place count 946 transition count 1505
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 3 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 1464 place count 839 transition count 1398
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1465 place count 838 transition count 1395
Iterating global reduction 3 with 1 rules applied. Total rules applied 1466 place count 838 transition count 1395
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 98 places in 4 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 1662 place count 740 transition count 1421
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1672 place count 740 transition count 1411
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 4 with 30 rules applied. Total rules applied 1702 place count 740 transition count 1381
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1705 place count 737 transition count 1381
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1705 place count 737 transition count 1380
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1707 place count 736 transition count 1380
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1711 place count 734 transition count 1381
Free-agglomeration rule applied 46 times with reduction of 1 identical transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 1757 place count 734 transition count 1334
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 47 rules applied. Total rules applied 1804 place count 688 transition count 1333
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 1813 place count 688 transition count 1324
Partial Free-agglomeration rule applied 31 times.
Drop transitions removed 31 transitions
Iterating global reduction 6 with 31 rules applied. Total rules applied 1844 place count 688 transition count 1324
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1845 place count 687 transition count 1323
Applied a total of 1845 rules in 667 ms. Remains 687 /1571 variables (removed 884) and now considering 1323/2173 (removed 850) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 668 ms. Remains : 687/1571 places, 1323/2173 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 224926 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 224926 steps, saw 76282 distinct states, run finished after 3003 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-26 02:55:48] [INFO ] Flow matrix only has 1313 transitions (discarded 10 similar events)
// Phase 1: matrix 1313 rows 687 cols
[2024-05-26 02:55:48] [INFO ] Computed 63 invariants in 14 ms
[2024-05-26 02:55:48] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-26 02:55:48] [INFO ] [Nat]Absence check using 63 positive place invariants in 18 ms returned sat
[2024-05-26 02:55:52] [INFO ] After 3339ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-26 02:55:52] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-26 02:55:54] [INFO ] After 2595ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-26 02:55:57] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 4 ms to minimize.
[2024-05-26 02:55:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
[2024-05-26 02:55:57] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 1 ms to minimize.
[2024-05-26 02:55:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 137 ms
[2024-05-26 02:55:58] [INFO ] After 6054ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 2784 ms.
[2024-05-26 02:56:01] [INFO ] After 12417ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2023-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 129 ms.
Support contains 252 out of 687 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 687/687 places, 1323/1323 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 687 transition count 1322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 686 transition count 1322
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 686 transition count 1321
Applied a total of 3 rules in 49 ms. Remains 686 /687 variables (removed 1) and now considering 1321/1323 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 686/687 places, 1321/1323 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 5) seen :1
FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 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 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-26 02:56:01] [INFO ] Flow matrix only has 1311 transitions (discarded 10 similar events)
// Phase 1: matrix 1311 rows 686 cols
[2024-05-26 02:56:01] [INFO ] Computed 63 invariants in 8 ms
[2024-05-26 02:56:01] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-26 02:56:02] [INFO ] [Nat]Absence check using 63 positive place invariants in 18 ms returned sat
[2024-05-26 02:56:03] [INFO ] After 1196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-26 02:56:03] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-26 02:56:04] [INFO ] After 1633ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-26 02:56:06] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 2 ms to minimize.
[2024-05-26 02:56:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 297 ms
[2024-05-26 02:56:06] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 1 ms to minimize.
[2024-05-26 02:56:06] [INFO ] Deduced a trap composed of 20 places in 170 ms of which 1 ms to minimize.
[2024-05-26 02:56:07] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 1 ms to minimize.
[2024-05-26 02:56:07] [INFO ] Deduced a trap composed of 45 places in 167 ms of which 2 ms to minimize.
[2024-05-26 02:56:07] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 0 ms to minimize.
[2024-05-26 02:56:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1306 ms
[2024-05-26 02:56:07] [INFO ] After 4567ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 941 ms.
[2024-05-26 02:56:08] [INFO ] After 6893ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 41 ms.
Support contains 163 out of 686 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 686/686 places, 1321/1321 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 686 transition count 1310
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 675 transition count 1309
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 674 transition count 1309
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 24 place count 674 transition count 1307
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 28 place count 672 transition count 1307
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 39 place count 661 transition count 1294
Iterating global reduction 3 with 11 rules applied. Total rules applied 50 place count 661 transition count 1294
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 50 place count 661 transition count 1293
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 660 transition count 1293
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 53 place count 659 transition count 1292
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 659 transition count 1292
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 8 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 116 place count 628 transition count 1261
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 125 place count 619 transition count 1243
Iterating global reduction 3 with 9 rules applied. Total rules applied 134 place count 619 transition count 1243
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 162 place count 605 transition count 1245
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 178 place count 605 transition count 1229
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 181 place count 602 transition count 1229
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 183 place count 600 transition count 1221
Iterating global reduction 4 with 2 rules applied. Total rules applied 185 place count 600 transition count 1221
Free-agglomeration rule applied 22 times.
Iterating global reduction 4 with 22 rules applied. Total rules applied 207 place count 600 transition count 1199
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 33 rules applied. Total rules applied 240 place count 578 transition count 1188
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 246 place count 578 transition count 1182
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 251 place count 578 transition count 1182
Applied a total of 251 rules in 186 ms. Remains 578 /686 variables (removed 108) and now considering 1182/1321 (removed 139) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 578/686 places, 1182/1321 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 184135 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 184135 steps, saw 167789 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-26 02:56:12] [INFO ] Flow matrix only has 1169 transitions (discarded 13 similar events)
// Phase 1: matrix 1169 rows 578 cols
[2024-05-26 02:56:12] [INFO ] Computed 60 invariants in 5 ms
[2024-05-26 02:56:12] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-26 02:56:12] [INFO ] [Nat]Absence check using 60 positive place invariants in 14 ms returned sat
[2024-05-26 02:56:14] [INFO ] After 1950ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-26 02:56:14] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-26 02:56:16] [INFO ] After 1489ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-26 02:56:16] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 0 ms to minimize.
[2024-05-26 02:56:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2024-05-26 02:56:17] [INFO ] After 2885ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 922 ms.
[2024-05-26 02:56:18] [INFO ] After 5905ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 42 ms.
Support contains 163 out of 578 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 578/578 places, 1182/1182 transitions.
Applied a total of 0 rules in 14 ms. Remains 578 /578 variables (removed 0) and now considering 1182/1182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 578/578 places, 1182/1182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 578/578 places, 1182/1182 transitions.
Applied a total of 0 rules in 13 ms. Remains 578 /578 variables (removed 0) and now considering 1182/1182 (removed 0) transitions.
[2024-05-26 02:56:18] [INFO ] Flow matrix only has 1169 transitions (discarded 13 similar events)
[2024-05-26 02:56:18] [INFO ] Invariant cache hit.
[2024-05-26 02:56:18] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-26 02:56:18] [INFO ] Flow matrix only has 1169 transitions (discarded 13 similar events)
[2024-05-26 02:56:18] [INFO ] Invariant cache hit.
[2024-05-26 02:56:19] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-26 02:56:19] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 806 ms to find 0 implicit places.
[2024-05-26 02:56:19] [INFO ] Redundant transitions in 76 ms returned []
[2024-05-26 02:56:19] [INFO ] Flow matrix only has 1169 transitions (discarded 13 similar events)
[2024-05-26 02:56:19] [INFO ] Invariant cache hit.
[2024-05-26 02:56:19] [INFO ] Dead Transitions using invariants and state equation in 419 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1322 ms. Remains : 578/578 places, 1182/1182 transitions.
Graph (complete) has 2240 edges and 578 vertex of which 577 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 577 transition count 1169
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 30 place count 577 transition count 1153
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 41 place count 577 transition count 1153
Applied a total of 41 rules in 123 ms. Remains 577 /578 variables (removed 1) and now considering 1153/1182 (removed 29) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1153 rows 577 cols
[2024-05-26 02:56:19] [INFO ] Computed 59 invariants in 4 ms
[2024-05-26 02:56:20] [INFO ] After 295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-26 02:56:20] [INFO ] [Nat]Absence check using 59 positive place invariants in 14 ms returned sat
[2024-05-26 02:56:21] [INFO ] After 1476ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-26 02:56:22] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-26 02:56:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2024-05-26 02:56:22] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
[2024-05-26 02:56:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2024-05-26 02:56:23] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 1 ms to minimize.
[2024-05-26 02:56:23] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-26 02:56:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 351 ms
[2024-05-26 02:56:23] [INFO ] After 3501ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 889 ms.
[2024-05-26 02:56:24] [INFO ] After 4546ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2024-05-26 02:56:24] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2024-05-26 02:56:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 578 places, 1182 transitions and 4280 arcs took 6 ms.
[2024-05-26 02:56:25] [INFO ] Flatten gal took : 218 ms
Total runtime 69742 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT NoC3x3-PT-5B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/370
ReachabilityFireability

FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-5B-ReachabilityFireability-2024-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

BK_STOP 1716692193410

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/370/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/370/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/370/ReachabilityFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 17 (type EXCL) for 6 NoC3x3-PT-5B-ReachabilityFireability-2024-14
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 13 (type FNDP) for 6 NoC3x3-PT-5B-ReachabilityFireability-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 14 (type EQUN) for 6 NoC3x3-PT-5B-ReachabilityFireability-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 16 (type SRCH) for 6 NoC3x3-PT-5B-ReachabilityFireability-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: 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: FINISHED task # 13 (type FNDP) for NoC3x3-PT-5B-ReachabilityFireability-2024-14
lola: result : true
lola: fired transitions : 62
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 14 (type EQUN) for NoC3x3-PT-5B-ReachabilityFireability-2024-14 (obsolete)
lola: CANCELED task # 16 (type SRCH) for NoC3x3-PT-5B-ReachabilityFireability-2024-14 (obsolete)
lola: CANCELED task # 17 (type EXCL) for NoC3x3-PT-5B-ReachabilityFireability-2024-14 (obsolete)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 28 (type EXCL) for 9 NoC3x3-PT-5B-ReachabilityFireability-2024-15
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 24 (type FNDP) for 9 NoC3x3-PT-5B-ReachabilityFireability-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 25 (type EQUN) for 9 NoC3x3-PT-5B-ReachabilityFireability-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 27 (type SRCH) for 9 NoC3x3-PT-5B-ReachabilityFireability-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/370/ReachabilityFireability-14.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 24 (type FNDP) for NoC3x3-PT-5B-ReachabilityFireability-2024-15
lola: result : true
lola: fired transitions : 15
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 25 (type EQUN) for NoC3x3-PT-5B-ReachabilityFireability-2024-15 (obsolete)
lola: CANCELED task # 27 (type SRCH) for NoC3x3-PT-5B-ReachabilityFireability-2024-15 (obsolete)
lola: CANCELED task # 28 (type EXCL) for NoC3x3-PT-5B-ReachabilityFireability-2024-15 (obsolete)
lola: LAUNCH task # 31 (type EXCL) for 3 NoC3x3-PT-5B-ReachabilityFireability-2024-12
lola: time limit : 3598 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 20 (type FNDP) for 3 NoC3x3-PT-5B-ReachabilityFireability-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 21 (type EQUN) for 3 NoC3x3-PT-5B-ReachabilityFireability-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 30 (type SRCH) for 3 NoC3x3-PT-5B-ReachabilityFireability-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 20 (type FNDP) for NoC3x3-PT-5B-ReachabilityFireability-2024-12
lola: result : true
lola: fired transitions : 15
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 21 (type EQUN) for NoC3x3-PT-5B-ReachabilityFireability-2024-12 (obsolete)
lola: CANCELED task # 30 (type SRCH) for NoC3x3-PT-5B-ReachabilityFireability-2024-12 (obsolete)
lola: CANCELED task # 31 (type EXCL) for NoC3x3-PT-5B-ReachabilityFireability-2024-12 (obsolete)
lola: LAUNCH task # 37 (type EXCL) for 0 NoC3x3-PT-5B-ReachabilityFireability-2024-04
lola: time limit : 3598 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 33 (type FNDP) for 0 NoC3x3-PT-5B-ReachabilityFireability-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 34 (type EQUN) for 0 NoC3x3-PT-5B-ReachabilityFireability-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 36 (type SRCH) for 0 NoC3x3-PT-5B-ReachabilityFireability-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 36 (type SRCH) for NoC3x3-PT-5B-ReachabilityFireability-2024-04
lola: result : true
lola: markings : 81
lola: fired transitions : 80
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 33 (type FNDP) for NoC3x3-PT-5B-ReachabilityFireability-2024-04 (obsolete)
lola: CANCELED task # 34 (type EQUN) for NoC3x3-PT-5B-ReachabilityFireability-2024-04 (obsolete)
lola: CANCELED task # 37 (type EXCL) for NoC3x3-PT-5B-ReachabilityFireability-2024-04 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
NoC3x3-PT-5B-ReachabilityFireability-2024-04: EF true tandem / insertion
NoC3x3-PT-5B-ReachabilityFireability-2024-12: AG false findpath
NoC3x3-PT-5B-ReachabilityFireability-2024-14: AG false findpath
NoC3x3-PT-5B-ReachabilityFireability-2024-15: AG false findpath


Time elapsed: 2 secs. Pages in use: 3

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-5B"
export BK_EXAMINATION="ReachabilityFireability"
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-5B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-tall-171654372700395"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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