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.r018-smll-177946788100292.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 BlocksWorld-PT-01, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946788100292
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.9K Mar 5 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 5 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 5 16:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 5 16:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 15 07:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 15 07:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 5 16:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Mar 5 16:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 5 16:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Mar 5 16:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 87K Mar 3 18:30 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 BlocksWorld-PT-01-LTLFireability-00
FORMULA_NAME BlocksWorld-PT-01-LTLFireability-01
FORMULA_NAME BlocksWorld-PT-01-LTLFireability-02
FORMULA_NAME BlocksWorld-PT-01-LTLFireability-03
FORMULA_NAME BlocksWorld-PT-01-LTLFireability-04
FORMULA_NAME BlocksWorld-PT-01-LTLFireability-05
FORMULA_NAME BlocksWorld-PT-01-LTLFireability-06
FORMULA_NAME BlocksWorld-PT-01-LTLFireability-07
FORMULA_NAME BlocksWorld-PT-01-LTLFireability-08
FORMULA_NAME BlocksWorld-PT-01-LTLFireability-09
FORMULA_NAME BlocksWorld-PT-01-LTLFireability-10
FORMULA_NAME BlocksWorld-PT-01-LTLFireability-11
FORMULA_NAME BlocksWorld-PT-01-LTLFireability-12
FORMULA_NAME BlocksWorld-PT-01-LTLFireability-13
FORMULA_NAME BlocksWorld-PT-01-LTLFireability-14
FORMULA_NAME BlocksWorld-PT-01-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779567087436

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 20:11:29] [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-05-23 20:11:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 20:11:30] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2026-05-23 20:11:30] [INFO ] Transformed 109 places.
[2026-05-23 20:11:30] [INFO ] Transformed 181 transitions.
[2026-05-23 20:11:30] [INFO ] Found NUPN structural information;
[2026-05-23 20:11:30] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8]
[2026-05-23 20:11:30] [INFO ] Parsed PT model containing 109 places and 181 transitions and 896 arcs in 385 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA BlocksWorld-PT-01-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-01-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-01-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-01-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 181/181 transitions.
Applied a total of 0 rules in 27 ms. Remains 109 /109 variables (removed 0) and now considering 181/181 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17400857351997535823.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16558119761735293182.kers'
[2026-05-23 20:11:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17400857351997535823.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16558119761735293182.kers]
Normalized transition count is 180 out of 181 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 109 cols 846 entries
Finished phase 1 with 90 SingleSign rule and 0 generalized
[2026-05-23 20:11:30] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16558119761735293182.kers
Total runtime 3 ms.
[2026-05-23 20:11:31] [INFO ] Implicit Places using invariants in 466 ms returned []
[2026-05-23 20:11:31] [INFO ] Invariant cache hit.
[2026-05-23 20:11:31] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-23 20:11:31] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 884 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2026-05-23 20:11:31] [INFO ] Invariant cache hit.
[2026-05-23 20:11:31] [INFO ] State equation strengthened by 15 read => feed constraints.
Problem TDEAD28 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD178 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 15/15 constraints. Problems are: Problem set: 14 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 14 solved, 165 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD124 is UNSAT
At refinement iteration 2 (OVERLAPS) 2/109 variables, 4/19 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/19 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 180/289 variables, 109/128 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 14/142 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 2/144 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 2/146 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 3/149 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 1/150 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 1/151 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 1/152 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 0/152 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 13 (OVERLAPS) 1/290 variables, 1/153 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/290 variables, 0/153 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 15 (OVERLAPS) 0/290 variables, 0/153 constraints. Problems are: Problem set: 18 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 153 constraints, problems are : Problem set: 18 solved, 161 unsolved in 19149 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 18 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 3/4 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 11/109 variables, 18/22 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 7/29 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/29 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 180/289 variables, 109/138 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 14/152 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 161/313 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 20/333 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 20/353 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 20/373 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 16/389 constraints. Problems are: Problem set: 18 solved, 161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/290 variables, and 389 constraints, problems are : Problem set: 18 solved, 161 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, ReadFeed: 14/15 constraints, PredecessorRefiner: 161/179 constraints, Known Traps: 86/86 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49770ms problems are : Problem set: 18 solved, 161 unsolved
Search for dead transitions found 18 dead transitions in 49794ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 109/109 places, 163/181 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 101 transition count 163
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 8 rules in 19 ms. Remains 101 /109 variables (removed 8) and now considering 163/163 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2308139545033212140.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7556431224134244732.kers'
[2026-05-23 20:12:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2308139545033212140.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7556431224134244732.kers]
Normalized transition count is 162 out of 163 initially.
Culling trivial invariants: removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 162 rows 100 cols 792 entries
Finished phase 1 with 81 SingleSign rule and 0 generalized
[2026-05-23 20:12:21] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7556431224134244732.kers
Total runtime 2 ms.
[2026-05-23 20:12:21] [INFO ] Implicit Places using invariants in 152 ms returned []
[2026-05-23 20:12:21] [INFO ] Invariant cache hit.
[2026-05-23 20:12:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 20:12:21] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 101/109 places, 163/181 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51226 ms. Remains : 101/109 places, 163/181 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 163/163 transitions.
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 0 rules in 7 ms. Remains 101 /101 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2026-05-23 20:12:21] [INFO ] Invariant cache hit.
[2026-05-23 20:12:21] [INFO ] Implicit Places using invariants in 125 ms returned []
[2026-05-23 20:12:21] [INFO ] Invariant cache hit.
[2026-05-23 20:12:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 20:12:22] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2026-05-23 20:12:22] [INFO ] Invariant cache hit.
[2026-05-23 20:12:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 2/100 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 162/262 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 1/263 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (OVERLAPS) 0/263 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/264 variables, and 121 constraints, problems are : Problem set: 0 solved, 161 unsolved in 13234 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, State Equation: 100/101 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 2/100 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 162/262 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 161/281 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 11/292 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 6/298 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 14/312 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 14/326 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 262/264 variables, and 337 constraints, problems are : Problem set: 0 solved, 161 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, State Equation: 100/101 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43468ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 43471ms
Finished structural reductions in LTL mode , in 1 iterations and 43847 ms. Remains : 101/101 places, 163/163 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Support contains 36 out of 100 places after structural reductions.
[2026-05-23 20:13:06] [INFO ] Flatten gal took : 166 ms
[2026-05-23 20:13:06] [INFO ] Flatten gal took : 60 ms
[2026-05-23 20:13:06] [INFO ] Input system was already deterministic with 163 transitions.
Support contains 35 out of 100 places (down from 36) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 29 to 27
RANDOM walk for 40000 steps (8 resets) in 3734 ms. (10 steps per ms) remains 3/27 properties
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 212 ms. (187 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 205 ms. (194 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-584749881286409067.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4263731465231489420.kers'
[2026-05-23 20:13:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-584749881286409067.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4263731465231489420.kers]
Normalized transition count is 162 out of 163 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 162 rows 100 cols 792 entries
Finished phase 1 with 81 SingleSign rule and 0 generalized
[2026-05-23 20:13:07] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4263731465231489420.kers
Total runtime 1 ms.
[2026-05-23 20:13:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp14 is UNSAT
At refinement iteration 1 (OVERLAPS) 82/93 variables, 15/15 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/100 variables, 4/19 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/119 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/263 variables, 1/120 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 0/120 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/263 variables, 0/120 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 120 constraints, problems are : Problem set: 2 solved, 1 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 84/91 variables, 14/14 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/100 variables, 5/19 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 1/120 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/120 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/263 variables, 1/121 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 0/121 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/263 variables, 0/121 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 121 constraints, problems are : Problem set: 2 solved, 1 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 412ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 7 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 163/163 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 100 transition count 162
Applied a total of 1 rules in 119 ms. Remains 100 /100 variables (removed 0) and now considering 162/163 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 100/100 places, 162/163 transitions.
RANDOM walk for 40000 steps (8 resets) in 341 ms. (116 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1218954 steps, run timeout after 3001 ms. (steps per millisecond=406 ) properties seen :0 out of 1
Probabilistic random walk after 1218954 steps, saw 625619 distinct states, run finished after 3009 ms. (steps per millisecond=405 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17740327753795863044.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15368658451097479048.kers'
[2026-05-23 20:13:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17740327753795863044.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15368658451097479048.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 162 rows 100 cols 792 entries
Finished phase 1 with 81 SingleSign rule and 0 generalized
[2026-05-23 20:13:11] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15368658451097479048.kers
Total runtime 1 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 84/91 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/100 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/262 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 119 constraints, problems are : Problem set: 0 solved, 1 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 84/91 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/100 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/262 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 120 constraints, problems are : Problem set: 0 solved, 1 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 289ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 7 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 162/162 transitions.
Applied a total of 0 rules in 41 ms. Remains 100 /100 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 100/100 places, 162/162 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 162/162 transitions.
Applied a total of 0 rules in 38 ms. Remains 100 /100 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2026-05-23 20:13:11] [INFO ] Invariant cache hit.
[2026-05-23 20:13:11] [INFO ] Implicit Places using invariants in 140 ms returned []
[2026-05-23 20:13:11] [INFO ] Invariant cache hit.
[2026-05-23 20:13:12] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2026-05-23 20:13:12] [INFO ] Redundant transitions in 7 ms returned []
Running 160 sub problems to find dead transitions.
[2026-05-23 20:13:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 2/100 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/262 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 119 constraints, problems are : Problem set: 0 solved, 160 unsolved in 9512 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 2/100 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 160/279 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 20/299 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 15/314 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 20/334 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 18/352 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 262/262 variables, and 352 constraints, problems are : Problem set: 0 solved, 160 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 73/73 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39735ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 39737ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40137 ms. Remains : 100/100 places, 162/162 transitions.
FORMULA BlocksWorld-PT-01-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BlocksWorld-PT-01-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
FORMULA BlocksWorld-PT-01-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable 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(X((F(p0)&&X(((p2 U (p3||G(p2)))||p1))))))'
Support contains 7 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 8 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17157539061686757499.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12043701971299653178.kers'
[2026-05-23 20:13:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17157539061686757499.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12043701971299653178.kers]
Normalized transition count is 162 out of 163 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 162 rows 100 cols 792 entries
Finished phase 1 with 81 SingleSign rule and 0 generalized
[2026-05-23 20:13:52] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12043701971299653178.kers
Total runtime 2 ms.
[2026-05-23 20:13:52] [INFO ] Implicit Places using invariants in 209 ms returned []
[2026-05-23 20:13:52] [INFO ] Invariant cache hit.
[2026-05-23 20:13:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 20:13:53] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2026-05-23 20:13:53] [INFO ] Invariant cache hit.
[2026-05-23 20:13:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 2/100 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 162/262 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 1/263 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (OVERLAPS) 0/263 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 121 constraints, problems are : Problem set: 0 solved, 161 unsolved in 14843 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 2/100 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 162/262 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 161/281 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 15/296 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 16/312 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 16/328 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 262/263 variables, and 341 constraints, problems are : Problem set: 0 solved, 161 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45085ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 45086ms
Finished structural reductions in LTL mode , in 1 iterations and 45649 ms. Remains : 100/100 places, 163/163 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(X((F(p0)&&X(((p2 U (p3||G(p2)))||p1))))))'
Stuttering acceptance computed with spot in 617 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p3) (NOT p2) (NOT p1)), true, (AND (NOT p3) (NOT p2))]
Running random walk in product with property : BlocksWorld-PT-01-LTLFireability-00
Product exploration explored 100000 steps with 436 reset in 915 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 1 ms.
FORMULA BlocksWorld-PT-01-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-01-LTLFireability-00 finished in 47348 ms.
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((X((p1 U p2))&&p0))||(p3 U p1)))&&F(p3)))'
Support contains 7 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 5 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2026-05-23 20:14:39] [INFO ] Invariant cache hit.
[2026-05-23 20:14:39] [INFO ] Implicit Places using invariants in 136 ms returned []
[2026-05-23 20:14:39] [INFO ] Invariant cache hit.
[2026-05-23 20:14:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 20:14:40] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 384 ms. Remains : 100/100 places, 163/163 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((X((p1 U p2))&&p0))||(p3 U p1)))&&F(p3)))'
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p3), (OR (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BlocksWorld-PT-01-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 621 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 2 ms.
FORMULA BlocksWorld-PT-01-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-01-LTLFireability-02 finished in 1332 ms.
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(G((X((F(G(p1))||G(p2)))||p0))))'
Support contains 7 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 5 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2026-05-23 20:14:41] [INFO ] Invariant cache hit.
[2026-05-23 20:14:41] [INFO ] Implicit Places using invariants in 125 ms returned []
[2026-05-23 20:14:41] [INFO ] Invariant cache hit.
[2026-05-23 20:14:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 20:14:41] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 364 ms. Remains : 100/100 places, 163/163 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(G((X((F(G(p1))||G(p2)))||p0))))'
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-01-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 560 ms.
Stack based approach found an accepted trace after 278 steps with 0 reset with depth 279 and stack size 122 in 3 ms.
FORMULA BlocksWorld-PT-01-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-01-LTLFireability-03 finished in 1152 ms.
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' '!(G((p0||G((X(X(p2))||p1)))))'
Support contains 5 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2026-05-23 20:14:42] [INFO ] Invariant cache hit.
[2026-05-23 20:14:42] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-23 20:14:42] [INFO ] Invariant cache hit.
[2026-05-23 20:14:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 20:14:42] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 346 ms. Remains : 100/100 places, 163/163 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' '!(G((G((X(X(p1))||p0))||p2)))'
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : BlocksWorld-PT-01-LTLFireability-05
Entered a terminal (fully accepting) state of product in 240 steps with 0 reset in 1 ms.
FORMULA BlocksWorld-PT-01-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-01-LTLFireability-05 finished in 574 ms.
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' '!(G(((p0||X(X(X(p0)))) U (X(F(p2))&&p1))))'
Support contains 5 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2026-05-23 20:14:42] [INFO ] Invariant cache hit.
[2026-05-23 20:14:43] [INFO ] Implicit Places using invariants in 159 ms returned []
[2026-05-23 20:14:43] [INFO ] Invariant cache hit.
[2026-05-23 20:14:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 20:14:43] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 419 ms. Remains : 100/100 places, 163/163 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' '!(G(((X(X(X(p0)))||p0) U (X(F(p2))&&p1))))'
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), true]
Running random walk in product with property : BlocksWorld-PT-01-LTLFireability-09
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA BlocksWorld-PT-01-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-01-LTLFireability-09 finished in 713 ms.
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((((p0||F(p1)) U p2)&&X((p3 U (p0||G(p1)))))))'
Support contains 8 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2026-05-23 20:14:43] [INFO ] Invariant cache hit.
[2026-05-23 20:14:43] [INFO ] Implicit Places using invariants in 166 ms returned []
[2026-05-23 20:14:43] [INFO ] Invariant cache hit.
[2026-05-23 20:14:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 20:14:44] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 509 ms. Remains : 100/100 places, 163/163 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((((p0||F(p1)) U p2)&&X((p3 U (p0||G(p1)))))))'
Stuttering acceptance computed with spot in 357 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-01-LTLFireability-10
Entered a terminal (fully accepting) state of product in 34 steps with 3 reset in 1 ms.
FORMULA BlocksWorld-PT-01-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-01-LTLFireability-10 finished in 931 ms.
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((G(p1)&&p0)))'
Support contains 10 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2026-05-23 20:14:44] [INFO ] Invariant cache hit.
[2026-05-23 20:14:44] [INFO ] Implicit Places using invariants in 172 ms returned []
[2026-05-23 20:14:44] [INFO ] Invariant cache hit.
[2026-05-23 20:14:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 20:14:44] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 520 ms. Remains : 100/100 places, 163/163 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((G(p1)&&p0)))'
Stuttering acceptance computed with spot in 166 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BlocksWorld-PT-01-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BlocksWorld-PT-01-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-01-LTLFireability-11 finished in 724 ms.
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' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 15 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2026-05-23 20:14:45] [INFO ] Invariant cache hit.
[2026-05-23 20:14:45] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-23 20:14:45] [INFO ] Invariant cache hit.
[2026-05-23 20:14:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 20:14:45] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2026-05-23 20:14:45] [INFO ] Redundant transitions in 10 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 393 ms. Remains : 100/100 places, 163/163 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' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-01-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 684 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 12 in 1 ms.
FORMULA BlocksWorld-PT-01-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-01-LTLFireability-12 finished in 1224 ms.
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' '!(F(G(p0)))'
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 14 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2026-05-23 20:14:46] [INFO ] Invariant cache hit.
[2026-05-23 20:14:46] [INFO ] Implicit Places using invariants in 195 ms returned []
[2026-05-23 20:14:46] [INFO ] Invariant cache hit.
[2026-05-23 20:14:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 20:14:46] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2026-05-23 20:14:47] [INFO ] Redundant transitions in 10 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 591 ms. Remains : 100/100 places, 163/163 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' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : BlocksWorld-PT-01-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 578 ms.
Stack based approach found an accepted trace after 342 steps with 0 reset with depth 343 and stack size 183 in 2 ms.
FORMULA BlocksWorld-PT-01-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-01-LTLFireability-14 finished in 1256 ms.
All properties solved by simple procedures.
Total runtime 197880 ms.

BK_STOP 1779567287731

--------------------
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="BlocksWorld-PT-01"
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 BlocksWorld-PT-01, 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 r018-smll-177946788100292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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