fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r265-tall-174931349800075
Last Updated
June 24, 2025

About the Execution of 2024-gold for ZombiesAndSurvivors-PT-Heawood175050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15688.260 8741.00 15378.00 57.10 100 100 50 100 50 50 100 100 100 50 50 100 50 100 100 50 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r265-tall-174931349800075.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is ZombiesAndSurvivors-PT-Heawood175050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-174931349800075
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 12K Jun 6 09:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Jun 6 09:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 6 09:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Jun 6 09:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K Jun 6 12:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Jun 6 12:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Jun 6 12:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 6 12:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 16K Jun 6 09:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Jun 6 09:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Jun 6 09:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Jun 6 09:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Jun 6 12:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Jun 6 12:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 14 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 66K Jun 5 20:08 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood175050-UpperBounds-00
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood175050-UpperBounds-01
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood175050-UpperBounds-02
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood175050-UpperBounds-03
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood175050-UpperBounds-04
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood175050-UpperBounds-05
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood175050-UpperBounds-06
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood175050-UpperBounds-07
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood175050-UpperBounds-08
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood175050-UpperBounds-09
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood175050-UpperBounds-10
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood175050-UpperBounds-11
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood175050-UpperBounds-12
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood175050-UpperBounds-13
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood175050-UpperBounds-14
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood175050-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749319220164

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ZombiesAndSurvivors-PT-Heawood175050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-07 18:00:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 18:00:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 18:00:21] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2025-06-07 18:00:21] [INFO ] Transformed 34 places.
[2025-06-07 18:00:21] [INFO ] Transformed 158 transitions.
[2025-06-07 18:00:21] [INFO ] Parsed PT model containing 34 places and 158 transitions and 350 arcs in 140 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 50, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 50, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 158 rows 34 cols
[2025-06-07 18:00:21] [INFO ] Computed 0 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 50, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 10046 steps (2 resets) in 19 ms. (502 steps per ms)
BEST_FIRST walk for 160015 steps (32 resets) in 103 ms. (1538 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[98, 56, 50, 98, 50, 50, 50, 98, 50, 50, 50, 54, 50, 98, 98, 50] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-07 18:00:21] [INFO ] Invariant cache hit.
[2025-06-07 18:00:21] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2025-06-07 18:00:21] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-06-07 18:00:21] [INFO ] [Real]Added 32 Read/Feed constraints in 10 ms returned sat
[2025-06-07 18:00:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 18:00:21] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-07 18:00:22] [INFO ] [Nat]Added 32 Read/Feed constraints in 6 ms returned sat
[2025-06-07 18:00:22] [INFO ] Computed and/alt/rep : 151/744/151 causal constraints (skipped 0 transitions) in 14 ms.
[2025-06-07 18:00:22] [INFO ] Added : 41 causal constraints over 10 iterations in 125 ms. Result :sat
Minimization took 77 ms.
[2025-06-07 18:00:22] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2025-06-07 18:00:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 18:00:22] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-07 18:00:22] [INFO ] [Nat]Added 32 Read/Feed constraints in 6 ms returned sat
[2025-06-07 18:00:22] [INFO ] Computed and/alt/rep : 151/744/151 causal constraints (skipped 0 transitions) in 15 ms.
[2025-06-07 18:00:22] [INFO ] Added : 33 causal constraints over 7 iterations in 78 ms. Result :sat
Minimization took 46 ms.
[2025-06-07 18:00:22] [INFO ] [Real]Absence check using state equation in 26 ms returned unsat
[2025-06-07 18:00:22] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-07 18:00:22] [INFO ] [Real]Added 32 Read/Feed constraints in 6 ms returned sat
[2025-06-07 18:00:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 18:00:22] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-07 18:00:22] [INFO ] [Nat]Added 32 Read/Feed constraints in 5 ms returned sat
[2025-06-07 18:00:22] [INFO ] Computed and/alt/rep : 151/744/151 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-07 18:00:22] [INFO ] Added : 44 causal constraints over 10 iterations in 104 ms. Result :sat
Minimization took 43 ms.
[2025-06-07 18:00:22] [INFO ] [Real]Absence check using state equation in 20 ms returned unsat
[2025-06-07 18:00:22] [INFO ] [Real]Absence check using state equation in 21 ms returned unsat
[2025-06-07 18:00:22] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-07 18:00:22] [INFO ] [Real]Added 32 Read/Feed constraints in 6 ms returned sat
[2025-06-07 18:00:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 18:00:22] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-07 18:00:23] [INFO ] [Nat]Added 32 Read/Feed constraints in 5 ms returned sat
[2025-06-07 18:00:23] [INFO ] Computed and/alt/rep : 151/744/151 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-07 18:00:23] [INFO ] Added : 49 causal constraints over 11 iterations in 127 ms. Result :sat
Minimization took 80 ms.
[2025-06-07 18:00:23] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-07 18:00:23] [INFO ] [Real]Added 32 Read/Feed constraints in 7 ms returned sat
[2025-06-07 18:00:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 18:00:23] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-07 18:00:23] [INFO ] [Nat]Added 32 Read/Feed constraints in 6 ms returned sat
[2025-06-07 18:00:23] [INFO ] Computed and/alt/rep : 151/744/151 causal constraints (skipped 0 transitions) in 13 ms.
[2025-06-07 18:00:23] [INFO ] Added : 41 causal constraints over 10 iterations in 110 ms. Result :sat
Minimization took 43 ms.
[2025-06-07 18:00:23] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2025-06-07 18:00:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 18:00:23] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-07 18:00:23] [INFO ] [Nat]Added 32 Read/Feed constraints in 6 ms returned sat
[2025-06-07 18:00:23] [INFO ] Computed and/alt/rep : 151/744/151 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-07 18:00:23] [INFO ] Added : 23 causal constraints over 5 iterations in 68 ms. Result :sat
Minimization took 34 ms.
[2025-06-07 18:00:23] [INFO ] [Real]Absence check using state equation in 29 ms returned unsat
[2025-06-07 18:00:23] [INFO ] [Real]Absence check using state equation in 24 ms returned unsat
[2025-06-07 18:00:23] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-07 18:00:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 18:00:23] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-07 18:00:23] [INFO ] [Nat]Added 32 Read/Feed constraints in 6 ms returned sat
[2025-06-07 18:00:23] [INFO ] Computed and/alt/rep : 151/744/151 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-07 18:00:24] [INFO ] Added : 14 causal constraints over 5 iterations in 66 ms. Result :sat
Minimization took 38 ms.
[2025-06-07 18:00:24] [INFO ] [Real]Absence check using state equation in 24 ms returned unsat
[2025-06-07 18:00:24] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-07 18:00:24] [INFO ] [Real]Added 32 Read/Feed constraints in 9 ms returned sat
[2025-06-07 18:00:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 18:00:24] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-07 18:00:24] [INFO ] [Nat]Added 32 Read/Feed constraints in 5 ms returned sat
[2025-06-07 18:00:24] [INFO ] Computed and/alt/rep : 151/744/151 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-07 18:00:24] [INFO ] Added : 26 causal constraints over 6 iterations in 71 ms. Result :sat
Minimization took 45 ms.
[2025-06-07 18:00:24] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-07 18:00:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 18:00:24] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-07 18:00:24] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2025-06-07 18:00:24] [INFO ] Computed and/alt/rep : 151/744/151 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-07 18:00:24] [INFO ] Added : 40 causal constraints over 9 iterations in 99 ms. Result :sat
Minimization took 42 ms.
[2025-06-07 18:00:24] [INFO ] [Real]Absence check using state equation in 23 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[98, 56, 50, 98, 50, 50, 50, 98, 50, 50, 50, 54, 50, 98, 98, 50] Max Struct:[+inf, +inf, 50, +inf, 50, 50, +inf, +inf, +inf, 50, 50, +inf, 50, +inf, +inf, 50]
FORMULA ZombiesAndSurvivors-PT-Heawood175050-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ZombiesAndSurvivors-PT-Heawood175050-UpperBounds-12 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ZombiesAndSurvivors-PT-Heawood175050-UpperBounds-10 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ZombiesAndSurvivors-PT-Heawood175050-UpperBounds-09 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ZombiesAndSurvivors-PT-Heawood175050-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ZombiesAndSurvivors-PT-Heawood175050-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ZombiesAndSurvivors-PT-Heawood175050-UpperBounds-02 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[99, 100, 99, 67, 98, 98, 100, 100, 98] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 9 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 158/158 transitions.
Graph (trivial) has 62 edges and 34 vertex of which 21 / 34 are part of one of the 2 SCC in 3 ms
Free SCC test removed 19 places
Drop transitions (Empty/Sink Transition effects.) removed 68 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 78 transitions.
Applied a total of 1 rules in 24 ms. Remains 15 /34 variables (removed 19) and now considering 80/158 (removed 78) transitions.
Running 75 sub problems to find dead transitions.
// Phase 1: matrix 80 rows 15 cols
[2025-06-07 18:00:25] [INFO ] Computed 0 invariants in 1 ms
[2025-06-07 18:00:25] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 79/93 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 75 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 2/95 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 0/95 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/95 variables, and 28 constraints, problems are : Problem set: 0 solved, 75 unsolved in 602 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 79/93 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 38/65 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (OVERLAPS) 2/95 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 37/103 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 0/95 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/95 variables, and 103 constraints, problems are : Problem set: 0 solved, 75 unsolved in 766 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
After SMT, in 1428ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 1437ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1472 ms. Remains : 15/34 places, 80/158 transitions.
When looking for a positive semi flow solution, solver replied unsat
[2025-06-07 18:00:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[99, 100, 99, 67, 98, 98, 100, 100, 98] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000009 steps (4 resets) in 180 ms. (5524 steps per ms)
BEST_FIRST walk for 9000007 steps (18 resets) in 1368 ms. (6574 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[100, 100, 100, 100, 100, 100, 100, 100, 100] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-07 18:00:28] [INFO ] Invariant cache hit.
[2025-06-07 18:00:28] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
[2025-06-07 18:00:28] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2025-06-07 18:00:28] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
[2025-06-07 18:00:28] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
[2025-06-07 18:00:28] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
[2025-06-07 18:00:28] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
[2025-06-07 18:00:28] [INFO ] [Real]Absence check using state equation in 12 ms returned unsat
[2025-06-07 18:00:28] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
[2025-06-07 18:00:28] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[100, 100, 100, 100, 100, 100, 100, 100, 100] Max Struct:[100, 100, 100, 100, 100, 100, 100, 100, 100]
FORMULA ZombiesAndSurvivors-PT-Heawood175050-UpperBounds-14 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ZombiesAndSurvivors-PT-Heawood175050-UpperBounds-13 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ZombiesAndSurvivors-PT-Heawood175050-UpperBounds-11 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ZombiesAndSurvivors-PT-Heawood175050-UpperBounds-08 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ZombiesAndSurvivors-PT-Heawood175050-UpperBounds-07 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ZombiesAndSurvivors-PT-Heawood175050-UpperBounds-06 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ZombiesAndSurvivors-PT-Heawood175050-UpperBounds-03 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ZombiesAndSurvivors-PT-Heawood175050-UpperBounds-01 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ZombiesAndSurvivors-PT-Heawood175050-UpperBounds-00 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-07 18:00:28] [INFO ] Flatten gal took : 44 ms
[2025-06-07 18:00:28] [INFO ] Flatten gal took : 9 ms
[2025-06-07 18:00:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6556290679937857744.gal : 6 ms
[2025-06-07 18:00:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18099575656628492969.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6556290679937857744.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18099575656628492969.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 7522 ms.

BK_STOP 1749319228905

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="ZombiesAndSurvivors-PT-Heawood175050"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is ZombiesAndSurvivors-PT-Heawood175050, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r265-tall-174931349800075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ZombiesAndSurvivors-PT-Heawood175050.tgz
mv ZombiesAndSurvivors-PT-Heawood175050 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;