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

About the Execution of 2023-gold for LeafsetExtension-PT-S32C4

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
763.308 40168.00 59704.00 961.90 FFTFFFTFTTFTTFTT 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.r241-tall-171649628400240.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 LeafsetExtension-PT-S32C4, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r241-tall-171649628400240
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 17K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 13:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 13:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 13:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 13:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.4M May 18 16:42 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 LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-00
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-01
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-02
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-03
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-04
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-05
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-06
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-07
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-08
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-09
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-10
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-11
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-12
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-13
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-14
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716563827148

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=LeafsetExtension-PT-S32C4
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-24 15:17:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 15:17:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 15:17:08] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2024-05-24 15:17:08] [INFO ] Transformed 5622 places.
[2024-05-24 15:17:09] [INFO ] Transformed 5449 transitions.
[2024-05-24 15:17:09] [INFO ] Parsed PT model containing 5622 places and 5449 transitions and 17500 arcs in 466 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 298 resets, run finished after 517 ms. (steps per millisecond=19 ) properties (out of 16) seen :5
FORMULA LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 5449 rows 5622 cols
[2024-05-24 15:17:10] [INFO ] Computed 173 invariants in 466 ms
[2024-05-24 15:17:12] [INFO ] [Real]Absence check using 35 positive place invariants in 20 ms returned sat
[2024-05-24 15:17:13] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 215 ms returned sat
[2024-05-24 15:17:13] [INFO ] After 2186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-24 15:17:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2024-05-24 15:17:15] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 184 ms returned sat
[2024-05-24 15:17:22] [INFO ] After 6368ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2024-05-24 15:17:26] [INFO ] After 10086ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :9
Attempting to minimize the solution found.
Minimization took 2827 ms.
[2024-05-24 15:17:28] [INFO ] After 15597ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :9
FORMULA LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 9 different solutions.
FORMULA LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
TestFail conflict detected : techniques TOPOLOGICAL PARIKH_WALK answered differently (true)on formula LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-03
FORMULA LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
TestFail conflict detected : techniques TOPOLOGICAL PARIKH_WALK answered differently (true)on formula LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-10
Parikh walk visited 5 properties in 30 ms.
Support contains 102 out of 5622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5622/5622 places, 5449/5449 transitions.
Graph (complete) has 11001 edges and 5622 vertex of which 2971 are kept as prefixes of interest. Removing 2651 places using SCC suffix rule.11 ms
Discarding 2651 places :
Also discarding 1213 output transitions
Drop transitions removed 1213 transitions
Drop transitions removed 324 transitions
Reduce isomorphic transitions removed 324 transitions.
Drop transitions removed 860 transitions
Trivial Post-agglo rules discarded 860 transitions
Performed 860 trivial Post agglomeration. Transition count delta: 860
Iterating post reduction 0 with 1184 rules applied. Total rules applied 1185 place count 2971 transition count 3052
Reduce places removed 861 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 864 rules applied. Total rules applied 2049 place count 2110 transition count 3049
Reduce places removed 3 places and 0 transitions.
Performed 343 Post agglomeration using F-continuation condition.Transition count delta: 343
Iterating post reduction 2 with 346 rules applied. Total rules applied 2395 place count 2107 transition count 2706
Reduce places removed 343 places and 0 transitions.
Iterating post reduction 3 with 343 rules applied. Total rules applied 2738 place count 1764 transition count 2706
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 38 Pre rules applied. Total rules applied 2738 place count 1764 transition count 2668
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 2814 place count 1726 transition count 2668
Discarding 670 places :
Symmetric choice reduction at 4 with 670 rule applications. Total rules 3484 place count 1056 transition count 1998
Iterating global reduction 4 with 670 rules applied. Total rules applied 4154 place count 1056 transition count 1998
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 4169 place count 1041 transition count 1983
Iterating global reduction 4 with 15 rules applied. Total rules applied 4184 place count 1041 transition count 1983
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 4185 place count 1040 transition count 1983
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4187 place count 1039 transition count 1982
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 4198 place count 1039 transition count 1971
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 4209 place count 1028 transition count 1971
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 6 with 78 rules applied. Total rules applied 4287 place count 1028 transition count 1971
Applied a total of 4287 rules in 892 ms. Remains 1028 /5622 variables (removed 4594) and now considering 1971/5449 (removed 3478) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 893 ms. Remains : 1028/5622 places, 1971/5449 transitions.
Incomplete random walk after 10000 steps, including 544 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 4) seen :2
FORMULA LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-24 15:17:30] [INFO ] Flow matrix only has 1664 transitions (discarded 307 similar events)
// Phase 1: matrix 1664 rows 1028 cols
[2024-05-24 15:17:30] [INFO ] Computed 63 invariants in 18 ms
[2024-05-24 15:17:30] [INFO ] [Real]Absence check using 0 positive and 63 generalized place invariants in 15 ms returned sat
[2024-05-24 15:17:30] [INFO ] After 624ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-24 15:17:31] [INFO ] After 984ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 283 ms.
[2024-05-24 15:17:31] [INFO ] After 1458ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 77 out of 1028 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1028/1028 places, 1971/1971 transitions.
Graph (complete) has 4550 edges and 1028 vertex of which 979 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.2 ms
Discarding 49 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Drop transitions removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 979 transition count 1922
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 43 place count 976 transition count 1921
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 975 transition count 1921
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 44 place count 975 transition count 1919
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 48 place count 973 transition count 1919
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 62 place count 959 transition count 1905
Iterating global reduction 3 with 14 rules applied. Total rules applied 76 place count 959 transition count 1905
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 959 transition count 1904
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 958 transition count 1904
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 92 place count 958 transition count 1904
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 94 place count 956 transition count 1902
Iterating global reduction 4 with 2 rules applied. Total rules applied 96 place count 956 transition count 1902
Applied a total of 96 rules in 229 ms. Remains 956 /1028 variables (removed 72) and now considering 1902/1971 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 956/1028 places, 1902/1971 transitions.
Incomplete random walk after 10000 steps, including 574 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 128489 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 128489 steps, saw 39807 distinct states, run finished after 3002 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 15:17:34] [INFO ] Flow matrix only has 1549 transitions (discarded 353 similar events)
// Phase 1: matrix 1549 rows 956 cols
[2024-05-24 15:17:34] [INFO ] Computed 60 invariants in 22 ms
[2024-05-24 15:17:35] [INFO ] [Real]Absence check using 0 positive and 60 generalized place invariants in 14 ms returned sat
[2024-05-24 15:17:35] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 15:17:35] [INFO ] [Nat]Absence check using 0 positive and 60 generalized place invariants in 13 ms returned sat
[2024-05-24 15:17:35] [INFO ] After 575ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 15:17:36] [INFO ] After 846ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 205 ms.
[2024-05-24 15:17:36] [INFO ] After 1206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 77 out of 956 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 956/956 places, 1902/1902 transitions.
Applied a total of 0 rules in 42 ms. Remains 956 /956 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 956/956 places, 1902/1902 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 956/956 places, 1902/1902 transitions.
Applied a total of 0 rules in 42 ms. Remains 956 /956 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
[2024-05-24 15:17:36] [INFO ] Flow matrix only has 1549 transitions (discarded 353 similar events)
[2024-05-24 15:17:36] [INFO ] Invariant cache hit.
[2024-05-24 15:17:37] [INFO ] Implicit Places using invariants in 573 ms returned [27, 30, 51, 69, 73, 111, 114, 132, 135, 153, 156, 175, 178, 219, 242, 260, 263, 302, 325, 349, 369, 372, 391, 394, 414, 416, 438, 509, 550, 575, 597, 644, 726, 748, 769, 809, 830, 854]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 582 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 918/956 places, 1902/1902 transitions.
Discarding 337 places :
Symmetric choice reduction at 0 with 337 rule applications. Total rules 337 place count 581 transition count 1565
Iterating global reduction 0 with 337 rules applied. Total rules applied 674 place count 581 transition count 1565
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 699 place count 556 transition count 1540
Iterating global reduction 0 with 25 rules applied. Total rules applied 724 place count 556 transition count 1540
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 873 place count 407 transition count 1391
Iterating global reduction 0 with 149 rules applied. Total rules applied 1022 place count 407 transition count 1391
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 1040 place count 398 transition count 1382
Applied a total of 1040 rules in 74 ms. Remains 398 /918 variables (removed 520) and now considering 1382/1902 (removed 520) transitions.
[2024-05-24 15:17:37] [INFO ] Flow matrix only has 642 transitions (discarded 740 similar events)
// Phase 1: matrix 642 rows 398 cols
[2024-05-24 15:17:37] [INFO ] Computed 22 invariants in 5 ms
[2024-05-24 15:17:37] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-24 15:17:37] [INFO ] Flow matrix only has 642 transitions (discarded 740 similar events)
[2024-05-24 15:17:37] [INFO ] Invariant cache hit.
[2024-05-24 15:17:38] [INFO ] Implicit Places using invariants and state equation in 703 ms returned [181, 199, 234, 239, 253, 273, 275, 305, 311, 314, 334, 336, 339, 370, 388]
Discarding 15 places :
Implicit Place search using SMT with State Equation took 891 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 383/956 places, 1382/1902 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 383 transition count 1379
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 380 transition count 1379
Discarding 97 places :
Symmetric choice reduction at 0 with 97 rule applications. Total rules 103 place count 283 transition count 1282
Iterating global reduction 0 with 97 rules applied. Total rules applied 200 place count 283 transition count 1282
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 214 place count 276 transition count 1275
Applied a total of 214 rules in 27 ms. Remains 276 /383 variables (removed 107) and now considering 1275/1382 (removed 107) transitions.
[2024-05-24 15:17:38] [INFO ] Flow matrix only has 521 transitions (discarded 754 similar events)
// Phase 1: matrix 521 rows 276 cols
[2024-05-24 15:17:38] [INFO ] Computed 22 invariants in 6 ms
[2024-05-24 15:17:38] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-24 15:17:38] [INFO ] Flow matrix only has 521 transitions (discarded 754 similar events)
[2024-05-24 15:17:38] [INFO ] Invariant cache hit.
[2024-05-24 15:17:38] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 276/956 places, 1275/1902 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2176 ms. Remains : 276/956 places, 1275/1902 transitions.
Incomplete random walk after 10000 steps, including 552 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 182773 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 182773 steps, saw 47555 distinct states, run finished after 3002 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 15:17:41] [INFO ] Flow matrix only has 521 transitions (discarded 754 similar events)
[2024-05-24 15:17:41] [INFO ] Invariant cache hit.
[2024-05-24 15:17:41] [INFO ] [Real]Absence check using 0 positive and 22 generalized place invariants in 4 ms returned sat
[2024-05-24 15:17:41] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 15:17:41] [INFO ] [Nat]Absence check using 0 positive and 22 generalized place invariants in 4 ms returned sat
[2024-05-24 15:17:42] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 15:17:42] [INFO ] After 321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 107 ms.
[2024-05-24 15:17:42] [INFO ] After 516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 77 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 1275/1275 transitions.
Applied a total of 0 rules in 11 ms. Remains 276 /276 variables (removed 0) and now considering 1275/1275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 276/276 places, 1275/1275 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 1275/1275 transitions.
Applied a total of 0 rules in 23 ms. Remains 276 /276 variables (removed 0) and now considering 1275/1275 (removed 0) transitions.
[2024-05-24 15:17:42] [INFO ] Flow matrix only has 521 transitions (discarded 754 similar events)
[2024-05-24 15:17:42] [INFO ] Invariant cache hit.
[2024-05-24 15:17:42] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-24 15:17:42] [INFO ] Flow matrix only has 521 transitions (discarded 754 similar events)
[2024-05-24 15:17:42] [INFO ] Invariant cache hit.
[2024-05-24 15:17:42] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
[2024-05-24 15:17:43] [INFO ] Redundant transitions in 86 ms returned []
[2024-05-24 15:17:43] [INFO ] Flow matrix only has 521 transitions (discarded 754 similar events)
[2024-05-24 15:17:43] [INFO ] Invariant cache hit.
[2024-05-24 15:17:43] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1067 ms. Remains : 276/276 places, 1275/1275 transitions.
Drop transitions removed 228 transitions
Ensure Unique test removed 536 transitions
Reduce isomorphic transitions removed 764 transitions.
Iterating post reduction 0 with 764 rules applied. Total rules applied 764 place count 276 transition count 511
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 764 place count 276 transition count 505
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 776 place count 270 transition count 505
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 777 place count 269 transition count 497
Iterating global reduction 1 with 1 rules applied. Total rules applied 778 place count 269 transition count 497
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 779 place count 268 transition count 496
Iterating global reduction 1 with 1 rules applied. Total rules applied 780 place count 268 transition count 496
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 816 place count 250 transition count 478
Free-agglomeration rule applied 73 times.
Iterating global reduction 1 with 73 rules applied. Total rules applied 889 place count 250 transition count 405
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 969 place count 177 transition count 398
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 971 place count 177 transition count 396
Applied a total of 971 rules in 33 ms. Remains 177 /276 variables (removed 99) and now considering 396/1275 (removed 879) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 396 rows 177 cols
[2024-05-24 15:17:43] [INFO ] Computed 22 invariants in 2 ms
[2024-05-24 15:17:43] [INFO ] [Real]Absence check using 0 positive and 22 generalized place invariants in 3 ms returned sat
[2024-05-24 15:17:43] [INFO ] After 184ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-24 15:17:43] [INFO ] After 312ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 120 ms.
[2024-05-24 15:17:44] [INFO ] After 485ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
[2024-05-24 15:17:44] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-05-24 15:17:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 276 places, 1275 transitions and 4712 arcs took 6 ms.
[2024-05-24 15:17:44] [INFO ] Flatten gal took : 95 ms
Total runtime 35718 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT LeafsetExtension-PT-S32C4
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
ReachabilityFireability

FORMULA LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716563867316

--------------------
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/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/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: 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 # 10 (type EXCL) for 3 LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-14
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 6 (type FNDP) for 3 LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 7 (type EQUN) for 3 LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 9 (type SRCH) for 3 LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 10 (type EXCL) for LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-14
lola: result : true
lola: markings : 75
lola: fired transitions : 74
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 6 (type FNDP) for LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-14 (obsolete)
lola: CANCELED task # 7 (type EQUN) for LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-14 (obsolete)
lola: CANCELED task # 9 (type SRCH) for LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-14 (obsolete)
lola: FINISHED task # 9 (type SRCH) for LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-14
lola: result : true
lola: markings : 7
lola: fired transitions : 6
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 6 (type FNDP) for LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-14
lola: result : true
lola: fired transitions : 5
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/372/ReachabilityFireability-7.sara.
sara: place or transition ordering is non-deterministic

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 0 LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-05
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 13 (type FNDP) for 0 LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 14 (type EQUN) for 0 LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 16 (type SRCH) for 0 LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-05
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: FINISHED task # 7 (type EQUN) for LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-14
lola: result : true
lola: FINISHED task # 13 (type FNDP) for LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-05
lola: result : true
lola: fired transitions : 49510
lola: tried executions : 8269
lola: time used : 1.000000
lola: memory pages used : 0
lola: CANCELED task # 14 (type EQUN) for LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-05 (obsolete)
lola: CANCELED task # 16 (type SRCH) for LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-05 (obsolete)
lola: CANCELED task # 17 (type EXCL) for LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-05 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-05: AG false findpath
LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-14: EF true tandem / relaxed


Time elapsed: 1 secs. Pages in use: 2

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="LeafsetExtension-PT-S32C4"
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 LeafsetExtension-PT-S32C4, 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 r241-tall-171649628400240"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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