Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r170-smll-174889233300092.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is Railroad-PT-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-174889233300092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 740K
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 255K May 29 14:32 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 Railroad-PT-020-LTLFireability-00
FORMULA_NAME Railroad-PT-020-LTLFireability-01
FORMULA_NAME Railroad-PT-020-LTLFireability-02
FORMULA_NAME Railroad-PT-020-LTLFireability-03
FORMULA_NAME Railroad-PT-020-LTLFireability-04
FORMULA_NAME Railroad-PT-020-LTLFireability-05
FORMULA_NAME Railroad-PT-020-LTLFireability-06
FORMULA_NAME Railroad-PT-020-LTLFireability-07
FORMULA_NAME Railroad-PT-020-LTLFireability-08
FORMULA_NAME Railroad-PT-020-LTLFireability-09
FORMULA_NAME Railroad-PT-020-LTLFireability-10
FORMULA_NAME Railroad-PT-020-LTLFireability-11
FORMULA_NAME Railroad-PT-020-LTLFireability-12
FORMULA_NAME Railroad-PT-020-LTLFireability-13
FORMULA_NAME Railroad-PT-020-LTLFireability-14
FORMULA_NAME Railroad-PT-020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748959580889

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Railroad-PT-020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 14:06:23] [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]
[2025-06-03 14:06:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 14:06:24] [INFO ] Load time of PNML (sax parser for PT used): 262 ms
[2025-06-03 14:06:24] [INFO ] Transformed 218 places.
[2025-06-03 14:06:24] [INFO ] Transformed 506 transitions.
[2025-06-03 14:06:24] [INFO ] Found NUPN structural information;
[2025-06-03 14:06:24] [INFO ] Parsed PT model containing 218 places and 506 transitions and 2968 arcs in 524 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 61 places in 8 ms
Reduce places removed 61 places and 20 transitions.
FORMULA Railroad-PT-020-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-020-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-020-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 486/486 transitions.
Ensure Unique test removed 21 places
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 136 transition count 486
Applied a total of 21 rules in 70 ms. Remains 136 /157 variables (removed 21) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 136 cols
[2025-06-03 14:06:25] [INFO ] Computed 50 invariants in 52 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:06:26] [INFO ] Implicit Places using invariants in 1180 ms returned [0, 2, 6, 9, 11, 15, 17, 39, 60, 62, 63, 66, 74, 75, 79, 80, 81, 106, 111, 115, 121, 125, 129, 132, 134]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 1265 ms to find 25 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 111/157 places, 486/486 transitions.
Applied a total of 0 rules in 14 ms. Remains 111 /111 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1383 ms. Remains : 111/157 places, 486/486 transitions.
Support contains 33 out of 111 places after structural reductions.
[2025-06-03 14:06:26] [INFO ] Flatten gal took : 159 ms
[2025-06-03 14:06:26] [INFO ] Flatten gal took : 98 ms
[2025-06-03 14:06:27] [INFO ] Input system was already deterministic with 486 transitions.
RANDOM walk for 40000 steps (8 resets) in 2932 ms. (13 steps per ms) remains 8/26 properties
BEST_FIRST walk for 40004 steps (8 resets) in 265 ms. (150 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 6/6 properties
// Phase 1: matrix 486 rows 111 cols
[2025-06-03 14:06:28] [INFO ] Invariants computation overflowed in 7 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 233/244 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 4 (OVERLAPS) 302/546 variables, 63/85 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 63/148 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:06:29] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 1/149 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 51/597 variables, 37/186 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/597 variables, 37/223 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/597 variables, 0/223 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/597 variables, 0/223 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 597/597 variables, and 223 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1574 ms.
Refiners :[Domain max(s): 111/111 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 155/163 variables, 8/16 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 381/544 variables, 65/81 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/544 variables, 65/146 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/544 variables, 5/151 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/544 variables, 1/152 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/544 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 53/597 variables, 38/190 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/597 variables, 38/228 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/597 variables, 0/228 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/597 variables, 0/228 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 597/597 variables, and 228 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1518 ms.
Refiners :[Domain max(s): 111/111 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3177ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 57 steps, including 0 resets, run visited all 5 properties in 4 ms. (steps per millisecond=14 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 17 ms.
FORMULA Railroad-PT-020-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Railroad-PT-020-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
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.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 486/486 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 108 transition count 484
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 4 place count 108 transition count 464
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 44 place count 88 transition count 464
Applied a total of 44 rules in 115 ms. Remains 88 /111 variables (removed 23) and now considering 464/486 (removed 22) transitions.
// Phase 1: matrix 464 rows 88 cols
[2025-06-03 14:06:31] [INFO ] Computed 24 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:06:32] [INFO ] Implicit Places using invariants in 641 ms returned []
[2025-06-03 14:06:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:06:33] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 1279 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 14:06:33] [INFO ] Redundant transitions in 52 ms returned []
Running 444 sub problems to find dead transitions.
[2025-06-03 14:06:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:06:36] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:06:38] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 4 (OVERLAPS) 20/88 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:06:46] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 9 (OVERLAPS) 464/552 variables, 88/203 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/552 variables, and 203 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30045 ms.
Refiners :[Domain max(s): 88/88 constraints, Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 4 (OVERLAPS) 20/88 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 8 (OVERLAPS) 464/552 variables, 88/203 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/552 variables, 444/647 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/552 variables, and 647 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30056 ms.
Refiners :[Domain max(s): 88/88 constraints, Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60955ms problems are : Problem set: 0 solved, 444 unsolved
Search for dead transitions found 0 dead transitions in 60971ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/111 places, 464/486 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62450 ms. Remains : 88/111 places, 464/486 transitions.
Stuttering acceptance computed with spot in 344 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-020-LTLFireability-02
Product exploration explored 100000 steps with 66 reset in 846 ms.
Stack based approach found an accepted trace after 1636 steps with 1 reset with depth 1305 and stack size 1305 in 10 ms.
FORMULA Railroad-PT-020-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-02 finished in 63741 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&(!p1 U (X(!p2)||G(!p1))))))'
Support contains 6 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 486/486 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 486
Applied a total of 1 rules in 10 ms. Remains 110 /111 variables (removed 1) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 110 cols
[2025-06-03 14:07:35] [INFO ] Computed 24 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:07:36] [INFO ] Implicit Places using invariants in 687 ms returned []
[2025-06-03 14:07:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:07:37] [INFO ] Implicit Places using invariants and state equation in 1113 ms returned []
Implicit Place search using SMT with State Equation took 1804 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2025-06-03 14:07:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:07:40] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:07:40] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:07:41] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/110 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:07:52] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 9 (OVERLAPS) 486/596 variables, 110/248 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 596/596 variables, and 248 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30028 ms.
Refiners :[Domain max(s): 110/110 constraints, Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/110 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 8 (OVERLAPS) 486/596 variables, 110/248 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/596 variables, 466/714 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 596/596 variables, and 714 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30025 ms.
Refiners :[Domain max(s): 110/110 constraints, Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60690ms problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 60695ms
Starting structural reductions in LTL mode, iteration 1 : 110/111 places, 486/486 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62514 ms. Remains : 110/111 places, 486/486 transitions.
Stuttering acceptance computed with spot in 354 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), p2, (NOT p0), (AND p1 p2), true]
Running random walk in product with property : Railroad-PT-020-LTLFireability-03
Product exploration explored 100000 steps with 33333 reset in 526 ms.
Product exploration explored 100000 steps with 33333 reset in 459 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 27 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Railroad-PT-020-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-020-LTLFireability-03 finished in 63928 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 486/486 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 108 transition count 484
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 4 place count 108 transition count 463
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 46 place count 87 transition count 463
Applied a total of 46 rules in 100 ms. Remains 87 /111 variables (removed 24) and now considering 463/486 (removed 23) transitions.
// Phase 1: matrix 463 rows 87 cols
[2025-06-03 14:08:39] [INFO ] Invariants computation overflowed in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:08:39] [INFO ] Implicit Places using invariants in 180 ms returned []
// Phase 1: matrix 463 rows 87 cols
[2025-06-03 14:08:39] [INFO ] Invariants computation overflowed in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:08:41] [INFO ] Implicit Places using invariants and state equation in 1343 ms returned []
Implicit Place search using SMT with State Equation took 1526 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 14:08:41] [INFO ] Redundant transitions in 11 ms returned []
Running 443 sub problems to find dead transitions.
// Phase 1: matrix 463 rows 87 cols
[2025-06-03 14:08:41] [INFO ] Invariants computation overflowed in 4 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (OVERLAPS) 463/530 variables, 67/134 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:08:46] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:08:46] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:08:51] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/530 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 443 unsolved
SMT process timed out in 30327ms, After SMT, problems are : Problem set: 0 solved, 443 unsolved
Search for dead transitions found 0 dead transitions in 30330ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/111 places, 463/486 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31981 ms. Remains : 87/111 places, 463/486 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : Railroad-PT-020-LTLFireability-04
Product exploration explored 100000 steps with 435 reset in 699 ms.
Stack based approach found an accepted trace after 3560 steps with 14 reset with depth 274 and stack size 274 in 30 ms.
FORMULA Railroad-PT-020-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-04 finished in 32791 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((((X(X(p0)) U p1) U p2)&&X(p1)))))'
Support contains 7 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 486/486 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 486
Applied a total of 1 rules in 13 ms. Remains 110 /111 variables (removed 1) and now considering 486/486 (removed 0) transitions.
[2025-06-03 14:09:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:09:12] [INFO ] Implicit Places using invariants in 663 ms returned []
[2025-06-03 14:09:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:09:13] [INFO ] Implicit Places using invariants and state equation in 736 ms returned []
Implicit Place search using SMT with State Equation took 1401 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2025-06-03 14:09:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:09:16] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:09:16] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:09:16] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/110 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:09:25] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 9 (OVERLAPS) 486/596 variables, 110/248 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 596/596 variables, and 248 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30026 ms.
Refiners :[Domain max(s): 110/110 constraints, Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/110 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 8 (OVERLAPS) 486/596 variables, 110/248 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/596 variables, 466/714 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 596/596 variables, and 714 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30028 ms.
Refiners :[Domain max(s): 110/110 constraints, Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60337ms problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 60338ms
Starting structural reductions in LTL mode, iteration 1 : 110/111 places, 486/486 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61754 ms. Remains : 110/111 places, 486/486 transitions.
Stuttering acceptance computed with spot in 488 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p0) (NOT p1)), (AND p1 (NOT p2) (NOT p0)), (NOT p1)]
Running random walk in product with property : Railroad-PT-020-LTLFireability-05
Product exploration explored 100000 steps with 10708 reset in 655 ms.
Product exploration explored 100000 steps with 10763 reset in 516 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 201 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 438 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p0) (NOT p1)), (AND p1 (NOT p2) (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 1480 ms. (27 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 395 ms. (101 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
[2025-06-03 14:10:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 33/40 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/59 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 19/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 51/110 variables, 17/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 51/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 486/596 variables, 110/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/596 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/596 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 596/596 variables, and 244 constraints, problems are : Problem set: 0 solved, 2 unsolved in 246 ms.
Refiners :[Domain max(s): 110/110 constraints, Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 33/40 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/59 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 19/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 51/110 variables, 17/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 51/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:10:17] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 486/596 variables, 110/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/596 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/596 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/596 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 596/596 variables, and 247 constraints, problems are : Problem set: 0 solved, 2 unsolved in 676 ms.
Refiners :[Domain max(s): 110/110 constraints, Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 937ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 1930 steps, including 165 resets, run visited all 2 properties in 65 ms. (steps per millisecond=29 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 66 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F p2), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 14 factoid took 684 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 386 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p0) (NOT p1)), (AND p1 (NOT p2) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 448 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p0) (NOT p1)), (AND p1 (NOT p2) (NOT p0)), (NOT p1)]
[2025-06-03 14:10:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 14:10:19] [INFO ] [Real]Absence check using 22 positive place invariants in 16 ms returned sat
[2025-06-03 14:10:20] [INFO ] [Real]Absence check using 22 positive and 2 generalized place invariants in 25 ms returned sat
[2025-06-03 14:10:20] [INFO ] [Real]Absence check using state equation in 836 ms returned sat
[2025-06-03 14:10:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 14:10:21] [INFO ] [Nat]Absence check using 22 positive place invariants in 15 ms returned sat
[2025-06-03 14:10:21] [INFO ] [Nat]Absence check using 22 positive and 2 generalized place invariants in 16 ms returned sat
[2025-06-03 14:10:21] [INFO ] [Nat]Absence check using state equation in 538 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:10:22] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 5 ms to minimize.
[2025-06-03 14:10:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 123 ms
Proved EG (NOT p2)
[2025-06-03 14:10:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 14:10:22] [INFO ] [Real]Absence check using 22 positive place invariants in 9 ms returned sat
[2025-06-03 14:10:22] [INFO ] [Real]Absence check using 22 positive and 2 generalized place invariants in 41 ms returned sat
[2025-06-03 14:10:23] [INFO ] [Real]Absence check using state equation in 1486 ms returned sat
[2025-06-03 14:10:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 14:10:24] [INFO ] [Nat]Absence check using 22 positive place invariants in 14 ms returned sat
[2025-06-03 14:10:24] [INFO ] [Nat]Absence check using 22 positive and 2 generalized place invariants in 11 ms returned sat
[2025-06-03 14:10:25] [INFO ] [Nat]Absence check using state equation in 768 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:10:25] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 5 ms to minimize.
[2025-06-03 14:10:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 125 ms
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F p2), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0), (G (NOT p2)), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 14 factoid took 691 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Railroad-PT-020-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-020-LTLFireability-05 finished in 73813 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F((G(p1)||G(p0))))))'
Support contains 5 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 486/486 transitions.
Applied a total of 0 rules in 5 ms. Remains 111 /111 variables (removed 0) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 111 cols
[2025-06-03 14:10:26] [INFO ] Invariants computation overflowed in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:10:26] [INFO ] Implicit Places using invariants in 188 ms returned []
// Phase 1: matrix 486 rows 111 cols
[2025-06-03 14:10:26] [INFO ] Invariants computation overflowed in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:10:28] [INFO ] Implicit Places using invariants and state equation in 2012 ms returned []
Implicit Place search using SMT with State Equation took 2219 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
// Phase 1: matrix 486 rows 111 cols
[2025-06-03 14:10:28] [INFO ] Invariants computation overflowed in 5 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (OVERLAPS) 486/577 variables, 91/182 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:10:35] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:10:35] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:10:35] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/577 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/577 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 466 unsolved
SMT process timed out in 30382ms, After SMT, problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 30384ms
Finished structural reductions in LTL mode , in 1 iterations and 32609 ms. Remains : 111/111 places, 486/486 transitions.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Railroad-PT-020-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 384 ms.
Stack based approach found an accepted trace after 29002 steps with 0 reset with depth 29003 and stack size 29003 in 133 ms.
FORMULA Railroad-PT-020-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-07 finished in 33320 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(F(p0)) U p1)||X(G(p2))))'
Support contains 7 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 486/486 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 486
Applied a total of 1 rules in 4 ms. Remains 110 /111 variables (removed 1) and now considering 486/486 (removed 0) transitions.
[2025-06-03 14:10:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:11:00] [INFO ] Implicit Places using invariants in 646 ms returned []
[2025-06-03 14:11:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:11:01] [INFO ] Implicit Places using invariants and state equation in 958 ms returned []
Implicit Place search using SMT with State Equation took 1611 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2025-06-03 14:11:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:11:03] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:11:03] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:11:04] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/110 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:11:15] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 9 (OVERLAPS) 486/596 variables, 110/248 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 596/596 variables, and 248 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30019 ms.
Refiners :[Domain max(s): 110/110 constraints, Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/110 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 8 (OVERLAPS) 486/596 variables, 110/248 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/596 variables, 466/714 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 596/596 variables, and 714 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30025 ms.
Refiners :[Domain max(s): 110/110 constraints, Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60355ms problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 60358ms
Starting structural reductions in LTL mode, iteration 1 : 110/111 places, 486/486 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61974 ms. Remains : 110/111 places, 486/486 transitions.
Stuttering acceptance computed with spot in 256 ms :[(NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Railroad-PT-020-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 564 ms.
Stack based approach found an accepted trace after 10774 steps with 0 reset with depth 10775 and stack size 10775 in 73 ms.
FORMULA Railroad-PT-020-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-08 finished in 62900 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U (p1 U X(p1)))||G((p2||G(p1)))))'
Support contains 6 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 486/486 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 486
Applied a total of 1 rules in 5 ms. Remains 110 /111 variables (removed 1) and now considering 486/486 (removed 0) transitions.
[2025-06-03 14:12:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:12:02] [INFO ] Implicit Places using invariants in 435 ms returned []
[2025-06-03 14:12:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:12:03] [INFO ] Implicit Places using invariants and state equation in 1174 ms returned []
Implicit Place search using SMT with State Equation took 1616 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2025-06-03 14:12:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:12:06] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:12:06] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:12:07] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/110 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:12:18] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 9 (OVERLAPS) 486/596 variables, 110/248 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 596/596 variables, and 248 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30030 ms.
Refiners :[Domain max(s): 110/110 constraints, Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/110 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 8 (OVERLAPS) 486/596 variables, 110/248 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/596 variables, 466/714 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 596/596 variables, and 714 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30024 ms.
Refiners :[Domain max(s): 110/110 constraints, Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60460ms problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 60462ms
Starting structural reductions in LTL mode, iteration 1 : 110/111 places, 486/486 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62089 ms. Remains : 110/111 places, 486/486 transitions.
Stuttering acceptance computed with spot in 390 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Railroad-PT-020-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 336 ms.
Stack based approach found an accepted trace after 12877 steps with 0 reset with depth 12878 and stack size 12878 in 54 ms.
FORMULA Railroad-PT-020-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-09 finished in 62907 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (p1 U (F(p1)&&X(p0))))&&F(p2)))'
Support contains 6 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 486/486 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 486
Applied a total of 1 rules in 3 ms. Remains 110 /111 variables (removed 1) and now considering 486/486 (removed 0) transitions.
[2025-06-03 14:13:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:13:05] [INFO ] Implicit Places using invariants in 426 ms returned []
[2025-06-03 14:13:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:13:06] [INFO ] Implicit Places using invariants and state equation in 826 ms returned []
Implicit Place search using SMT with State Equation took 1260 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2025-06-03 14:13:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:13:09] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:13:09] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:13:09] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/110 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:13:18] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 9 (OVERLAPS) 486/596 variables, 110/248 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 596/596 variables, and 248 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30019 ms.
Refiners :[Domain max(s): 110/110 constraints, Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/110 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 8 (OVERLAPS) 486/596 variables, 110/248 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/596 variables, 466/714 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 15)
(t2 2)
(t3 15)
(t4 2)
(t5 1)
(t6 2)
(t7 2)
(t8 2)
(t9 4)
(t10 1)
(t11 15)
(t12 2)
(t13 1)
(t14 1)
(t15 2)
(t16 1)
(t17 2)
(t18 1)
(t19 2)
(t20 1)
(t21 4)
(t22 3)
(t23 2)
(t24 2)
(t25 3)
(t26 1)
(t27 0)
(t28 1)
(t29 1)
(t30 1)
(t31 1)
(t32 0)
(t33 1)
(t34 1)
(t35 0)
(t36 1)
(t37 1)
(t38 1)
(t39 1)
(t40 1)
(t41 0)
(t42 1)
(t43 0)
(t44 1)
(t45 1)
(t46 1)
(t47 4)
(t48 2)
(t49 4)
(t50 1)
(t51 3)
(t52 1)
(t53 16)
(t54 1)
(t55 4)
(t56 16)
(t57 2)
(t58 1)
(t59 1)
(t60 0)
(t61 0)
(t62 0)
(t63 0)
(t64 0)
(t65 0)
(t66 0)
(t67 0)
(t68 0)
(t69 0)
(t70 0)
(t71 0)
(t72 0)
(t73 0)
(t74 0)
(t75 0)
(t76 0)
(t77 0)
(t78 1)
(t79 0)
(t80 0)
(t81 0)
(t82 0)
(t83 0)
(t84 0)
(t85 0)
(t86 0)
(t87 1)
(t88 0)
(t89 0)
(t90 0)
(t91 0)
(t92 0)
(t93 0)
(t94 0)
(t95 0)
(t96 0)
(t97 0)
(t98 0)
(t99 0)
(t100 0)
(t101 0)
(t102 0)
(t103 0)
(t104 0)
(t105 0)
(t106 0)
(t107 0)
(t108 0)
(t109 0)
(t110 1)
(t111 0)
(t112 0)
(t113 0)
(t114 0)
(t115 0)
(t116 0)
(t117 0)
(t118 0)
(t119 0)
(t120 0)
(t121 0)
(t122 0)
(t123 0)
(t124 0)
(t125 0)
(t126 0)
(t127 0)
(t128 0)
(t129 0)
(t130 1)
(t131 0)
(t132 0)
(t133 0)
(t134 0)
(t135 0)
(t136 0)
(t137 0)
(t138 0)
(t139 0)
(t140 0)
(t141 0)
(t142 0)
(t143 0)
(t144 0)
(t145 0)
(t146 0)
(t147 0)
(t148 1)
(t149 0)
(t150 0)
(t151 0)
(t152 0)
(t153 0)
(t154 1)
(t155 1)
(t156 0)
(t157 0)
(t158 0)
(t159 0)
(t160 0)
(t161 0)
(t162 0)
(t163 0)
(t164 0)
(t165 0)
(t166 0)
(t167 0)
(t168 0)
(t169 0)
(t170 0)
(t171 0)
(t172 0)
(t173 0)
(t174 0)
(t175 1)
(t176 0)
(t177 0)
(t178 0)
(t179 0)
(t180 0)
(t181 0)
(t182 0)
(t183 0)
(t184 0)
(t185 0)
(t186 0)
(t187 0)
(t188 0)
(t189 0)
(t190 0)
(t191 0)
(t192 0)
(t193 0)
(t194 0)
(t195 0)
(t196 1)
(t197 0)
(t198 0)
(t199 0)
(t200 0)
(t201 0)
(t202 0)
(t203 0)
(t204 0)
(t205 0)
(t206 0)
(t207 0)
(t208 0)
(t209 0)
(t210 0)
(t211 0)
(t212 0)
(t213 0)
(t214 0)
(t215 0)
(t216 0)
(t217 0)
(t218 0)
(t219 1)
(t220 0)
(t221 0)
(t222 0)
(t223 0)
(t224 0)
(t225 0)
(t226 0)
(t227 0)
(t228 0)
(t229 0)
(t230 0)
(t231 0)
(t232 0)
(t233 0)
(t234 0)
(t235 0)
(t236 0)
(t237 0)
(t238 0)
(t239 0)
(t240 0)
(t241 1)
(t242 0)
(t243 0)
(t244 0)
(t245 1)
(t246 0)
(t247 0)
(t248 0)
(t249 0)
(t250 0)
(t251 0)
(t252 0)
(t253 0)
(t254 0)
(t255 0)
(t256 0)
(t257 0)
(t258 0)
(t259 0)
(t260 0)
(t261 0)
(t262 0)
(t263 0)
(t264 0)
(t265 0)
(t266 0)
(t267 0)
(t268 0)
(t269 0)
(t270 0)
(t271 0)
(t272 0)
(t273 0)
(t274 0)
(t275 0)
(t276 0)
(t277 0)
(t278 1)
(t279 0)
(t280 0)
(t281 0)
(t282 0)
(t283 0)
(t284 0)
(t285 0)
(t286 0)
(t287 0)
(t288 0)
(t289 0)
(t290 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 596/596 variables, and 714 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30027 ms.
Refiners :[Domain max(s): 110/110 constraints, Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60311ms problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 60314ms
Starting structural reductions in LTL mode, iteration 1 : 110/111 places, 486/486 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61579 ms. Remains : 110/111 places, 486/486 transitions.
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (NOT p0), (NOT p0), true]
Running random walk in product with property : Railroad-PT-020-LTLFireability-10
Product exploration explored 100000 steps with 356 reset in 574 ms.
Stack based approach found an accepted trace after 21214 steps with 79 reset with depth 173 and stack size 173 in 128 ms.
FORMULA Railroad-PT-020-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-10 finished in 62641 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 486/486 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 486
Applied a total of 1 rules in 6 ms. Remains 110 /111 variables (removed 1) and now considering 486/486 (removed 0) transitions.
[2025-06-03 14:14:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:14:08] [INFO ] Implicit Places using invariants in 477 ms returned []
[2025-06-03 14:14:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:14:09] [INFO ] Implicit Places using invariants and state equation in 1181 ms returned []
Implicit Place search using SMT with State Equation took 1662 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2025-06-03 14:14:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:12] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:12] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:12] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/110 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:22] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 9 (OVERLAPS) 486/596 variables, 110/248 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 596/596 variables, and 248 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30024 ms.
Refiners :[Domain max(s): 110/110 constraints, Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/110 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 8 (OVERLAPS) 486/596 variables, 110/248 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/596 variables, 466/714 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 596/596 variables, and 714 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30026 ms.
Refiners :[Domain max(s): 110/110 constraints, Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60464ms problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 60466ms
Starting structural reductions in LTL mode, iteration 1 : 110/111 places, 486/486 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62141 ms. Remains : 110/111 places, 486/486 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-020-LTLFireability-11
Product exploration explored 100000 steps with 185 reset in 354 ms.
Stack based approach found an accepted trace after 26407 steps with 43 reset with depth 390 and stack size 390 in 92 ms.
FORMULA Railroad-PT-020-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-11 finished in 62786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 5 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 486/486 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 108 transition count 484
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 4 place count 108 transition count 463
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 46 place count 87 transition count 463
Applied a total of 46 rules in 65 ms. Remains 87 /111 variables (removed 24) and now considering 463/486 (removed 23) transitions.
// Phase 1: matrix 463 rows 87 cols
[2025-06-03 14:15:10] [INFO ] Invariants computation overflowed in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:15:10] [INFO ] Implicit Places using invariants in 182 ms returned []
// Phase 1: matrix 463 rows 87 cols
[2025-06-03 14:15:10] [INFO ] Invariants computation overflowed in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:15:12] [INFO ] Implicit Places using invariants and state equation in 1562 ms returned []
Implicit Place search using SMT with State Equation took 1747 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 14:15:12] [INFO ] Redundant transitions in 5 ms returned []
Running 443 sub problems to find dead transitions.
// Phase 1: matrix 463 rows 87 cols
[2025-06-03 14:15:12] [INFO ] Invariants computation overflowed in 4 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (OVERLAPS) 463/530 variables, 67/134 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:17] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:18] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:22] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/530 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 5 (OVERLAPS) 20/550 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/550 variables, and 177 constraints, problems are : Problem set: 0 solved, 443 unsolved in 30015 ms.
Refiners :[Domain max(s): 87/87 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 443 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 3 (OVERLAPS) 463/530 variables, 67/137 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/530 variables, 22/159 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/550 variables, and 159 constraints, problems are : Problem set: 0 solved, 443 unsolved in 30016 ms.
Refiners :[Domain max(s): 67/87 constraints, State Equation: 67/87 constraints, PredecessorRefiner: 22/443 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60352ms problems are : Problem set: 0 solved, 443 unsolved
Search for dead transitions found 0 dead transitions in 60356ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/111 places, 463/486 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62183 ms. Remains : 87/111 places, 463/486 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Running random walk in product with property : Railroad-PT-020-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 404 ms.
Stack based approach found an accepted trace after 8073 steps with 0 reset with depth 8074 and stack size 8063 in 35 ms.
FORMULA Railroad-PT-020-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLFireability-13 finished in 62700 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 5 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 486/486 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 486
Applied a total of 1 rules in 4 ms. Remains 110 /111 variables (removed 1) and now considering 486/486 (removed 0) transitions.
[2025-06-03 14:16:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:16:14] [INFO ] Implicit Places using invariants in 687 ms returned []
[2025-06-03 14:16:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:16:15] [INFO ] Implicit Places using invariants and state equation in 1003 ms returned []
Implicit Place search using SMT with State Equation took 1698 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2025-06-03 14:16:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:16:17] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:16:17] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:16:18] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/110 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:16:27] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 9 (OVERLAPS) 486/596 variables, 110/248 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 596/596 variables, and 248 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30025 ms.
Refiners :[Domain max(s): 110/110 constraints, Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/110 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 8 (OVERLAPS) 486/596 variables, 110/248 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/596 variables, 466/714 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 596/596 variables, and 714 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30028 ms.
Refiners :[Domain max(s): 110/110 constraints, Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60448ms problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 60451ms
Starting structural reductions in LTL mode, iteration 1 : 110/111 places, 486/486 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62154 ms. Remains : 110/111 places, 486/486 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-020-LTLFireability-14
Entered a terminal (fully accepting) state of product in 18150 steps with 0 reset in 65 ms.
FORMULA Railroad-PT-020-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-020-LTLFireability-14 finished in 62428 ms.
All properties solved by simple procedures.
Total runtime 651864 ms.

BK_STOP 1748960235828

--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="Railroad-PT-020"
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-5832"
echo " Executing tool itstools"
echo " Input is Railroad-PT-020, 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 r170-smll-174889233300092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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