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

About the Execution of 2023-gold for Szymanski-PT-a10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
651.623 11095.00 26979.00 286.80 FFTTFFFTFTTTTTTF 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.r417-tall-171690556600529.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 Szymanski-PT-a10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556600529
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 15:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 11 15:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 11 15:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 15:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 101K 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 Szymanski-PT-a10-ReachabilityCardinality-2024-00
FORMULA_NAME Szymanski-PT-a10-ReachabilityCardinality-2024-01
FORMULA_NAME Szymanski-PT-a10-ReachabilityCardinality-2024-02
FORMULA_NAME Szymanski-PT-a10-ReachabilityCardinality-2024-03
FORMULA_NAME Szymanski-PT-a10-ReachabilityCardinality-2024-04
FORMULA_NAME Szymanski-PT-a10-ReachabilityCardinality-2024-05
FORMULA_NAME Szymanski-PT-a10-ReachabilityCardinality-2024-06
FORMULA_NAME Szymanski-PT-a10-ReachabilityCardinality-2024-07
FORMULA_NAME Szymanski-PT-a10-ReachabilityCardinality-2024-08
FORMULA_NAME Szymanski-PT-a10-ReachabilityCardinality-2024-09
FORMULA_NAME Szymanski-PT-a10-ReachabilityCardinality-2024-10
FORMULA_NAME Szymanski-PT-a10-ReachabilityCardinality-2024-11
FORMULA_NAME Szymanski-PT-a10-ReachabilityCardinality-2024-12
FORMULA_NAME Szymanski-PT-a10-ReachabilityCardinality-2024-13
FORMULA_NAME Szymanski-PT-a10-ReachabilityCardinality-2024-14
FORMULA_NAME Szymanski-PT-a10-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717167321861

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-a10
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-31 14:55:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 14:55:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 14:55:23] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2024-05-31 14:55:23] [INFO ] Transformed 61 places.
[2024-05-31 14:55:23] [INFO ] Transformed 224 transitions.
[2024-05-31 14:55:23] [INFO ] Parsed PT model containing 61 places and 224 transitions and 900 arcs in 109 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 8 transitions.
FORMULA Szymanski-PT-a10-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a10-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 16 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 14) seen :7
FORMULA Szymanski-PT-a10-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a10-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a10-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a10-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a10-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a10-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a10-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :1
FORMULA Szymanski-PT-a10-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-31 14:55:24] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
// Phase 1: matrix 79 rows 49 cols
[2024-05-31 14:55:24] [INFO ] Computed 3 invariants in 11 ms
[2024-05-31 14:55:24] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-31 14:55:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 14:55:24] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 14:55:24] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :2
[2024-05-31 14:55:24] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-31 14:55:24] [INFO ] After 10ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :4 sat :2
[2024-05-31 14:55:24] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 3 ms to minimize.
[2024-05-31 14:55:24] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-31 14:55:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2024-05-31 14:55:24] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-31 14:55:24] [INFO ] After 262ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :2
FORMULA Szymanski-PT-a10-ReachabilityCardinality-2024-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Szymanski-PT-a10-ReachabilityCardinality-2024-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Szymanski-PT-a10-ReachabilityCardinality-2024-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Szymanski-PT-a10-ReachabilityCardinality-2024-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 8 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 216/216 transitions.
Graph (complete) has 251 edges and 49 vertex of which 48 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 44 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 44 transition count 200
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 25 place count 44 transition count 184
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 27 place count 42 transition count 176
Iterating global reduction 0 with 2 rules applied. Total rules applied 29 place count 42 transition count 176
Applied a total of 29 rules in 32 ms. Remains 42 /49 variables (removed 7) and now considering 176/216 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 42/49 places, 176/216 transitions.
Incomplete random walk after 10002 steps, including 14 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :1
FORMULA Szymanski-PT-a10-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 14:55:24] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
// Phase 1: matrix 69 rows 42 cols
[2024-05-31 14:55:24] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 14:55:24] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 14:55:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 14:55:24] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 14:55:24] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-31 14:55:24] [INFO ] After 5ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 14:55:24] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-31 14:55:24] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 42 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 42/42 places, 176/176 transitions.
Graph (complete) has 212 edges and 42 vertex of which 41 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 41 transition count 172
Applied a total of 5 rules in 8 ms. Remains 41 /42 variables (removed 1) and now considering 172/176 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 41/42 places, 172/176 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2337145 steps, run timeout after 3001 ms. (steps per millisecond=778 ) properties seen :{}
Probabilistic random walk after 2337145 steps, saw 861330 distinct states, run finished after 3002 ms. (steps per millisecond=778 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 14:55:27] [INFO ] Flow matrix only has 65 transitions (discarded 107 similar events)
// Phase 1: matrix 65 rows 41 cols
[2024-05-31 14:55:27] [INFO ] Computed 3 invariants in 4 ms
[2024-05-31 14:55:27] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 14:55:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 14:55:27] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 14:55:27] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-31 14:55:27] [INFO ] After 6ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 14:55:27] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-31 14:55:27] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 172/172 transitions.
Applied a total of 0 rules in 7 ms. Remains 41 /41 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 41/41 places, 172/172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 172/172 transitions.
Applied a total of 0 rules in 6 ms. Remains 41 /41 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2024-05-31 14:55:27] [INFO ] Flow matrix only has 65 transitions (discarded 107 similar events)
[2024-05-31 14:55:27] [INFO ] Invariant cache hit.
[2024-05-31 14:55:27] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-31 14:55:27] [INFO ] Flow matrix only has 65 transitions (discarded 107 similar events)
[2024-05-31 14:55:27] [INFO ] Invariant cache hit.
[2024-05-31 14:55:27] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-31 14:55:27] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-05-31 14:55:27] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-31 14:55:27] [INFO ] Flow matrix only has 65 transitions (discarded 107 similar events)
[2024-05-31 14:55:27] [INFO ] Invariant cache hit.
[2024-05-31 14:55:28] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 266 ms. Remains : 41/41 places, 172/172 transitions.
Graph (trivial) has 123 edges and 41 vertex of which 15 / 41 are part of one of the 7 SCC in 2 ms
Free SCC test removed 8 places
Drop transitions removed 60 transitions
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 122 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 33 transition count 44
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 27 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 26 transition count 43
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 15 place count 26 transition count 39
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 23 place count 22 transition count 39
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 27 place count 20 transition count 37
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 20 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 29 place count 19 transition count 36
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 30 place count 19 transition count 36
Applied a total of 30 rules in 10 ms. Remains 19 /41 variables (removed 22) and now considering 36/172 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 36 rows 19 cols
[2024-05-31 14:55:28] [INFO ] Computed 3 invariants in 0 ms
[2024-05-31 14:55:28] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 14:55:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 14:55:28] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 14:55:28] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-31 14:55:28] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-31 14:55:28] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2024-05-31 14:55:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 41 places, 172 transitions and 692 arcs took 2 ms.
[2024-05-31 14:55:28] [INFO ] Flatten gal took : 55 ms
Total runtime 5118 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Szymanski-PT-a10
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/365
ReachabilityCardinality

FORMULA Szymanski-PT-a10-ReachabilityCardinality-2024-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1717167332956

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/365/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/365/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/365/ReachabilityCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k: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 # 8 (type EXCL) for 0 Szymanski-PT-a10-ReachabilityCardinality-2024-15
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 4 (type FNDP) for 0 Szymanski-PT-a10-ReachabilityCardinality-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 5 (type EQUN) for 0 Szymanski-PT-a10-ReachabilityCardinality-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 7 (type SRCH) for 0 Szymanski-PT-a10-ReachabilityCardinality-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/365/ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 4 (type FNDP) for Szymanski-PT-a10-ReachabilityCardinality-2024-15
lola: result : true
lola: fired transitions : 1037457
lola: tried executions : 22654
lola: time used : 3.000000
lola: memory pages used : 0
lola: CANCELED task # 5 (type EQUN) for Szymanski-PT-a10-ReachabilityCardinality-2024-15 (obsolete)
lola: CANCELED task # 7 (type SRCH) for Szymanski-PT-a10-ReachabilityCardinality-2024-15 (obsolete)
lola: CANCELED task # 8 (type EXCL) for Szymanski-PT-a10-ReachabilityCardinality-2024-15 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Szymanski-PT-a10-ReachabilityCardinality-2024-15: AG false findpath


Time elapsed: 3 secs. Pages in use: 6

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="Szymanski-PT-a10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is Szymanski-PT-a10, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r417-tall-171690556600529"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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