fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r354-tall-178024402800132
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for LastZero-PT-N20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1863.840 138168.00 174228.00 353.90 FTTFTTFFFFFTFTTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r354-tall-178024402800132.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is LastZero-PT-N20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r354-tall-178024402800132
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 7.9K May 27 10:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 27 10:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 27 10:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 27 10:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 16 12:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 16 12:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 16 12:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 16 12:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 11K May 27 10:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 27 10:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 27 10:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K May 27 10:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 16 12:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 16 12:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 4 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 3.1M Jun 10 11:58 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1781643273814

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LastZero-PT-N20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-06-16 20:54:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-16 20:54:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-16 20:54:35] [INFO ] Load time of PNML (sax parser for PT used): 254 ms
[2026-06-16 20:54:35] [INFO ] Transformed 924 places.
[2026-06-16 20:54:35] [INFO ] Transformed 10061 transitions.
[2026-06-16 20:54:35] [INFO ] Parsed PT model containing 924 places and 10061 transitions and 30983 arcs in 377 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 442 places in 54 ms
Reduce places removed 442 places and 6561 transitions.
Reduce places removed 1 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA LastZero-PT-N20-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N20-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N20-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N20-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N20-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N20-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N20-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N20-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N20-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N20-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N20-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 481/481 places, 3500/3500 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 480 transition count 3500
Applied a total of 1 rules in 62 ms. Remains 480 /481 variables (removed 1) and now considering 3500/3500 (removed 0) transitions.
[2026-06-16 20:54:35] [INFO ] Flow matrix only has 3310 transitions (discarded 190 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-109390223009063217.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15198476966164548557.kers'
[2026-06-16 20:54:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-109390223009063217.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15198476966164548557.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 3310 rows 479 cols 9278 entries
Finished phase 1 with 460 SingleSign rule and 0 generalized
[2026-06-16 20:54:35] [INFO ] Computed 20 invariants in 8 ms
Computed 20 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-15198476966164548557.kers
Total runtime 12 ms.
[2026-06-16 20:54:36] [INFO ] Implicit Places using invariants in 1077 ms returned []
[2026-06-16 20:54:36] [INFO ] Flow matrix only has 3310 transitions (discarded 190 similar events)
[2026-06-16 20:54:36] [INFO ] Invariant cache hit.
[2026-06-16 20:54:37] [INFO ] State equation strengthened by 420 read => feed constraints.
[2026-06-16 20:54:53] [INFO ] Implicit Places using invariants and state equation in 17168 ms returned [165]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 18319 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 479/481 places, 3500/3500 transitions.
Applied a total of 0 rules in 16 ms. Remains 479 /479 variables (removed 0) and now considering 3500/3500 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 18411 ms. Remains : 479/481 places, 3500/3500 transitions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 3500/3500 transitions.
Applied a total of 0 rules in 15 ms. Remains 479 /479 variables (removed 0) and now considering 3500/3500 (removed 0) transitions.
[2026-06-16 20:54:54] [INFO ] Flow matrix only has 3310 transitions (discarded 190 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3698047039036138219.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13128598514263921387.kers'
[2026-06-16 20:54:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3698047039036138219.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13128598514263921387.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 3310 rows 478 cols 9258 entries
Finished phase 1 with 460 SingleSign rule and 0 generalized
[2026-06-16 20:54:54] [INFO ] Computed 19 invariants in 8 ms
Computed 19 P flows in 33 ms.
Exported basis to /tmp/petrispot-output-13128598514263921387.kers
Total runtime 37 ms.
[2026-06-16 20:54:54] [INFO ] Implicit Places using invariants in 415 ms returned []
[2026-06-16 20:54:54] [INFO ] Flow matrix only has 3310 transitions (discarded 190 similar events)
[2026-06-16 20:54:54] [INFO ] Invariant cache hit.
[2026-06-16 20:54:55] [INFO ] State equation strengthened by 420 read => feed constraints.
[2026-06-16 20:55:21] [INFO ] Implicit Places using invariants and state equation in 26681 ms returned []
Implicit Place search using SMT with State Equation took 27100 ms to find 0 implicit places.
Running 3480 sub problems to find dead transitions.
[2026-06-16 20:55:21] [INFO ] Flow matrix only has 3310 transitions (discarded 190 similar events)
[2026-06-16 20:55:21] [INFO ] Invariant cache hit.
[2026-06-16 20:55:21] [INFO ] State equation strengthened by 420 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3480 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/3789 variables, and 19 constraints, problems are : Problem set: 0 solved, 3480 unsolved in 30105 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 0/479 constraints, ReadFeed: 0/420 constraints, PredecessorRefiner: 3480/3480 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3480 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3480 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/3789 variables, and 19 constraints, problems are : Problem set: 0 solved, 3480 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 0/479 constraints, ReadFeed: 0/420 constraints, PredecessorRefiner: 0/3480 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62303ms problems are : Problem set: 0 solved, 3480 unsolved
Search for dead transitions found 0 dead transitions in 62343ms
Finished structural reductions in LTL mode , in 1 iterations and 89496 ms. Remains : 479/479 places, 3500/3500 transitions.
Support contains 16 out of 479 places after structural reductions.
[2026-06-16 20:56:23] [INFO ] Flatten gal took : 234 ms
[2026-06-16 20:56:24] [INFO ] Flatten gal took : 163 ms
[2026-06-16 20:56:24] [INFO ] Input system was already deterministic with 3500 transitions.
RANDOM walk for 40000 steps (652 resets) in 1213 ms. (32 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (64 resets) in 161 ms. (246 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (64 resets) in 195 ms. (204 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (64 resets) in 105 ms. (377 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (64 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (65 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (64 resets) in 115 ms. (344 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (64 resets) in 209 ms. (190 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 188398 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 7
Probabilistic random walk after 188398 steps, saw 37844 distinct states, run finished after 3006 ms. (steps per millisecond=62 ) properties seen :0
[2026-06-16 20:56:28] [INFO ] Flow matrix only has 3310 transitions (discarded 190 similar events)
[2026-06-16 20:56:28] [INFO ] Invariant cache hit.
[2026-06-16 20:56:28] [INFO ] State equation strengthened by 420 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 66/82 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1043/1125 variables, 82/87 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1125 variables, 9/96 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1125 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
At refinement iteration 6 (OVERLAPS) 188/1313 variables, 66/162 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1313 variables, 69/231 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1313 variables, 0/231 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 878/2191 variables, 120/351 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2191 variables, 0/351 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1016/3207 variables, 170/521 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3207 variables, 4/525 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3207 variables, 116/641 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3207 variables, 0/641 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 110/3317 variables, 59/700 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3317 variables, 2/702 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3317 variables, 7/709 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3317 variables, 0/709 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/3319 variables, 1/710 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3319 variables, 0/710 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/3321 variables, 1/711 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3321 variables, 0/711 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/3323 variables, 1/712 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3323 variables, 0/712 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/3325 variables, 1/713 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3325 variables, 0/713 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 2/3327 variables, 1/714 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3327 variables, 0/714 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 2/3329 variables, 1/715 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3329 variables, 0/715 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 295/3624 variables, 38/753 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/3624 variables, 0/753 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 158/3782 variables, 89/842 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/3782 variables, 8/850 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/3782 variables, 61/911 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/3782 variables, 0/911 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 7/3789 variables, 7/918 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/3789 variables, 0/918 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 0/3789 variables, 0/918 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3789/3789 variables, and 918 constraints, problems are : Problem set: 5 solved, 2 unsolved in 3054 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 479/479 constraints, ReadFeed: 420/420 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 36/40 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 654/694 variables, 40/42 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/694 variables, 2/44 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/694 variables, 0/44 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 104/798 variables, 36/80 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/798 variables, 34/114 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/798 variables, 0/114 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 618/1416 variables, 72/186 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1416 variables, 0/186 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 549/1965 variables, 95/281 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1965 variables, 2/283 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1965 variables, 55/338 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1965 variables, 2/340 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1965 variables, 0/340 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 46/2011 variables, 24/364 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2011 variables, 2/366 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2011 variables, 0/366 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/2013 variables, 1/367 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2013 variables, 0/367 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/2015 variables, 1/368 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2015 variables, 0/368 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/2017 variables, 1/369 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2017 variables, 0/369 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/2019 variables, 1/370 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2019 variables, 0/370 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 2/2021 variables, 1/371 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2021 variables, 0/371 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 2/2023 variables, 1/372 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2023 variables, 0/372 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 2/2025 variables, 1/373 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2025 variables, 0/373 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 2/2027 variables, 1/374 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2027 variables, 0/374 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 2/2029 variables, 1/375 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2029 variables, 0/375 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 2/2031 variables, 1/376 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2031 variables, 0/376 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 2/2033 variables, 1/377 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2033 variables, 0/377 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 2/2035 variables, 1/378 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2035 variables, 0/378 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 2/2037 variables, 1/379 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2037 variables, 0/379 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 45 (OVERLAPS) 2/2039 variables, 1/380 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2039 variables, 0/380 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 1240/3279 variables, 30/410 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/3279 variables, 0/410 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 49 (OVERLAPS) 495/3774 variables, 255/665 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/3774 variables, 15/680 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/3774 variables, 225/905 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/3774 variables, 0/905 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 53 (OVERLAPS) 15/3789 variables, 15/920 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/3789 variables, 0/920 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 0/3789 variables, 0/920 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3789/3789 variables, and 920 constraints, problems are : Problem set: 5 solved, 2 unsolved in 4552 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 479/479 constraints, ReadFeed: 420/420 constraints, PredecessorRefiner: 2/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7639ms problems are : Problem set: 5 solved, 2 unsolved
Finished Parikh walk after 30 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=30 )
Parikh walk visited 2 properties in 24 ms.
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
FORMULA LastZero-PT-N20-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N20-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N20-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N20-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 479 stabilizing places and 3500 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 479 transition count 3500
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 3500/3500 transitions.
Applied a total of 0 rules in 11 ms. Remains 479 /479 variables (removed 0) and now considering 3500/3500 (removed 0) transitions.
[2026-06-16 20:56:35] [INFO ] Flow matrix only has 3310 transitions (discarded 190 similar events)
[2026-06-16 20:56:35] [INFO ] Invariant cache hit.
[2026-06-16 20:56:36] [INFO ] Implicit Places using invariants in 339 ms returned []
[2026-06-16 20:56:36] [INFO ] Flow matrix only has 3310 transitions (discarded 190 similar events)
[2026-06-16 20:56:36] [INFO ] Invariant cache hit.
[2026-06-16 20:56:36] [INFO ] State equation strengthened by 420 read => feed constraints.
[2026-06-16 20:56:49] [INFO ] Implicit Places using invariants and state equation in 13627 ms returned []
Implicit Place search using SMT with State Equation took 13968 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 13982 ms. Remains : 479/479 places, 3500/3500 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LastZero-PT-N20-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 578 ms.
Product exploration explored 100000 steps with 50000 reset in 465 ms.
Computed a total of 479 stabilizing places and 3500 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 479 transition count 3500
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 4 factoid took 17 ms. Proved property starting from automaton with 2 states, 2 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 498 ms.
FORMULA LastZero-PT-N20-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LastZero-PT-N20-LTLFireability-02 finished in 15805 ms.
All properties solved by simple procedures.
Total runtime 136652 ms.

BK_STOP 1781643411982

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="LastZero-PT-N20"
export BK_EXAMINATION="LTLFireability"
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-5973"
echo " Executing tool itstools"
echo " Input is LastZero-PT-N20, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r354-tall-178024402800132"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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