About the Execution of ITS-Tools for ZombiesAndSurvivors-PT-Heawood14600
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r254-tall-174931340200581.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 itstools
Input is ZombiesAndSurvivors-PT-Heawood14600, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931340200581
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 5.3K Jun 6 09:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 40K Jun 6 09:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Jun 6 09:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 6 09:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K Jun 6 12:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Jun 6 12:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Jun 6 12:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 12:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 11K Jun 6 09:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Jun 6 09:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Jun 6 09:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Jun 6 09:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Jun 6 12:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Jun 6 12:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 13 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 50K 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-Heawood14600-UpperBounds-00
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood14600-UpperBounds-01
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood14600-UpperBounds-02
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood14600-UpperBounds-03
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood14600-UpperBounds-04
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood14600-UpperBounds-05
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood14600-UpperBounds-06
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood14600-UpperBounds-07
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood14600-UpperBounds-08
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood14600-UpperBounds-09
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood14600-UpperBounds-10
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood14600-UpperBounds-11
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood14600-UpperBounds-12
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood14600-UpperBounds-13
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood14600-UpperBounds-14
FORMULA_NAME ZombiesAndSurvivors-PT-Heawood14600-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1749419263064
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ZombiesAndSurvivors-PT-Heawood14600
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-08 21:47:44] [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-08 21:47:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 21:47:44] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2025-06-08 21:47:44] [INFO ] Transformed 28 places.
[2025-06-08 21:47:44] [INFO ] Transformed 112 transitions.
[2025-06-08 21:47:44] [INFO ] Parsed PT model containing 28 places and 112 transitions and 252 arcs in 133 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 60, 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, 0, 0, 0, 0, 0, 0, 0, 60, 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 112 rows 28 cols
[2025-06-08 21:47:44] [INFO ] Computed 0 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 60, 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 10042 steps (2 resets) in 11 ms. (836 steps per ms)
BEST_FIRST walk for 160016 steps (32 resets) in 120 ms. (1322 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[60, 60, 60, 60, 60, 60, 8, 60, 68, 73, 60, 60, 60, 81, 60, 60] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-08 21:47:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 21:47:44] [INFO ] [Real]Absence check using state equation in 59 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 21:47:44] [INFO ] [Real]Absence check using state equation in 36 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 21:47:44] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-08 21:47:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 21:47:44] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-08 21:47:44] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-06-08 21:47:44] [INFO ] [Nat]Added 26 Read/Feed constraints in 8 ms returned sat
[2025-06-08 21:47:45] [INFO ] Computed and/alt/rep : 106/442/106 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-08 21:47:45] [INFO ] Added : 36 causal constraints over 11 iterations in 152 ms. Result :sat
Minimization took 40 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 21:47:45] [INFO ] [Real]Absence check using state equation in 18 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 21:47:45] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-08 21:47:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 21:47:45] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-08 21:47:45] [INFO ] [Nat]Added 26 Read/Feed constraints in 9 ms returned sat
[2025-06-08 21:47:45] [INFO ] Computed and/alt/rep : 106/442/106 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-08 21:47:45] [INFO ] Added : 33 causal constraints over 8 iterations in 99 ms. Result :sat
Minimization took 89 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 21:47:45] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-08 21:47:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 21:47:45] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-08 21:47:45] [INFO ] [Nat]Added 26 Read/Feed constraints in 8 ms returned sat
[2025-06-08 21:47:45] [INFO ] Computed and/alt/rep : 106/442/106 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-08 21:47:45] [INFO ] Added : 31 causal constraints over 7 iterations in 66 ms. Result :sat
Minimization took 73 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 21:47:45] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-08 21:47:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 21:47:45] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-08 21:47:45] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2025-06-08 21:47:45] [INFO ] Computed and/alt/rep : 106/442/106 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-08 21:47:45] [INFO ] Added : 12 causal constraints over 3 iterations in 37 ms. Result :sat
Minimization took 26 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 21:47:45] [INFO ] [Real]Absence check using state equation in 20 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 21:47:46] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-08 21:47:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 21:47:46] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-08 21:47:46] [INFO ] [Nat]Added 26 Read/Feed constraints in 7 ms returned sat
[2025-06-08 21:47:46] [INFO ] Computed and/alt/rep : 106/442/106 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-08 21:47:46] [INFO ] Added : 34 causal constraints over 9 iterations in 94 ms. Result :sat
Minimization took 39 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 21:47:46] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-08 21:47:46] [INFO ] [Real]Added 26 Read/Feed constraints in 7 ms returned sat
[2025-06-08 21:47:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 21:47:46] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-08 21:47:46] [INFO ] [Nat]Added 26 Read/Feed constraints in 9 ms returned sat
[2025-06-08 21:47:46] [INFO ] Computed and/alt/rep : 106/442/106 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-08 21:47:46] [INFO ] Added : 23 causal constraints over 5 iterations in 57 ms. Result :sat
Minimization took 81 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 21:47:46] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-08 21:47:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 21:47:46] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-08 21:47:46] [INFO ] [Nat]Added 26 Read/Feed constraints in 17 ms returned sat
[2025-06-08 21:47:46] [INFO ] Computed and/alt/rep : 106/442/106 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-08 21:47:46] [INFO ] Added : 15 causal constraints over 4 iterations in 48 ms. Result :sat
Minimization took 34 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 21:47:46] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-08 21:47:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 21:47:46] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-08 21:47:46] [INFO ] [Nat]Added 26 Read/Feed constraints in 13 ms returned sat
[2025-06-08 21:47:46] [INFO ] Computed and/alt/rep : 106/442/106 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-08 21:47:46] [INFO ] Added : 21 causal constraints over 5 iterations in 48 ms. Result :sat
Minimization took 129 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 21:47:46] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-08 21:47:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 21:47:47] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-08 21:47:47] [INFO ] [Nat]Added 26 Read/Feed constraints in 13 ms returned sat
[2025-06-08 21:47:47] [INFO ] Computed and/alt/rep : 106/442/106 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-08 21:47:47] [INFO ] Added : 18 causal constraints over 4 iterations in 48 ms. Result :sat
Minimization took 25 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 21:47:47] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-08 21:47:47] [INFO ] [Real]Added 26 Read/Feed constraints in 9 ms returned sat
[2025-06-08 21:47:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 21:47:47] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-08 21:47:47] [INFO ] [Nat]Added 26 Read/Feed constraints in 9 ms returned sat
[2025-06-08 21:47:47] [INFO ] Computed and/alt/rep : 106/442/106 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-08 21:47:47] [INFO ] Added : 31 causal constraints over 7 iterations in 68 ms. Result :sat
Minimization took 47 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 21:47:47] [INFO ] [Real]Absence check using state equation in 19 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 21:47:47] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[60, 60, 60, 60, 60, 60, 8, 60, 68, 73, 60, 60, 60, 81, 60, 60] Max Struct:[60, 60, +inf, 60, +inf, +inf, +inf, 60, +inf, +inf, +inf, +inf, +inf, +inf, 60, 60]
FORMULA ZombiesAndSurvivors-PT-Heawood14600-UpperBounds-15 60 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ZombiesAndSurvivors-PT-Heawood14600-UpperBounds-14 60 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ZombiesAndSurvivors-PT-Heawood14600-UpperBounds-07 60 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ZombiesAndSurvivors-PT-Heawood14600-UpperBounds-03 60 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ZombiesAndSurvivors-PT-Heawood14600-UpperBounds-01 60 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ZombiesAndSurvivors-PT-Heawood14600-UpperBounds-00 60 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[120, 117, 120, 60, 120, 118, 120, 120, 120, 120] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 10 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 112/112 transitions.
Graph (trivial) has 26 edges and 28 vertex of which 15 / 28 are part of one of the 2 SCC in 1 ms
Free SCC test removed 13 places
Drop transitions (Empty/Sink Transition effects.) removed 38 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 42 transitions.
Applied a total of 1 rules in 19 ms. Remains 15 /28 variables (removed 13) and now considering 70/112 (removed 42) transitions.
Running 63 sub problems to find dead transitions.
Normalized transition count is 68 out of 70 initially.
// Phase 1: matrix 68 rows 15 cols
[2025-06-08 21:47:48] [INFO ] Computed 0 invariants in 3 ms
[2025-06-08 21:47:48] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 69/83 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 2/85 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 0/85 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/85 variables, and 28 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1548 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 69/83 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 32/59 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 2/85 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 31/91 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/85 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/85 variables, and 91 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1390 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3008ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 3016ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3046 ms. Remains : 15/28 places, 70/112 transitions.
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
When looking for a positive semi flow solution, solver replied unsat
[2025-06-08 21:47:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[120, 117, 120, 60, 120, 118, 120, 120, 120, 120] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000006 steps (2 resets) in 112 ms. (8849 steps per ms)
BEST_FIRST walk for 10000010 steps (20 resets) in 1681 ms. (5945 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[120, 120, 120, 60, 120, 120, 120, 120, 120, 120] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-08 21:47:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 21:47:52] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 21:47:52] [INFO ] [Real]Absence check using state equation in 12 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 21:47:53] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 21:47:53] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 21:47:53] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 21:47:53] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 21:47:53] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 21:47:53] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 21:47:53] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 21:47:53] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[120, 120, 120, 60, 120, 120, 120, 120, 120, 120] Max Struct:[120, 120, 120, 60, 120, 120, 120, 120, 120, 120]
FORMULA ZombiesAndSurvivors-PT-Heawood14600-UpperBounds-13 120 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ZombiesAndSurvivors-PT-Heawood14600-UpperBounds-12 120 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ZombiesAndSurvivors-PT-Heawood14600-UpperBounds-11 120 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ZombiesAndSurvivors-PT-Heawood14600-UpperBounds-10 120 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ZombiesAndSurvivors-PT-Heawood14600-UpperBounds-09 120 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ZombiesAndSurvivors-PT-Heawood14600-UpperBounds-08 120 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ZombiesAndSurvivors-PT-Heawood14600-UpperBounds-06 60 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ZombiesAndSurvivors-PT-Heawood14600-UpperBounds-05 120 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ZombiesAndSurvivors-PT-Heawood14600-UpperBounds-04 120 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ZombiesAndSurvivors-PT-Heawood14600-UpperBounds-02 120 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-08 21:47:53] [INFO ] Flatten gal took : 28 ms
[2025-06-08 21:47:53] [INFO ] Flatten gal took : 7 ms
[2025-06-08 21:47:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7765301734784136208.gal : 5 ms
[2025-06-08 21:47:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15356180048449987919.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7765301734784136208.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15356180048449987919.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
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 9300 ms.
BK_STOP 1749419273577
--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-Heawood14600"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ZombiesAndSurvivors-PT-Heawood14600, 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 r254-tall-174931340200581"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ZombiesAndSurvivors-PT-Heawood14600.tgz
mv ZombiesAndSurvivors-PT-Heawood14600 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 '
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 ;